Simple Tests of Quantumness Also Certify Qubits
Zvika Brakerski, Alexandru Gheorghiu, Gregory D. Kahanamoku-Meyer, Eitan Porat, Thomas Vidick
摘要
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as [KCVY21, KLVY22], can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
Certifying qubits was previously only known to be possible based on families of post-quantum trapdoor claw-free functions (TCF) with an advanced "adaptive hardcore bit" property, which have only been constructed based on the hardness of the Learning with Errors problem [BCM + 21] and recently isogeny-based group actions [AMR23]. Our framework allows certification of qubits based only on the existence of post-quantum TCF, without the adaptive hardcore bit property, or on quantum fully homomorphic encryption. These can be instantiated, for example, from Ring Learning with Errors. This has the potential to improve the efficiency of qubit certification and derived functionalities.
On the technical side, we show that the quantum soundness of any such protocol can be reduced to proving a bound on a simple algorithmic task: informally, answering "two challenges simultaneously" in the protocol. Our reduction formalizes the intuition that these protocols demonstrate quantumness by leveraging the impossibility of rewinding a general quantum prover. This allows us to prove tight bounds on the quantum soundness of [KCVY21] and [KLVY22], showing that no quantum polynomialtime prover can succeed with probability larger than cos 2 π 8 ≈ 0.853. Previously, only an upper bound on the success probability of classical provers, and a lower bound on the success probability of quantum provers, were known. We then extend this proof of quantum soundness to show that provers that approach the quantum soundness bound must perform almost anti-commuting measurements. This certifies that the prover holds a qubit.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper3
- A Computational Test of Contextuality and, Even Simpler Proofs of QuantumnessAtul Singh Arora, Kishor Bharti, Alexandru Cojocaru, Andrea ColadangeloFOCS 2024 · 被引用 3 次
- A Modular Approach to Succinct Arguments for QMAJames Bartusek, Jiahui Liu, Giulio MalavoltaEUROCRYPT 2026 · 被引用 1 次
- Bounding the asymptotic quantum value of all multipartite compiled non-local gamesMatilde Baroni, Dominik Leichtle, Sinisa Jankovic, Ivan SupicSODA 2026
它引用的顶会 Paper3
- Verifiable Quantum Advantage without StructureTakashi Yamakawa, Mark ZhandryFOCS 2022 · 被引用 35 次
- Quantum Advantage from Any Non-local GameYael Kalai, Alex Lombardi, Vinod Vaikuntanathan, Lisa YangSTOC 2023 · 被引用 25 次
- Bounding the Quantum Value of Compiled Nonlocal Games: From CHSH to BQP VerificationAnand Natarajan, Tina ZhangFOCS 2023 · 被引用 18 次
相关 Paper
- Classical Commitments to Quantum StatesSam Gunn, Yael Tauman Kalai, Anand Natarajan, Ági VillányiSTOC 2025 · 被引用 2 次
- On the Power of Oblivious State PreparationJames Bartusek, Dakshita KhuranaCRYPTO 2025 · 被引用 2 次
- Certified Randomness from Quantum SupremacyScott Aaronson, Shih-Han HungSTOC 2023 · 被引用 18 次
- Constant-Round Blind Classical Verification of Quantum SamplingKai-Min Chung, Yi Lee, Han-Hsuan Lin, Xiaodi WuEUROCRYPT 2022 · 被引用 7 次
- Quantum Hamiltonian CertificationMinbo Gao, Zhengfeng Ji, Qisheng Wang, Wenjun Yu 等SODA 2026
