Consecutive Measurement Tradeoffs in Quantum Cryptography

arXiv:2504.12754v4 Announce Type: replace Abstract: Measuring a quantum system can reveal information while disturbing its state. Consequently, the probabilities of obtaining desired outcomes in individual measurements constrain the probability of obtaining them in sequence. This interplay arises naturally in mistrustful quantum cryptography, where a dishonest participant may perform sequential measurements to extract more information than the protocol allows. We develop consecutive measurement theorems (CMTs) to quantify this constraint, relating the average success probability of a single measurement to that of an ordered pair of distinct measurements. For measurements on a common state, we derive the optimal lower bound on consecutive-measurement success as a function of single-measurement success and provide matching constructions over the entire parameter range. We also establish the first robust CMTs for measurements on different but nearby states, with closeness quantified by fidelity or trace distance. We use these results to strengthen sum-binding guarantees for relativistic bit commitment and soundness bounds for relativistic zero-knowledge proofs, and to obtain improved no-go results for quantum oblivious transfer and quantum private query. Our results establish CMTs as a versatile tool for translating consecutive-measurement constraints into concrete cryptographic bounds and suggest applications in other quantum-information settings.

Abstract:Measuring a quantum system can reveal information while disturbing its state. Consequently, the probabilities of obtaining desired outcomes in individual measurements constrain the probability of obtaining them in sequence. This interplay arises naturally in mistrustful quantum cryptography, where a dishonest participant may perform sequential measurements to extract more information than the protocol allows. We develop consecutive measurement theorems (CMTs) to quantify this constraint, relating the average success probability of a single measurement to that of an ordered pair of distinct measurements. For measurements on a common state, we derive the optimal lower bound on consecutive-measurement success as a function of single-measurement success and provide matching constructions over the entire parameter range. We also establish the first robust CMTs for measurements on different but nearby states, with closeness quantified by fidelity or trace distance. We use these results to strengthen sum-binding guarantees for relativistic bit commitment and soundness bounds for relativistic zero-knowledge proofs, and to obtain improved no-go results for quantum oblivious transfer and quantum private query. Our results establish CMTs as a versatile tool for translating consecutive-measurement constraints into concrete cryptographic bounds and suggest applications in other quantum-information settings.

arXiv:2504.12754 [quant-ph]

(or arXiv:2504.12754v4 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2504.12754 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

analiza aiqbench

Consecutive Measurement Tradeoffs in Quantum Cryptography

Subiecte conexe