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

Jacob Miller and Akimasa Miyake
Phys. Rev. Lett. 120, 170503 – Published 26 April 2018
PDFHTMLExport Citation

Abstract

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 (Z2)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.

  • Figure
  • Figure
  • Received 11 January 2017

DOI:https://doi.org/10.1103/PhysRevLett.120.170503

© 2018 American Physical Society

Physics Subject Headings (PhySH)

Quantum Information, Science & Technology

Authors & Affiliations

Jacob Miller* and Akimasa Miyake

  • Center for Quantum Information and Control, Department of Physics and Astronomy, University of New Mexico, Albuquerque, New Mexico 87131, USA

  • *jmjacobmiller@gmail.com
  • amiyake@unm.edu

Article Text (Subscription Required)

Click to Expand

Supplemental Material (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 120, Iss. 17 — 27 April 2018

Reuse & Permissions
Access Options
CHORUS

Article Available via CHORUS

Download Accepted Manuscript
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review Letters

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×