From communication complexity to an entanglement spread area law in the ground state of gapped local Hamiltonians

04/30/2020
by   Anurag Anshu, et al.
0

In this work, we make a connection between two seemingly different problems. The first problem involves characterizing the properties of entanglement in the ground state of gapped local Hamiltonians, which is a central topic in quantum many-body physics. The second problem is on the quantum communication complexity of testing bipartite states with EPR assistance, a well-known question in quantum information theory. We construct a communication protocol for testing (or measuring) the ground state and use its communication complexity to reveal a new structural property for the ground state entanglement. This property, known as the entanglement spread, roughly measures the ratio between the largest and the smallest Schmidt coefficients across a cut in the ground state. Our main result shows that gapped ground states possess limited entanglement spread across any cut, exhibiting an "area law" behavior. Our result quite generally applies to any interaction graph with an improved bound for the special case of lattices. This entanglement spread area law includes interaction graphs constructed in [Aharonov et al., FOCS'14] that violate a generalized area law for the entanglement entropy. Our construction also provides evidence for a conjecture in physics by Li and Haldane on the entanglement spectrum of lattice Hamiltonians [Li and Haldane, PRL'08]. On the technical side, we use recent advances in Hamiltonian simulation algorithms along with quantum phase estimation to give a new construction for an approximate ground space projector (AGSP) over arbitrary interaction graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/01/2022

Quantum Pseudoentanglement

Quantum pseudorandom states are efficiently constructable states which n...
research
05/12/2021

Second Law of Entanglement Dynamics for the Non-Asymptotic Regime

The distillable entanglement of a bipartite quantum state does not excee...
research
10/24/2019

On the geometry of learning neural quantum states

Combining insights from machine learning and quantum Monte Carlo, the st...
research
01/01/2023

Matching upper bounds on symmetric predicates in quantum communication complexity

In this paper, we focus on the quantum communication complexity of funct...
research
03/23/2021

Ground Truths for the Humanities

Ensuring a faithful interaction with data and its representation for hum...
research
06/02/2019

Ubiquitous Complexity of Entanglement Spectra

In recent years, the entanglement spectra of quantum states have been id...
research
07/05/2023

Hybrid Ground-State Quantum Algorithms based on Neural Schrödinger Forging

Entanglement forging based variational algorithms leverage the bi-partit...

Please sign up or login with your details

Forgot password? Click here to reset