Classically verifiable quantum advantage on pre-fault-tolerant hardware
70No. 118 in all physics · No. 10 in Quantum Information and Foundations
Find a task executable by circuits of depth $O(\operatorname{polylog} n)$ on $n \le 10^{3}$ qubits with two-qubit gate error $\sim 10^{-3}$ and no error correction such that (i) a classical verifier checks the output in $\operatorname{poly}(n)$ time, (ii) the task is classically hard under a standard assumption such as learning with errors, and (iii) soundness holds at the output fidelity actually achievable. Answer: a protocol with all three properties, or a no-go result relating verifiability, noise rate and depth.
What would settle it
An experiment executing such a protocol at a size where the classical cost is established, or a theorem excluding it.
Status in the literature
Unverified note: it names recent work and was partly written without a live literature search; it awaits a check by an editor.
Many 2025-2026 proposals (low-depth lattice-based, planted-structure and obfuscation-based schemes, e.g. arXiv:2609.01448, arXiv:2609.39918) address subsets of these conditions.
No solutions, ideas or subproblems yet.
See also
- Related Classical verification of quantum computation without cryptographic assumptions
- Related Is the 2025 OTOC(2) quantum echo experiment beyond classical simulation?
Details, signature and history
- Kind
- Well-posed question
- Answer
- Identification
- Topic review
- A. M. Dalzell et al., Quantum algorithms: A survey of applications and end-to-end complexities, arXiv, 2023. Link
- Record
- Revision 1 · imported from the seed collection · compiled by AI, not yet reviewed by an editor
Proof
- Fingerprint
- d669fbe9615d…
- Public log
- Entry 2,063, in checkpoint 2,123
- In the log by
- Block 969,698, 2026-10-03
This text was in the PubPhys log by that date. The date says nothing about when the problem was first posed.
Comments (0)
Comments are not records: they are not signed, stamped or logged. How comments work
No comments yet.
Sign in to comment.