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.

Slides:



Advertisements
Similar presentations
1+eps-Approximate Sparse Recovery Eric Price MIT David Woodruff IBM Almaden.
Advertisements

Protected edge modes without symmetry Michael Levin University of Maryland.
Sergey Bravyi, IBM Watson Center Robert Raussendorf, Perimeter Institute Perugia July 16, 2007 Exactly solvable models of statistical physics: applications.
Equilibration and Unitary k- Designs Fernando G.S.L. Brandão UCL Joint work with Aram Harrow and Michal Horodecki arXiv: IMS, September 2013.
Quantum Computing MAS 725 Hartmut Klauck NTU
Weakening the Causal Faithfulness Assumption
Gibbs sampler - simple properties It’s not hard to show that this MC chain is aperiodic. Often is reversible distribution. If in addition the chain is.
Spin chains and channels with memory Martin Plenio (a) & Shashank Virmani (a,b) quant-ph/ , to appear prl (a)Institute for Mathematical Sciences.
Thermalization Algorithms: Digital vs Analogue Fernando G.S.L. Brandão University College London Joint work with Michael Kastoryano Freie Universität Berlin.
Entropy in the Quantum World Panagiotis Aleiferis EECS 598, Fall 2001.
Chain Rules for Entropy
Product-State Approximations to Quantum Groundstates Fernando G.S.L. Brandão Imperial -> UCL Based on joint work with A. Harrow Paris, April 2013.
Exponential Decay of Correlations Implies Area Law Fernando G.S.L. Brandão ETH Zürich Based on joint work with Michał Horodecki Arxiv: COOGEE.
Quantum Hammersley-Clifford Theorem Winton Brown CRM-Workshop on quantum information in Quantum many body physics 2011.
Graduate School of Information Sciences, Tohoku University
Stronger Subadditivity Fernando G.S.L. Brandão University College London -> Microsoft Research Coogee 2015 based on arXiv: with Aram Harrow Jonathan.
Chapter 8-3 Markov Random Fields 1. Topics 1. Introduction 1. Undirected Graphical Models 2. Terminology 2. Conditional Independence 3. Factorization.
. Hidden Markov Model Lecture #6 Background Readings: Chapters 3.1, 3.2 in the text book, Biological Sequence Analysis, Durbin et al., 2001.
. Hidden Markov Model Lecture #6 Background Readings: Chapters 3.1, 3.2 in the text book, Biological Sequence Analysis, Durbin et al., 2001.
Bayesian Network Representation Continued
Ramanujan Graphs of Every Degree Adam Marcus (Crisply, Yale) Daniel Spielman (Yale) Nikhil Srivastava (MSR India)
1 Quantum NP Dorit Aharonov & Tomer Naveh Presented by Alex Rapaport.
Area Laws for Entanglement Fernando G.S.L. Brandão University College London joint work with Michal Horodecki arXiv: arXiv:1406.XXXX Stanford.
Joint Distribution of two or More Random Variables
Approximate Inference 2: Monte Carlo Markov Chain
Witnesses for quantum information resources Archan S. Majumdar S. N. Bose National Centre for Basic Sciences, Kolkata, India Collaborators: S. Adhikari,
Entanglement Area Law (from Heat Capacity)
Exponential Decay of Correlations Implies Area Law Fernando G.S.L. Brandão ETH Zürich Based on joint work with Michał Horodecki Arxiv: Q+ Hangout,
1 Introduction to Quantum Information Processing QIC 710 / CS 667 / PH 767 / CO 681 / AM 871 Richard Cleve DC 2117 Lecture 16 (2011)
Motivation and goals One particle, two particles: previous work Three particles: flow through particles Many particles: flow along networks Application:
Faithful Squashed Entanglement Fernando G.S.L. Brandão 1 Matthias Christandl 2 Jon Yard 3 1. Universidade Federal de Minas Gerais, Brazil 2. ETH Zürich,
Methods of Proof. This Lecture Now we have learnt the basics in logic. We are going to apply the logical rules in proving mathematical theorems. Direct.
Quantum Gibbs Samplers
Thermalization and Quantum Information Fernando G.S.L. Brandão University College London New Perspectives on Thermalization, Aspen 2014 partially based.
Quantum Gibbs Samplers Fernando G.S.L. Brandão QuArC, Microsoft Research Based on joint work with Michael Kastoryano University of Copenhagen Quantum Hamiltonian.
Barriers in Hamiltonian Complexity Umesh V. Vazirani U.C. Berkeley.
H ij Entangle- ment flow multipartite systems [1] Numerically computed times assuming saturated rate equations, along with the lower bound (solid line)
Approximate Inference: Decomposition Methods with Applications to Computer Vision Kyomin Jung ( KAIST ) Joint work with Pushmeet Kohli (Microsoft Research)
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.
A simple nearest-neighbour two-body Hamiltonian system for which the ground state is a universal resource for quantum computation Stephen Bartlett Terry.
A generalization of quantum Stein’s Lemma Fernando G.S.L. Brandão and Martin B. Plenio Tohoku University, 13/09/2008.
Yuval Peled, HUJI Joint work with Nati Linial, Benny Sudakov, Hao Huang and Humberto Naves.
On Minimum Reversible Entanglement Generating Sets Fernando G.S.L. Brandão Cambridge 16/11/2009.
MA428 Class Project The Heat Equation Temperature Distribution in a Bar with Radiating Ends.
STA347 - week 91 Random Vectors and Matrices A random vector is a vector whose elements are random variables. The collective behavior of a p x 1 random.
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”
Exponential Decay of Correlations Implies Area Law: Single-Shot Techniques Fernando G.S.L. Brandão ETH Zürich Based on joint work with Michał Horodecki.
Methods of Proof Lecture 4: Sep 20 (chapter 3 of the book, except 3.5 and 3.8)
Theory of Computational Complexity Probability and Computing Chapter Hikaru Inada Iwama and Ito lab M1.
Fernando G.S.L. Brandão MSR -> Caltech Faculty Summit 2016
Random Access Codes and a Hypercontractive Inequality for
Markov Chains and Random Walks
Fernando G.S.L. Brandão Microsoft Research MIT 2016
Sampling of min-entropy relative to quantum knowledge Robert König in collaboration with Renato Renner TexPoint fonts used in EMF. Read the TexPoint.
Information-Theoretical Analysis of the Topological Entanglement Entropy and Multipartite correlations Kohtaro Kato (The University of Tokyo) based on.
Production of an S(α,β) Covariance Matrix with a Monte Carlo-Generated
LATTICES AND BOOLEAN ALGEBRA
Graduate School of Information Sciences, Tohoku University
Reconstruction on trees and Phylogeny 1
Reconstruction on trees and Phylogeny 2
On MPS and PEPS… David Pérez-García. Near Chiemsee
Quantum Information Theory Introduction
Markov Networks Independencies Representation Probabilistic Graphical
Decoupling with random diagonal-unitaries
Quantum computation with classical bits
Checking the Consistency of Local Density Matrices
Markov Networks Independencies Representation Probabilistic Graphical
Factoring using the greatest common factor (GCF).
Integer and fractional packing of graph families
A quantum machine learning algorithm based on generative models
Presentation transcript:

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 Kato University of Tokyo

