Error thresholds for arbitrary Pauli noise
From MaRDI portal
computational group theoryerror thresholdsgroup actionsquantum channel capacitiesquantum error correctionquantum information theory
Group actions on combinatorial structures (05E18) White noise theory (60H40) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum channels, fidelity (81P47) Quantum computation (81P68) Quantum coding (general) (81P70) Computational stability and error-correcting codes for quantum computation and communication processing (81P73) Error probability in coding theory (94B70)
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.
Recommendations
Cites work
- A Decoupling Approach to the Quantum Capacity
- A Mathematical Theory of Communication
- Applied finite group actions.
- Completely positive maps and entropy inequalities
- Continuity of quantum channel capacities
- Engineering an efficient canonical labeling tool for large and sparse graphs
- Error Correcting Codes in Quantum Theory
- Generation modulo the action of a permutation group
- Graph theory
- Graphical description of Pauli measurements on stabilizer states
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 5360947 (Why is no real title available?)
- scientific article; zbMATH DE number 1849958 (Why is no real title available?)
- Improved one-way rates for BB84 and 6-state protocols
- McKay's canonical graph labeling algorithm
- Minimal and canonical images
- Mixed-state entanglement and quantum error correction
- Multiparty entanglement in graph states
- Practical graph isomorphism. II.
- Proof of unconditional security of six-state quantum key distribution scheme
- Quantum computations on a topologically encoded qubit
- Quantum cryptography: public key distribution and coin tossing
- Solving the quantum many-body problem with artificial neural networks
- The capacity of a quantum channel for simultaneous transmission of classical and quantum information
- The Private Classical Capacity and Quantum Capacity of a Quantum Channel
Cited in
(6)- scientific article; zbMATH DE number 5320399 (Why is no real title available?)
- scientific article; zbMATH DE number 2103532 (Why is no real title available?)
- Pauli error estimation via population recovery
- Low-ground/high-ground capacity regions analysis for bosonic Gaussian channels
- Calibrated hypergraph states. I: Calibrated hypergraph and multi qudit state monads
- Calibrated hypergraph states. II: Calibrated hypergraph state construction and applications
This page was built for publication: Error thresholds for arbitrary Pauli noise
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4957914)
