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

Symmetry-Protected Topological Phases for Robust Quantum Computation

Sam Roberts

Published Feb 28, 2019• 1 citation
OpenAlex

Abstract

In recent years, topological phases of matter have presented exciting new avenues to achieve scalable quantum computation. In this thesis, we investigate a class of quantum many-body spin models known as symmetry-protected topological (SPT) phases for use in quantum information processing and storage. We explore the fault-tolerant properties of SPT phases, and how they can be utilized in the design of a quantum computer. Of central importance in this thesis is the concept of quantum error-correction, which in addition to its importance in fault-tolerant quantum computation, is used to characterise the stability of topological phases at finite temperature. We begin with an introduction to quantum computation, quantum error correction, and topological phases of matter. We then focus on the fundamental question of whether symmetry-protected topological phases of matter can exist in thermal equilibrium; we prove that systems protected by global onsite symmetries cannot be ordered at nonzero temperature. Subsequently, we show that certain three-dimensional models with generalised higher-form symmetries can be thermally SPT ordered, and we relate this order to the ability to perform fault-tolerant measurement-based quantum computation. Following this, we assess feasibility of these phases as quantum memories, motivated by the fact that SPT phases in three dimensions can possess protected topological degrees of freedom on their boundary. We find that certain SPT ordered systems can be self-correcting, allowing quantum information to be stored for arbitrarily long times without requiring active error correction. Finally, we develop a framework to construct new schemes of fault-tolerant measurement-based quantum computation. As a notable example, we develop a cluster-state scheme that simulates the braiding and fusion of surface-code defects, offering novel alternative methods to achieve fault-tolerant universal quantum computation.

Related papers

Symmetry-protected topological order at nonzero temperature

Sam Roberts, Beni Yoshida, Aleksander Kubica +1 more

We address the question of whether symmetry-protected topological (SPT) order can persist at nonzero temperature, with a focus on understanding the thermal stability of several models studied in the theory of quantum computation. We present three results in this direction. First, we prove that nontrivial SPT order protected by a global onsite symmetry cannot persist at nonzero temperature, demonstrating that several quantum computational structures protected by such onsite symmetries are not thermally stable. Second, we prove that the three-dimensional (3D) cluster-state model used in the formulation of topological measurement-based quantum computation possesses a nontrivial SPT-ordered thermal phase when protected by a generalized (1-form) symmetry. The SPT order in this model is detected by long-range localizable entanglement in the thermal state, which compares with related results characterizing SPT order at zero temperature in spin chains using localizable entanglement as an order parameter. Our third result is to demonstrate that the high-error tolerance of this 3D cluster-state model for quantum computation, even without a protecting symmetry, can be understood as an application of quantum error correction to effectively enforce a 1-form symmetry.

arXiv:1611.05450•Physical Review A•Aug 7, 2017•68 citations

Computational power of one-dimensional symmetry-protected topological phases

David T. Stephen

We consider ground states of quantum spin chains with symmetry-protected topological (SPT) order as resources for measurement-based quantum computation (MBQC). Using tensor network methods, we show that SPT phases protected by a finite abelian on-site symmetry group exhibit uniform computational power. That is, any state from a given phase leads to the same Lie group of executable gates when used as a resource for MBQC. This Lie group is determined by the same algebraic information that labels the SPT phase itself, and we give a necessary condition on the phase that guarantees a full set of single-qubit gates. To obtain our results, we construct several new techniques in MBQC and refine the structure of quantum states with abelian SPT order. Our results are analogous to similar results relating topological order and topological quantum computation, and we comments on their implications on the general connection between quantum phases of matter and quantum computation.

•Jan 1, 2017•3 citations

Subsystem symmetries, quantum cellular automata, and computational phases of quantum matter

David T. Stephen, Hendrik Poulsen Nautrup, Juani Bermejo-Vega +2 more

