Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1310.4401 · Physical Review A

Recursive encoding and decoding of the noiseless subsystem for qudits

Utkan Güngördü, Chi-Kwong Li, Mikio Nakahara, Yiu‐Tung Poon, Nung-Sing Sze

Published Apr 2, 2014• 2 citations
arXivHTMLPDF

Abstract

We give a full explanation of the noiseless subsystem that protects a single qubit against collective errors and the corresponding recursive scheme described by C.-K. Li et al. [Phys. Rev. A 84, 044301 (2011)] from a representation theory point of view. Furthermore, we extend the construction to qudits under the influence of collective SU($d$) errors. We find that under this recursive scheme, the asymptotic encoding rate is $1/d$.

DOI
10.1103/physreva.89.042301

Related papers

RECURSIVE CONSTRUCTION OF NOISELESS SUBSYSTEM FOR QUDITS

Utkan Güngördü, Chi-Kwong Li, Mikio Nakahara +2 more

When the environmental noise acting on the system has certain symmetries, a subsystem of the total system can avoid errors. Encoding information into such a subsystem is advantageous since it does not require any error syndrome measurements, which may introduce further errors to the system. However, utilizing such a subsystem for large systems gets impractical with the increasing number of qudits. A recursive scheme offers a solution to this problem. Here, we review the recursive construct introduced in, which can asymptotically protect 1 /d of the qudits in system against collective errors.

•Apr 1, 2014•1 citation

Recursive encoding and decoding of the noiseless subsystem and decoherence-free subspace

Chi-Kwong Li, Mikio Nakahara, Yiu‐Tung Poon +2 more

When an environmental disturbance to a quantum system has a wavelength much larger than the system size, all qubits in the system are under the action of the same error operator. The noiseless subsystem and decoherence-free subspace are immune to such collective noise. We construct simple quantum circuits that implement these error-avoiding codes for a small number $n$ of physical qubits. A single logical qubit is encoded with $n=3$ and 4, while two and three logical qubits are encoded with $n=5$ and 7, respectively. Recursive relations among subspaces employed in these codes play essential roles in our implementation.

arXiv:1106.5210•Physical Review A•Oct 5, 2011•15 citations

Three-qubit quantum error-correction scheme for collective decoherence

Chui‐Ping Yang, Julio R. Gea-Banacloche

We show a way to correct collective error through a three-qubit quantum code. The encoding and decoding (i.e., error recovery) operations for such a code, which protects one qubit of quantum information perfectly (with infinite ``distance'') against collective decoherence, are presented. The code is actually a manifestation of a noiseless subsystem first reported by Knill, Laflamme, and Viola [Phys. Rev. Lett. 84, 2525 (2000)], and provides a good illustration of the relationship between noiseless subsystems and error-correcting codes already noted by these authors. We also show in detail how this code can be used to preserve an arbitrary joint state (including entangled states) of two qubits, by pairing each of them with two other qubits, even in the case in which the two resulting clusters interact in nonequivalent ways with a common environment.

Physical Review A•Jan 18, 2001•31 citations

Exploring noiseless subsystems via nuclear magnetic resonance

Evan M. Fortunato, Lorenza Viola, Marco A. Pravia +4 more

Noiseless subsystems offer a general and efficient method for protecting quantum information in the presence of noise that has symmetry properties. A paradigmatic class of error models displaying nontrivial symmetries emerges under collective noise behavior, which implies a permutationally invariant interaction between the system and the environment. We expand our previous investigation of the noiseless subsystem idea [L. Viola et al., Science 293, 2059 (2001)] by reporting and analyzing NMR experiments that demonstrate the preservation of a qubit encoded in a three-qubit noiseless subsystem for general collective noise. A complete set of input states is used to determine the superoperator for the implemented one-qubit process and to confirm that the fidelity of entanglement is improved for a large, noncommutative set of engineered errors. To date, this is the largest set of error operators that has been successfully corrected for by any quantum code.

arXiv:quant-ph/0210057•Physical Review A•Jun 19, 2003•38 citations

Compatible transformations for a qudit decoherence-free/noiseless encoding

C Allen Bishop, Mark S Byrd

