加入
Quantum query complexity of triangle finding
Close the gap between the Ω(n) lower bound and O(n^1.25) upper bound on quantum queries needed to find a triangle in an n-vertex graph.
| 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_0c17d9fef967858d/", |
| 12 | "id": "op_0c17d9fef967858d", |
| 13 | "curator": "Bikun Li, Qicheng Tang, Changhao Li, Chengkai Zhu, Minbo Gao, Zhong-Xia Shang, Bin Cheng and Naixu Guo", |
| 14 | "poser": "Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha and Ronald de Wolf", |
| 15 | "status": "unsolved", |
| 16 | "as_of": "2026-10-20", |
| 17 | "catalog": "0521c19bbd38" |
| 18 | } |
| 19 | } |