EFFICIENT QUANTUM CIRCUITS FOR NON-QUBIT QUANTUM ERROR-CORRECTING CODES
From MaRDI portal
Publication:5696937
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).
Recommendations
Cites work
- scientific article; zbMATH DE number 3131829 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- Conservative logic
- Endliche Gruppen I
- Error Correcting Codes in Quantum Theory
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
Cited in
(43)- Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\)
- Quantum codes from affine variety codes and their subfield-subcodes
- Sparse quantum codes from quantum circuits
- On the distance of stabilizer quantum codes from \(J\)-affine variety codes
- Some new quantum codes from constacyclic codes
- On a generalized quantum swap gate
- Theory behind quantum error correcting codes: an overview
- Sharing classical secrets with Calderbank-Shor-Steane codes
- A quantum error-correction circuit based on cyclic code
- Parallel quantum computation and quantum codes
- Variations on encoding circuits for stabilizer quantum codes
- Stabilizer states and Clifford operations for systems of arbitrary dimensions and modular arithmetic
- Non-binary entanglement-assisted stabilizer codes
- Improved constructions for quantum maximum distance separable codes
- SIMPLE FAULT-TOLERANT ENCODING OVER q-ARY CSS QUANTUM CODES
- Entanglement-assisted Reed-Solomon codes over qudits: theory and architecture
- Quantum MDS and synchronizable codes from cyclic codes of length \(5p^s\) over \(\mathbb{F}_{p^m}\)
- Cyclic quantum error-correcting codes and quantum shift registers
- On certain self-orthogonal AG codes with applications to quantum error-correcting codes
- Secure quantum carriers for quantum state sharing
- On the stabilizer formalism and its generalization
- Nonbinary quantum Goppa codes exceeding the quantum Gilbert-Varshamov bound
- Maximally symmetric stabilizer MUBs in even prime-power dimensions
- scientific article; zbMATH DE number 1504668 (Why is no real title available?)
- Quantum circuit design for accurate simulation of qudit channels
- On subsystem codes beating the quantum Hamming or Singleton bound
- Fault-tolerant quantum computation with non-binary systems
- Construction of quantum MDS codes from generalized Reed–Solomon codes
- [[:Publication:1955881|Efficient quantum circuit for encoding and decoding of the 8,3,5 stabilizer code]]
- Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction
- The application of weight parity error correction in quantum codes
- Three classes of optimal Hermitian dual-containing codes and quantum codes
- Standard form of qudit stabilizer groups
- Efficient quantum circuits for diagonal unitaries without ancillas
- A family of Hermitian dual-containing constacyclic codes and related quantum codes
- Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\)
- Designing quantum circuits for decoding binary linear codes
- A method to reduce resources for quantum error correction
- Efficient one-way quantum computations for quantum error correction
- New quantum MDS code from constacyclic codes
- New quantum MDS codes derived from constacyclic codes
- Covariant mutually unbiased bases
- ON OPTIMAL QUANTUM CODES
This page was built for publication: EFFICIENT QUANTUM CIRCUITS FOR NON-QUBIT QUANTUM ERROR-CORRECTING CODES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696937)
