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:1907.13279 · Quantum

Computational universality of symmetry-protected topologically ordered cluster phases on 2D Archimedean lattices

Austin K. Daniel, Rafael N. Alexander, Akimasa Miyake

Published Feb 10, 2020• 46 citations
arXivHTMLPDF

Abstract

What kinds of symmetry-protected topologically ordered (SPTO) ground states can be used for universal measurement-based quantum computation in a similar fashion to the 2D cluster state? 2D SPTO states are classified not only by global on-site symmetries but also by subsystem symmetries, which are fine-grained symmetries dependent on the lattice geometry. Recently, all states within so-called SPTO cluster phases on the square and hexagonal lattices have been shown to be universal, based on the presence of subsystem symmetries and associated structures of quantum cellular automata. Motivated by this observation, we analyze the computational capability of SPTO cluster phases on all vertex-translative 2D Archimedean lattices. There are four subsystem symmetries here called ribbon, cone, fractal, and 1-form symmetries, and the former three are fundamentally in one-to-one correspondence with three classes of Clifford quantum cellular automata. We conclude that nine out of the eleven Archimedean lattices support universal cluster phases protected by one of the former three symmetries, while the remaining lattices possess 1-form symmetries and have a different capability related to error correction.

DOI
10.22331/q-2020-02-10-228

Related papers

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

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

Latent Computational Complexity of Symmetry-Protected Topological Order with Fractional Symmetry

Jacob Miller, Akimasa Miyake

An emerging insight is that ground states of symmetry-protected topological orders (SPTOs) possess latent computational complexity in terms of their many-body entanglement. By introducing a fractional symmetry of SPTO, which requires the invariance under 3-colorable symmetries of a lattice, we prove that every renormalization fixed-point state of 2D (Z_{2})^{m} SPTO with fractional symmetry can be utilized for universal quantum computation using only Pauli measurements, as long as it belongs to a nontrivial 2D SPTO phase. Our infinite family of fixed-point states may serve as a base model to demonstrate the idea of a "quantum computational phase" of matter, whose states share universal computational complexity ubiquitously.

arXiv:1612.08135•Physical Review Letters•Apr 26, 2018•30 citations

Universal quantum computation using fractal symmetry-protected cluster phases

Trithep Devakul, Dominic J. Williamson

We show that two-dimensional fractal subsystem symmetry-protected topological phases may serve as resources for universal measurement-based quantum computation. This is demonstrated explicitly for two cluster models known to lie within fractal symmetry-protected topological phases, and computational universality is shown to persist throughout those phases. One of the models considered is simply the cluster model on the honeycomb lattice in one limit. We discuss the importance of rigid subsystem symmetries, as opposed to global or $(D\ensuremath{-}1)$-form symmetries, in this context.

arXiv:1806.04663•Physical Review A•Aug 30, 2018•76 citations

Measurement-Based Quantum Computation and Symmetry-Protected Topological Order

Jacob Miller

While quantum computers can achieve dramatic speedups over the classical computers familiar to us, identifying the origin of this quantum advantage in physical systems remains a major goal of quantum information science. A useful tool here is measurement-based quantum computation (MQC), a computational framework utilizing the quantum entanglement found in many-body resource states. Not all resource states are useful for quantum computation however, so an important question is what properties of many-body entanglement characterize universal resource states, which can implement any quantum computation. Many-body states are also studied in condensed matter physics, where the collective behavior of quantum many-body systems sometimes define topological phases of matter. These phases are defined by nonlocal many-body entanglement, making topologically-ordered states natural candidates for MQC. We might wonder if these topological phases could be organized as phases of quantum computation, so that every state within the phase is universal for MQC. While phases of symmetry-protected topological order (SPTO) have arisen as natural candidates, previous attempts to demonstrate an MQC-SPTO correspondence were mostly limited to nonuniversal 1D spin chains, leaving the important 2D setting wide open. In this dissertation, we explore the wide and varied connections between MQC and SPTO, and obtain new results for 1D and 2D systems. After identifying a new MQC-SPTO correspondence within 1D spin chains, we move up and explore the operational use of 2D states with two complementary forms of SPTO. We create a new Union Jack resource state, whose different form of SPTO than previous 2D resource states permits a hierarchical notion of MQC universality. This state leads us to consider an idealized model of 2D SPTO, where we show that an additional symmetry condition makes these model states form universal resources for MQC only when they have nontrivial SPTO. We finally study the intrinsic complexity of SPTO-inspired states for classically intractable sampling, and identify inherent advantages of MQC for this purpose. Our work highlights the rich complexity available in states of entangled quantum matter, providing new evidence which sharpens our understanding of the diverse connections between MQC and SPTO.

•Jan 1, 2017•0 citations

Hierarchy of universal entanglement in 2D measurement-based quantum computation

Jacob Miller, Akimasa Miyake

