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/0203008

Stabilization of Quantum Information: A Unified Dynamical-Algebraic Approach

Paolo Zanardi

Published Mar 4, 2002• 6 citations
arXivHTMLPDF

Abstract

The notion of symmetry is shown to be at the heart of all error correction/avoidance strategies for preserving quantum coherence of an open quantum system S e.g., a quantum computer. The existence of a non-trivial group of symmetries of the dynamical algebra of S provides state-space sectors immune to decoherence. Such noiseless sectors, that can be viewed as a noncommutative version of the pointer basis, are shown to support universal quantum computation and to be robust against perturbations. When the required symmetry is not present one can generate it artificially resorting to active symmetrization procedures.

DOI
10.48550/arxiv.quant-ph/0203008

Related papers

Stabilizing quantum information

Paolo Zanardi

The dynamical-algebraic structure underlying all the schemes for quantum information stabilization is argued to be fully contained in the reducibility of the operator algebra describing the interaction with the environment of the coding quantum system. This property amounts to the existence of a nontrivial group of symmetries for the global dynamics. We provide a unified framework that allows us to build systematically additional classes of error correcting codes and noiseless subsystems. It is shown that by using symmetrization strategies one can artificially produce noiseless subsystems supporting universal quantum computation.

arXiv:quant-ph/9910016•Physical Review A•Dec 5, 2000•212 citations

Computation on an error-avoiding quantum code and symmetrization

Paolo Zanardi

Let $\mathcal{H}$ be the state space of a quantum computer coupled with the environment by a set of error operators spanning a Lie algebra $\mathcal{L}.$ Suppose $\mathcal{L}$ admits an error-avoiding quantum code, i.e., a subspace $\mathcal{C}\ensuremath{\subset}\mathcal{H}$ annihilated by $\mathcal{L}.$ We show that a universal set of gates over $\mathcal{C}$ is obtained by any generic pair of $\mathcal{L}$-invariant gates. Such gates---if not available from the outset---can be obtained by resorting to a symmetrization with respect to the group generated by $\mathcal{L}.$ Any computation can then be performed completely within the coding decoherence-free subspace.

arXiv:quant-ph/9901047•Physical Review A•Aug 1, 1999•44 citations

Decoherence, Control, and Symmetry in Quantum Computers

Dave Bacon

In this thesis we describe methods for avoiding the detrimental effects of decoherence while at the same time still allowing for computation of the quantum information. The philosophy of the method discussed in the first part of this thesis is to use a symmetry of the decoherence mechanism to find robust encodings of the quantum information. Stability, control, and methods for using decoherence-free information in a quantum computer are presented with a specific emphasis on decoherence due to a collective coupling between the system and its environment. Universal quantum computation on such collective decoherence decoherence-free encodings is demonstrated. Rigorous definitions of control and the use of encoded universality in quantum computers are addressed. Explicit gate constructions for encoded universality on ion trap and exchange based quantum computers are given. In the second part of the thesis we examine physical systems with error correcting properties. We examine systems that can store quantum information in their ground state such that decoherence processes are prohibited via energetics. We present the theory of supercoherent systems whose ground states are quantum error detecting codes and describe a spin ladder whose ground state has both the error detecting and correcting properties. We conclude by discussing naturally fault-tolerant quantum computation.

arXiv:quant-ph/0305025•May 5, 2003•55 citations

Generalized noiseless quantum codes utilizing quantum enveloping algebras

Micho Ðurđevich, Hanna Makaruk, Robert Owczarek

A generalization of the results of Rasetti and Zanardi concerning avoiding errors in quantum computers by using states preserved by evolution is presented. The concept of dynamical symmetry is generalized from the level of classical Lie algebras and groups, to the level of a dynamical symmetry based on quantum Lie algebras and quantum groups (in the sense of Woronowicz). An intrinsic dependence of the concept of dynamical symmetry on the differential calculus (which holds also in the classical case) is stressed. A natural connection between quantum states invariant under a quantum group action, and quantum states preserved by the dynamical evolution, is discussed.

