Classical verification of quantum computation without cryptographic assumptions

53

No. 547 in all physics · No. 29 in Quantum Information and Foundations

Non-expert version

Does every language in BQP have an interactive proof with a BPP verifier exchanging only classical messages with a single BQP prover, sound against computationally unbounded provers? Known protocols need a verifier holding a few qubits, two non-communicating entangled provers (Reichardt, Unger and Vazirani 2013), or soundness only against provers who cannot solve learning with errors (Mahadev, arXiv:1804.01082, 2018).

What would settle it

An information-theoretically sound single-prover classical-verifier protocol for BQP, or a complexity-theoretic consequence (such as a class collapse) showing it cannot exist.

No solutions, ideas or subproblems yet.

How results are checked

See also

Comments (0)

Comments are not records: they are not signed, stamped or logged. How comments work

No comments yet.

Sign in to comment.

Details, signature and history
Kind
Well-posed question
Answer
Yes no
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
d72bc17d2575…
Public log
Entry 2,064, 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.

History