Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit Golay code
pith:M4ZDLLJI Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{M4ZDLLJI}
Prints a linked pith:M4ZDLLJI badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
In fault-tolerant quantum computing schemes, the overhead is often dominated by the cost of preparing codewords reliably. This cost generally increases quadratically with the block size of the underlying quantum error-correcting code. In consequence, large codes that are otherwise very efficient have found limited fault-tolerance applications. Fault-tolerant preparation circuits therefore are an important target for optimization. We study the Golay code, a 23-qubit quantum error-correcting code that protects the logical qubit to a distance of seven. In simulations, even using a naive ancilla preparation procedure, the Golay code is competitive with other codes both in terms of overhead and the tolerable noise threshold. We provide two simplified circuits for fault-tolerant preparation of Golay code-encoded ancillas. The new circuits minimize error propagation, reducing the overhead by roughly a factor of four compared to standard encoding circuits. By adapting the malignant set counting technique to depolarizing noise, we further prove a threshold above 1.32 x 10^{-3} noise per gate.
This paper has not been read by Pith yet.
Forward citations
Cited by 4 Pith papers
-
Efficient Fault-Tolerant Ancilla Preparation for Quantum BCH codes via Cyclic Symmetry
A symmetry-leveraging framework for fault-tolerant ancilla preparation in quantum BCH codes yields lower spatial overhead and logical error rates than standard distillation in simulations up to 127 qubits.
-
Synthesis and Optimization of Encoding Circuits for Fault-Tolerant Quantum Computation
New search algorithms over stabilizer tableaus and modular assembly techniques yield encoders with up to 43% fewer two-qubit gates and 70% lower depth than prior constructions on tested stabilizer codes including qLDP...
-
Fire and ice: Partially fault-tolerant quantum computing with selective state filtering
Concatenates Laflamme and Iceberg codes with selective filtering for a partially fault-tolerant quantum computation scheme that simulations indicate performs reliably at realistic noise levels.
-
Realistic Simulation of Quantum Repeater with Encoding and Classical Error Correction
Simulation of QRE-CEC protocol in SeQUeNCe shows logical Bell pairs distributed at 0.91 fidelity over 2000 km with all modeled errors suppressed to second order.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.