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/0301032 · Lecture notes in physics

Decoherence-Free Subspaces and Subsystems

Daniel A. Lidar, K. Birgitta Whaley

Published Jan 1, 2003• 362 citations
arXivHTMLPDF
DOI
10.1007/3-540-44874-8_5

Related papers

21aED-12 Implementation of Noiseless Subsystems and Decoherence Free Subspace

幹夫 中原, Chi-Kwong Li, Yiu‐Tung Poon +2 more

日本物理学会講演概要集•Aug 24, 2011•0 citations

Characterization of Decoherence-Free Subsystems

Emanuela Sasso, Veronica Umanità

Reports on Mathematical Physics•Dec 1, 2018•1 citation

Theory of initialization-free decoherence-free subspaces and subsystems

Alireza Shabani, Daniel A. Lidar

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.

arXiv:quant-ph/0505051•Physical Review A•Oct 3, 2005•104 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

Decoherence-free subspaces and incoherently generated coherences

Raisa I. Karasik, Karl-Peter Marzlin, Barry C. Sanders +1 more

Bulletin of the American Physical Society•Mar 13, 2008•0 citations

Using a Numerical Algorithm to Search for Decoherence-Free Sub-systems

Purva Thakre

In this paper, we discuss the need for quantum error correction. We also describe some basic techniques used in quantum error correction which includes decoherence-free subspaces and subsystems. These subspaces and subsystems are described in detail. We also introduce a numerical algorithm that was used previously to search for these decoherence-free subspaces and subsystems under collective error. It is useful to search for them as they can be used to store quantum information. We use this algorithm in some specific examples involving qubits and qutrits. The results of these algorithm are then compared with the error algebra obtained using Young tableaux. We use these results to describe how the specific numerical algorithm can be used for the search of approximate decoherence-free subspaces and subsystems and minimal noise subsystems.

Theory of Computing Systems•Jan 1, 2018•0 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.
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.
In this paper, we discuss the need for quantum error correction. We also describe some basic techniques used in quantum error correction which includes decoherence-free subspaces and subsystems. These subspaces and subsystems are described in detail. We also introduce a numerical algorithm that was used previously to search for these decoherence-free subspaces and subsystems under collective error. It is useful to search for them as they can be used to store quantum information. We use this algorithm in some specific examples involving qubits and qutrits. The results of these algorithm are then compared with the error algebra obtained using Young tableaux. We use these results to describe how the specific numerical algorithm can be used for the search of approximate decoherence-free subspaces and subsystems and minimal noise subsystems.