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:1802.04904

The Structure of Decoherence-free Subsystems

Ji Guan, Yuan Feng, Mingsheng Ying

Published Feb 14, 2018• 9 citations
arXivHTMLPDF

Abstract

Decoherence-free subsystems have been successfully developed as a tool to preserve fragile quantum information against noises. In this letter, we develop a structure theory for decoherence-free subsystems. Based on it, we present an effective algorithm to construct a set of maximal decoherence-free subsystems in the sense that any other such subsystem is a subspace of one of them. As an application of these techniques in quantum many body systems, we propose a simple and numerically robust method to determine if two irreducible tensors are repeated, a key step in deciding if they are equivalent in generating matrix product states.

DOI
10.48550/arxiv.1802.04904

Related papers

Method to Find Quantum Noiseless Subsystems

Man-Duen Choi, David W. Kribs

We develop a structure theory for decoherence-free subspaces and noiseless subsystems that applies to arbitrary (not necessarily unital) quantum operations. The theory can be alternatively phrased in terms of the superoperator perspective, or the algebraic noise commutant formalism. As an application, we propose a method for finding all such subspaces and subsystems for arbitrary quantum operations. We suggest that this work brings the fundamental passive technique for error correction in quantum computing an important step closer to practical realization.

arXiv:quant-ph/0507213•Physical Review Letters•Feb 6, 2006•63 citations

Symmetry and Liouville Space Formulation of Decoherence-Free Subsystems

So, Mi-Jung, Mahn‐Soo Choi

We propose a generic and systematic decoherence-free scheme to encode quantum information into an open quantum system based focusing on symmetry. Under a given symmetry, the Liouville space is decomposed into invariant subspaces characterized by a tensor-product structure. A decoherence-free subsystem is then identified as a factor of the tensor product. Unlike decoherence-free subspaces, which typically require strong symmetries, decoherence-free systems are permitted under less restrictive weak symmetries. Specifically, we primarily concern the permutation symmetry in conjunction with the unitary symmetry and utilize the Schur-Weyl duality, which facilitates numerous efficient and systematic calculations based on the well-established group representation theory. Employing the isomorphism between the Liouville space and the fictitious Hilbert space, we construct a super-Schur basis, which block-diagonalizes the super-operators that describe the noisy quantum channels, both in the Kraus representation and in terms of the quantum master equation. Each block reveals the tensor-product structure and facilitates the identification of physically relevant decoherence-free subsystems under the specified weak symmetry.

arXiv:2507.15506•Jul 21, 2025•1 citation

Control of qubits encoded in decoherence-free subspaces

Paola Cappellaro, J. S. Hodges, Timothy F. Havel +1 more

Decoherence-free subspaces protect quantum information from the effects of noise that is correlated across the physical qubits used to implement them. Given the ability to impose suitable Hamiltonians upon such a multi-qubit system, one can also implement a set of logical gates which enables universal computation on this information without compromising this protection. Real physical systems, however, seldom come with the correct Hamiltonians built-in, let alone the ability to turn them off and on at will. In the course of our development of quantum information processing devices based on liquid-state NMR, we have found the task of operating on quantum information encoded in decoherence-free subspaces rather more challenging than is commonly assumed. This contribution presents an overview of these challenges and the methods we have developed for overcoming them in practice. These methods promise to be broadly applicable to many of the physical systems proposed for the implementation of quantum information processing devices.

Laser Physics•Apr 1, 2007•5 citations

Structure of uniformly continuous quantum Markov semigroups

Julien Deschamps, Franco Fagnola, Emanuela Sasso +1 more

The structure of uniformly continuous quantum Markov semigroups with atomic decoherence-free subalgebra is established providing a natural decomposition of a Markovian open quantum system into its noiseless (decoherence-free) and irreducible (ergodic) components. This leads to a new characterization of the structure of invariant states and a new method for finding decoherence-free subsystems and subspaces. Examples are presented to illustrate these results.

arXiv:1412.3239•Reviews in Mathematical Physics•Feb 1, 2016•47 citations

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

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
Decoherence-free subsystems have been successfully developed as a tool to preserve fragile quantum information against noises. In this letter, we develop a structure theory for decoherence-free subsystems. Based on it, we present an effective algorithm to construct a set of maximal decoherence-free subsystems in the sense that any other such subsystem is a subspace of one of them. As an application of these techniques in quantum many body systems, we propose a simple and numerically robust method to determine if two irreducible tensors are repeated, a key step in deciding if they are equivalent in generating matrix product states.
We develop a structure theory for decoherence-free subspaces and noiseless subsystems that applies to arbitrary (not necessarily unital) quantum operations. The theory can be alternatively phrased in terms of the superoperator perspective, or the algebraic noise commutant formalism. As an application, we propose a method for finding all such subspaces and subsystems for arbitrary quantum operations. We suggest that this work brings the fundamental passive technique for error correction in quantum computing an important step closer to practical realization.
We propose a generic and systematic decoherence-free scheme to encode quantum information into an open quantum system based focusing on symmetry. Under a given symmetry, the Liouville space is decomposed into invariant subspaces characterized by a tensor-product structure. A decoherence-free subsystem is then identified as a factor of the tensor product. Unlike decoherence-free subspaces, which typically require strong symmetries, decoherence-free systems are permitted under less restrictive weak symmetries. Specifically, we primarily concern the permutation symmetry in conjunction with the unitary symmetry and utilize the Schur-Weyl duality, which facilitates numerous efficient and systematic calculations based on the well-established group representation theory. Employing the isomorphism between the Liouville space and the fictitious Hilbert space, we construct a super-Schur basis, which block-diagonalizes the super-operators that describe the noisy quantum channels, both in the Kraus representation and in terms of the quantum master equation. Each block reveals the tensor-product structure and facilitates the identification of physically relevant decoherence-free subsystems under the specified weak symmetry.
Decoherence-free subspaces protect quantum information from the effects of noise that is correlated across the physical qubits used to implement them. Given the ability to impose suitable Hamiltonians upon such a multi-qubit system, one can also implement a set of logical gates which enables universal computation on this information without compromising this protection. Real physical systems, however, seldom come with the correct Hamiltonians built-in, let alone the ability to turn them off and on at will. In the course of our development of quantum information processing devices based on liquid-state NMR, we have found the task of operating on quantum information encoded in decoherence-free subspaces rather more challenging than is commonly assumed. This contribution presents an overview of these challenges and the methods we have developed for overcoming them in practice. These methods promise to be broadly applicable to many of the physical systems proposed for the implementation of quantum information processing devices.
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.
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.