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:quant-ph/0505051 · Physical Review A

Theory of initialization-free decoherence-free subspaces and subsystems

Alireza Shabani, Daniel A. Lidar

Published Oct 3, 2005• 104 citations
arXivHTMLPDF

Abstract

We introduce a generalized theory of decoherence-free subspaces and subsystems (DFSs), which do not require accurate initialization. We derive a set of conditions for the existence of DFSs within this generalized framework. By relaxing the initialization requirement we show that a DFS can tolerate arbitrarily large preparation errors. This has potentially significant implications for experiments involving DFSs, in particular for the experimental implementation, over DFSs, of the large class of quantum algorithms which can function with arbitrary input states.

DOI
10.1103/physreva.72.042303

Related papers

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

Universal Fault-Tolerant Quantum Computation on Decoherence-Free Subspaces

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

A general scheme to perform universal, fault-tolerant quantum computation within decoherence-free subspaces (DFSs) is presented. At most two-qubit interactions are required, and the system remains within the DFS throughout the entire implementation of a quantum gate. We show explicitly how to perform universal computation on clusters of the four-qubit DFS encoding one logical qubit each under spatially symmetric (collective) decoherence. Our results have immediate relevance to quantum computer implementations in which quantum logic is implemented through exchange interactions, such as the recently proposed spin-spin coupled quantum dot arrays and donor-atom arrays.

arXiv:quant-ph/9909058•Physical Review Letters•Aug 21, 2000•388 citations

Decoherence-Free Subspaces for a Quantum Register Interacting with a Spin Environment

Paweł Należyty, Dariusz Chruściński

We study a model of a quantum spin register interacting with an environment of spin particles in quantum-measurement limit. In the limit of collective decoherence we obtain the form of state vectors that constitute high-dimensional decoherence-free subspaces (DFS). In a more general setting we present sufficient and necessary conditions for the existence of low-dimensional DFSs that can be used to construct subspaces of higher dimension.

arXiv:1409.3494•Open Systems & Information Dynamics•Nov 25, 2013•4 citations

Review of Decoherence‐Free Subspaces, Noiseless Subsystems, and Dynamical Decoupling

Daniel A. Lidar

This chapter provides an introduction to the theory of decoherence-free subspaces (DFSs), noiseless subsystems (NSs), and dynamical decoupling (DD) – the key tools for decoherence mitigation strategies. The second and third sections of the chapter discuss decoherence-free subspaces, and define and analyze the collective dephasing model and explain how to combine the corresponding DFS encoding with universal quantum computation. The next section considers the same problem in the context of the more general collective decoherence model. The fifth section analyzes NSs, a key generalization of DFSs. The subsequent section defines DD by analyzing the protection of a single qubit against pure dephasing and against general decoherence. The seventh section discusses DD as a symmetrization procedure; the combining of DD with DFS is discussed in the eighth section. The penultimate section addresses concatenated dynamical decoupling (CDD). In the final section, DD is linked to the representation theory ideas underlying NSs theory.

Advances in chemical physics•Feb 14, 2014•155 citations

Realistic Decoherence Free Subspaces

K. M. Fonseca-Romero, S. G. Mokarzel, Marcelo Terra Cunha +1 more

Decoherence free subspaces (DFS) is a theoretical tool towards experimental implementation of quantum information storage and processing. However, they represent an experimental challenge, since conditions for their existence are very stringent. This work explores the situation in which a system of $N$ oscillators coupled to a bath of harmonic oscillators is close to satisfy the conditions for the existence of DFS. We show, in the Born-Markov limit and for small deviations from separability and degeneracy conditions, that there are {\emph{weak decoherence subspaces}} which resemble the original notion of DFS.

arXiv:quant-ph/0304018•Apr 2, 2003•3 citations

Robustness of operator quantum error correction with respect to initialization errors

Ognyan Oreshkov

