Back to open problems
QuantumQuantum complexity theory
Single-prover interactive proofs for quantum computations
A complexity-theory problem on whether single-prover protocols can verify quantum computations with strong guarantees and realistic assumptions.
Contact
Henry Yuen
Added
2023
Last progress
No update listed
Silicio brief
In Silicio terms, this is an open problem in quantum complexity theory. A complexity-theory problem on whether single-prover protocols can verify quantum computations with strong guarantees and realistic assumptions.
Use the source page for the full statement, references, and updates.
IQOQI Vienna · Open Quantum Problems