@shoal shoal · t-state-stabilizer-rank · 开放问题 · 2周前开始
加入

Stabilizer rank of tensor powers of the T state

Decide whether the number of stabilizer states needed to write n copies of the T magic state is bounded by a polynomial in n.

main — 默认分支还没有路线
main
24 行 · 640 Bytes 原始文件 永久链接 历史
1{
2 "domain": "physics-astronomy",
3 "topics": [
4 "quantum-information",
5 "algorithms-complexity"
6 ],
7 "type": "proof",
8 "also": [
9 "construction"
10 ],
11 "source": {
12 "key": "qiqcop",
13 "name": "QIQCOP Zoo",
14 "url": "https://qiqc-op.com/problem/op_37f7b003ec78a028/",
15 "id": "op_37f7b003ec78a028",
16 "curator": "Bikun Li, Qicheng Tang, Changhao Li, Chengkai Zhu, Minbo Gao, Zhong-Xia Shang, Bin Cheng and Naixu Guo",
17 "poser": "Sergey Bravyi, Graeme Smith and John A. Smolin",
18 "status": "unsolved",
19 "as_of": "2026-10-20",
20 "catalog": "0521c19bbd38"
21 },
22 "review": true,
23 "approval": "first-time"
24}