Separating Non-Interactive Classical Verification of Quantum Computation from Falsifiable Assumptions
Summarize this article with:
Quantum Physics arXiv:2602.18034 (quant-ph) [Submitted on 20 Feb 2026] Title:Separating Non-Interactive Classical Verification of Quantum Computation from Falsifiable Assumptions Authors:Mohammed Barhoush, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa View a PDF of the paper titled Separating Non-Interactive Classical Verification of Quantum Computation from Falsifiable Assumptions, by Mohammed Barhoush and Tomoyuki Morimae and Ryo Nishimaki and Takashi Yamakawa View PDF Abstract:Mahadev [SIAM J. Comput. 2022] introduced the first protocol for classical verification of quantum computation based on the Learning-with-Errors (LWE) assumption, achieving a 4-message interactive scheme. This breakthrough naturally raised the question of whether fewer messages are possible in the plain model. Despite its importance, this question has remained unresolved. In this work, we prove that there is no quantum black-box reduction of non-interactive classical verification of quantum computation of $\textsf{QMA}$ to any falsifiable assumption. Here, "non-interactive" means that after an instance-independent setup, the protocol consists of a single message. This constitutes a strong negative result given that falsifiable assumptions cover almost all standard assumptions used in cryptography, including LWE. Our separation holds under the existence of a $\textsf{QMA} \text{-} \textsf{QCMA}$ gap problem. Essentially, these problems require a slightly stronger assumption than $\textsf{QMA}\neq \textsf{QCMA}$. To support the existence of such problems, we present a construction relative to a quantum unitary oracle. Comments: Subjects: Quantum Physics (quant-ph); Cryptography and Security (cs.CR) Report number: YITP-26-19 Cite as: arXiv:2602.18034 [quant-ph] (or arXiv:2602.18034v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2602.18034 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Mohammed Barhoush Mr [view email] [v1] Fri, 20 Feb 2026 07:27:25 UTC (84 KB) Full-text links: Access Paper: View a PDF of the paper titled Separating Non-Interactive Classical Verification of Quantum Computation from Falsifiable Assumptions, by Mohammed Barhoush and Tomoyuki Morimae and Ryo Nishimaki and Takashi YamakawaView 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?)