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:1405.0611 · Advances in Applied Clifford Algebras

An Approach by Representation of Algebras for Decoherence-Free Subspaces

Marco A. S. Trindade, Eric Pinto, J. D. M. Vianna

Published Nov 12, 2015• 1 citation
arXivHTMLPDF
DOI
10.1007/s00006-015-0623-0

Related papers

Algebraic Method in the Analysis of Decoherence-Free Subspaces in Open Quantum Systems

Takeo Kamizawa

International Journal of Theoretical Physics•Jan 3, 2018•3 citations

Concatenating Decoherence-Free Subspaces with Quantum Error Correcting Codes

Daniel A. Lidar, Dave Bacon, K. Birgitta Whaley

An operator sum representation is derived for a decoherence-free subspace (DFS) and used to (i) show that DFS's are the class of quantum error correcting codes (QECC's) with fixed, unitary recovery operators and (ii) find explicit representations for the Kraus operators of collective decoherence. We demonstrate how this can be used to construct a concatenated DFS-QECC code which protects against collective decoherence perturbed by independent decoherence. The code yields an error threshold which depends only on the perturbing independent decoherence rate.

arXiv:quant-ph/9809081•Physical Review Letters•May 31, 1999•278 citations

Decoherence-free algebras in quantum dynamics

Daniele Amato, Paolo Facchi A, Arturo Konderak

arXiv:2403.12926•Letters in Mathematical Physics•Jun 10, 2026•7 citations

Numerical method for finding decoherence-free subspaces and its applications

Xiaoting Wang, Mark Byrd, Kurt A. Jacobs

In this work, inspired by the study of semidefinite programming for block-diagonalizing matrix *-algebras, we propose an algorithm that can find the algebraic structure of decoherence-free subspaces (DFS's) for a given noisy quantum channel. We prove that this algorithm will work for all cases with probability 1, and it is more efficient than the algorithm proposed by J. A. Holbrook, D. W. Kribs, and R. Laflamme, [Quantum. Inf. Proc. 80, 381 (2003)]. In fact, our results reveal that this previous algorithm only works for special cases. As an application, we discuss how this method can be applied to increase the efficiency of an optimization procedure for finding an approximate DFS.

arXiv:1212.3839•Physical Review A•Jan 31, 2013•19 citations

Decoherence-Free Subspaces and Subsystems

Daniel A. Lidar, K. Birgitta Whaley

arXiv:quant-ph/0301032•Lecture notes in physics•Jan 1, 2003•362 citations

Control-Induced Decoherence-Free Manifolds

EDMOND A. JONCKHEERE, Alireza Shabani, A. T. Rezakhani

Quantum coherence of open quantum systems is usually compromised because of the interaction with the ambient environment. A "decoherence-free subspace" (DFS) of the system Hilbert space is defined where the evolution remains unitary. In the absence of a priori existence of such subspaces, it seems natural that utilizing quantum control may help generate and/or retain a DFS. Here, we introduce a time-varying DFS wherein the system's density matrix has a unitarily evolving sub-density corresponding to some given set of its eigenvalues (which we aim to preserve). This subspace is characterized from both topological and algebraic perspectives. In particular, we show that this DFS admits a complex vector bundle structure over a real-analytic manifold (the decoherence-free manifold).

arXiv:1002.1515•Feb 8, 2010•1 citation
An operator sum representation is derived for a decoherence-free subspace (DFS) and used to (i) show that DFS's are the class of quantum error correcting codes (QECC's) with fixed, unitary recovery operators and (ii) find explicit representations for the Kraus operators of collective decoherence. We demonstrate how this can be used to construct a concatenated DFS-QECC code which protects against collective decoherence perturbed by independent decoherence. The code yields an error threshold which depends only on the perturbing independent decoherence rate.
In this work, inspired by the study of semidefinite programming for block-diagonalizing matrix *-algebras, we propose an algorithm that can find the algebraic structure of decoherence-free subspaces (DFS's) for a given noisy quantum channel. We prove that this algorithm will work for all cases with probability 1, and it is more efficient than the algorithm proposed by J. A. Holbrook, D. W. Kribs, and R. Laflamme, [Quantum. Inf. Proc. 80, 381 (2003)]. In fact, our results reveal that this previous algorithm only works for special cases. As an application, we discuss how this method can be applied to increase the efficiency of an optimization procedure for finding an approximate DFS.
Quantum coherence of open quantum systems is usually compromised because of the interaction with the ambient environment. A "decoherence-free subspace" (DFS) of the system Hilbert space is defined where the evolution remains unitary. In the absence of a priori existence of such subspaces, it seems natural that utilizing quantum control may help generate and/or retain a DFS. Here, we introduce a time-varying DFS wherein the system's density matrix has a unitarily evolving sub-density corresponding to some given set of its eigenvalues (which we aim to preserve). This subspace is characterized from both topological and algebraic perspectives. In particular, we show that this DFS admits a complex vector bundle structure over a real-analytic manifold (the decoherence-free manifold).