(4,1)-Quantum random access coding does not exist—one qubit is not enough to recover one of four bits

DOI DOI DOI 被引用文献5件 オープンアクセス

書誌事項

公開日
2006-08-04
DOI
  • 10.1088/1367-2630/8/8/129
  • 10.1109/isit.2006.261708
  • 10.48550/arxiv.quant-ph/0604061
公開者
IOP Publishing

説明

An (n,1,p)-Quantum Random Access (QRA) coding, introduced by Ambainis, Nayak, Ta-shma and Vazirani in ACM Symp. on Theory of Computing 1999, is the following communication system: The sender which has n-bit information encodes his/her information into one qubit, which is sent to the receiver. The receiver can recover any one bit of the original n bits correctly with probability at least p, through a certain decoding process based on positive operator-valued measures. Actually, Ambainis et al. shows the existence of a (2,1,0.85)-QRA coding and also proves the impossibility of its classical counterpart. Chuang immediately extends it to a (3,1,0.79)-QRA coding and whether or not a (4,1,p)-QRA coding such that p > 1/2 exists has been open since then. This paper gives a negative answer to this open question.

8pages, 3figures

収録刊行物

被引用文献 (5)*注記

もっと見る

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