Recognition: unknown
Subsystem symmetries, quantum cellular automata, and computational phases of quantum matter
read the original abstract
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.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Matrix Product States for Modulated Topological Phases: Crystalline Equivalence Principle and Lieb-Schultz-Mattis Constraints
Modulated SPT phases in 1D are classified by H²(G, U(1)_s) and obey LSM-type theorems forbidding symmetric short-range entangled ground states.
-
The Structure of Circle Graph States
Circle graphs are closed under r-local complementation and bipartite circle graph states correspond one-to-one with planar code states whose MBQC is classically simulable.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.