Efficient Computations of Encodings for Quantum Error Correction
arXiv:quant-ph/9607030 · doi:10.1103/PhysRevA.56.76
Abstract
We show how, given any set of generators of the stabilizer of a quantum code, an efficient gate array that computes the codewords can be constructed. For an n-qubit code whose stabilizer has d generators, the resulting gate array consists of O(n d) operations, and converts k-qubit data (where k = n - d) into n-qubit codewords.
16 pages, REVTeX, 3 figures within the text
References in corpus (11)
- Mixed State Entanglement and Quantum Error Correction
- Good Quantum Error-Correcting Codes Exist
- Multiple Particle Interference and Quantum Error Correction
- A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
- Quantum Error Correction and Orthogonal Geometry
- Simple Quantum Error Correcting Codes
- Fault-Tolerant Error Correction with Efficient Quantum Codes
- Error Prevention Scheme with Four Particles
- Quantum Error-Correcting Codes Need Not Completely Reveal the Error Syndrome
- Error Correction in Quantum Communication
- Perfect quantum error correction coding in 24 laser pulses
Cited by in corpus (46)
- Improved Simulation of Stabilizer Circuits
- Quantum Computing with Very Noisy Devices
- A Theory of Fault-Tolerant Quantum Computation
- Quantum Error Correction for Beginners
- Effective Pure States for Bulk Quantum Computation
- Basics of Quantum Computation
- Optimizing Quantum Error Correction Codes with Reinforcement Learning
- Lower bounds on the non-Clifford resources for quantum computations
- Quantum Gates and Circuits
- Efficient Quantum Circuits for Non-Qubit Quantum Error-Correcting Codes
- Asymptotically Good Quantum Codes
- Quantum error correction in the presence of spontaneous emission
- Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation
- Experimental Demonstration of Logical Magic State Distillation
- Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction
- Cyclic Quantum Error-Correcting Codes and Quantum Shift Registers
- Quantum Stabilizer Codes and Classical Linear Codes
- Quantum Tokens for Digital Signatures
- Environment-Induced Decoherence and the Transition From Quantum to Classical
- Short random circuits define good quantum error correcting codes
- Conditional generation of error syndromes in fault-tolerant error correction
- Near-Hashing-Bound Multiple-Rate Quantum Turbo Short-Block Codes
- Optimal local unitary encoding circuits for the surface code
- Efficient Inner-product Algorithm for Stabilizer States
- Low-depth simulations of fermionic systems on square-grid quantum hardware
- Efficient learning of -doped stabilizer states with single-copy measurements
- No-Go Theorems for Universal Entanglement Purification
- Quantum Error Correction from Complexity in Brownian SYK
- Gottesman Types for Quantum Programs
- The equivalence of two approaches to the design of entanglement distillation protocols
- The Encoding and Decoding Complexities of Entanglement-Assisted Quantum Stabilizer Codes
- On Quantum and Classical Error Control Codes: Constructions and Applications
- Encoding Majorana codes
- Dissipative Encoding of Quantum Information
- Effect of ancilla's structure on quantum error correction using the 7-qubit Calderbank-Shor-Steane code
- Discovery of Optimal Quantum Error Correcting Codes via Reinforcement Learning
- Partially Concatenated Calderbank-Shor-Steane Codes Achieving the Quantum Gilbert-Varshamov Bound Asymptotically
- Encoding Subsystem Codes
- Resource Reduction in Multiplexed High-Dimensional Quantum Reed-Solomon Codes
- Minimizing readout-induced noise for early fault-tolerant quantum computers
- Nonbinary stabilizer codes over finite fields
- Syndrome decoding by quantum approximate optimization
- Error-mitigated initialization of surface codes with non-Pauli stabilizers
- High-fidelity initialization a logical qubit with multiple injections
- Measurement-free reconstruction circuit of quantum secrets in quantum secret sharing
- Hoare meets Heisenberg: A Lightweight Logic for Quantum Programs