Markov Chain Classical: X, Y, Z with distribution p(x, y, z) i)X-Y-Z Markov if X and Z are independent conditioned on Y ii) X-Y-Z Markov if there is a channel Λ : Y -> YZ s.t. Λ(p XY ) = p XYZ Quantum: i) ρ CRB Markov quantum state iff C and R are independent conditioned on B, i.e. and ii)ρ CRB Markov iff there is channel Λ : B -> RB s.t. Λ(ρ CB ) = ρ CRB (Hayden, Jozsa, Petz, Winter ’03) I(C:R|B)=0 iff ρ CRB is quantum Markov X Y Λ X Y Z

Quantum Markov Chain Classical: X, Y, Z with distribution p(x, y, z) i)X-Y-Z Markov if X and Z are independent conditioned on Y ii) X-Y-Z Markov if there is a channel Λ : Y -> YZ s.t. Λ(p XY ) = p XYZ Quantum: i) ρ ABC Markov quantum state if A and C are ”independent conditioned” on B ii)ρ ABC Markov iff there is channel Λ : B -> BC s.t. Λ(ρ AB ) = ρ ABC (Hayden, Jozsa, Petz, Winter ’03)

Quantum Markov Chain Classical: X, Y, Z with distribution p(x, y, z) i)X-Y-Z Markov if X and Z are independent conditioned on Y ii) X-Y-Z Markov if there is a channel Λ : Y -> YZ s.t. Λ(p XY ) = p XYZ Quantum: i) ρ ABC Markov quantum state if A and C are ”independent conditioned” on B, i.e. and ii)ρ ABC Markov iff there is channel Λ : B -> BC s.t. Λ(ρ AB ) = ρ ABC (Hayden, Jozsa, Petz, Winter ’03)

