How to Classically Verify a Quantum Cat without Killing It
Summarize this article with:
Quantum Physics arXiv:2602.09282 (quant-ph) [Submitted on 9 Feb 2026] Title:How to Classically Verify a Quantum Cat without Killing It Authors:Yael Tauman Kalai, Dakshita Khurana, Justin Raizes View a PDF of the paper titled How to Classically Verify a Quantum Cat without Killing It, by Yael Tauman Kalai and 2 other authors View PDF Abstract:Existing protocols for classical verification of quantum computation (CVQC) consume the prover's witness state, requiring a new witness state for each invocation. Because QMA witnesses are not generally clonable, destroying the input witness means that amplifying soundness and completeness via repetition requires many copies of the witness. Building CVQC with low soundness error that uses only *one* copy of the witness has remained an open problem so far. We resolve this problem by constructing a CVQC that uses a single copy of the QMA witness, has negligible completeness and soundness errors, and does *not* destroy its witness. The soundness of our CVQC is based on the post-quantum Learning With Errors (LWE) assumption. To obtain this result, we define and construct two primitives (under the post-quantum LWE assumption) for non-destructively handling superpositions of classical data, which we believe are of independent interest: - A *state preserving* classical argument for NP. - Dual-mode trapdoor functions with *state recovery*. Subjects: Quantum Physics (quant-ph); Cryptography and Security (cs.CR) Cite as: arXiv:2602.09282 [quant-ph] (or arXiv:2602.09282v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2602.09282 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Justin Raizes [view email] [v1] Mon, 9 Feb 2026 23:47:46 UTC (6,555 KB) Full-text links: Access Paper: View a PDF of the paper titled How to Classically Verify a Quantum Cat without Killing It, by Yael Tauman Kalai and 2 other authorsView PDFTeX Source view license Current browse context: quant-ph new | recent | 2026-02 Change to browse by: cs cs.CR 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?)