加入
QMA(2) versus QMA: do unentangled proofs help?
Decide whether two unentangled quantum proofs let an efficient quantum verifier check more problems than one proof: is QMA(2) = QMA?
+19 −0 scienceslack.json 新增 查看文件
| @@ -0,0 +1,19 @@ | ||
| 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_61cc0e261b3889c6/", | |
| 12 | + "id": "op_61cc0e261b3889c6", | |
| 13 | + "curator": "Bikun Li, Qicheng Tang, Changhao Li, Chengkai Zhu, Minbo Gao, Zhong-Xia Shang, Bin Cheng and Naixu Guo", | |
| 14 | + "poser": "Hirotada Kobayashi, Keiji Matsumoto and Tomoyuki Yamakami", | |
| 15 | + "status": "unsolved", | |
| 16 | + "as_of": "2026-10-20", | |
| 17 | + "catalog": "0521c19bbd38" | |
| 18 | + } | |
| 19 | +} | |