Fault-Tolerant High Level Quantum Circuits: Form, Compilation and Description

Abstract

Fault-tolerant quantum error correction is a necessity for any quantum architecture destined to tackle interesting, large-scale problems. Its theoretical formalism has been well founded for nearly two decades. However, we still do not have an appropriate compiler to produce a fault-tolerant, error corrected description from a higher level quantum circuit for state of the art hardware models. There are many technical hurdles, including dynamic circuit constructions that occur when constructing fault-tolerant circuits with commonly used error correcting codes. We introduce a package that converts high level quantum circuits consisting of commonly used gates into a form employing all decompositions and ancillary protocols needed for fault-tolerant error correction. We call this form the (I)initialisation, (C)NOT, (M)measurement form (ICM) and consists of an initialisation layer of qubits into one of four distinct states, a massive, deterministic array of CNOT operations and a series of time ordered $X$- or $Z$-basis measurements. The form allows a more flexbile approach towards circuit optimisation. At the same time, the package outputs a standard circuit or a canonical geometric description which is a necessity for operating current state-of-the-art hardware architectures using topological quantum codes.

17 pages, 17 figures, comments welcome. The compiler source code is released under the Microsoft Reference Source License (Ms-RSL, http://referencesource.microsoft.com/ license.html) at http://www.teqcnique.com/icmconvert

References in corpus (21)

• Surface codes: Towards practical large-scale quantum computation
• Topological fault-tolerance in cluster state quantum computation
• Quantum computing with nearest neighbor interactions and error rates over 1%
• Photonic architecture for scalable quantum information processing in NV-diamond
• Novel constructions for the fault-tolerant Toffoli gate
• A Lambda Calculus for Quantum Computation
• Fast Quantum Modular Exponentiation
• Exact synthesis of multiqubit Clifford+T circuits
• LIQUi|>: A Software Design Architecture and Domain-Specific Language for Quantum Computing
• Efficient synthesis of universal Repeat-Until-Success circuits
• Fault-tolerant thresholds for quantum error correction with the surface code
• Linear Depth Stabilizer and Quantum Fourier Transformation Circuits with no Auxiliary Qubits in Finite Neighbor Quantum Architectures
• An Introduction to Quantum Programming in Quipper
• Efficient synthesis of probabilistic quantum circuits with fallback
• A bridge to lower overhead quantum computation
• Synthesis of Arbitrary Quantum Circuits to Topological Assembly
• Optimal ancilla-free Clifford+T approximation of z-rotations
• Quantum circuit optimization by topological compaction in the surface code
• Global Quantum Circuit Optimization
• Logic Synthesis for Fault-Tolerant Quantum Computers
• A Regular Representation of Quantum Circuits

Cited by in corpus (34)

• A Quantum Engineer's Guide to Superconducting Qubits
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Local and Distributed Quantum Computation
• Performing Quantum Computing Experiments in the Cloud
• Skyrmion Logic System for Large-Scale Reversible Computation
• Time-Sliced Quantum Circuit Partitioning for Modular Architectures
• Optimized Surface Code Communication in Superconducting Quantum Computers
• Mapping of Lattice Surgery-based Quantum Circuits on Surface Code Architectures
• SQUARE: Strategic Quantum Ancilla Reuse for Modular Quantum Programs via Cost-Effective Uncomputation
• Optimization of Lattice Surgery is NP-Hard
• Pseudo-2D superconducting quantum computing circuit for the surface code: the proposal and preliminary tests
• Quantum Circuit Design for Objective Function Maximization in Gate-Model Quantum Computers
• Compilation of algorithm-specific graph states for quantum circuits
• Lattice Surgery on the Raussendorf Lattice
• Resource Optimized Quantum Architectures for Surface Code Implementations of Magic-State Distillation
• State Stabilization for Gate-Model Quantum Computers
• Universal quantum computing with thermal state bosonic systems
• Universal quantum state preparation via revised greedy algorithm
• Everything You Always Wanted to Know About Quantum Circuits
• SurfBraid: A concept tool for preparing and resource estimating quantum circuits protected by the surface code
• Domain-Specific Compilers for Dynamic Simulations of Quantum Materials on Quantum Computers
• A Specification Format and a Verification Method of Fault-Tolerant Quantum Circuits
• Hardness of braided quantum circuit optimization in the surface code
• T-count and Qubit Optimized Quantum Circuit Designs of Carry Lookahead Adder
• T-count Optimized Quantum Circuits for Bilinear Interpolation
• A Substrate Scheduler for Compiling Arbitrary Fault-tolerant Graph States
• $T$-depth-optimized Quantum Search with Quantum Data-access Machine
• Superconducting qubits in the millions: the potential and limitations of modularity
• Really Small Shoe Boxes - On Realistic Quantum Resource Estimation
• Faster manipulation of large quantum circuits using wire label reference diagrams
• String Diagrams for Defect-Based Surface Code Computing
• Controlling distilleries in fault-tolerant quantum circuits: problem statement and analysis towards a solution
• Reliable quantum circuits have defects
• Programming quantum computers using 3-D puzzles, coffee cups, and doughnuts