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

PRX Quantum

Measurement-Based Quantum Computation in Symmetry-Enriched Topological Phases

Paul Herringer, Vir B. Bulchandani, Younes Javanmard, David T. Stephen, Robert Raussendorf

Published Aug 13, 2025• 2 citations
Publisher

Abstract

We present the first examples of topological phases of matter with uniform power for measurement-based quantum computation (MBQC). This is possible due to a new framework for analyzing the computational properties of phases of matter that is more general than previous constructions, which have been limited to short-range entangled phases in one dimension. We show that ground states of the toric code in an anisotropic magnetic field yield a natural, albeit noncomputationally universal, application of our framework. We then present a new model with topological order the ground states of which are universal resources for MBQC. Both topological models are enriched by subsystem symmetries and these symmetries protect their computational power. Our framework greatly expands the range of physical models that can be analyzed from the computational perspective.

DOI
10.1103/j2z3-s6d6

Related papers

Duality between string and computational order in symmetry-enriched topological phases

Paul Herringer, Vir B. Bulchandani, Younes Javanmard +2 more

We present the first examples of topological phases of matter with uniform power for measurement-based quantum computation. This is possible thanks to a new framework for analyzing the computational properties of phases of matter that is more general than previous constructions, which were limited to short-range entangled phases in one dimension. We show that ground states of the toric code in an anisotropic magnetic field yield a natural, albeit non-computationally-universal, application of our framework. We then present a new model with topological order whose ground states are universal resources for MBQC. Both topological models are enriched by subsystem symmetries, and these symmetries protect their computational power. Our framework greatly expands the range of physical models that can be analyzed from the computational perspective.

arXiv:2410.02716•Oct 3, 2024•0 citations

Computational Power of Symmetry-Protected Topological Phases

David T. Stephen, Dongsheng Wang, Abhishodh Prakash +2 more

We consider ground states of quantum spin chains with symmetry-protected topological (SPT) order as resources for measurement-based quantum computation (MBQC). We show that, for a wide range of SPT phases, the computational power of ground states is uniform throughout each phase. This computational power, defined as the Lie group of executable gates in MBQC, is determined by the same algebraic information that labels the SPT phase itself. We prove that these Lie groups always contain a full set of single-qubit gates, thereby affirming the long-standing conjecture that general SPT phases can serve as computationally useful phases of matter.

arXiv:1611.08053•Physical Review Letters•Jul 5, 2017•86 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

Symmetry protected measurement-based quantum computation in finite spin chains

Arnab Adhikary

We consider ground states of quantum spin chains with symmetry-protected topological (SPT) order and their usefulness as resources for measurement-based quantum computation (MBQC). It is known that SPT phases (applicable to infinite spin chains) protected by a finite abelian symmetry group exhibit uniform computational power. In this work, we extend these ideas to finite spin chains which are more realistic resources for physical computation. Herein, we relate the usefulness of MBQC resource states to a non-vanishing string-order parameter. Furthermore, using the techniques developed, we show that hard-to-think-about regimes of computation are actually more efficient than the textbook prescription. Our results strengthen the connection between condensed matter and quantum computation and also provide the necessary tools to explore such connections in the state-of-the-art noisy small quantum devices. As an outlook, we discuss how this newly developed formalism can potentially be used to identify non-traditional resource states for MBQC and be extended to higher dimensions, leading to universal quantum computation.

•Jan 1, 2021•0 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

Testing measurement-based computational phases of quantum matter on a quantum processor

Ryohei Weil, Dmytro Bondarenko, Arnab Adhikary +1 more

Many symmetry protected or symmetry enriched phases of quantum matter have the property that every ground state in a given such phase endows measurement based quantum computation with the same computational power. Such phases are called computational phases of quantum matter. Here, we experimentally verify four theoretical predictions for them on an IBM superconducting quantum device. We comprehensively investigate how symmetric imperfections of the resource states translate into logical decoherence, and how this decoherence is mitigated. In particular, the central experiment probes the scaling law from which the uniformity of computational power follows. We also analyze the correlated regime, where local measurements give rise to logical operations collectively. We test the prediction that densest packing of a measurement-based algorithms remains the most efficient, in spite of the correlations. Our experiments corroborate the operational stability of measurement based quantum computation in quantum phases of matter with symmetry.

quant-pharXiv:2601.03426•Jan 8, 2026•0 citations
We present the first examples of topological phases of matter with uniform power for measurement-based quantum computation (MBQC). This is possible due to a new framework for analyzing the computational properties of phases of matter that is more general than previous constructions, which have been limited to short-range entangled phases in one dimension. We show that ground states of the toric code in an anisotropic magnetic field yield a natural, albeit noncomputationally universal, application of our framework. We then present a new model with topological order the ground states of which are universal resources for MBQC. Both topological models are enriched by subsystem symmetries and these symmetries protect their computational power. Our framework greatly expands the range of physical models that can be analyzed from the computational perspective.
We present the first examples of topological phases of matter with uniform power for measurement-based quantum computation. This is possible thanks to a new framework for analyzing the computational properties of phases of matter that is more general than previous constructions, which were limited to short-range entangled phases in one dimension. We show that ground states of the toric code in an anisotropic magnetic field yield a natural, albeit non-computationally-universal, application of our framework. We then present a new model with topological order whose ground states are universal resources for MBQC. Both topological models are enriched by subsystem symmetries, and these symmetries protect their computational power. Our framework greatly expands the range of physical models that can be analyzed from the computational perspective.
We consider ground states of quantum spin chains with symmetry-protected topological (SPT) order as resources for measurement-based quantum computation (MBQC). We show that, for a wide range of SPT phases, the computational power of ground states is uniform throughout each phase. This computational power, defined as the Lie group of executable gates in MBQC, is determined by the same algebraic information that labels the SPT phase itself. We prove that these Lie groups always contain a full set of single-qubit gates, thereby affirming the long-standing conjecture that general SPT phases can serve as computationally useful phases of matter.
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.
We consider ground states of quantum spin chains with symmetry-protected topological (SPT) order and their usefulness as resources for measurement-based quantum computation (MBQC). It is known that SPT phases (applicable to infinite spin chains) protected by a finite abelian symmetry group exhibit uniform computational power. In this work, we extend these ideas to finite spin chains which are more realistic resources for physical computation. Herein, we relate the usefulness of MBQC resource states to a non-vanishing string-order parameter. Furthermore, using the techniques developed, we show that hard-to-think-about regimes of computation are actually more efficient than the textbook prescription. Our results strengthen the connection between condensed matter and quantum computation and also provide the necessary tools to explore such connections in the state-of-the-art noisy small quantum devices. As an outlook, we discuss how this newly developed formalism can potentially be used to identify non-traditional resource states for MBQC and be extended to higher dimensions, leading to universal 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.
Many symmetry protected or symmetry enriched phases of quantum matter have the property that every ground state in a given such phase endows measurement based quantum computation with the same computational power. Such phases are called computational phases of quantum matter. Here, we experimentally verify four theoretical predictions for them on an IBM superconducting quantum device. We comprehensively investigate how symmetric imperfections of the resource states translate into logical decoherence, and how this decoherence is mitigated. In particular, the central experiment probes the scaling law from which the uniformity of computational power follows. We also analyze the correlated regime, where local measurements give rise to logical operations collectively. We test the prediction that densest packing of a measurement-based algorithms remains the most efficient, in spite of the correlations. Our experiments corroborate the operational stability of measurement based quantum computation in quantum phases of matter with symmetry.