Quantum Markov Chain Classical: X, Y, Z with distribution p(x, y, z) i)X-Y-Z Markov if X and Z are independent conditioned on Y ii) X-Y-Z Markov if there is a channel Λ : Y -> YZ s.t. Λ(p XY ) = p XYZ Quantum: i) ρ ABC Markov quantum state if A and C are ”independent conditioned” on B, i.e. and ii)ρ ABC Markov if there is channel Λ : B -> BC s.t. Λ(ρ AB ) = ρ ABC (Hayden, Jozsa, Petz, Winter ’03)

Quantum Markov Chain Classical: X, Y, Z with distribution p(x, y, z) i)X-Y-Z Markov if X and Z are independent conditioned on Y ii) X-Y-Z Markov if there is a channel Λ : Y -> YZ s.t. Λ(p XY ) = p XYZ Quantum: i) ρ ABC Markov quantum state if A and C are ”independent conditioned” on B, i.e. and ii)ρ ABC Markov if there is channel Λ : B -> BC s.t. Λ(ρ AB ) = ρ ABC iii)ρ ABC Markov if (Hayden, Jozsa, Petz, Winter ’03)

Markov Networks x1x1 x2x2 x3x3 x4x4 x5x5 x6x6 x7x7 x8x8 x9x9 x 10 We say X 1, …, X n on a graph G form a Markov Network if X i is indendent of all other X’s conditioned on its neighbors

Hammersley-Clifford Theorem x1x1 x2x2 x3x3 x4x4 x5x5 x7x7 x8x8 x9x9 x 10 Markov networks Gibbs state local classical Hamiltonian

Hammersley-Clifford Theorem x1x1 x2x2 x3x3 x4x4 x5x5 x7x7 x8x8 x9x9 x 10 (Hammersley-Clifford ‘71) Let G = (V, E) be a graph and P(V) be a positive probability distribution over random variables located at the vertices of G. The pair (P(V), G) is a Markov Network if, and only if, the probability P can be expressed as P(V) = e H(V) /Z where is a sum of real functions h Q (Q) of the random variables in cliques Q.

Quantum Hammersley-Clifford Theorem q1q1 q2q2 q3q3 q4q4 q5q5 q6q6 q7q7 q8q8 q9q9 q 10 (Leifer, Poulin ‘08, Brown, Poulin ‘12) Analogous result holds replacing classical Hamiltonians by commuting quantum Hamiltonians (obs: quantum version more fragile; only works for graphs with no 3- cliques) Only Gibbs states of commuting Hamiltonians appear. Is there a fully quantum formulation?

Approximate Conditional Independence X-Y-Z approximate Markov if X and Z are approximately independent conditioned on Y

Approximate Conditional Independence X-Y-Z approximate Markov if X and Z are approximately independent conditioned on Y Def: X-Y-Z ε-Markov if I(X:Y|Z) ≤ ε Conditional Mutual Information: Fact:

Quantum Approximate Conditional Independence ρ ABC quantum approximate Markov if A and C are approximately independent conditioned on B But: (Fawzi, Renner ‘14) Approximate recovery Quantum Conditional Mutual Information: Note:

Quantum Approximate Conditional Independence ρ ABC quantum approximate Markov if A and C are approximately independent conditioned on B Quantum Conditional Mutual Information: Def: ρ ABC quantum ε-Markov if I(A:C|B) ≤ ε

Q. Approximate Markov States A B C quantum approximate Markov if for every A, B, C when Conjecture Quantum Approximate Markov Gibbs state local Hamiltonian

Strengthening of Area Law A B C Conjecture Quantum Approximate Markov Gibbs state local Hamiltonian (Wolf, Verstraete, Hastings, Cirac ‘07) Gibbs temperature T:

Strengthening of Area Law A B C Conjecture Quantum Approximate Markov Gibbs state local Hamiltonian From conjecture: Gives rate of saturation of area law

Approximate Quantum Markov Chains are Thermal thm 1.Let H be a local Hamiltonian on n qubits. Then AB C

thm 1.Let H be a local Hamiltonian on n qubits. Then 2.Let be a state on n qubits s.t. for every split ABC with |B| > m,. Then AB C Approximate Quantum Markov Chains are Thermal

Rest of the Talk - Application of theorem to Entanglement Spectrum - Idea of the Proof

“Uniform” Area Law XXcXc For every region X, Topological entanglement entropy (TEE) correlation length Expected to hold in models with a finite correlation length ξ. TEE ɣ accounts for long-range quantum entanglement in the system (i.e. entanglement that cannot be created by short local dynamics) ɣ ≠ 0: Fractional Quantum Hall, Spin liquids, Toric code, … What are the consequences of an area law? (Kitaev, Preskill ‘05, Levin, Wen ‘05)

Consequence of Area Law: Approximate Conditional Independece A B C Area law assumption: For every region X, Topological entanglement entropy correlation length A B C For every ABC with trivial topology: l

