Physics – Quantum Physics
Scientific paper
2006-09-29
Phys. Rev. Lett., 97, 250501 (2006)
Physics
Quantum Physics
To appear in PRL. Short version of quant-ph/0504078, long version to appear separately. Improved security definition and resul
Scientific paper
10.1103/PhysRevLett.97.250501
Unconditionally secure non-relativistic bit commitment is known to be impossible in both the classical and the quantum world. However, when committing to a string of n bits at once, how far can we stretch the quantum limits? In this letter, we introduce a framework of quantum schemes where Alice commits a string of n bits to Bob, in such a way that she can only cheat on a bits and Bob can learn at most b bits of information before the reveal phase. Our results are two-fold: we show by an explicit construction that in the traditional approach, where the reveal and guess probabilities form the security criteria, no good schemes can exist: a+b is at least n. If, however, we use a more liberal criterion of security, the accessible information, we construct schemes where a=4 log n+O(1) and b=4, which is impossible classically. Our findings significantly extend known no-go results for quantum bit commitment.
Buhrman Harry
Christandl Matthias
Hayden Patrick
Lo Hoi-Kwong
Wehner Stephanie
No associations
LandOfFree
Security of quantum bit string commitment depends on the information measure 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 Security of quantum bit string commitment depends on the information measure, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Security of quantum bit string commitment depends on the information measure will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-184958