The circuit
The 8\times35 matrix. Rows are wires and columns are rotations. A 1 means the wire takes part in the rotation, and the number beside each wire is its row weight.
| wire | 0 10 20 30 |
|---|---|
| out 0 (14) | ·11··1·1·111··111··11······11······ |
| out 1 (12) | 1·1111·1·111111···················· |
| check 2 (16) | 1·1···1·1···1·1··11·1·1·1·1·1·1·11· |
| check 3 (16) | ·11·1··11·1··11·1·1···1···1···111·1 |
| check 4 (16) | ···11····11····1111··11··11··11··11 |
| check 5 (16) | ·····111111······11····1111····1111 |
| check 6 (16) | ···········11111111········11111111 |
| check 7 (16) | ···················1111111111111111 |
The gate is read off the output rows. An output row of odd weight gives a T, a pair of output rows with odd overlap gives a CS, and an odd triple overlap gives a CCZ. The circuit is a valid factory because every such parity that touches a check row is even.
Figures of merit
inputs n35Noisy T states per run.
outputs k2
distance d3Exact, proved and witnessed here.
error coefficient A_{3}84Faults of weight 3 in the circuit shown that pass every check and damage the output. The output error is A_{3}\,p^{3} to leading order.
wires N8
checks r6
V_{\mathrm{ex}}1T states per run. CCZ counts as two.
\gamma_\rho = \log(n/V_{\mathrm{ex}})/\log d3.2362Overhead per extractable T state. Lower is better.
\gamma = \log(n/k)/\log d2.6053Overhead per output qubit.
\gamma_T = \log(n/T)/\log d2.2362Overhead per unit of T-count.
T-count3Minimal T-count of the output gate.
phase-polynomial degree2Minimised over changes of output basis.
effective width2Rank of the output rows modulo the check rows.
Output gate
0 T1 CS0 CCZon 2 output wires
As gates: \mathrm{CS}_{01}
As monomials: 01 (output wires per term, separated by +)
This row stands for every gate that a CNOT circuit and S, Z and CZ gates on the outputs can reach from this one. They all prepare the same magic state. The wires are shown in the S_k-canonical frame.
Clifford correction
With every rotation a \mathrm{T}=\mathrm{diag}(1,e^{i\pi/4}), the rotations deposit the gate above times a diagonal Clifford. Undo it after the rotations and before the checks are measured, with 2 single-wire gates and 6 \mathrm{CZ} gates: \mathrm{S} on output 0, \mathrm{Z} on output 1, \mathrm{CZ} on output 0, check 3, \mathrm{CZ} on output 0, check 6, \mathrm{CZ} on output 1, check 3, \mathrm{CZ} on check 2, check 4, \mathrm{CZ} on check 3, check 7, \mathrm{CZ} on check 5, check 6. The circuit's action is then exactly the gate above, and an error-free run passes every check with certainty.
These Clifford gates cannot be avoided. No choice of \mathrm{T}, \mathrm{T}^3, \mathrm{T}^5 or \mathrm{T}^\dagger for each rotation removes them; the catalogue proves this by showing that the linear system over \mathbb{Z}_4 the powers would have to solve has no solution.
Rotations are numbered by matrix column, from 0. The correction comes from the columns by the weight expansion of Bravyi and Haah (2012). verify_catalog.py re-derives it, checks the corrected circuit's phase input by input against the gate, and on small circuits simulates it gate by gate.
Convert the output with CNOT and S
A CNOT circuit on the outputs, followed by S, Z and CZ gates, turns this factory's gate into other gates that prepare the same magic state. Type a target gate to check whether it is reachable. If it is, you get the circuit, checked on every basis state.
Or list every gate it reaches. The list is built in your browser and saved as a text file, one gate per line.
Python code that writes the same list
import json, urllib.request
NAMES = {1: "T", 2: "CS", 3: "CCZ"}
def equivalent_gates(k, terms, limit=1_000_000):
"""Every gate a CNOT circuit and S, Z, CZ gates reach from this one.
A gate is its set of terms mod Clifford: {a} is T, {a,b} is CS and
{a,b,c} is CCZ on those outputs. CNOT c->t sends x_t to
x_c + x_t - 2 x_c x_t, so a term on t but not c adds the term with t
replaced by c, and, below CCZ, the term with c added.
"""
start = frozenset(frozenset(m) for m in terms)
seen, queue = {start}, [start]
for gate in queue:
for c in range(k):
for t in range(k):
if c == t:
continue
new = set(gate)
for m in gate:
if t in m and c not in m:
new ^= {(m - {t}) | {c}}
if len(m) < 3:
new ^= {m | {c}}
new = frozenset(new)
if new not in seen:
seen.add(new)
queue.append(new)
if len(seen) > limit:
raise RuntimeError(f"more than {limit} equivalent gates")
return seen
def name(gate, k):
sep = "," if k > 10 else ""
terms = sorted((sorted(m) for m in gate), key=lambda m: (len(m), m))
return "·".join(NAMES[len(m)] + sep.join(map(str, m)) for m in terms) or "I"
url = "https://shubhamj810.github.io/magic-state-factory-repo/data/factories/35.2.3.a.json"
record = json.load(urllib.request.urlopen(url))
k = record["parameters"]["k"]
gates = equivalent_gates(k, record["gate"]["monomials"])
lines = sorted(name(g, k) for g in gates)
print(len(lines), "equivalent gates")
with open("equivalent-gates-35.2.3.a.txt", "w") as out:
out.write("\n".join(lines) + "\n")
Distance
d=3, exact. No fault of weight below 3 is both undetectable and damaging. One of weight 3 is.
Exactly 84 faults of weight 3 are undetectable and damaging, so A_{3}=84. If each rotation fails independently with probability p, an accepted run has a damaged output with probability A_{3}\,p^{3}+O(p^{4}).
A damaging fault of weight 3 sits on columns [0,5,6].
A fault is a set of faulty columns. It is undetectable when their check parts cancel, and damaging when their output parts do not.
Original source
S. Nezami and J. Haah, "Classification of small triorthogonal codes," Phys. Rev. A 106, 012437 (2022). doi.org/10.1103/PhysRevA.106.012437
Provenance
a Pareto point of the exhaustive classification of generalised triorthogonal protocols through length 54 (classification/length54/): no protocol with n <= 54, the same CNOT+S output class and the same exact distance has n and S both no larger and one of them smaller, where S counts every matrix row -- the N of this table
Found by: exhaustive classification n<=54 (Pareto point) symmetry-SAT search AI search
Discovery: pre-existing
12 recorded sources
[
{
"regime": "exhaustive classification n<=54 (Pareto point)",
"file": "classification/legacy/exhaustive_n38/catalog/classification_n38.json",
"label": "01",
"N": 8,
"d": 3,
"d_is_exact": true,
"origin": null,
"provenance": "quotient_catalog_k3"
},
{
"regime": "symmetry-SAT search",
"file": "symmetry_sat_search/catalog/factories.json",
"label": "CS01",
"N": 9,
"d": 3,
"d_is_exact": true,
"origin": null,
"provenance": "archived slot-search output: geometry C7"
},
{
"regime": "AI search",
"file": "master_catalog/AI results",
"label": "CS01",
"N": 8,
"d": 3,
"d_is_exact": true,
"origin": "factory_records/findings_ccz.jsonl",
"provenance": "factory_records/findings_ccz.jsonl:36"
},
{
"regime": "AI search",
"file": "master_catalog/AI results",
"label": "CS01",
"N": 9,
"d": 3,
"d_is_exact": true,
"origin": "factory_records/reproductions",
"provenance": "factory_records/reproductions/n35_k2_d3_tau3_CS01.json"
},
{
"regime": "AI search",
"file": "master_catalog/AI results",
"label": "CS01",
"N": 9,
"d": 3,
"d_is_exact": true,
"origin": "ai_campaign/circuits",
"provenance": "ai_campaign/circuits/n35_k2_d3_tau3_parent(r=9,n=35)_it11.json"
},
{
"regime": "AI search",
"file": "master_catalog/AI results",
"label": "CS01",
"N": 9,
"d": 3,
"d_is_exact": true,
"origin": "ai_campaign/circuits",
"provenance": "ai_campaign/circuits/n35_k2_d3_tau3_parent-target(n=35,kappa=9)_it12.json"
},
{
"regime": "AI search",
"file": "master_catalog/catalogue_new",
"label": "CS01",
"N": 8,
"d": 3,
"d_is_exact": true,
"origin": "factory_records/findings_ccz",
"provenance": "factory_records/findings_ccz \u00b7 catalogue.jsonl:70"
},
{
"regime": "AI search",
"file": "master_catalog/catalogue_new",
"label": "CS01",
"N": 8,
"d": 3,
"d_is_exact": true,
"origin": "frontier_campaign",
"provenance": "frontier_campaign \u00b7 catalogue.jsonl:78"
},
{
"regime": "AI search",
"file": "master_catalog/catalogue_new",
"label": "CS01",
"N": 9,
"d": 3,
"d_is_exact": true,
"origin": "factory_records/reproductions",
"provenance": "factory_records/reproductions \u00b7 catalogue.jsonl:69"
},
{
"regime": "AI search",
"file": "master_catalog/catalogue_new",
"label": "CS01",
"N": 9,
"d": 3,
"d_is_exact": true,
"origin": "ai_campaign/circuits",
"provenance": "ai_campaign/circuits \u00b7 catalogue.jsonl:74"
},
{
"regime": "exhaustive classification n<=54 (Pareto point)",
"file": "classification/legacy/rank7_census/catalog/sk_classes_r7.json",
"label": "01",
"N": 8,
"d": 3,
"d_is_exact": true,
"origin": null,
"provenance": "RM(3,7) orbit class 3432, origin 64; rep_3432_64.json"
},
{
"regime": "exhaustive classification n<=54 (Pareto point)",
"file": "classification/length54/pareto_frontier.json",
"label": "protocol 7",
"N": 8,
"d": 3,
"d_is_exact": true,
"origin": "exhaustive classification of generalised triorthogonal protocols through length 54 (Wills, Jain and Singh)",
"provenance": "Pareto point 7 of the length-54 classification: output class Q2_0000000000000004 (CS), (n, S, d_Z) = (35, 8, 3), leading error coefficient 84; the outputs are its 2 logical rows"
}
]Use it in code
Load this factory and re-derive every number from its circuit with the catalogue's own verifier.
# git clone https://github.com/shubhamj810/magic-state-factory-repo
# cd magic-state-factory-repo/master_catalog
import json, urllib.request
import verify_catalog as VC
url = "https://shubhamj810.github.io/magic-state-factory-repo/data/factories/35.2.3.a.json"
record = json.load(urllib.request.urlopen(url))
columns = record["circuit"]["columns"]
k, N = record["parameters"]["k"], record["parameters"]["N"]
facts, problems = VC.derive(columns, k, N) # gate, T-count, degree, ...
distance = VC.measure_distance(columns, k, N) # exhaustive fault search
print(facts["gate_human"], distance["d_exact"] or distance["d_at_least"],
problems or "verified")
Raw record
Show the JSON this page is built from
Source: master_catalog.json, factories[88].