Accessing inaccessible information via quantum indistinguishability

Author:

Horvat SebastianORCID,Dakić BorivojeORCID

Abstract

Abstract In this paper we present and analyze an information-theoretic task that consists in learning a bit of information by spatially moving the ‘target’ particle that encodes it. We show that, on one hand, the task can be solved with the use of additional independently prepared quantum particles, only if these are indistinguishable from the target particle. On the other hand, the task can be solved with the use of distinguishable quantum particles, only if they are entangled with the target particle. Our task thus provides a new example in which the entanglement apparently inherent to independently prepared indistinguishable quantum particles is put into use for information processing. Importantly, a novelty of our protocol lies in that it does not require any spatial overlap between the involved particles. Besides analyzing the class of quantum-mechanical protocols that solve our task, we gesture towards possible ways of generalizing our results and of applying them in cryptography.

Funder

Austrian Science Fund

Publisher

IOP Publishing

Subject

General Physics and Astronomy

Reference52 articles.

1. How to distinguish identical particles;Herbut;Am. J. Phys.,2001

2. How to distinguish identical particles. The general case;Herbut,2006

3. Entanglement and properties of composite quantum systems: a conceptual and mathematical analysis;Ghirardi;J. Stat. Phys.,2002

4. Entanglement and properties;Ghirardi;Fortschr. Phys.,2003

5. General criterion for the entanglement of two indistinguishable particles;Ghirardi;Phys. Rev. A,2004

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3