We introduce a convergent iterative algorithm for finding the optimal coding and decoding operations for an arbitrary noisy quantum channel. This algorithm does not require any error syndrome to be corrected completely, and hence also finds codes outside the usual Knill-Laflamme definition of error correcting codes. The iteration is shown to improve the figure of merit "channel fidelity" in every step.
We introduce a convergent iterative algorithm for finding the optimal coding and decoding operations for an arbitrary noisy quantum channel. This algorithm does not require any error syndrome to be corrected completely, and hence also finds codes outside the usual Knill-Laflamme definition of error correcting codes. The iteration is shown to improve the figure of merit "channel fidelity" in every step.
The Knill-Laflamme conditions distinguish exact quantum error correction codes, and they have played a critical role in the discovery of state-of-the-art codes. However, the family of exact codes is a very restrictive one and does not necessarily contain the best-performing codes. Therefore, it is desirable to develop a generalized and quantitative performance metric. In this Letter, we derive the near-optimal channel fidelity, a concise and optimization-free metric for arbitrary codes and noise. The metric provides a narrow two-sided bound to the optimal code performance, and it can be evaluated with exactly the same input required by the Knill-Laflamme conditions. We demonstrate the numerical advantage of the near-optimal channel fidelity through multiple qubit code and oscillator code examples. Compared to conventional optimization-based approaches, the reduced computational cost enables us to simulate systems with previously inaccessible sizes, such as oscillators encoding hundreds of average excitations. Moreover, we analytically derive the near-optimal performance for the thermodynamic code and the Gottesman-Kitaev-Preskill code. In particular, the Gottesman-Kitaev-Preskill code's performance under excitation loss improves monotonically with its energy and converges to an asymptotic limit at infinite energy, which is distinct from other oscillator codes.
Introduction This chapter concerns quantum coding schemes based on iterative decoding. So far, most of the focus of this book has been on quantum error-correcting codes (QECCs) that use a relatively small number of qubits, and concatenation thereof. The decoding strategy adopted for these codes consists of identifying the lowest-weight error that is consistent with the syndrome and reversing its effect. The lowest-weight error associated with each syndrome can, in the worst case, be found by exhaustive search and stored in a look-up table for future reference. Each time a syndrome is measured, the appropriate recovery can be rapidly extracted from the table to complete the error-correction cycle. In contrast, the codes described in this chapter use a very large number of qubits; the larger the better! For a fixed rate r = k / n , the performance of the codes improves as n increases. For such large codes however, more clever decoding schemes are required. For a code with parameters [[ n, k, d ]], the size of the look-up table – i.e. the number of distinct syndromes – is 2 n−k = 2(1− r ) n . Thus, look-up tables are only suitable for codes of a few dozen qubits. For larger codes, the decoding process involves a highly nontrivial computation that needs to be executed “on the fly,” so fast and reliable algorithms are needed. Iterative decoding is one such algorithm and it has produced some of the best coding schemes – in particular turbo-codes and sparse codes – widely used in classical wireless communication.
We derive necessary and sufficient conditions for the approximate correctability of a quantum code, generalizing the Knill-Laflamme conditions for exact error correction. Our measure of success of the recovery operation is the worst-case entanglement fidelity. We show that the optimal recovery fidelity can be predicted exactly from a dual optimization problem on the environment causing the noise. We use this result to obtain an estimate of the optimal recovery fidelity as well as a way of constructing a class of near-optimal recovery channels that work within twice the minimal error. In addition to standard subspace codes, our results hold for subsystem codes and hybrid quantum-classical codes.
Quantum error correction (QEC) is an essential concept for any quantum information processing device. Typically, QEC is designed with minimal assumptions about the noise process; this generic assumption exacts a high cost in efficiency and performance. In physical systems, errors are not likely to be arbitrary; rather we will have reasonable models for the structure of quantum decoherence. We may choose quantum error correcting codes and recovery operations that specifically target the most likely errors. We present a convex optimization method to determine the optimal (in terms of average entanglement fidelity) recovery operation for a given channel, encoding, and information source. This is solvable via a semidefinite program (SDP). We present computational algorithms to generate near-optimal recovery operations structured to begin with a projective syndrome measurement. These structured operations are more computationally scalable than the SDP required for computing the optimal; we can thus numerically analyze longer codes. Using Lagrange duality, we bound the performance of the structured recovery operations and show that they are nearly optimal in many relevant cases. We present two classes of channel-adapted quantum error correcting codes specifically designed for the amplitude damping channel. These have significantly higher rates with shorter block lengths than corresponding generic quantum error correcting codes. Both classes are stabilizer codes, and have good fidelity performance with stabilizer recovery operations. The encoding, syndrome measurement, and syndrome recovery operations can all be implemented with Clifford group operations.
We address the problem of decoding sparse quantum error correction codes. For Pauli channels, this task can be accomplished by a version of the belief propagation algorithm used for decoding sparse classical codes. Quantum codes pose two new challenges however. Firstly, their Tanner graph unavoidably contain small loops which typically undermines the performance of belief propagation. Secondly, sparse quantum codes are by definition highly degenerate. The standard belief propagation algorithm does not exploit this feature, but rather it is impaired by it. We propose heuristic methods to improve belief propagation decoding, specifically targeted at these two problems. While our results exhibit a clear improvement due to the proposed heuristic methods, they also indicate that the main source of errors in the quantum coding scheme remains in the decoding.
We address the problem of decoding sparse quantum error correction codes. For Pauli channels, this task can be accomplished by a version of the belief propagation algorithm used for decoding sparse classical codes. Quantum codes pose two new challenges however. Firstly, their Tanner graph unavoidably contain small loops which typically undermines the performance of belief propagation. Secondly, sparse quantum codes are by definition highly degenerate. The standard belief propagation algorithm does not exploit this feature, but rather it is impaired by it. We propose heuristic methods to improve belief propagation decoding, specifically targeted at these two problems. While our results exhibit a clear improvement due to the proposed heuristic methods, they also indicate that the main source of errors in the quantum coding scheme remains in the decoding.