Preparing topological PEPS on a quantum computer

  title={Preparing topological PEPS on a quantum computer},
  author={Martin Schwarz and Toby S. Cubitt and Kristan Temme and F. Verstraete and David P{\'e}rez-Garc{\'i}a},
Martin Schwarz, Toby S. Cubitt, Kristan Temme, Frank Verstraete, and David Perez-Garcia Vienna Center for Quantum Science and Technology, Faculty of Physics, University of Vienna, Vienna, Austria Departamento de Análisis Matemático, Universidad Complutense de Madrid, Plaza de Ciencias 3, Ciudad Universitaria, 28040 Madrid, Spain Center for Theoretical Physics, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge MA 02139-4307, USA 

Figures from this paper

Probabilistic nonunitary gate in imaginary time evolution
By application of Grover's algorithm, the probabilistic method of implementing nonunitary operation is extended and it is shown that it can promote success probability without fidelity decreasing and can be applied to problems of imaginary time evolution and contraction of tensor networks on a quantum computer.
An Information-Theoretic Proof of the Constructive Commutative Quantum Lovász Local Lemma
An efficient quantum algorithm is proposed to prepare this ground state for the special case of commuting projector terms and follows the breakthrough ideas of Moser's classical algorithm and lifts his information theoretic argument to the quantum setting.
Spectral Gaps for the Two-Species Product Vacua and Boundary States Models on the d-Dimensional Lattice
  • M. Bishop
  • Mathematics
    Journal of Statistical Physics
  • 2019
We study the two-species Product Vacua and Boundary States (PVBS) models on the integer lattice $${\mathbb {Z}}^d$$Zd and prove the existence and non-existence of a spectral gap for all choices of


Quantum computation and quantum information
  • T. Paul
  • Physics
    Mathematical Structures in Computer Science
  • 2007
This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers deal
Communications in Mathematical Physics Efficient Quantum Algorithms for Simulating Sparse Hamiltonians
We present an efficient quantum algorithm for simulating the evolution of a quantum state for a sparse Hamiltonian H over a given time t in terms of a procedure for computing the matrix entries of H
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
The papers in this volume were presented at the 3rd Innovations in Theoretical Computer Science (ITCS 2012) conference, sponsored by the ACM Special Interest Group on Algorithms and Computation
  • Rev. Lett. 101, 110502
  • 2012
Annals of 6 Physics 325
  • 2153
  • 2010
Computational Complexity 14
  • 122
  • 2005
Annals of Physics 303
  • 2
  • 2003
Matrix computations (3rd ed.)
  • Rev. B 84, 165139
  • 2011
Nature Physics 8
  • 277
  • 2012