Topological Entanglement Entropy Area law assumption: For every region X, Topological entanglement entropy correlation length B B A C Conditional Mutual Information: Assuming area law holds: l (Kitaev, Preskill ‘05, Levin, Wen ‘05)

Entanglement Spectrum R : eigenvalues of reduced density matrix on X RcRc is called entanglement spectrum Area law is an statement about Are there more information in the distribution of the λ i ?

Entanglement Spectrum X : eigenvalues of reduced density matrix on X Also known as Schmidt eigenvalues of the state XcXc (Haldane, Li ’08, ….) For FQHE, entanglement spectrum matches the low energies of a CFT acting on the boundary of X

Entanglement Spectrum X : eigenvalues of reduced density matrix on X Also known as Schmidt eigenvalues of the state XcXc (Haldane, Li ’08, ….) For FQHE, entanglement spectrum matches the low energies of a CFT acting on the boundary of X (Cirac, Poiblanc, Schuch, Verstraete ’11, ….) Numerical studies with PEPS For topologically trivial systems (AKLT, Heisenberg models): entanglement spectrum matches the energies of a local Hamiltonian on boundary How generic are these findings? Can we give a proof?

claim 1 Suppose satisfies the area law assumption. Then Result 1: Boundary State B B A C

claim 1 Suppose satisfies the area law assumption. Suppose. Then there is a local s.t. Result 1: Boundary State B1B1 B2B2 B3B3 B k-1 BkBk B k+1 B 2k B k-2 … B k+2 …

claim 1 Suppose satisfies the area law assumption. Suppose. Then there is a local s.t. In general: Result 1: Boundary State B B A C

claim 1 Suppose satisfies the area law assumption. Suppose. Then there is a local s.t. In general: Result 1: Boundary State B B A C Zero-correlation case proved by (Kato, Furrer, Murao ‘15)

claim 1 Suppose satisfies the area law assumption. Suppose. Then there is a local s.t. In general: Result 1: Boundary State Local ”boundary Hamiltonian” Non-local ”boundary Hamiltonian”

Result 2: Entanglement Spectrum claim 2 Suppose satisfies the area law assumption with. Then XX’ B1B1 B2B2 B3B3 … B l-1 BlBl

From 1 to 2 XX’B

X B since is a pure state From 1 to 2

XX’B From 1 to 2

If, XX’B From 1 to 2

How to prove claim 1? Suppose. Then there is a local s.t. Let’s focus on second part. Recap: B1B1 B2B2 B3B3 B k-1 BkBk B k+1 B 2k B k-2 … B k+2 … By area law: By main theorem, we know it’s thermal

Suppose. Then there is a local s.t. Apply part 2 of thm to get: with l = n/m. Choose m = O(log(n)) to make error small How to prove claim 1? Let’s focus on second part. Recap:

Recap main theorem thm 1.Let H be a local Hamiltonian on n qubits. Then 2.Let be a state on n qubits s.t. for every split ABC with |B| > m,. Then AB C

Proof Part 2 X1X1 X2X2 X3X3 m Let be the maximum entropy state s.t. Fact 1 (Jaynes’ Principle): Fact 2 Let’s show it’s small

Proof Part 2 X1X1 X2X2 X3X3 m SSA

Proof Part 2 X1X1 X2X2 X3X3 m

X1X1 X2X2 X3X3 m

X1X1 X2X2 X3X3 m Since

Proof Part 2 X1X1 X2X2 X3X3 m Since

Proof Part 1 Recap: Let H be a local Hamiltonian on n qubits. Then We show there is a recovery channel from B to BC reconstructing the state on ABC from its reduction on AB.

Structure of Recovery Map

Repeat-until-success Method Success Fail Success Fail Success Fail

Locality of Perturbations Local

Proof claim 1 part 1 thm 1 Suppose satisfies the area law assumption. Then B B A C

B1B1 B1B1 A C B2B2 B2B2 We follow the strategy of (Kato et al ‘15) for the zero-correlation length case Area Law implies By Fawzi-Renner Bound, there are channels s.t. Proof claim 1 part 1

Define: We have It follows that C can be reconstructed from B. Therefore Proof claim 1 part 1

Define: We have It follows that C can be reconstructed from B. Therefore Since with So Proof claim 1 part 1

Since Let R 2 be the set of Gibbs states of Hamiltonians H = H AB + H BC. Then Proof claim 1 part 1

Summary Quantum Approximate Markov Chains are Thermal The double of the entanglement spectrum of topological trivial states is local What happens in dims bigger than 2? Solve the conjecture! Are two copies of the entanglement spectrum necessary to get a local boundary model? What can we say about topological non-trivial states? Thanks! Open Problems: