On the Computational Collapse of Quantum Information


  • Claude Crépeau
  • Paul Dumais
  • Dominic Mayers
  • Louis Salvail




We analyze the situation where computationally binding string commitment schemes are used to force the receiver of a BB84 encoding of a classical bitstring to measure upon reception. Since measuring induces an irreversible collapse to the received quantum state, even given extra information after the measurement does not allow the receiver to evaluate reliably some predicates apply to the classical bits encoded in the state. This fundamental quantum primitive is called quantum measure commitment (QMC) and allows for secure two-party computation of classical functions. An adversary to QMC is one that can both provide valid proof of having measured the received states while still able to evaluate a predicate applied to the classical content of the encoding. We give the first quantum black-box reduction for the security of QMC to the binding property of the string commitment. We characterize a class of quantum adversaries against QMC that can be transformed into adversaries against a weak form for the binding property of the string commitment. Our result provides a construction for 1--2-oblivious transfer that is computationally secure against the receiver and unconditionally secure against the sender from any string commitment scheme satisfying a weak binding property.




How to Cite

Crépeau, C., Dumais, P., Mayers, D., & Salvail, L. (2003). On the Computational Collapse of Quantum Information. BRICS Report Series, 10(3). https://doi.org/10.7146/brics.v10i3.21774