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:1106.5210 · Physical Review A

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

Chi-Kwong Li, Mikio Nakahara, Yiu‐Tung Poon, Nung-Sing Sze, Hiroyuki Tomita

Published Oct 5, 2011• 13 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.84.044301

Related papers

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•32 citations

Recursive encoding and decoding of the noiseless subsystem for qudits

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

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$.

arXiv:1310.4401•Physical Review A•Apr 2, 2014•2 citations

Universal leakage elimination

Mark Byrd, Daniel A. Lidar, Lian-Ao Wu +1 more

``Leakage'' errors are particularly serious errors which couple states within a code subspace to states outside of that subspace, thus destroying the error protection benefit afforded by an encoded state. We generalize an earlier method for producing leakage elimination decoupling operations and examine the effects of the leakage eliminating operations on decoherence-free or noiseless subsystems which encode one logical, or protected qubit into three or four qubits. We find that by eliminating a large class of leakage errors, under some circumstances, we can create the conditions for a decoherence-free evolution. In other cases we identify a combined decoherence-free and quantum error correcting code which could eliminate errors in solid-state qubits with anisotropic exchange interaction Hamiltonians and enable universal quantum computing with only these interactions.

arXiv:quant-ph/0409049•Physical Review A•May 3, 2005•68 citations

Hybrid noise protection of logical qubits for universal quantum computation

Zhao-Ming Wang, Feng-Hua Ren, Mark Byrd +1 more

Quantum computers now show the promise of surpassing any possible classical machine. However, errors limit this ability and current machines do not have the ability to implement error correcting codes due to the limited number of qubits and limited control. Therefore, dynamical decoupling (DD) and encodings that limit noise with fewer qubits are more promising. For these reasons, we put forth a model of universal quantum computation that has many advantages over strategies that require a large overhead such as the standard quantum-error correcting codes. First, we separate collective noise from individual noises on physical qubits and use a decoherence-free subspace that uses just two qubits for its encoding to eliminate collective noise. Second, our bath model is very general as it uses a spin-boson-type bath but without any Markovian assumption. Third, we are able to either use a steady global magnetic field or to devise a set of DD pulses that remove much of the remaining noise and commute with the logical operations on the encoded qubit. This allows removal of noise while implementing gate operations. Numerical support is given for this hybrid protection strategy which provides an efficient approach to deal with the decoherence problems in quantum computation and is experimentally viable for several current quantum computing systems. This is emphasized by a recent experiment on superconducting qubits which shows promise for increasing the number of gates that can be implemented reliably with some realistic parameter assumptions.

arXiv:2306.15144•Physical Review A•Aug 10, 2023•6 citations

Theory of decoherence-free fault-tolerant universal quantum computation

Julia Kempe, Dave Bacon, Daniel A. Lidar +1 more

Universal quantum computation on decoherence-free subspaces and subsystems (DFSs) is examined with particular emphasis on using only physically relevant interactions. A necessary and sufficient condition for the existence of decoherence-free (noiseless) subsystems in the Markovian regime is derived here for the first time. A stabilizer formalism for DFSs is then developed which allows for the explicit understanding of these in their dual role as quantum error correcting codes. Conditions for the existence of Hamiltonians whose induced evolution always preserves a DFS are derived within this stabilizer formalism. Two possible collective decoherence mechanisms arising from permutation symmetries of the system-bath coupling are examined within this framework. It is shown that in both cases universal quantum computation which always preserves the DFS (natural fault-tolerant computation) can be performed using only two-body interactions. This is in marked contrast to standard error correcting codes, where all known constructions using one- or two-body interactions must leave the code space during the on-time of the fault-tolerant gates. A further consequence of our universality construction is that a single exchange Hamiltonian can be used to perform universal quantum computation on an encoded space whose asymptotic coding efficiency is unity. The exchange Hamiltonian, which is naturally present in many quantum systems, is thus asymptotically universal.

arXiv:quant-ph/0004064•Physical Review A•Mar 20, 2001•534 citations

UNIVERSAL CONTROL OF NOISELESS SUBSYSTEMS FROM SYSTEMS WITH ARBITRARY DIMENSION

C. Allen Bishop

