On MPS and PEPS… David Pérez-García. Near Chiemsee

Slides:



Advertisements
Similar presentations
Henry Haselgrove School of Physical Sciences University of Queensland
Advertisements

The DMRG and Matrix Product States
Sergey Bravyi, IBM Watson Center Robert Raussendorf, Perimeter Institute Perugia July 16, 2007 Exactly solvable models of statistical physics: applications.
APRIL 2010 AARHUS UNIVERSITY Simulation of probed quantum many body systems.
Matrix product states for the absolute beginner
Exploring Topological Phases With Quantum Walks $$ NSF, AFOSR MURI, DARPA, ARO Harvard-MIT Takuya Kitagawa, Erez Berg, Mark Rudner Eugene Demler Harvard.
Preparing Projected Entangled Pair States on a Quantum Computer Martin Schwarz, Kristan Temme, Frank Verstraete University of Vienna, Faculty of Physics,
Spin chains and channels with memory Martin Plenio (a) & Shashank Virmani (a,b) quant-ph/ , to appear prl (a)Institute for Mathematical Sciences.
Preparing Topological States on a Quantum Computer Martin Schwarz (1), Kristan Temme (1), Frank Verstraete (1) Toby Cubitt (2), David Perez-Garcia (2)
Quantum Information Theory and Strongly Correlated Quantum Systems
Doing Very Big Calculations on Modest Size Computers Reducing the Cost of Exact Diagonalization Using Singular Value Decomposistion Marvin Weinstein, Assa.
Quantum Information and the simulation of quantum systems José Ignacio Latorre Universitat de Barcelona Perugia, July 2007 In collaboration with: Sofyan.
Funded by NSF, Harvard-MIT CUA, AFOSR, DARPA, MURI Takuya Kitagawa Harvard University Mark Rudner Harvard University Erez Berg Harvard University Yutaka.
Quantum Circuits for Clebsch- GordAn and Schur duality transformations D. Bacon (Caltech), I. Chuang (MIT) and A. Harrow (MIT) quant-ph/ more.
Review from last lecture: A Simple Quantum (3,1) Repetition Code
Entanglement Renormalization Frontiers in Quantum Nanoscience A Sir Mark Oliphant & PITP Conference Noosa, January 2006 Guifre Vidal The University of.
A Fault-tolerant Architecture for Quantum Hamiltonian Simulation Guoming Wang Oleg Khainovski.
Quantum computing Alex Karassev. Quantum Computer Quantum computer uses properties of elementary particle that are predicted by quantum mechanics Usual.
Presented by: Erik Cox, Shannon Hintzman, Mike Miller, Jacquie Otto, Adam Serdar, Lacie Zimmerman.
Witnesses for quantum information resources Archan S. Majumdar S. N. Bose National Centre for Basic Sciences, Kolkata, India Collaborators: S. Adhikari,
Introduction to Tensor Network States Sukhwinder Singh Macquarie University (Sydney)
Entanglement entropy and the simulation of quantum systems Open discussion with pde2007 José Ignacio Latorre Universitat de Barcelona Benasque, September.
Germán Sierra, Instituto de Física Teórica UAM-CSIC, Madrid 9th Bolonia Workshop in CFT and Integrable Systems Bolonia, Sept 2014.
Max Planck Institut of Quantum Optics (Garching) New perspectives on Thermalization Aspen (NON) THERMALIZATION OF 1D SYSTEMS: numerical studies.
Towards practical classical processing for the surface code arXiv: Austin G. Fowler, Adam C. Whiteside, Lloyd C. L. Hollenberg Centre for Quantum.
PEPS, matrix product operators and the algebraic Bethe ansatz
Barriers in Hamiltonian Complexity Umesh V. Vazirani U.C. Berkeley.
DISTRIBUTED SYSTEMS II A POLYNOMIAL LOCAL SOLUTION TO MUTUAL EXCLUSION Prof Philippas Tsigas Distributed Computing and Systems Research Group.
1 Qubits, time and the equations of physics Salomon S. Mizrahi Departamento de Física, CCET, Universidade Federal de São Carlos Time and Matter October.
1 Dorit Aharonov Hebrew Univ. & UC Berkeley Adiabatic Quantum Computation.
Tensor networks and the numerical study of quantum and classical systems on infinite lattices Román Orús School of Physical Sciences, The University of.
Introduction to MERA Sukhwinder Singh Macquarie University.
Quantum computation through many-body correlations of a condensed matter system New trends in QC, Nov. 17 (2010) Akimasa Miyake 1 Perimeter Institute for.
Workshop on Optimization in Complex Networks, CNLS, LANL (19-22 June 2006) Application of replica method to scale-free networks: Spectral density and spin-glass.
A Monomial matrix formalism to describe quantum many-body states Maarten Van den Nest Max Planck Institute for Quantum Optics Montreal, October 19 th 2011.
Quantum Convolutional Coding Techniques Mark M. Wilde Communication Sciences Institute, Ming Hsieh Department of Electrical Engineering, University of.
A simple nearest-neighbour two-body Hamiltonian system for which the ground state is a universal resource for quantum computation Stephen Bartlett Terry.
Network RS Codes for Efficient Network Adversary Localization Sidharth Jaggi Minghua Chen Hongyi Yao.
Fidelity of a Quantum ARQ Protocol Alexei Ashikhmin Bell Labs  Classical Automatic Repeat Request (ARQ) Protocol  Quantum Automatic Repeat Request (ARQ)
KITPC Max Planck Institut of Quantum Optics (Garching) Tensor networks for dynamical observables in 1D systems Mari-Carmen Bañuls.
Giovanni Ramírez, Javier Rodríguez-Laguna, Germán Sierra Instituto de Física Teórica UAM-CSIC, Madrid Workshop “Entanglement in Strongly Correlated Systems”
Goro Ishiki (University of Tsukuba) arXiv: [hep-th]
Quantum Approximate Markov Chains and the Locality of Entanglement Spectrum Fernando G.S.L. Brandão Caltech Seefeld 2016 based on joint work with Kohtaro.
Theory of Computational Complexity Probability and Computing Chapter Hikaru Inada Iwama and Ito lab M1.
Real space RG and the emergence of topological order Michael Levin Harvard University Cody Nave MIT.
Quantum Mechanical Models for Near Extremal Black Holes
Fernando G.S.L. Brandão Microsoft Research MIT 2016
Linear Quantum Error Correction
The countable character of uncountable graphs François Laviolette Barbados 2003.
CSE 2331/5331 Topic 9: Basic Graph Alg.
Morphing and Shape Processing
Information-Theoretical Analysis of the Topological Entanglement Entropy and Multipartite correlations Kohtaro Kato (The University of Tokyo) based on.
Statistical Mechanics and Multi-Scale Simulation Methods ChBE
Generalized DMRG with Tree Tensor Network
MPS & PEPS as a Laboratory for Condensed Matter
Mesh Parameterization: Theory and Practice
Sungho Kang Yonsei University
Topological quantum computing ▬ Toric code
Quantum computation with classical bits
Improving Quantum Circuit Dependability
Witness for Teleportation
Parameterized Complexity of Even Set (and others)
Lecture One: Automata Theory Amjad Ali
in collaboration with Andrew Doherty (UQ)
Institute for Theoretical Physics,
Computational approaches for quantum many-body systems
Marios Mattheakis and Pavlos Protopapas
Computational approaches for quantum many-body systems
A quantum machine learning algorithm based on generative models
Presentation transcript:

On MPS and PEPS… David Pérez-García. Near Chiemsee. 2007. work in collaboration with F. Verstraete, M.M. Wolf and J.I. Cirac, L. Lamata, J. León, D. Salgado, E. Solano.

Part I: Sequential generation of unitaries.

Summary Sequential generation of states. MPS canonical form. Sequential generation on unitaries

Relation between unitaries and MPS Generation of States C. Schön, E. Solano, F. Verstraete, J.I. Cirac and M.M. Wolf, PRL 95, 110503 (2005) MPS A decoupled Relation between unitaries and MPS Canonical form

MPS canonical form (G. Vidal, PRL 2003) Canonical unique MPS representation: Canonical conditions

Pushing forward. Canonical form. D. P-G, F. Verstraete, M. M. Wolf, J Pushing forward. Canonical form. D. P-G, F. Verstraete, M.M. Wolf, J.I. Cirac, Quant. Inf. Comp. 2007. We analyze the full freedom one has in the choice of the matrices for an MPS. We also find a constructive way to go from any MPS representation of the state to the canonical one. As a consequence we are able to transfer to the canonical form some “nice” properties of other (non canonical) representations.

Pushing forward. Generation of isometries. MPS M N-M

Results. A dichotomy. M=N (Unitaries). M=1 No non-trivial unitary can be implemented sequentially, even with an infinitely large ancilla. M=1 Every isometry can be implemented sequentially. The optimal dimension of the ancilla is the one given in the canonical MPS decomposition of U.

Examples V The dimension of the ancilla grows linearly Optimal cloning. V The dimension of the ancilla grows linearly << exp(N) (worst case)

Examples Error correction. The Shor code. It allows to detect and correct one arbitrary error It only requires an ancilla of dimension 4 << 256 (worst case)

Part II: PEPS as unique GS of local Hamiltonians.

Summary PEPS Injectivity Parent Hamiltonians Uniqueness Energy gap.

PEPS 2D analogue of MPS. Very useful tool to understand 2D systems: Topological order. Measurement based quantum computation (ask Jens). Complexity theory (ask Norbert). Useful to simulate 2D systems (ask Frank)

PEPS Physical systems

PEPS Working in the computational basis Hence Contraction of tensors following the graph of the PEPS v v

Injectivity R R C # outgoing bonds in R # vertices inside R Boundary condition

Injectivity We say that R is injective if is injective as a linear map Is injectivity a reasonable assumption? Numerically it is generic. AKLT is injective. Area Volume

Parent Hamiltonian Notation: For sufficiently large R For each vertex v we take and

Parent Hamiltonian By construction R PEPS g.s. of H H frustration free Is H non-degenerate?

Uniqueness (under injectivity) We assume that we can group the spins to have injectivity in each vertex. New graph. It is going to be the interaction graph of the Hamiltonian. Edge of the graph The PEPS is the unique g.s. of H.

Energy gap Injectivity Unique GS Gap In the 1D case (MPS) we have This is not the case in the 2D setting. There are injective PEPS without gap. There are non-injetive PEPS that are unique g.s. of their parent Hamiltonian. Injectivity Unique GS Gap

Energy gap Classical system Same correlations PEPS !!!

Energy gap. Classical 2D Ising at critical temp. No gap PEPS ground state of gapless H. Power low decay It is the unique g.s. of H Injective Non-injective