Quantum phases of matter are resources for notions of quantum computation. In this work, we establish a new link between concepts of quantum information theory and condensed matter physics by presenting a unified understanding of symmetry-protected topological (SPT) order protected by subsystem symmetries and its relation to measurement-based quantum computation (MBQC). The key unifying ingredient is the concept of quantum cellular automata (QCA) which we use to define subsystem symmetries acting on rigid lower-dimensional lines or fractals on a 2D lattice. Notably, both types of symmetries are treated equivalently in our framework. We show that states within a non-trivial SPT phase protected by these symmetries are indicated by the presence of the same QCA in a tensor network representation of the state, thereby characterizing the structure of entanglement that is uniformly present throughout these phases. By also formulating schemes of MBQC based on these QCA, we are able to prove that most of the phases we construct are computationally universal phases of matter, in which every state is a resource for universal MBQC. Interestingly, our approach allows us to construct computational phases which have practical advantages over previous examples, including a computational speedup. The significance of the approach stems from constructing novel computationally universal phases of matter and showcasing the power of tensor networks and quantum information theory in classifying subsystem SPT order.

arXiv:1806.08780•Quantum•May 20, 2019•82 citations

Subsystem symmetries, quantum cellular automata, and computational phases of quantum matter

Stephen, D., Nautrup, H., Bermejo-Vega, J. +2 more

Quantum phases of matter are resources for notions of quantum computation. In this work, we establish a new link between concepts of quantum information theory and condensed matter physics by presenting a unified understanding of symmetry-protected topological (SPT) order protected by subsystem symmetries and its relation to measurement-based quantum computation (MBQC). The key unifying ingredient is the concept of quantum cellular automata (QCA) which we use to define subsystem symmetries acting on rigid lower-dimensional lines or fractals on a 2D lattice. Notably, both types of symmetries are treated equivalently in our framework. We show that states within a non-trivial SPT phase protected by these symmetries are indicated by the presence of the same QCA in a tensor network representation of the state, thereby characterizing the structure of entanglement that is uniformly present throughout these phases. By also formulating schemes of MBQC based on these QCA, we are able to prove that most of the phases we construct are computationally universal phases of matter, in which every state is a resource for universal MBQC. Interestingly, our approach allows us to construct computational phases which have practical advantages over previous examples, including a computational speedup. The significance of the approach stems from constructing novel computationally universal phases of matter and showcasing the power of tensor networks and quantum information theory in classifying subsystem SPT order.

•May 20, 2019•75 citations

Topological magic response in quantum spin chains

Ritu Nehra, Poetri Sonya Tarabunga, Martina Frau +3 more

Topological matter provides natural platforms for robust, non-local information storage, central to quantum error correction. Yet, while the relation between entanglement and topology is well established, little is known about the role of nonstabilizerness (or magic), a pivotal concept in fault-tolerant quantum computation, in topological phases. We introduce the concept of topological magic response, the ability of a state to spread over stabilizer space when perturbed by finite-depth non-Clifford circuits. Unlike a topological invariant or order parameter, this response function probes how a phase reacts to non-Clifford perturbations, revealing the presence of non-local quantum correlations. In Ising-type spin chains, we show that symmetry-broken and paramagnetic phases lack such a response, whereas symmetry-protected topological (SPT) phases always display it. To capture this, we utilize a combination of stabilizer Rényi entropies that, in analogy with topological entanglement entropy, isolates non-locally stored information. Using exact analytic computations and matrix product states simulations based on an algorithmic technique we introduce, we show that SPT phases doped with $T$ gates support robust topological magic response, while trivial phases remain featureless.

quant-pharXiv:2512.16673•Dec 19, 2025•0 citations

Symmetry-protected topological phases in one-dimensional systems

Frank Pollmann

