Corpus ID: 236318204

The Diagonal Distance of CWS Codes

@article{Kapshikar2021TheDD,
  title={The Diagonal Distance of CWS Codes},
  author={Upendra Kapshikar},
  journal={ArXiv},
  year={2021},
  volume={abs/2107.11286}
}
Quantum degeneracy in error correction is a feature unique to quantum error correcting codes unlike their classically counterpart. It allows a quantum error correcting code to correct errors even in cases when they can not uniquely pin point the error. Diagonal distance of a quantum code is an important parameter that characterizes if the quantum code is degenerate or not. If code has distance more than the diagonal distance then it is degenerate whereas if it is below the diagonal distance… Expand

References

SHOWING 1-10 OF 21 REFERENCES
Quantum-error-correcting codes using qudit graph states
Graph states are generalized from qubits to collections of $n$ qudits of arbitrary dimension $D$, and simple graphical methods are used to construct both additive and nonadditive quantum errorExpand
Stabilizer Codes and Quantum Error Correction
TLDR
An overview of the field of quantum error correction and the formalism of stabilizer codes is given and a number of known codes are discussed, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation are discussed. Expand
A Theory of Quantum Error-Correcting Codes
Quantum Error Correction will be necessary for preserving coherent states against noise and other unwanted interactions in quantum computation and communication. We develop a general theory ofExpand
Decoding of Quantum Data-Syndrome Codes via Belief Propagation
TLDR
This paper proposes an efficient decoding algorithm for quantum DS codes with sparse check matrices to handle the quaternary quantum data errors and binary syndrome bit errors and demonstrates this with simulations on a quantum hypergraph-product code. Expand
Fiber bundle codes: breaking the n1/2 polylog(n) barrier for Quantum LDPC codes
TLDR
This is the first quantum LDPC code construction that achieves distance greater than N1/2 polylog(N), based on generalizing the homological product of codes to a fiber bundle. Expand
Refined Belief Propagation Decoding of Sparse-Graph Quantum Codes
  • Kao-Yueh Kuo, C. Lai
  • Computer Science, Physics
  • IEEE Journal on Selected Areas in Information Theory
  • 2020
TLDR
It is shown that running BP with message strength normalization according to a serial schedule (or other schedules) may significantly improve the decoding performance and error floor in computer simulation. Expand
Neural Belief-Propagation Decoders for Quantum Error-Correcting Codes.
TLDR
Inspired by an exact mapping between BP and deep neural networks, neural BP decoders are trained with a loss function tailored to error degeneracy to solve the degeneracy problem which plagues the decoding of quantum low-density parity-check codes. Expand
Approximate Low-Weight Check Codes and Circuit Lower Bounds for Noisy Ground States
TLDR
A much simpler proof of the NLETS theorem is given, and the principal technique is to leverage the Feynman-Kitaev clock construction to approximately embed a subspace of states defined by a circuit as the ground space of a local Hamiltonian. Expand
Codeword Stabilized Quantum Codes
TLDR
A unifying approach to quantum error correcting code design is presented that encompasses additive (stabilizer) codes, as well as all known examples of nonadditive codes with good parameters, and is used to generate new codes with superior parameters to any previously known. Expand
Fault-tolerant quantum computation by anyons
A two-dimensional quantum system with anyonic excitations can be considered as a quantum computer. Unitary transformations can be performed by moving the excitations around each other. MeasurementsExpand
...
1
2
3
...