The development of a quantum computer presents one of the greatest challenges in science and engineering to date. The promise of more efficient computing based on entangled quantum states and the superposition principle has led to a worldwide explosion of interest in the fields of quantum information and computation. Among the number of hurdles which must first be cleared before we witness a physical realization are problems associated with environment-induced decoherence and noise more generally. However, the discovery of quantum error correction and the establishment of the accuracy threshold theorem provide us with the hope of someday harnessing the potential power a functioning fault-tolerant quantum information processor has to offer. This dissertation contributes to this effort by investigating a particular class of quantum error correcting codes, namely noiseless subsystem encodings. The passive approach to error correction taken by these encodings provides an efficient means of protection from symmetrically coupled system-environment interactions. Here I will present methods for determining the subsystem-preserving evolutions for noiseless subsystem encodings supported by arbitrary-dimensional physical quantum systems. Implications for universal, collective decoherence-free quantum computation using the derived operations are discussed. Moreover, I will present a proposal for an optical device which is capable of preparing a variety of these noiseless subsystem encodings through a postselection strategy.

•Jan 1, 2012•1 citation
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.
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.
``Leakage'' errors are particularly serious errors which couple states within a code subspace to states outside of that subspace, thus destroying the error protection benefit afforded by an encoded state. We generalize an earlier method for producing leakage elimination decoupling operations and examine the effects of the leakage eliminating operations on decoherence-free or noiseless subsystems which encode one logical, or protected qubit into three or four qubits. We find that by eliminating a large class of leakage errors, under some circumstances, we can create the conditions for a decoherence-free evolution. In other cases we identify a combined decoherence-free and quantum error correcting code which could eliminate errors in solid-state qubits with anisotropic exchange interaction Hamiltonians and enable universal quantum computing with only these interactions.
Quantum computers now show the promise of surpassing any possible classical machine. However, errors limit this ability and current machines do not have the ability to implement error correcting codes due to the limited number of qubits and limited control. Therefore, dynamical decoupling (DD) and encodings that limit noise with fewer qubits are more promising. For these reasons, we put forth a model of universal quantum computation that has many advantages over strategies that require a large overhead such as the standard quantum-error correcting codes. First, we separate collective noise from individual noises on physical qubits and use a decoherence-free subspace that uses just two qubits for its encoding to eliminate collective noise. Second, our bath model is very general as it uses a spin-boson-type bath but without any Markovian assumption. Third, we are able to either use a steady global magnetic field or to devise a set of DD pulses that remove much of the remaining noise and commute with the logical operations on the encoded qubit. This allows removal of noise while implementing gate operations. Numerical support is given for this hybrid protection strategy which provides an efficient approach to deal with the decoherence problems in quantum computation and is experimentally viable for several current quantum computing systems. This is emphasized by a recent experiment on superconducting qubits which shows promise for increasing the number of gates that can be implemented reliably with some realistic parameter assumptions.
Universal quantum computation on decoherence-free subspaces and subsystems (DFSs) is examined with particular emphasis on using only physically relevant interactions. A necessary and sufficient condition for the existence of decoherence-free (noiseless) subsystems in the Markovian regime is derived here for the first time. A stabilizer formalism for DFSs is then developed which allows for the explicit understanding of these in their dual role as quantum error correcting codes. Conditions for the existence of Hamiltonians whose induced evolution always preserves a DFS are derived within this stabilizer formalism. Two possible collective decoherence mechanisms arising from permutation symmetries of the system-bath coupling are examined within this framework. It is shown that in both cases universal quantum computation which always preserves the DFS (natural fault-tolerant computation) can be performed using only two-body interactions. This is in marked contrast to standard error correcting codes, where all known constructions using one- or two-body interactions must leave the code space during the on-time of the fault-tolerant gates. A further consequence of our universality construction is that a single exchange Hamiltonian can be used to perform universal quantum computation on an encoded space whose asymptotic coding efficiency is unity. The exchange Hamiltonian, which is naturally present in many quantum systems, is thus asymptotically universal.
The development of a quantum computer presents one of the greatest challenges in science and engineering to date. The promise of more efficient computing based on entangled quantum states and the superposition principle has led to a worldwide explosion of interest in the fields of quantum information and computation. Among the number of hurdles which must first be cleared before we witness a physical realization are problems associated with environment-induced decoherence and noise more generally. However, the discovery of quantum error correction and the establishment of the accuracy threshold theorem provide us with the hope of someday harnessing the potential power a functioning fault-tolerant quantum information processor has to offer. This dissertation contributes to this effort by investigating a particular class of quantum error correcting codes, namely noiseless subsystem encodings. The passive approach to error correction taken by these encodings provides an efficient means of protection from symmetrically coupled system-environment interactions. Here I will present methods for determining the subsystem-preserving evolutions for noiseless subsystem encodings supported by arbitrary-dimensional physical quantum systems. Implications for universal, collective decoherence-free quantum computation using the derived operations are discussed. Moreover, I will present a proposal for an optical device which is capable of preparing a variety of these noiseless subsystem encodings through a postselection strategy.