Why cut-and-choose quantum state verification cannot be both efficient and secure
Summarize this article with:
Quantum Physics arXiv:2512.11358 (quant-ph) [Submitted on 12 Dec 2025] Title:Why cut-and-choose quantum state verification cannot be both efficient and secure Authors:Fabian Wiesner, Ziad Chaoui, Diana Kessler, Anna Pappa, Martti Karvonen View a PDF of the paper titled Why cut-and-choose quantum state verification cannot be both efficient and secure, by Fabian Wiesner and 4 other authors View PDF HTML (experimental) 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. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2512.11358 [quant-ph] (or arXiv:2512.11358v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2512.11358 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Fabian Alexander Wiesner [view email] [v1] Fri, 12 Dec 2025 08:13:58 UTC (42 KB) Full-text links: Access Paper: View a PDF of the paper titled Why cut-and-choose quantum state verification cannot be both efficient and secure, by Fabian Wiesner and 4 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2025-12 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators 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. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)