Abstract Measurement-based quantum computation (MQC) is a paradigm for studying quantum computation using many-body entanglement and single-qubit measurements. Although MQC has inspired wide-ranging discoveries throughout quantum information, our understanding of the general principles underlying MQC seems to be biased by its historical reliance upon the archetypal 2D cluster state. Here we utilise recent advances in the subject of symmetry-protected topological order (SPTO) to introduce a novel MQC resource state, whose physical and computational behaviour differs fundamentally from that of the cluster state. We show that, in sharp contrast to the cluster state, our state enables universal quantum computation using only measurements of single-qubit Pauli X , Y , and Z operators. This novel computational feature is related to the ‘genuine’ 2D SPTO possessed by our state, and which is absent in the cluster state. Our concrete connection between the latent computational complexity of many-body systems and macroscopic quantum orders may find applications in quantum many-body simulation for benchmarking classically intractable complexity.

arXiv:1508.02695•npj Quantum Information•Nov 14, 2016•91 citations
What kinds of symmetry-protected topologically ordered (SPTO) ground states can be used for universal measurement-based quantum computation in a similar fashion to the 2D cluster state? 2D SPTO states are classified not only by global on-site symmetries but also by subsystem symmetries, which are fine-grained symmetries dependent on the lattice geometry. Recently, all states within so-called SPTO cluster phases on the square and hexagonal lattices have been shown to be universal, based on the presence of subsystem symmetries and associated structures of quantum cellular automata. Motivated by this observation, we analyze the computational capability of SPTO cluster phases on all vertex-translative 2D Archimedean lattices. There are four subsystem symmetries here called ribbon, cone, fractal, and 1-form symmetries, and the former three are fundamentally in one-to-one correspondence with three classes of Clifford quantum cellular automata. We conclude that nine out of the eleven Archimedean lattices support universal cluster phases protected by one of the former three symmetries, while the remaining lattices possess 1-form symmetries and have a different capability related to error correction.
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.
An emerging insight is that ground states of symmetry-protected topological orders (SPTOs) possess latent computational complexity in terms of their many-body entanglement. By introducing a fractional symmetry of SPTO, which requires the invariance under 3-colorable symmetries of a lattice, we prove that every renormalization fixed-point state of 2D (Z_{2})^{m} SPTO with fractional symmetry can be utilized for universal quantum computation using only Pauli measurements, as long as it belongs to a nontrivial 2D SPTO phase. Our infinite family of fixed-point states may serve as a base model to demonstrate the idea of a "quantum computational phase" of matter, whose states share universal computational complexity ubiquitously.
We show that two-dimensional fractal subsystem symmetry-protected topological phases may serve as resources for universal measurement-based quantum computation. This is demonstrated explicitly for two cluster models known to lie within fractal symmetry-protected topological phases, and computational universality is shown to persist throughout those phases. One of the models considered is simply the cluster model on the honeycomb lattice in one limit. We discuss the importance of rigid subsystem symmetries, as opposed to global or $(D\ensuremath{-}1)$-form symmetries, in this context.
While quantum computers can achieve dramatic speedups over the classical computers familiar to us, identifying the origin of this quantum advantage in physical systems remains a major goal of quantum information science. A useful tool here is measurement-based quantum computation (MQC), a computational framework utilizing the quantum entanglement found in many-body resource states. Not all resource states are useful for quantum computation however, so an important question is what properties of many-body entanglement characterize universal resource states, which can implement any quantum computation. Many-body states are also studied in condensed matter physics, where the collective behavior of quantum many-body systems sometimes define topological phases of matter. These phases are defined by nonlocal many-body entanglement, making topologically-ordered states natural candidates for MQC. We might wonder if these topological phases could be organized as phases of quantum computation, so that every state within the phase is universal for MQC. While phases of symmetry-protected topological order (SPTO) have arisen as natural candidates, previous attempts to demonstrate an MQC-SPTO correspondence were mostly limited to nonuniversal 1D spin chains, leaving the important 2D setting wide open. In this dissertation, we explore the wide and varied connections between MQC and SPTO, and obtain new results for 1D and 2D systems. After identifying a new MQC-SPTO correspondence within 1D spin chains, we move up and explore the operational use of 2D states with two complementary forms of SPTO. We create a new Union Jack resource state, whose different form of SPTO than previous 2D resource states permits a hierarchical notion of MQC universality. This state leads us to consider an idealized model of 2D SPTO, where we show that an additional symmetry condition makes these model states form universal resources for MQC only when they have nontrivial SPTO. We finally study the intrinsic complexity of SPTO-inspired states for classically intractable sampling, and identify inherent advantages of MQC for this purpose. Our work highlights the rich complexity available in states of entangled quantum matter, providing new evidence which sharpens our understanding of the diverse connections between MQC and SPTO.
Abstract Measurement-based quantum computation (MQC) is a paradigm for studying quantum computation using many-body entanglement and single-qubit measurements. Although MQC has inspired wide-ranging discoveries throughout quantum information, our understanding of the general principles underlying MQC seems to be biased by its historical reliance upon the archetypal 2D cluster state. Here we utilise recent advances in the subject of symmetry-protected topological order (SPTO) to introduce a novel MQC resource state, whose physical and computational behaviour differs fundamentally from that of the cluster state. We show that, in sharp contrast to the cluster state, our state enables universal quantum computation using only measurements of single-qubit Pauli X , Y , and Z operators. This novel computational feature is related to the ‘genuine’ 2D SPTO possessed by our state, and which is absent in the cluster state. Our concrete connection between the latent computational complexity of many-body systems and macroscopic quantum orders may find applications in quantum many-body simulation for benchmarking classically intractable complexity.