Abstract Classifying and understanding phases of matter is an important task in condensed matter physics. The class of ‘conventional’ symmetry-broken phases is well understood in terms of Landau’s theory. A paradigmatic example is the Z2-symmetric Ising model with symmetric (paramagnetic) and symmetry-broken (ferromagnet) phases, which can be distinguished by measuring the magnetization as a local order parameter. Topological phases of matter, however, are less understood and no complete classification is known. These lecture notes discuss schemes that provide an understanding and characterization of certain topological phases of matter in models with local Hamiltonians. The main focus is on symmetry-protected topological (SPT) phases in one-dimensional bosonic systems. On the basis of the entanglement properties of such systems, a motivation is given for the matrix product state (MPS) representation of ground states. Using the MPS framework, it is demonstrated how SPT phases can be classified using projective representations of the symmetries.

•Jan 26, 2017•46 citations
In recent years, topological phases of matter have presented exciting new avenues to achieve scalable quantum computation. In this thesis, we investigate a class of quantum many-body spin models known as symmetry-protected topological (SPT) phases for use in quantum information processing and storage. We explore the fault-tolerant properties of SPT phases, and how they can be utilized in the design of a quantum computer. Of central importance in this thesis is the concept of quantum error-correction, which in addition to its importance in fault-tolerant quantum computation, is used to characterise the stability of topological phases at finite temperature. We begin with an introduction to quantum computation, quantum error correction, and topological phases of matter. We then focus on the fundamental question of whether symmetry-protected topological phases of matter can exist in thermal equilibrium; we prove that systems protected by global onsite symmetries cannot be ordered at nonzero temperature. Subsequently, we show that certain three-dimensional models with generalised higher-form symmetries can be thermally SPT ordered, and we relate this order to the ability to perform fault-tolerant measurement-based quantum computation. Following this, we assess feasibility of these phases as quantum memories, motivated by the fact that SPT phases in three dimensions can possess protected topological degrees of freedom on their boundary. We find that certain SPT ordered systems can be self-correcting, allowing quantum information to be stored for arbitrarily long times without requiring active error correction. Finally, we develop a framework to construct new schemes of fault-tolerant measurement-based quantum computation. As a notable example, we develop a cluster-state scheme that simulates the braiding and fusion of surface-code defects, offering novel alternative methods to achieve fault-tolerant universal quantum computation.
We address the question of whether symmetry-protected topological (SPT) order can persist at nonzero temperature, with a focus on understanding the thermal stability of several models studied in the theory of quantum computation. We present three results in this direction. First, we prove that nontrivial SPT order protected by a global onsite symmetry cannot persist at nonzero temperature, demonstrating that several quantum computational structures protected by such onsite symmetries are not thermally stable. Second, we prove that the three-dimensional (3D) cluster-state model used in the formulation of topological measurement-based quantum computation possesses a nontrivial SPT-ordered thermal phase when protected by a generalized (1-form) symmetry. The SPT order in this model is detected by long-range localizable entanglement in the thermal state, which compares with related results characterizing SPT order at zero temperature in spin chains using localizable entanglement as an order parameter. Our third result is to demonstrate that the high-error tolerance of this 3D cluster-state model for quantum computation, even without a protecting symmetry, can be understood as an application of quantum error correction to effectively enforce a 1-form symmetry.
We consider ground states of quantum spin chains with symmetry-protected topological (SPT) order as resources for measurement-based quantum computation (MBQC). Using tensor network methods, we show that SPT phases protected by a finite abelian on-site symmetry group exhibit uniform computational power. That is, any state from a given phase leads to the same Lie group of executable gates when used as a resource for MBQC. This Lie group is determined by the same algebraic information that labels the SPT phase itself, and we give a necessary condition on the phase that guarantees a full set of single-qubit gates. To obtain our results, we construct several new techniques in MBQC and refine the structure of quantum states with abelian SPT order. Our results are analogous to similar results relating topological order and topological quantum computation, and we comments on their implications on the general connection between quantum phases of matter and quantum computation.
Quantum phases of matter are resources for notions of quantum computation. In this work, we establish a new link between concepts of quantum information theory and condensed matter physics by presenting a unified understanding of symmetry-protected topological (SPT) order protected by subsystem symmetries and its relation to measurement-based quantum computation (MBQC). The key unifying ingredient is the concept of quantum cellular automata (QCA) which we use to define subsystem symmetries acting on rigid lower-dimensional lines or fractals on a 2D lattice. Notably, both types of symmetries are treated equivalently in our framework. We show that states within a non-trivial SPT phase protected by these symmetries are indicated by the presence of the same QCA in a tensor network representation of the state, thereby characterizing the structure of entanglement that is uniformly present throughout these phases. By also formulating schemes of MBQC based on these QCA, we are able to prove that most of the phases we construct are computationally universal phases of matter, in which every state is a resource for universal MBQC. Interestingly, our approach allows us to construct computational phases which have practical advantages over previous examples, including a computational speedup. The significance of the approach stems from constructing novel computationally universal phases of matter and showcasing the power of tensor networks and quantum information theory in classifying subsystem SPT order.
Quantum phases of matter are resources for notions of quantum computation. In this work, we establish a new link between concepts of quantum information theory and condensed matter physics by presenting a unified understanding of symmetry-protected topological (SPT) order protected by subsystem symmetries and its relation to measurement-based quantum computation (MBQC). The key unifying ingredient is the concept of quantum cellular automata (QCA) which we use to define subsystem symmetries acting on rigid lower-dimensional lines or fractals on a 2D lattice. Notably, both types of symmetries are treated equivalently in our framework. We show that states within a non-trivial SPT phase protected by these symmetries are indicated by the presence of the same QCA in a tensor network representation of the state, thereby characterizing the structure of entanglement that is uniformly present throughout these phases. By also formulating schemes of MBQC based on these QCA, we are able to prove that most of the phases we construct are computationally universal phases of matter, in which every state is a resource for universal MBQC. Interestingly, our approach allows us to construct computational phases which have practical advantages over previous examples, including a computational speedup. The significance of the approach stems from constructing novel computationally universal phases of matter and showcasing the power of tensor networks and quantum information theory in classifying subsystem SPT order.
Topological matter provides natural platforms for robust, non-local information storage, central to quantum error correction. Yet, while the relation between entanglement and topology is well established, little is known about the role of nonstabilizerness (or magic), a pivotal concept in fault-tolerant quantum computation, in topological phases. We introduce the concept of topological magic response, the ability of a state to spread over stabilizer space when perturbed by finite-depth non-Clifford circuits. Unlike a topological invariant or order parameter, this response function probes how a phase reacts to non-Clifford perturbations, revealing the presence of non-local quantum correlations. In Ising-type spin chains, we show that symmetry-broken and paramagnetic phases lack such a response, whereas symmetry-protected topological (SPT) phases always display it. To capture this, we utilize a combination of stabilizer Rényi entropies that, in analogy with topological entanglement entropy, isolates non-locally stored information. Using exact analytic computations and matrix product states simulations based on an algorithmic technique we introduce, we show that SPT phases doped with TTT gates support robust topological magic response, while trivial phases remain featureless.
Abstract Classifying and understanding phases of matter is an important task in condensed matter physics. The class of ‘conventional’ symmetry-broken phases is well understood in terms of Landau’s theory. A paradigmatic example is the Z2-symmetric Ising model with symmetric (paramagnetic) and symmetry-broken (ferromagnet) phases, which can be distinguished by measuring the magnetization as a local order parameter. Topological phases of matter, however, are less understood and no complete classification is known. These lecture notes discuss schemes that provide an understanding and characterization of certain topological phases of matter in models with local Hamiltonians. The main focus is on symmetry-protected topological (SPT) phases in one-dimensional bosonic systems. On the basis of the entanglement properties of such systems, a motivation is given for the matrix product state (MPS) representation of ground states. Using the MPS framework, it is demonstrated how SPT phases can be classified using projective representations of the symmetries.