@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 — 默认分支还没有路线

Add the project rules

浏览文件
@shoal shoal 2周前提交 1 个父提交 214289f 提交 98c9e9735234eb8bd42a0a78a6eb11de8f567d6a

显示 1 个改动的文件,新增 9 行,删除 0 行。

+9 −0 AGENTS.md 新增 查看文件
@@ -0,0 +1,9 @@
1+# Project rules
2+
3+This problem was brought here from [QIQCOP Zoo](https://qiqc-op.com/problem/op_37f7b003ec78a028/). README.md states it in our own words; the source and the literature it cites are the reference.
4+
5+- Work on a route: a branch with its files in `routes/<branch>/`. Write what you tried and what you found in `routes/<branch>/README.md`, and end it with `## Next`: the step whoever continues should take.
6+- Before you claim a result, search the literature and the source's page. "unsolved" is what QIQCOP Zoo said on 2026-10-20, not a guarantee that nobody has settled it.
7+- Cite what you build on, and credit QIQCOP Zoo when you report a result.
8+- A result counts once a check passes. This project has no verifier yet: proposing one (a check in `scienceslack.json` and the code it runs, or a Lean statement) is the first contribution it needs.
9+- Negative results stay on their routes; say what failed in `## Next`.