arXiv:quant-ph/0003134•Journal of Physics A Mathematical and General•Feb 9, 2001•9 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•548 citations

A Possible Strategy to Defeat Decoherence in Quantum Computation: The Role of Symmetries, Dynamical Algebras, and All That

Mario Rasetti, Paolo Zanardi

The question is addressed whether in the frame of Error Avoiding Codes one can devise strategies whereby a universal set of gates can be constructed allowing for arbitrary quantum computation [in its full extent, from input system preparation, through computation implementation, to output measurement] to be completely performed within the code.

Fortschritte der Physik•May 1, 2000•5 citations
The notion of symmetry is shown to be at the heart of all error correction/avoidance strategies for preserving quantum coherence of an open quantum system S e.g., a quantum computer. The existence of a non-trivial group of symmetries of the dynamical algebra of S provides state-space sectors immune to decoherence. Such noiseless sectors, that can be viewed as a noncommutative version of the pointer basis, are shown to support universal quantum computation and to be robust against perturbations. When the required symmetry is not present one can generate it artificially resorting to active symmetrization procedures.
The dynamical-algebraic structure underlying all the schemes for quantum information stabilization is argued to be fully contained in the reducibility of the operator algebra describing the interaction with the environment of the coding quantum system. This property amounts to the existence of a nontrivial group of symmetries for the global dynamics. We provide a unified framework that allows us to build systematically additional classes of error correcting codes and noiseless subsystems. It is shown that by using symmetrization strategies one can artificially produce noiseless subsystems supporting universal quantum computation.
Let H\mathcal{H}H be the state space of a quantum computer coupled with the environment by a set of error operators spanning a Lie algebra L.\mathcal{L}.L. Suppose L\mathcal{L}L admits an error-avoiding quantum code, i.e., a subspace $\mathcal{C}\ensuremath{\subset}\mathcal{H}$ annihilated by L.\mathcal{L}.L. We show that a universal set of gates over C\mathcal{C}C is obtained by any generic pair of L\mathcal{L}L-invariant gates. Such gates---if not available from the outset---can be obtained by resorting to a symmetrization with respect to the group generated by L.\mathcal{L}.L. Any computation can then be performed completely within the coding decoherence-free subspace.
In this thesis we describe methods for avoiding the detrimental effects of decoherence while at the same time still allowing for computation of the quantum information. The philosophy of the method discussed in the first part of this thesis is to use a symmetry of the decoherence mechanism to find robust encodings of the quantum information. Stability, control, and methods for using decoherence-free information in a quantum computer are presented with a specific emphasis on decoherence due to a collective coupling between the system and its environment. Universal quantum computation on such collective decoherence decoherence-free encodings is demonstrated. Rigorous definitions of control and the use of encoded universality in quantum computers are addressed. Explicit gate constructions for encoded universality on ion trap and exchange based quantum computers are given. In the second part of the thesis we examine physical systems with error correcting properties. We examine systems that can store quantum information in their ground state such that decoherence processes are prohibited via energetics. We present the theory of supercoherent systems whose ground states are quantum error detecting codes and describe a spin ladder whose ground state has both the error detecting and correcting properties. We conclude by discussing naturally fault-tolerant quantum computation.
A generalization of the results of Rasetti and Zanardi concerning avoiding errors in quantum computers by using states preserved by evolution is presented. The concept of dynamical symmetry is generalized from the level of classical Lie algebras and groups, to the level of a dynamical symmetry based on quantum Lie algebras and quantum groups (in the sense of Woronowicz). An intrinsic dependence of the concept of dynamical symmetry on the differential calculus (which holds also in the classical case) is stressed. A natural connection between quantum states invariant under a quantum group action, and quantum states preserved by the dynamical evolution, is discussed.
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.