Error correction schemes for fully correlated quantum channels protecting both quantum and classical information

preprint2020arXivOpen access

Abstract

We study efficient quantum error correction schemes for the fully correlated channel on an nn-qubit system with error operators that assume the form σx⊗nσ_x^{\otimes n}, σy⊗nσ_y^{\otimes n}, σz⊗nσ_z^{\otimes n}. Previous schemes are improved to facilitate implementation. In particular, when nn is odd and equals 2k+12k+1, we describe a quantum error correction scheme using one arbitrary qubit σσ to protect the data state ρρ in a 2k2k-qubit system. The encoding operation σ⊗ρ↦Φ(σ⊗ρ)σ\otimes ρ\mapsto Φ(σ\otimes ρ) only requires 3k3k CNOT gates (each with one control bit and one target bit). After the encoded state Φ(σ⊗ρ)Φ(σ\otimes ρ) goes through the channel, we can apply the inverse operation Φ−1Φ^{-1} to produce σ~⊗ρ\tilde σ\otimes ρ so that a partial trace operation can recover ρρ. When nn is even and equals 2k+22k+2, we describe a hybrid quantum error correction scheme using any one of the two classical bits σ∈{∣ij⟩⟨ij∣:i,j∈{0,1}}σ\in \{|ij\rangle \langle ij|: i, j \in \{0,1\}\} to protect a 2k2k-qubit state ρρ and 2 classical bits. The encoding operation σ⊗ρ↦Φ(σ⊗ρ)σ\otimes ρ\mapsto Φ(σ\otimes ρ) can be done by 3k+23k+2 CNOT gates and a single quibt Hadamard gate. After the encoded state Φ(σ⊗ρ)Φ(σ\otimes ρ) goes through the channel, we can apply the inverse operation Φ−1Φ^{-1} to produce σ⊗ρσ\otimes ρ so that a perfect protection of the two classical bits σσ and the 2k2k-qubit state is achieved. If one uses an arbitrary 22-qubit state σσ, the same scheme will protect 2k2k-qubit states. The scheme was implemented using Matlab, Mathematica, Python, and the IBM's quantum computing framework qiskit.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.