REVIEW 6 cited by
Cleaner magic states with hook injection
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
In this paper, I show how an intentional hook error mechanism can be used as a control knob for injecting magic states into surface codes. The limitation, and benefit, of this approach is that it can only inject states in the XY or YZ plane of the Bloch sphere. This increases fidelity, because perturbations out of the target plane can be detected as errors. I use Monte Carlo sampling to show that this technique outperforms previous injection techniques, achieving lower error rates at smaller spacetime cost under digitized circuit noise.
Forward citations
Cited by 6 Pith papers
-
Unfolded distillation: very low-cost magic state preparation for biased-noise qubits
Unfolded distillation prepares an |X^{1/4}> magic state with logical error 3e-7 using 53 biased-noise qubits and 5.5 rounds, by unfolding the 3D Reed-Muller X-stabilizers into a 2D layout.
-
Transversal Surface-Code Game Powered by Neutral Atoms
A transversal surface-code game framework for neutral-atom FTQC that allows syndrome extraction at any step and yields a resource estimate of about 76,000 physical qubits and 3.4 hours for a 100-logical-qubit, 10^8 T-...
-
Constant-Overhead Magic State Injection into qLDPC Codes with Error Independence Guarantees
A code surgery protocol injects magic states into many logical qubits of qLDPC codes with constant qubit overhead, O~(d^2) time, and an error independence guarantee.
-
Efficient certification of intractable quantum states with few Pauli measurements
The paper claims Clifford-enhanced product states can be certified with O(n^2/epsilon^2) Pauli measurements in the i.i.d. setting and polynomially many in the adversarial setting, but the central estimator is derived ...
-
Controller-decoder system requirements derived by implementing Shor's algorithm with surface code
Running a non-Clifford surface-code circuit requires controller-decoder latency of tens of microseconds and parallel decoding tasks; a 1000-qubit, 0.1%-error processor could factor 21 with over 90% logical fidelity.
-
Pauli webs spun by transversal $|Y\rangle$ state initialisation
A diagrammatic verification, using Pauli webs, that the CCLP fold-transversal S gate maps the logical X correlator to the logical Y correlator.
Discussion (0). Continue with ORCID to comment.