Structured Error Recovery for Codeword-Stabilized Quantum Codes
arXiv:0912.3245 · doi:10.1103/PhysRevA.81.052337
Abstract
Codeword stabilized (CWS) codes are, in general, non-additive quantum codes that can correct errors by an exhaustive search of different error patterns, similar to the way that we decode classical non-linear 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 paper, we suggest an error grouping technique that allows to simultaneously test large groups of errors in a single measurement. This structured error recovery technique exponentially reduces the number of measurements by about 3^t times. While it still leaves exponentially many measurements for a generic CWS code, the technique is equivalent to syndrome-based recovery for the special case of additive CWS codes.
13 pages, 9 eps figures
References in corpus (16)
- Fault-tolerant quantum computation with high threshold in two dimensions
- Codeword Stabilized Quantum Codes
- Graphs, Quadratic Forms, and Quantum Codes
- Quantum Error Correction on Linear Nearest Neighbor Qubit Arrays
- Nonadditive quantum error-correcting code
- A simple family of nonadditive quantum codes
- Generalized Concatenated Quantum Codes
- On the logical operators of quantum codes
- Codeword stabilized quantum codes: algorithm and structure
- Nonbinary Codeword Stabilized Quantum Codes
- Quantum Goethals-Preparata Codes
- Boolean Functions, Projection Operators and Quantum Error Correcting Codes
- Accuracy threshold for concatenated error detection in one dimension
- Non-Additive Quantum Codes from Goethals and Preparata Codes
- Towards Large-Scale Quantum Computation
- Clustered Error Correction of Codeword-Stabilized Quantum Codes