Logical Clifford Synthesis for Stabilizer Codes
arXiv:1907.00310 · doi:10.1109/TQE.2020.3023419
Abstract
Quantum error-correcting codes are used to protect qubits involved in quantum computation. This process requires logical operators, acting on protected qubits, to be translated into physical operators (circuits) acting on physical quantum states. We propose a mathematical framework for synthesizing physical circuits that implement logical Clifford operators for stabilizer codes. Circuit synthesis is enabled by representing the desired physical Clifford operator in as a partial binary symplectic matrix, where . We state and prove two theorems that use symplectic transvections to efficiently enumerate all binary symplectic matrices that satisfy a system of linear equations. As a corollary of these results, we prove that for an stabilizer code every logical Clifford operator has symplectic solutions, where , up to stabilizer degeneracy. The desired physical circuits are then obtained by decomposing each solution into a product of elementary symplectic matrices, that correspond to elementary circuits. This enumeration of all physical realizations enables optimization over the ensemble with respect to a suitable metric. Furthermore, we show that any circuit that normalizes the stabilizer of the code can be transformed into a circuit that centralizes the stabilizer, while realizing the same logical operation. Our method of circuit synthesis can be applied to any stabilizer code, and this paper discusses a proof of concept synthesis for the CSS code. Programs implementing the algorithms in this paper, which includes routines to solve for binary symplectic solutions of general linear systems and our overall LCS (logical circuit synthesis) algorithm, can be found at: https://github.com/nrenga/symplectic-arxiv18a
arXiv commentMain content 12 pages, double column. This is primarily a shortened version of the paper arXiv:1803.06987 based on feedback received, and also has a much more improved introduction. It was presented at ISIT 2018 as well as posters in TQC 2018 and QIP 2019. All comments are welcome!
References in corpus (43)
- Quantum Computing in the NISQ era and beyond
- Surface codes: Towards practical large-scale quantum computation
- Good Quantum Error-Correcting Codes Exist
- Quantum Teleportation is a Universal Computational Primitive
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- A Theory of Fault-Tolerant Quantum Computation
- Quantum Error Correction and Orthogonal Geometry
- A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
- Simple Quantum Error Correcting Codes
- Experimental Comparison of Two Quantum Computing Architectures
- Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories
- Correcting Quantum Errors with Entanglement
- Characterizing Quantum Gates via Randomized Benchmarking
- Restrictions on Transversal Encoded Quantum Gate Sets
- Quantum advantage with shallow circuits
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- Magic state distillation with low overhead
- Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
- The Clifford group, stabilizer states, and linear and quadratic operations over GF(2)
- Fault-tolerant quantum error detection
- Quantum advantage with noisy shallow circuits in 3D
- Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
- Universal transversal gates with color codes - a simplified approach
- Fault-Tolerant Logical Gates in the IBM Quantum Experience
- Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits
- Fault-tolerant quantum computation with few qubits
- Optimized Compilation of Aggregated Instructions for Realistic Quantum Computers
- Catalytic quantum error correction
- Quantum circuit optimizations for NISQ architectures
- Codes and Protocols for Distilling , controlled-, and Toffoli Gates
- How to efficiently select an arbitrary Clifford group element
- Magic State Distillation with Low Space Overhead and Optimal Asymptotic Input Count
- Shorter stabilizer circuits via Bruhat decomposition and quantum circuit transformations
- On Optimality of CSS Codes for Transversal
- Fault-Tolerant Quantum Computing in the Pauli or Clifford Frame with Slow Error Diagnostics
- On the logical operators of quantum codes
- Tutorial: The trapped-ion qubit toolbox
- Optimising Clifford Circuits with Quantomatic
- Formal Constraint-based Compilation for Noisy Intermediate-Scale Quantum Systems
- Unifying the Clifford Hierarchy via Symmetric Matrices over Rings
- Synthesis of Logical Clifford Operators via Symplectic Geometry
- Leveraging Automorphisms of Quantum Codes for Fault-Tolerant Quantum Computation
- Kerdock Codes Determine Unitary 2-Designs
Cited by in corpus (10)
- Transversal Diagonal Logical Operators for Stabiliser Codes
- Entanglement Purification with Quantum LDPC Codes and Iterative Decoding
- Quantum Circuit Discovery for Fault-Tolerant Logical State Preparation with Reinforcement Learning
- Targeted Clifford logical gates for hypergraph product codes
- Tailoring Fault-Tolerance to Quantum Algorithms
- GNarsil: Splitting Stabilizers into Gauges
- Enlarging the GKP stabilizer group for enhanced noise protection
- Fault Tolerant Quantum Simulation via Symplectic Transvections
- Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code
- Clifford Transformations for Fermionic Quantum Systems: From Paulis to Majoranas to Fermions