The interest in decoherence-free, or noiseless subsystems (DFS/NSs) of quantum systems is both of fundamental and practical interest. Understanding the invariance of a set of states under certain transformations is mutually associated with a better understanding of some fundamental aspects of quantum mechanics as well as the practical utility of invariant subsystems. For example, DFS/NSs are potentially useful for protecting quantum information in quantum cryptography and quantum computing as well as enabling universal computation. Here we discuss transformations which are compatible with a DFS/NS that is composed of d-state systems which protect against collective noise. They are compatible in the sense that they do not take the logical (encoded) states outside of the DFS/NS during the transformation. Furthermore, it is shown that the Hamiltonian evolutions derived here can be used to perform universal quantum computation on a three qudit DFS/NS. Many of the methods used in our derivations are directly applicable to a large variety of DFS/NSs. More generally, we may also state that these transformations are compatible with collective motions.

arXiv:0807.4194•Journal of Physics A Mathematical and Theoretical•Jan 6, 2009•11 citations

A recursive construction of noiseless subsystem for qudits

Utkan G ung ord u, Chi-Kwong Li, Mikio Nakahara +2 more

Bulletin of the American Physical Society•Mar 4, 2014•0 citations
We give a full explanation of the noiseless subsystem that protects a single qubit against collective errors and the corresponding recursive scheme described by C.-K. Li et al. [Phys. Rev. A 84, 044301 (2011)] from a representation theory point of view. Furthermore, we extend the construction to qudits under the influence of collective SU(ddd) errors. We find that under this recursive scheme, the asymptotic encoding rate is 1/d1/d1/d.
When the environmental noise acting on the system has certain symmetries, a subsystem of the total system can avoid errors. Encoding information into such a subsystem is advantageous since it does not require any error syndrome measurements, which may introduce further errors to the system. However, utilizing such a subsystem for large systems gets impractical with the increasing number of qudits. A recursive scheme offers a solution to this problem. Here, we review the recursive construct introduced in, which can asymptotically protect 1 /d of the qudits in system against collective errors.
When an environmental disturbance to a quantum system has a wavelength much larger than the system size, all qubits in the system are under the action of the same error operator. The noiseless subsystem and decoherence-free subspace are immune to such collective noise. We construct simple quantum circuits that implement these error-avoiding codes for a small number nnn of physical qubits. A single logical qubit is encoded with n=3n=3n=3 and 4, while two and three logical qubits are encoded with n=5n=5n=5 and 7, respectively. Recursive relations among subspaces employed in these codes play essential roles in our implementation.
We show a way to correct collective error through a three-qubit quantum code. The encoding and decoding (i.e., error recovery) operations for such a code, which protects one qubit of quantum information perfectly (with infinite ``distance'') against collective decoherence, are presented. The code is actually a manifestation of a noiseless subsystem first reported by Knill, Laflamme, and Viola [Phys. Rev. Lett. 84, 2525 (2000)], and provides a good illustration of the relationship between noiseless subsystems and error-correcting codes already noted by these authors. We also show in detail how this code can be used to preserve an arbitrary joint state (including entangled states) of two qubits, by pairing each of them with two other qubits, even in the case in which the two resulting clusters interact in nonequivalent ways with a common environment.
Noiseless subsystems offer a general and efficient method for protecting quantum information in the presence of noise that has symmetry properties. A paradigmatic class of error models displaying nontrivial symmetries emerges under collective noise behavior, which implies a permutationally invariant interaction between the system and the environment. We expand our previous investigation of the noiseless subsystem idea [L. Viola et al., Science 293, 2059 (2001)] by reporting and analyzing NMR experiments that demonstrate the preservation of a qubit encoded in a three-qubit noiseless subsystem for general collective noise. A complete set of input states is used to determine the superoperator for the implemented one-qubit process and to confirm that the fidelity of entanglement is improved for a large, noncommutative set of engineered errors. To date, this is the largest set of error operators that has been successfully corrected for by any quantum code.
The interest in decoherence-free, or noiseless subsystems (DFS/NSs) of quantum systems is both of fundamental and practical interest. Understanding the invariance of a set of states under certain transformations is mutually associated with a better understanding of some fundamental aspects of quantum mechanics as well as the practical utility of invariant subsystems. For example, DFS/NSs are potentially useful for protecting quantum information in quantum cryptography and quantum computing as well as enabling universal computation. Here we discuss transformations which are compatible with a DFS/NS that is composed of d-state systems which protect against collective noise. They are compatible in the sense that they do not take the logical (encoded) states outside of the DFS/NS during the transformation. Furthermore, it is shown that the Hamiltonian evolutions derived here can be used to perform universal quantum computation on a three qudit DFS/NS. Many of the methods used in our derivations are directly applicable to a large variety of DFS/NSs. More generally, we may also state that these transformations are compatible with collective motions.