Tailoring Fault-Tolerance to Quantum Algorithms

Abstract

The standard approach to universal fault-tolerant quantum computing is to develop a general purpose quantum error correction mechanism that can implement a universal set of logical gates fault-tolerantly. Given such a scheme, any quantum algorithm can be realized fault-tolerantly by composing the relevant logical gates from this set. However, we know that quantum computers provide a significant quantum advantage only for specific quantum algorithms. Hence, a universal quantum computer can likely gain from compiling such specific algorithms using tailored quantum error correction schemes. In this work, we take the first steps towards such algorithm-tailored quantum fault-tolerance. We consider Trotter circuits in quantum simulation, which is an important application of quantum computing. We develop a solve-and-stitch algorithm to systematically synthesize physical realizations of Clifford Trotter circuits on the well-known $\llbr n,n-2,2 \rrbr$ error-detecting code family. Our analysis shows that this family implements Trotter circuits with essentially optimal depth under reasonable assumptions, thereby serving as an illuminating example of tailored quantum error correction. We achieve fault-tolerance for these circuits using flag gadgets, which add minimal overhead. Importantly, the solve-and-stitch algorithm has the potential to scale beyond this specific example, as illustrated by a generalization to the four-qubit logical Clifford Trotter circuit on the $\llbr 20,4,2 \rrbr$ hypergraph product code, thereby providing a principled approach to tailored fault-tolerance in quantum computing.

arXiv comment24 pages IEEE double column, 37 figures

References in corpus (14)

• Improved Simulation of Stabilizer Circuits
• Logical quantum processor based on reconfigurable atom arrays
• Quantum algorithms: an overview
• Simulation of Electronic Structure Hamiltonians Using Quantum Computers
• Restrictions on Transversal Encoded Quantum Gate Sets
• Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
• Finding Exponential Product Formulas of Higher Orders
• The Clifford group, stabilizer states, and linear and quadratic operations over GF(2)
• Fault-tolerant quantum computation with few qubits
• Low-overhead fault-tolerant quantum computing using long-range connectivity
• Demonstration of fault-tolerant Steane quantum error correction
• Logical Clifford Synthesis for Stabilizer Codes
• Reducing the error rate of a superconducting logical qubit using analog readout information
• Efficient fault-tolerant implementations of non-Clifford gates with reconfigurable atom arrays