Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error Correction Codes

Abstract

A central ingredient in fault-tolerant quantum algorithms is the initialization of a logical state for a given quantum error-correcting code from a set of noisy qubits. A scheme that has demonstrated promising results for small code instances that are realizable on currently available hardware composes a non-fault-tolerant state preparation step with a verification step that checks for spreading errors. Known circuit constructions of this scheme are mostly obtained manually, and no algorithmic techniques for constructing depth- or gate-optimal circuits exist. As a consequence, the current state of the art exploits this scheme only for specific code instances and mostly for the special case of distance 3 codes. In this work, we propose an automated approach for synthesizing fault-tolerant state preparation circuits for arbitrary CSS codes. We utilize methods based on satisfiability solving (SAT) techniques to construct fault-tolerant state preparation circuits consisting of depth- and gate-optimal preparation and verification circuits. We also provide heuristics that can synthesize fault-tolerant state preparation circuits for code instances where no optimal solution can be obtained in an adequate timeframe. Moreover, we give a general construction for non-deterministic state preparation circuits beyond distance 3. Numerical evaluations using $d=3$ and $d=5$ codes confirm that the generated circuits exhibit the desired scaling of the logical error rates. The resulting methods are publicly available as part of the Munich Quantum Toolkit (MQT) at https://github.com/cda-tum/mqt-qecc. Such methods are an important step in providing fault-tolerant circuit constructions that can aid in near-term demonstration of fault-tolerant quantum computing.

32 pages, 21 figures Version 2: included some references, fixed error in printed circuits Version 3: journal publication update, extended evaluations

References in corpus (20)

• Array Programming with NumPy
• Logical quantum processor based on reconfigurable atom arrays
• Topological Quantum Distillation
• High-fidelity parallel entangling gates on a neutral atom quantum computer
• Stim: a fast stabilizer circuit simulator
• Quantum Low-Density Parity-Check Codes
• Demonstration of fault-tolerant universal quantum gate operations
• Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
• Flag fault-tolerant error correction for any stabilizer code
• Linear Depth Stabilizer and Quantum Fourier Transformation Circuits with no Auxiliary Qubits in Finite Neighbor Quantum Architectures
• Single-shot error correction of three-dimensional homological product codes
• Measurement-free fault-tolerant quantum error correction in near-term devices
• Depth optimization of CZ, CNOT, and Clifford circuits
• Fault-Tolerant Code Switching Protocols for Near-Term Quantum Processors
• 6-qubit Optimal Clifford Circuits
• Adaptive syndrome measurements for Shor-style error correction
• Gaussian Elimination versus Greedy Methods for the Synthesis of Linear Reversible Circuits
• Decoding Merged Color-Surface Codes and Finding Fault-Tolerant Clifford Circuits Using Solvers for Satisfiability Modulo Theories
• Fault-Tolerant Preparation of Quantum Polar Codes Encoding One Logical Qubit
• Factory-based Fault-tolerant Preparation of Quantum Polar Codes Encoding One logical Qubit

Cited by in corpus (4)

• Efficient fault-tolerant code switching via one-way transversal CNOT gates
• Optimal State Preparation for Logical Arrays on Zoned Neutral Atom Quantum Computers
• Experimental measurement and a physical interpretation of quantum shadow enumerators
• On the interpretability of neural network decoders