Efficient Quantum Circuits for Non-Qubit Quantum Error-Correcting Codes
arXiv:quant-ph/0211014 · doi:10.1142/S0129054103002011
Abstract
We present two methods for the construction of quantum circuits for quantum error-correcting codes (QECC). The underlying quantum systems are tensor products of subsystems (qudits) of equal dimension which is a prime power. For a QECC encoding k qudits into n qudits, the resulting quantum circuit has O(n(n-k)) gates. The running time of the classical algorithm to compute the quantum circuit is O(n(n-k)^2).
18 pages, submitted to special issue of IJFCS
Cited by in corpus (48)
- On optimal quantum codes
- Stabilizer states and Clifford operations for systems of arbitrary dimensions, and modular arithmetic
- Practical trapped-ion protocols for universal qudit-based quantum computing
- Implementation of a Walsh-Hadamard gate in a superconducting qutrit
- Criteria for Exact Qudit Universality
- Perfect Quantum Network Communication Protocol Based on Classical Network Coding
- Standard Form of Qudit Stabilizer Groups
- Non-catastrophic Encoders and Encoder Inverses for Quantum Convolutional Codes
- Qudit Quantum Computation in the Jaynes-Cummings Model
- Sharing classical secrets with CSS codes
- Control of inhomogeneous atomic ensembles of hyperfine qudits
- Hardware-Efficient Bosonic Quantum Error-Correcting Codes Based on Symmetry Operators
- Constructions of Quantum Convolutional Codes
- Quantum Tokens for Digital Signatures
- An Ideal Characterization of the Clifford Operators
- Matroids and Quantum Secret Sharing Schemes
- A linearized stabilizer formalism for systems of finite dimension
- On Subsystem Codes Beating the Hamming or Singleton Bound
- Communication Efficient Quantum Secret Sharing
- Accessing quantum secrets via local operations and classical communication
- Non-Additive Quantum Codes from Goethals and Preparata Codes
- Log-domain decoding of quantum LDPC codes over binary finite fields
- Absolutely maximally entangled states, quantum maximum distance separable codes, and quantum repeaters
- Towards Large-Scale Quantum Computation
- Protecting qudit operations from noise by continuous dynamical decoupling
- Quantum stabilizer codes and beyond
- On Quantum and Classical Error Control Codes: Constructions and Applications
- Coarse graining the phase space of qubits
- Quantum linear network coding as one-way quantum computation
- Efficient Circuits for Exact-Universal Computations with Qudits
- Encoding Subsystem Codes
- Improved Quantum Ternary Arithmetics
- Covariant mutually unbiased bases
- Relation Between Surface Codes and Hypermap-Homology Quantum Codes
- Resource Reduction in Multiplexed High-Dimensional Quantum Reed-Solomon Codes
- Time-dependent Rabi frequencies to protect quantum operations on an atomic qutrit by continuous dynamical decoupling
- Qudit low-density parity-check codes
- An Optimized Nearest Neighbor Compliant Quantum Circuit for 5-qubit Code
- Quantum computation with charge-and-color permuting twists in qudit color codes
- Measurement-free reconstruction circuit of quantum secrets in quantum secret sharing
- On The Stabilizer Formalism And Its Generalization
- Classical representation of local Clifford operators
- Physically motivated decompositions of single-qutrit gates
- Constrained free energy minimization for the design of thermal states and stabilizer thermodynamic systems
- A generalized quantum SWAP gate
- Maximally symmetric stabilizer MUBs in even prime-power dimensions
- On interchanging the states of a pair of qudits
- Encoder Circuit Optimization for Non-Binary Quantum Error Correction Codes in Prime Dimensions: An Algorithmic Framework