Structured Error Recovery for Codeword-Stabilized Quantum Codes

  title={Structured Error Recovery for Codeword-Stabilized Quantum Codes},
  author={Yunfan Li and Ilya Dumer and Markus Grassl and Leonid P. Pryadko},
Code-word-stabilized (CWS) codes are, in general, nonadditive quantum codes that can correct errors by an exhaustive search of different error patterns, similar to the way that we decode classical nonlinear codes. For an n-qubit quantum code correcting errors on up to t qubits, this brute-force approach consecutively tests different errors of weight t or less and employs a separate n-qubit measurement in each test. In this article, we suggest an error grouping technique that allows one to… 

Figures from this paper

High Performance Single-Error-Correcting Quantum Codes for Amplitude Damping
These codes are nonadditive and most modestly outperform the best possible additive codes in terms of encoded dimension and are of the codeword stabilized (CWS) type, conceptually simple encoding and decoding circuits are available.
Universal Fault-Tolerant Gates on Concatenated Stabilizer Codes
It is shown how the limits of non-transversality can be overcome by performing rounds of intermediate error-correction to create logical gates on stabilizer codes that use no ancillas other than those required for syndrome measurement.
Non-Pauli observables for CWS codes
Some results are established on the kind of non-Pauli operators that can be used as observables in the decoding scheme of CWS codes and a procedure to obtain those observables is proposed.
Heuristic construction of codeword stabilized codes
It is shown that graphs that give large codes typically yield clique graphs with a large number of nodes, and it is demonstrated that n -node graphs yielding largeClique graphs can be found using a genetic algorithm that uses a crossover operation based on spectral bisection to be superior to more standard crossover operations.
Decoder for Nonbinary CWS Quantum Codes
A decoder for nonbinary CWS quantum codes using the structure of union codes using a union of stabilizer codes to detect a sequence of errors and builds a new code, called union code, that allows to correct the errors.


Stabilizer Codes and Quantum Error Correction
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.
A Note on Non-Additive Quantum Codes
A method to combine two quantum error-correcting codes is presented and the notion of the erasure space is introduced which gives a full characterisation of theErasure-Correcting capabilities of the codes.
Towards Large-Scale Quantum Computation
This thesis deals with a series of quantum computer implementation issues from the Kane 31P in 28Si architecture to Shor’s integer factoring algorithm and beyond, and describes a method of constructing optimal approximations of arbitrary single-qubit fault-tolerant gates.
Theory of Error-correcting Codes
This course expounds the principles of coded modulations for the Gaussian channel and, if time permits, for Rician and Rayleigh fading channels (fully interleaved), and reminds students of the basics of the theory of linear codes for conventional memoryless ergodic channels.
Quantum Goethals-Preparata codes
A family of non-additive quantum codes based on Goethals and Preparata codes with parameters eight times higher than the dimension of the best known additive quantum codes of equal length and minimum distance is presented.
Non-additive quantum codes from Goethals and Preparata codes
The stabilizer formalism is extended to a class of nonadditive quantum codes which are constructed from non-linear classical codes, and an example is presented which is derived from Goethals and Preparata codes.
Quantum Computation and Quantum Information
This chapter discusses quantum information theory, public-key cryptography and the RSA cryptosystem, and the proof of Lieb's theorem.
Algorithms for quantum computation: discrete logarithms and factoring
  • P. Shor
  • Computer Science
    Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored are given.
Entanglement in Graph States and its Applications
This review gives a tutorial introduction into the theory of graph states, and discusses the basic notions and properties of these states, including aspects of non-locality, bi-partite and multi- partite entanglement and its classification in terms of the Schmidt measure.
Graphs, quadratic forms, and quantum codes
It is shown that any stabilizer code over a finite field is equivalent to a graphical quantum code and the technique used in the proof establishes a new connection between quantum codes and quadratic forms.