Efficient Quantum Error Correction for Fully Correlated Noise

Abstract

We investigate an efficient quantum error correction of a fully correlated noise. Suppose the noise is characterized by a quantum channel whose error operators take fully correlated forms given by ${\sigma }_x^{\otimes n}$, ${\sigma }_y^{\otimes n}$ and ${\sigma }_z^{\otimes n}$, where $n>2$ is the number of qubits encoding the codeword. It is proved that (i) $n$ qubits codeword encodes $(n-1)$ data qubits when $n$ is odd and (ii) $n$ qubits codeword implements a noiseless subsystem encoding $(n-2)$ data qubits when $n$ is even. Quantum circuits implementing these schemes are constructed.

11 pages, 2 figures

References in corpus (1)

• Unitary Quantum Error Correction without Error Detection

Cited by in corpus (10)

• Local Pauli stabilizers of symmetric hypergraph states
• Quantum Error Correction with Uniformly Mixed State Ancillae
• Error correction schemes for fully correlated quantum channels protecting both quantum and classical information
• Graph-Theoretic Approach to Quantum Error Correction
• The two-qubit amplitude damping channel: characterization using quantum stabilizer codes
• Recursive encoding and decoding of the noiseless subsystem for qudits
• Private quantum codes: introduction and connection with higher rank numerical ranges
• On the boundary of weighted numerical ranges
• Approximate private quantum channels on fermionic Gaussian systems
• Higher Rank Matricial Ranges and Hybrid Quantum Error Correction