Efficient Quantum Error Correction for Fully Correlated Noise
classification
🪐 quant-ph
keywords
qubitsquantumcodewordcorrelatederrorfullynoiseotimes
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.