Why cut-and-choose quantum state verification cannot be both efficient and secure

Abstract

Quantum state verification plays a vital role in many quantum cryptographic protocols, as it allows the use of quantum states from untrusted sources. While some progress has been made in this direction, the question of whether the most prevalent type of quantum state verification, namely cut-and-choose verification, can be efficient and secure, is still not answered in full generality. In this work, we show a fundamental limit for quantum state verification for all cut-and-choose approaches used to verify arbitrary quantum states. We provide a no-go result showing that the cut-and-choose techniques cannot lead to quantum state verification protocols that are both efficient in the number of rounds and secure. We show this trade-off for stand-alone and composable security, where the scaling of the lower bound for the security parameters renders cut-and-choose quantum state verification effectively unusable.

Supersedes arXiv:2411.04767, which proves a weaker bound for composable security. To appear in IACR Communications in Cryptology Volume 2, Issue 4

References in corpus (18)

• Quantum Computing in the NISQ era and beyond
• Quantum Cryptography
• Advances in Quantum Cryptography
• Device-independent security of quantum cryptography against collective attacks
• Hacking commercial quantum cryptography systems by tailored bright illumination
• Self-testing of quantum systems: a review
• Verifiable measurement-only blind quantum computing with stabilizer testing
• Optimal verification of entangled states with local measurements
• Efficient Verification of Pure Quantum States in the Adversarial Scenario
• Multipartite entanglement verification resistant against dishonest parties
• Verification of Many-Qubit States
• Verified measurement-based quantum computing with hypergraph states
• Anonymous Quantum Conference Key Agreement
• Statistical Methods for Quantum State Verification and Fidelity Estimation
• Verification of graph states in an untrusted network
• Categorical composable cryptography
• Composable Security for Multipartite Entanglement Verification
• Categorical composable cryptography: extended version