pith. sign in

arxiv: 1106.5210 · v1 · pith:Q2AV6TTRnew · submitted 2011-06-26 · 🪐 quant-ph

Recursive Encoding and Decoding of Noiseless Subsystem and Decoherence Free Subspace

classification 🪐 quant-ph
keywords qubitsdecoherencefreelogicalnoiselessrecursivesubspacesubsystem
0
0 comments X
read the original abstract

When the environmental disturbace to a quantum system has a wavelength much larger than the system size, all qubits localized within a small area are under action of the same error operators. Noiseless subsystem and decoherence free subspace are known to correct such collective errors. We construct simple quantum circuits, which implement these collective error correction codes, for a small number $n$ of physical qubits. A single logical qubit is encoded with $n=3$ and $n=4$, while two logical qubits are encoded with $n=5$. The recursive relations among the subspaces employed in noiseless subsystem and decoherence free subspace play essential r\^oles in our implementation. The recursive relations also show that the number of gates required to encode $m$ logical qubits increases linearly in $m$.

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.