Harry Buhrman1, Matthias Christandl, Patrick Hayden
1CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands.
You might also read
Articles linked to this work by shared authors, journal, and citation graph.
Quantum bit commitment, impossible classically and quantumly, faces new limits. Researchers show schemes where Alice can cheat on a bits and Bob learns b bits, finding a + b >= n under traditional security, but a = 4log2(n) + O(1) and b = 4 with accessible information criteria.
Area of Science:
Background:
Purpose of the Study:
Main Methods:
Main Results:
Conclusions: