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

Springer eBooks

Stabilization of Quantum Information: A Unified Dynamical-Algebraic Approach

Paolo Zanardi

Published Jan 1, 2001• 2 citations
Publisher
DOI
10.1007/978-1-4615-1245-5_35

Related papers

Dynamics of quantum information

Robert J. Lewis-Swan, Arghavan Safavi-Naini, A. M. Kaufman +1 more

arXiv:1908.11747•Nature Reviews Physics•Aug 28, 2019•126 citations

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

Dynamical Control of Quantum Information Processing

Gershon Kurizki, Abraham G. Kofman

Cambridge University Press eBooks•Dec 23, 2021•0 citations

Stabilization of Quantum Information: A Unified Dynamical-Algebraic Approach

Paolo Zanardi

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.

arXiv:quant-ph/0203008•Mar 4, 2002•6 citations

Universally Certifying Partially Self-Correcting Quantum Memories in 3D Translation-Invariant Stabilizer Codes

Chong-Yuan Xu, Yong Xu

Achieving passive protection of quantum information at finite temperature is a central problem at the intersection of quantum information and quantum many-body physics. Yet a general, computable criterion for determining self-correcting behavior directly from the form of local interactions remains elusive. Here we develop a unified algebraic-geometric framework for certifying partial self-correction in three-dimensional translation-invariant local stabilizer codes, encompassing the cubic code as a special case. From the algebraic curves defined by the codes' defining polynomials, we construct valuation matrices on the boundaries of their normalized projective closures and derive a computable rank criterion. Together with a polynomial-time decoder, this criterion guarantees super-Arrhenius memory lifetimes for code families satisfying it under the specified local Davies dynamics. We apply the framework to certify several classes of partially self-correcting quantum memories, including nearest-neighbor models with stabilizer weight as low as six and long memory lifetimes at modest system sizes. These results establish an algebraic-geometric connection between local stabilizer structure and the recoverability of quantum information at finite temperature, providing a systematic approach to certifying and designing passive quantum memories.

arXiv:2611.06469•Nov 4, 2026•0 citations

Quantum state reconstruction and stabilization

Paolo Tombesi, David Vitali

•Jan 1, 2003•0 citations
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.
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.
Achieving passive protection of quantum information at finite temperature is a central problem at the intersection of quantum information and quantum many-body physics. Yet a general, computable criterion for determining self-correcting behavior directly from the form of local interactions remains elusive. Here we develop a unified algebraic-geometric framework for certifying partial self-correction in three-dimensional translation-invariant local stabilizer codes, encompassing the cubic code as a special case. From the algebraic curves defined by the codes' defining polynomials, we construct valuation matrices on the boundaries of their normalized projective closures and derive a computable rank criterion. Together with a polynomial-time decoder, this criterion guarantees super-Arrhenius memory lifetimes for code families satisfying it under the specified local Davies dynamics. We apply the framework to certify several classes of partially self-correcting quantum memories, including nearest-neighbor models with stabilizer weight as low as six and long memory lifetimes at modest system sizes. These results establish an algebraic-geometric connection between local stabilizer structure and the recoverability of quantum information at finite temperature, providing a systematic approach to certifying and designing passive quantum memories.