Decoding Merged Color-Surface Codes and Finding Fault-Tolerant Clifford Circuits Using Solvers for Satisfiability Modulo Theories

Abstract

Universal fault-tolerant quantum computers will require the use of efficient protocols to implement encoded operations necessary in the execution of algorithms. In this work, we show how solvers for satisfiability modulo theories (SMT solvers) can be used to automate the construction of Clifford circuits with certain fault-tolerance properties and we apply our techniques to a fault-tolerant magic-state-preparation protocol. Part of the protocol requires converting magic states encoded in the color code to magic states encoded in the surface code. Since the teleportation step involves decoding a color code merged with a surface code, we develop a decoding algorithm that is applicable to such codes.

arXiv comment23 pages, 9 figures; v5 conforms to journal specifications

References in corpus (37)

• Fault-tolerant quantum computation by anyons
• Surface codes: Towards practical large-scale quantum computation
• Topological quantum memory
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Quantum Computing with Very Noisy Devices
• Topological Quantum Distillation
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Overhead and noise threshold of fault-tolerant quantum error correction
• Quantum codes on a lattice with boundary
• Improved classical simulation of quantum circuits dominated by Clifford gates
• Building a fault-tolerant quantum computer using concatenated cat codes
• Universal fault-tolerant quantum computation with only transversal gates and error correction
• Quantum error correction with only two extra qubits
• Magic State Distillation: Not as Costly as You Think
• Topological and subsystem codes on low-degree graphs with flag qubits
• Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
• Flag fault-tolerant error correction with arbitrary distance codes
• Universal transversal gates with color codes - a simplified approach
• Fault-tolerant quantum computation with few qubits
• Optimal Layout Synthesis for Quantum Computing
• Quantum accuracy threshold for concatenated distance-3 codes
• The surface code with a twist
• Triangular color codes on trivalent graphs with flag qubits
• Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes
• Flag fault-tolerant error correction for any stabilizer code
• Universal quantum computing with twist-free and temporally encoded lattice surgery
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
• Fault-tolerant magic state preparation with flag qubits
• Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
• Low overhead quantum computation using lattice surgery
• Fault-tolerant quantum error correction for Steane's seven-qubit color code with few or no extra qubits
• Flag fault-tolerant error correction, measurement, and quantum computation for cyclic CSS codes
• Morphing quantum codes
• A circuit-level protocol and analysis for twist-based lattice surgery
• Formal Constraint-based Compilation for Noisy Intermediate-Scale Quantum Systems
• Achieving fault tolerance on capped color codes with few ancillas
• Fault-tolerant quantum error correction using error weight parities

Cited by in corpus (6)

• Encoding a magic state with beyond break-even fidelity
• Scaling and logic in the color code on a superconducting quantum processor
• Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error Correction Codes
• A SAT Scalpel for Lattice Surgery: Representation and Synthesis of Subroutines for Surface-Code Fault-Tolerant Quantum Computing
• Quantum Circuit Discovery for Fault-Tolerant Logical State Preparation with Reinforcement Learning
• Synchronization for Fault-Tolerant Quantum Computers