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

New Journal of Physics

Volumn 8, Issue , 2006, Pages

  Hayashi, M ^a,f   Iwama, K ^b   Nishimura, H ^c   Raymond, R ^d   Yamashita, S ^e  

^a JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

^b KYOTO UNIVERSITY   (Japan)

^c Osaka Prefecture University   (Japan)

^d IBM JAPAN LTD   (Japan)

^e NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^f UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION SYSTEMS; COMPUTABILITY AND DECIDABILITY; INFORMATION ANALYSIS; PROBABILITY; RANDOM ACCESS STORAGE;

DECODING PROCESS; N-BIT INFORMATION; ONE-QUBIT ENCODING; OPERATOR-VALUED MEASURES;

QUANTUM CRYPTOGRAPHY;

EID: 33746874082     PISSN: 13672630     EISSN: 13672630     Source Type: Journal    
DOI: 10.1088/1367-2630/8/8/129     Document Type: Article

References (23)

1. Holevo A S 1979 Problems Inform. Trans. 15 247
2. Ambainis A, Nayak A, Ta-shma A and Vazirani U 1999 Proc. 31st ACM Symp. on Theory of Computing (New York: ACM) p 376
3. Ambainis A, Nayak A, Ta-shma A and Vazirani U 2002 J. ACM 49 496
4. Nayak A 1999 Proc. 40th IEEE Symp. on Foundations of Computer Science (Los Alamitos, CA: IEEE) p 369
5. Hayashi M, Iwama K, Nishimura H, Raymond R and Yamashita S 2006 Talk at 9th Workshop of Quantum Information Processing Preprint quant-ph/0601088
6. Buhrman H and de Wolf R 2001 Proc. 16th IEEE Conf. on Computational Complexity (Los Alamitos, CA: IEEE) p 120
7. Klauck H 2001 Proc. 42th IEEE Symp. on Foundations of Computer Science (Los Alamitos, CA: IEEE) p 288
8. Gavinsky D, Kempe J, Regev O and de Wolf R 2006 Proc. 38th ACM Symp. on Theory of Computing (New York: ACM) Preprint quant-ph/0511013
9. Klauck H 2000 Proc 32nd ACM Symp. on Theory of Computing (New York: ACM) p 644
10. Kerenidis I and de Wolf R 2004 J. Comput. Syst. Sci. 69 395
11. Wehner S and de Wolf R 2005 Proc. 32nd Int. Colloquium on Automata, Languages and Programming (Lecture Notes in Computer Science vol 3580) (New York: Springer) p 1424
12. König R, Maurer U M and Renner R 2005 IEEE Trans. Inf. Theory 51 2391
13. Aaronson S 2006 Proc. 21st IEEE Conf. on Computational Complexity (Los Alamitos, CA: IEEE) Preprint quant-ph/0510230
14. Nielsen M A and Chuang I L 2000 Quantum Computation and Quantum Information (Cambridge: Cambridge University Press)
15. Bužek V and Hillery M 1996 Phys. Rev. A 54 1844
16. Alicki R and Lendi K 1987 Quantum Dynamical Semigroups and Applications (Lecture Notes in Physics vol 286) (New York: Springer)
17. Jakóbczyk L and Siennicki M 2001 Phys. Lett. A 286 383
18. Mahler G and Weberruss V A 1995 Quantum Networks (New York: Springer)
19. Kimura G and Kossakowski A 2005 Open Syst. Inform. Dyn. 12 207 (Preprint quant-ph/0408014)
20. Edelsbrunner H 1987 Algorithms in Computational Geometry (New York: Springer)
21. Ahlswede R, Cai N, Li S-Y R and Yeung R W 2000 IEEE Trans. Inform. Theory 46 1204
22. Bužek V, Hillery M and Werner R F 1999 Phys. Rev. A 60 2626
23. Gisin N and Popescu S 1999 Phys. Rev. Lett. 83 432