2005/05/18 by Horace P. Yuen, Yuen, Horace P. · 1 citation
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph) #quant-ph
paper · pdf · doi:10.48550/arxiv.quant-ph/0505132
4 pages, no figures; This paper is an expanded, self-contained version of QBC4 presented in quant-ph/0305143. It is the basis of talks to be presented at the University of Pavia, Italy on May 23, 2005 and Nottingham University, England on May 25, 2005
arxiv created 2005/05/18 · openalex publication_date 2005/05/18 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The ``impossibility proof'' on unconditionally secure quantum bit commitment is examined. It is shown that the possibility of juxtaposing quantum and classical randomness has not been properly taken into account. A specific protocol that beats entanglement cheating with entanglement is proven to be unconditionally secure.