[Paper Review] Quantum Bit Commitment Revisited: the Possible and the Impossible

Giacomo Mauro D’Ariano, Dennis Kretschmann+2 more|arXiv (Cornell University)|May 26, 2006

Quantum Information and Cryptography9 citations

TL;DR

This paper provides a rigorous proof that quantum bit commitment protocols based solely on quantum mechanics are fundamentally impossible, even when allowing arbitrary rounds, classical and quantum communication, aborts, resets, and non-honest receivers. It shows that any concealing protocol can be cheated by the sender with a universal strategy, and that approximate concealing leads to undetectable cheating with high probability, using a new continuity estimate for Stinespring dilation and a novel protocol relying on receiver decoherence for security.

ABSTRACT

Bit commitment protocols whose security is based on the laws of quantum mechanics alone are generally held to be impossible. In this paper we give a strengthened and explicit proof of this result. We extend its scope to a much larger variety of protocols, which may have an arbitrary number of rounds, in which both classical and quantum information is exchanged, and which may include aborts and resets. Moreover, we do not consider the receiver to be bound to a fixed "honest" strategy, so that "anonymous state protocols", which were recently suggested as a possible way to beat the known no-go results are also covered. We show that any concealing protocol allows the sender to find a cheating strategy, which is universal in the sense that it works against any strategy of the receiver. Moreover, if the concealing property holds only approximately, the cheat goes undetected with a high probability, which we explicitly estimate. The proof uses an explicit formalization of general two party protocols, which is applicable to more general situations, and a new estimate about the continuity of the Stinespring dilation of a general quantum channel. The result also provides a natural characterization of protocols that fall outside the standard setting of unlimited available technology, and thus may allow secure bit commitment. We present a new such protocol whose security, perhaps surprisingly, relies on decoherence in the receiver's lab.

Motivation & Objective

• To strengthen and generalize the no-go result for quantum bit commitment beyond previous limitations.
• To address protocols with arbitrary rounds, mixed classical-quantum communication, aborts, resets, and non-honest receivers.
• To formally prove that any concealing protocol allows a universal cheating strategy by the sender.
• To analyze the detectability of cheating when concealing is only approximate, providing a quantitative estimate.

Proposed method

• Formalizing general two-party quantum protocols using a unified framework applicable to diverse communication patterns.
• Introducing a new continuity estimate for the Stinespring dilation of a general quantum channel, crucial for bounding cheating fidelity.
• Analyzing the structure of quantum bit commitment protocols under the assumption of concealing security.
• Constructing a new protocol whose security relies on decoherence in the receiver’s laboratory, rather than unitary evolution.
• Using the formalism to show that any concealing protocol admits a universal cheating strategy independent of the receiver’s actions.
• Estimating the probability that cheating remains undetected when concealing is approximate, based on the continuity bound.

Experimental results

Research questions

• RQ1 Can quantum bit commitment be secure under arbitrary protocols that include classical communication, multiple rounds, aborts, and resets?
• RQ2 Is it possible to circumvent known no-go theorems using 'anonymous state' protocols where the receiver is not bound to an honest strategy?
• RQ3 What is the detectability of cheating in protocols that are only approximately concealing?
• RQ4 Can decoherence in the receiver’s lab provide a basis for secure bit commitment outside the standard quantum mechanical no-go framework?

Key findings

• Any quantum bit commitment protocol that is concealing (even approximately) allows the sender to cheat with a universal strategy that works against any receiver behavior.
• When concealing is only approximate, the cheating strategy remains undetected with high probability, and this probability is explicitly bounded using a new continuity estimate.
• The paper establishes a general framework for two-party quantum protocols that accommodates arbitrary communication sequences and measurement choices.
• A new protocol is proposed whose security relies on decoherence in the receiver’s lab, suggesting a path to secure bit commitment outside the standard no-go setting.
• The continuity estimate for Stinespring dilation is shown to be instrumental in proving the robustness of cheating strategies under small deviations from perfect concealing.
• The result implies that secure bit commitment via quantum mechanics alone is impossible in the standard model, but may be achievable in models with limited technology or environmental decoherence.