Error Thresholds for Arbitrary Pauli Noise

10/01/2019
by   Johannes Bausch, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/22/2018

Quantum Codes from Neural Networks

We report on the usefulness of using neural networks as a variational st...
research
01/11/2018

Construction and Performance of Quantum Burst Error Correction Codes for Correlated Errors

In practical communication and computation systems, errors occur predomi...
research
11/17/2022

An efficient combination of quantum error correction and authentication

When sending quantum information over a channel, we want to ensure that ...
research
10/16/2021

Quantum Error Correction with Reflexive Stabilizer Codes and Cayley Graphs

Long distance communication of digital data, whether through a physical ...
research
03/04/2023

Quantum Steganography via Coherent and Fock State Encoding in an Optical Medium

Steganography is an alternative to cryptography, where information is pr...
research
07/14/2022

Quantifying the performance of approximate teleportation and quantum error correction via symmetric two-PPT-extendibility

The ideal realization of quantum teleportation relies on having access t...
research
11/13/2021

Finite Rate QLDPC-GKP Coding Scheme that Surpasses the CSS Hamming Bound

Quantum error correction has recently been shown to benefit greatly from...

Please sign up or login with your details

Forgot password? Click here to reset