(4,1)-Quantum Random Access Coding Does Not Exist

Details (4,1)-Quantum Random Access Coding Does Not Exist (4,1)-Quantum Random Access Coding Does Not Exist

2006-04-10

arxiv.org/abs/quant-ph/0604061v1

New J. Phys 8 (2006) 129

Physics

Quantum Physics

8pages, 3figures

Scientific paper

10.1088/1367-2630/8/8/129

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.

Affiliated with

Also associated with

No associations

Rating

(4,1)-Quantum Random Access Coding Does Not Exist does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with (4,1)-Quantum Random Access Coding Does Not Exist, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and (4,1)-Quantum Random Access Coding Does Not Exist will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-702206