Error Thresholds for Arbitrary Pauli Noise

Abstract

The error threshold of a one-parameter family of quantum channels is defined as the largest noise level such that the quantum capacity of the channel remains positive. This in turn guarantees the existence of a quantum error correction code for noise modeled by that channel. Discretizing the single-qubit errors leads to the important family of Pauli quantum channels; curiously, multipartite entangled states can increase the threshold of these channels beyond the so-called hashing bound, an effect termed superadditivity of coherent information. In this work, we divide the simplex of Pauli channels into one-parameter families and compute numerical lower bounds on their error thresholds. We find substantial increases of error thresholds relative to the hashing bound for large regions in the Pauli simplex corresponding to biased noise, which is a realistic noise model in promising quantum computing architectures. The error thresholds are computed on the family of graph states, a special type of stabilizer state. In order to determine the coherent information of a graph state, we devise an algorithm that exploits the symmetries of the underlying graph, resulting in a substantial computational speed-up. This algorithm uses tools from computational group theory and allows us to consider symmetric graph states on a large number of vertices. Our algorithm works particularly well for repetition codes and concatenated repetition codes (or cat codes), for which our results provide the first comprehensive study of superadditivity for arbitrary Pauli channels. In addition, we identify a novel family of quantum codes based on tree graphs. The error thresholds of these tree graph states outperform repetition and cat codes in large regions of the Pauli simplex, and hence form a new code family with desirable error correction properties.

56 pages, 20 figures; code repositories available at https://github.com/rumschuettel/CoffeeCode and https://github.com/felixled/graph-states-coherent-info

References in corpus (14)

• Multi-party entanglement in graph states
• Demonstration of Entanglement of Electrostatically Coupled Singlet-Triplet Qubits
• Experimental Quantum Computations on a Topologically Encoded Qubit
• Trapped-ion quantum logic gates based on oscillating magnetic fields
• Fault-tolerant quantum computation against biased noise
• Degenerate Quantum Codes for Pauli Channels
• Fault-Tolerant Computing With Biased-Noise Superconducting Qubits
• Unbounded number of channel uses are required to see quantum capacity
• Continuity of quantum channel capacities
• New lower bounds on the non-zero capacity of Pauli Channels
• Spectrum conditions for symmetric extendible states
• Graphical description of the action of Clifford operators on stabilizer states
• Graph state basis for Pauli Channels
• Generating tuples of integers modulo the action of a permutation group and applications

Cited by in corpus (10)

• Positivity and nonadditivity of quantum capacities using generalized erasure channels
• Generic nonadditivity of quantum capacity in simple channels
• Entropic singularities give rise to quantum transmission
• The platypus of the quantum channel zoo
• Exploring super-additivity of coherent information of noisy quantum channels through Genetic algorithms
• Bounding quantum capacities via partial orders and complementarity
• Allowing leakage can increase quantum transmission
• Five Starter Pieces: Quantum Information Science via Semi-definite Programs
• Bounding the quantum capacity with flagged extensions
• The superadditivity effects of quantum capacity decrease with the dimension for qudit depolarizing channels