In the theory of operator quantum error correction (OQEC), the notion of correctability is defined under the assumption that states are perfectly initialized inside a particular subspace, a factor of which (a subsystem) contains the protected information. If the initial state of the system does not belong entirely to the subspace in question, the restriction of the state to the otherwise correctable subsystem may not remain invariant after the application of noise and error correction. It is known that in the case of decoherence-free subspaces and subsystems (DFSs) the condition for perfect unitary evolution inside the code imposes more restrictive conditions on the noise process if one allows imperfect initialization. It was believed that these conditions are necessary if DFSs are to be able to protect imperfectly encoded states from subsequent errors. By a similar argument, general operator quantum error-correcting (OQEC) codes would also require more restrictive error-correction conditions for the case of imperfect initialization. In this study, we examine this requirement by looking at the errors on the encoded state. In order to quantitatively analyze the errors in an OQEC code, we introduce a measure of the fidelity between the encoded information in two states for the case of subsystem encoding. A major part of the paper concerns the definition of the measure and the derivation of its properties. In contrast to what was previously believed, we obtain that more restrictive conditions are not necessary for either DFSs or for general OQEC codes. This is because the effective noise that can arise inside the code as a result of imperfect initialization is such that it can only increase the fidelity of an imperfectly encoded state with a perfectly encoded one.

arXiv:0709.3533•Physical Review A•Mar 20, 2008•10 citations
We introduce a generalized theory of decoherence-free subspaces and subsystems (DFSs), which do not require accurate initialization. We derive a set of conditions for the existence of DFSs within this generalized framework. By relaxing the initialization requirement we show that a DFS can tolerate arbitrarily large preparation errors. This has potentially significant implications for experiments involving DFSs, in particular for the experimental implementation, over DFSs, of the large class of quantum algorithms which can function with arbitrary input states.
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.
A general scheme to perform universal, fault-tolerant quantum computation within decoherence-free subspaces (DFSs) is presented. At most two-qubit interactions are required, and the system remains within the DFS throughout the entire implementation of a quantum gate. We show explicitly how to perform universal computation on clusters of the four-qubit DFS encoding one logical qubit each under spatially symmetric (collective) decoherence. Our results have immediate relevance to quantum computer implementations in which quantum logic is implemented through exchange interactions, such as the recently proposed spin-spin coupled quantum dot arrays and donor-atom arrays.
This chapter provides an introduction to the theory of decoherence-free subspaces (DFSs), noiseless subsystems (NSs), and dynamical decoupling (DD) – the key tools for decoherence mitigation strategies. The second and third sections of the chapter discuss decoherence-free subspaces, and define and analyze the collective dephasing model and explain how to combine the corresponding DFS encoding with universal quantum computation. The next section considers the same problem in the context of the more general collective decoherence model. The fifth section analyzes NSs, a key generalization of DFSs. The subsequent section defines DD by analyzing the protection of a single qubit against pure dephasing and against general decoherence. The seventh section discusses DD as a symmetrization procedure; the combining of DD with DFS is discussed in the eighth section. The penultimate section addresses concatenated dynamical decoupling (CDD). In the final section, DD is linked to the representation theory ideas underlying NSs theory.
Decoherence free subspaces (DFS) is a theoretical tool towards experimental implementation of quantum information storage and processing. However, they represent an experimental challenge, since conditions for their existence are very stringent. This work explores the situation in which a system of NNN oscillators coupled to a bath of harmonic oscillators is close to satisfy the conditions for the existence of DFS. We show, in the Born-Markov limit and for small deviations from separability and degeneracy conditions, that there are {\emph{weak decoherence subspaces}} which resemble the original notion of DFS.
In the theory of operator quantum error correction (OQEC), the notion of correctability is defined under the assumption that states are perfectly initialized inside a particular subspace, a factor of which (a subsystem) contains the protected information. If the initial state of the system does not belong entirely to the subspace in question, the restriction of the state to the otherwise correctable subsystem may not remain invariant after the application of noise and error correction. It is known that in the case of decoherence-free subspaces and subsystems (DFSs) the condition for perfect unitary evolution inside the code imposes more restrictive conditions on the noise process if one allows imperfect initialization. It was believed that these conditions are necessary if DFSs are to be able to protect imperfectly encoded states from subsequent errors. By a similar argument, general operator quantum error-correcting (OQEC) codes would also require more restrictive error-correction conditions for the case of imperfect initialization. In this study, we examine this requirement by looking at the errors on the encoded state. In order to quantitatively analyze the errors in an OQEC code, we introduce a measure of the fidelity between the encoded information in two states for the case of subsystem encoding. A major part of the paper concerns the definition of the measure and the derivation of its properties. In contrast to what was previously believed, we obtain that more restrictive conditions are not necessary for either DFSs or for general OQEC codes. This is because the effective noise that can arise inside the code as a result of imperfect initialization is such that it can only increase the fidelity of an imperfectly encoded state with a perfectly encoded one.