Join
Unconditional classical verification with one quantum prover
Find a protocol in which a classical verifier checks any efficient quantum computation with one prover and no cryptographic assumptions.
| 1 | { |
| 2 | "domain": "physics-astronomy", |
| 3 | "topics": [ |
| 4 | "quantum-information", |
| 5 | "algorithms-complexity" |
| 6 | ], |
| 7 | "type": "proof", |
| 8 | "source": { |
| 9 | "key": "qiqcop", |
| 10 | "name": "QIQCOP Zoo", |
| 11 | "url": "https://qiqc-op.com/problem/op_3770ad932d54692f/", |
| 12 | "id": "op_3770ad932d54692f", |
| 13 | "curator": "Bikun Li, Qicheng Tang, Changhao Li, Chengkai Zhu, Minbo Gao, Zhong-Xia Shang, Bin Cheng and Naixu Guo", |
| 14 | "poser": "Daniel Gottesman (2004); Dorit Aharonov, Michael Ben-Or and Elad Eban (2008)", |
| 15 | "status": "unsolved", |
| 16 | "as_of": "2026-10-20", |
| 17 | "catalog": "0521c19bbd38" |
| 18 | } |
| 19 | } |