Quantum Information, Entanglement, and Many-Body Physics Fernando G.S.L. Brandão University College London Caltech, January 2014.

Slides:



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

How Much Information Is In Entangled Quantum States? Scott Aaronson MIT |
The Learnability of Quantum States Scott Aaronson University of Waterloo.
Physics Information Day. Physics of Information Day.
Random Quantum Circuits are Unitary Polynomial-Designs Fernando G.S.L. Brandão 1 Aram Harrow 2 Michal Horodecki 3 1.Universidade Federal de Minas Gerais,
Part 2: Indirect interactions We assume that two quantum objects A and C interact only via another object (or objects) B. No other assumptions are made.
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
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.
Frustration of Decoherence and Entanglement-sharing in the Spin-bath Andrew Hines Christopher Dawson Ross McKenzie Gerard Milburn.
Quantum Information Stephen M. Barnett University of Strathclyde The Wolfson Foundation.
Preparing Topological States on a Quantum Computer Martin Schwarz (1), Kristan Temme (1), Frank Verstraete (1) Toby Cubitt (2), David Perez-Garcia (2)
Thermalization Algorithms: Digital vs Analogue Fernando G.S.L. Brandão University College London Joint work with Michael Kastoryano Freie Universität Berlin.
Quantum Data Hiding Challenges and Opportunities Fernando G.S.L. Brandão Universidade Federal de Minas Gerais, Brazil Based on joint work with M. Christandl,
Quantum Darwinism is Generic Fernando G.S.L. Brandão University College London Joint work with Marco Piani and Pawel Horodecki arXiv: February.
Limitations for Quantum PCPs Fernando G.S.L. Brandão University College London Based on joint work arXiv: with Aram Harrow MIT Simons Institute,
Bell inequality & entanglement
Boris Altshuler Columbia University Anderson Localization against Adiabatic Quantum Computation Hari Krovi, Jérémie Roland NEC Laboratories America.
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.
Stronger Subadditivity Fernando G.S.L. Brandão University College London -> Microsoft Research Coogee 2015 based on arXiv: with Aram Harrow Jonathan.
Andy Ferris International summer school on new trends in computational approaches for many-body systems Orford, Québec (June 2012) Multiscale Entanglement.
Breakdown of the adiabatic approximation in low-dimensional gapless systems Anatoli Polkovnikov, Boston University Vladimir Gritsev Harvard University.
Universal Optical Operations in Quantum Information Processing Wei-Min Zhang ( Physics Dept, NCKU )
Entanglement in Quantum Critical Phenomena, Holography and Gravity Dmitri V. Fursaev Joint Institute for Nuclear Research Dubna, RUSSIA Banff, July 31,
Quantum Algorithms I Andrew Chi-Chih Yao Tsinghua University & Chinese U. of Hong Kong.
Entanglement Renormalization Frontiers in Quantum Nanoscience A Sir Mark Oliphant & PITP Conference Noosa, January 2006 Guifre Vidal The University of.
Schrödinger’s Elephants & Quantum Slide Rules A.M. Zagoskin (FRS RIKEN & UBC) S. Savel’ev (FRS RIKEN & Loughborough U.) F. Nori (FRS RIKEN & U. of Michigan)
Quantum Mechanics from Classical Statistics. what is an atom ? quantum mechanics : isolated object quantum mechanics : isolated object quantum field theory.
EECS 598 Fall ’01 Quantum Cryptography Presentation By George Mathew.
Paraty, Quantum Information School, August 2007 Antonio Acín ICFO-Institut de Ciències Fotòniques (Barcelona) Quantum Cryptography.
Quantum Hamiltonian Complexity Fernando G.S.L. Brandão ETH Zürich Based on joint work with A. Harrow and M. Horodecki Quo Vadis Quantum Physics, Natal.
Area Laws for Entanglement Fernando G.S.L. Brandão University College London joint work with Michal Horodecki arXiv: arXiv:1406.XXXX Stanford.
Quantum Information Theory in Quantum Hamiltonian Complexity Aram Harrow (MIT) Simons Institute 16 Jan 2014.
Information-Theoretic Techniques in Many-Body Physics Day 1 Fernando G.S.L. Brandão UCL Based on joint work with A. Harrow and M. Horodecki New Mathematical.
Entanglement Area Law (from Heat Capacity)
Entropy localization and distribution in the Hawking radiation Horacio Casini CONICET-Intituto Balseiro – Centro Atómico Bariloche.
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,
ENTROPIC CHARACTERISTICS OF QUANTUM CHANNELS AND THE ADDITIVITY PROBLEM A. S. Holevo Steklov Mathematical Institute, Moscow.
Test for entanglement: realignment criterion, entanglement witness and positive maps Kai Chen † CQIQC, Toronto, July 2004 † Kai Chen is now a postdoctoral.
Quantum Gibbs Samplers
Max Planck Institut of Quantum Optics (Garching) New perspectives on Thermalization Aspen (NON) THERMALIZATION OF 1D SYSTEMS: numerical studies.
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.
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.
Recent Progress in Many-Body Theories Barcelona, 20 July 2007 Antonio Acín 1,2 J. Ignacio Cirac 3 Maciej Lewenstein 1,2 1 ICFO-Institut de Ciències Fotòniques.
CENTER FOR EXOTIC QUANTUM SYSTEMS CEQS Preskill 1983 Kitaev 2002 Refael 2005 Motrunich 2006 Fisher 2009 Historically, Caltech physics has focused on the.
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.
On Minimum Reversible Entanglement Generating Sets Fernando G.S.L. Brandão Cambridge 16/11/2009.
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.
Quantum Cryptography Antonio Acín
KITPC Max Planck Institut of Quantum Optics (Garching) Tensor networks for dynamical observables in 1D systems Mari-Carmen Bañuls.
A counterexample for the graph area law conjecture Dorit Aharonov Aram Harrow Zeph Landau Daniel Nagaj Mario Szegedy Umesh Vazirani arXiv:
Ground State Entanglement in 1-Dimensional Translationally-Invariant Quantum Systems Sandy Irani Computer Science Department University of California,
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.
Limitations on quantum PCPs Aram Harrow based on joint work with Fernando G.S.L. Brandão (ETHZ->Imperial)
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.
Fernando G.S.L. Brandão Microsoft Research MIT 2016
Quantum Information and Everything.
Information-Theoretical Analysis of the Topological Entanglement Entropy and Multipartite correlations Kohtaro Kato (The University of Tokyo) based on.
Generalized DMRG with Tree Tensor Network
MPS & PEPS as a Laboratory for Condensed Matter
Computational approaches for quantum many-body systems
Presentation transcript:

Quantum Information, Entanglement, and Many-Body Physics Fernando G.S.L. Brandão University College London Caltech, January 2014

Quantum Information Theory Quant. Comm. Entanglement theory Q. error correc. + FT Quantum comp. Quantum complex. theo. Goal: Lay down the theory for future quantum-based technology (quantum computers, quantum cryptography, …)

Quantum Information Theory Quant. Comm. Entanglement theory Q. error correc. + FT Quantum comp. Quantum complex. theo. Ultimate limits to information transmission Goal: Lay down the theory for future quantum-based technology (quantum computers, quantum cryptography, …)

Quantum Information Theory Quant. Comm. Entanglement theory Q. error correc. + FT Quantum comp. Quantum complex. theo. Entanglement as a resource Ultimate limits to information transmission Goal: Lay down the theory for future quantum-based technology (quantum computers, quantum cryptography, …)

Quantum Information Theory Quant. Comm. Entanglement theory Q. error correc. + FT Quantum comp. Quantum complex. theo. Entanglement as a resource Ultimate limits to information transmission Quantum computers are digital Goal: Lay down the theory for future quantum-based technology (quantum computers, quantum cryptography, …)

Quantum Information Theory Quant. Comm. Entanglement theory Q. error correc. + FT Quantum comp. Quantum complex. theo. Entanglement as a resource Ultimate limits to information transmission Quantum computers are digital Quantum algorithms with exponential speed-up Goal: Lay down the theory for future quantum-based technology (quantum computers, quantum cryptography, …)

Quantum Information Theory Quant. Comm. Entanglement theory Q. error correc. + FT Quantum comp. Quantum complex. theo. Entanglement as a resource Ultimate limits to information transmission Quantum computers are digital Quantum algorithms with exponential speed-up Ultimate limits for efficient computation Goal: Lay down the theory for future quantum-based technology (quantum computers, quantum cryptography, …)

QIT Connections Quant. Comm. Entanglement theory Q. error correc. + FT Quantum comp. Quantum complex. theo. QIT

QIT Connections Quant. Comm. Entanglement theory Q. error correc. + FT Quantum comp. Quantum complex. theo. Strongly corr. systems Topological order Spin glasses Condensed Matter QIT

QIT Connections Quant. Comm. Entanglement theory Q. error correc. + FT Quantum comp. Quantum complex. theo. Strongly corr. systems Topological order Spin glasses Thermalization scale Quantum-to-Classical Transition Condensed Matter QIT StatMech

QIT Connections Quant. Comm. Entanglement theory Q. error correc. + FT Quantum comp. Quantum complex. theo. Topolog. q. field theo. Black hole physics Holography Strongly corr. systems Topological order Spin glasses Thermalization scale Quantum-to-Classical Transition Condensed Matter QIT StatMech HEP/GR

QIT Connections Quant. Comm. Entanglement theory Q. error correc. + FT Quantum comp. Quantum complex. theo. Ion traps, linear optics, optical lattices, cQED, superconduc. devices, many more Topolog. q. field theo. Black hole physics Holography Strongly corr. systems Topological order Spin glasses Thermalization scale Quantum-to-Classical Transition HEP/GRCondensed Matter QIT StatMech Exper. Phys.

This Talk Goal: give examples of these connections: 1.Entanglement in many-body systems - area law in 1D from finite correlation length - product-state approximation to low-energy states in high dimensions 2. (time permitting) Quantum-to-Classical Transition - show that distributed quantum information becomes classical (quantum Darwinism)

Entanglement Entanglement in quantum information science is a resource (teleportation, quantum key distribution, metrology, …) Ex. EPR pair How to quantify it? Bipartite Pure State Entanglement Given, its entropy of entanglement is Reduced State: Entropy: (Renyi Entropies: )

Entanglement in Many-Body Systems A quantum state ψ of n qubits is a vector in ≅ For almost every state ψ, S(X) ψ ≈ |X| (for any X with |X| < n/2) |X| := ♯ qubits in X Almost maximal entanglement Exceptional Set

Area Law X XcXc ψ Def: ψ satisfies an area law if there is c > 0 s.t. for every region X, S(X) ≤ c Area(X) Area(X) Entanglement is Holographic

Area Law X XcXc ψ Def: ψ satisfies an area law if there is c > 0 s.t. for every region X, S(X) ≤ c Area(X) Area(X) When do we expect an area law? Low-energy states of many-body local models Entanglement is Holographic H ij

Area Law X XcXc ψ Def: ψ satisfies an area law if there is c > 0 s.t. for every region X, S(X) ≤ c Area(X) Area(X) (Bombeli et al ’86) massless free scalar field (connection to Bekenstein-Hawking entropy ) (Vidal et al ‘03; Plenio et al ’05, …) XY model, quasi-free bosonic and fermionic models, … (Holzhey et al ‘94; Calabrese, Cardy ‘04) critical systems described by CFT (log correction) (Aharonov et al ‘09; Irani ‘10) 1D model with volume scaling of entanglement entropy! When do we expect an area law? Low-energy states of many-body local models Entanglement is Holographic H ij …

Why Area Law is Interesting? Connection to Holography. Interesting to study entanglement in physical states with an eye on quantum information processing. Area law appears to be connected to our ability to write- down simple Ansatzes for the quantum state. (e.g. tensor-network states) This is known rigorously in 1D:

Matrix Product States (Fannes, Nachtergaele, Werner ’92; Affleck, Kennedy, Lieb, Tasaki ‘87) D : bond dimension Only nD 2 parameters. Local expectation values computed in nD 3 time Variational class of states for powerful DMRG Generalization of product states (MPS with D=1)

MPS Area Law XY (Vidal ’03; Verstraete, Cirac ‘05) If ψ satisfies S(ρ X ) ≤ log(D) for all X, then it has a MPS description of bond dim. D (obs: must use Renyi entropies) For MPS, S(ρ X ) ≤ log(D)

Correlation Length X Z Correlation Function: ψ has correlation length ξ if for every regions X, Z: cor(X : Z) ψ ≤ 2 - dist(X, Z) / ξ Correlation Length: ρ For pure state Ψ

When there is a finite correlation length? (Araki ‘69) In 1D at any finite temperature T (for ρ = e -H/T /Z; ξ = O(1/T)) (Hastings ‘04) In any dim at zero temperature for gapped models (for groundstates; ξ = O(1/gap)) (Hastings ’11; Hamza et al ’12; …) In any dim for models with mobility gap (many-body localization) (Kliesch et al ‘13) In any dim at large enough T (Kastoryano et al ‘12) Steady-state of rapidly-mixing dissipative processes (e.g. gapped Liovillians)

Area Law from Correlation Length? X XcXc ψ

X XcXc That’s incorrect! Ex. For almost every n qubit state, but for all i in X c, Entanglement can be non-locally encoded (e.g. QECC, Topological Order) ψ

Area Law from Correlation Length? XYZ Suppose.

Area Law from Correlation Length? XYZ Suppose. Then X is only entangled with Y l

Area Law from Correlation Length? XYZ Suppose. Then X is only entangled with Y But there are states (data hiding, quantum expanders) for which Cor(X:Y) <= 2 -l and Small correlations in a fixed partition doesn’t mean anything l

Area Law in 1D? Gapped Ham Finite Correlation Length Area Law MPS Representation ??? (Hastings ’04) Vidal ‘03

Area Law in 1D Gapped Ham Finite Correlation Length Area Law MPS Representation ??? (Hastings ’07) (Hastings ’04) Vidal ‘03 thm (Hastings ‘07) For H with spectral gap Δ and unique groundstate Ψ 0, for every region X, S(X) ψ ≤ exp(c / Δ) X (Arad, Kitaev, Landau, Vazirani ‘12) S(X) ψ ≤ c / Δ

Area Law in 1D Gapped Ham Finite Correlation Length Area Law MPS Representation ??? (Hastings ’07) (Hastings ’04) Vidal ‘03 (Rev. Mod. Phys. 82, 277 (2010)) “Interestingly, states that are defined by quantum expanders can have exponentially decaying correlations and still have large entanglement, as has been proven in (…)”

Correlation Length vs Entanglement I thm 1 (B., Horodecki ‘12) Let be a quantum state in 1D with correlation length ξ. Then for every X, X The statement is only about quantum states, no Hamiltonian involved. Applies to gapless models with finite correlation length e.g. systems with mobility gap (many-body localization)

Correlation Length vs Entanglement II thm 2 Let be quantum states in 1D with correlation length ξ. Then for every k and X, Applies to 1D gapped Hamiltonians with degenerate groundstates

Correlation Length vs Entanglement II Def: have correlation length ξ if for every i and regions X, Z: cor P (X : Z) ψi ≤ 2 - dist(X, Z) / ξ with and thm 2 Let be quantum states in 1D with correlation length ξ. Then for every k and X, Applies to 1D gapped Hamiltonians with degenerate groundstates

Application: Adiabatic Quantum Computing in 1D Quantum computing by dragging: Prepare ψ(0) and adiabatically change H(s) to obtain ψ(s f ) (Aharonov et al ‘08) Universal in 1D with unique groundstate and Δ > 1/poly(n) (Hastings ‘09) Non-universal in 1D with unique groundstate and constant Δ (Bacon, Flammia ‘10) Universal in 1D with exponentially many groundstates and constant Δ … cor: Adiabatic computation using 1D gapped H(s) with N groundstates can be simulated classically in time exp(N)poly(n) H(0) ψ 0 H(s f ) H(s)ψ s = E 0,s ψ s Δ := min Δ(s) H(s) ψ s

Correlation Length vs Entanglement III thm 3 Let be a mixed quantum state in 1D with correlation length ξ. Let. Then Implies area law for thermal states at any non-zero temperature

Summing Up Area law always holds in 1D whenever there is a finite correlation length: Groundstates (unique or degenerate) of gapped models Groundstates of models with mobility gap (many-body localization) Thermal states at any non-zero temperature Steady-state of gapped dissipative dynamics Implies that in all such cases the state has an efficient classical parametrization as a MPS (Useful for numerics – e.g. DMRG. Limitations for quantum information processing)

Proof Idea X We want to bound the entropy of X using the fact the correlation length of the state is finite. Need to relate entropy to correlations.

Entanglement Distillation Consists of extracting EPR pairs from bipartite entangled states by Local Operations and Classical Communication (LOCC) Central task in quantum information processing for distributing entanglement over large distances (e.g. entanglement repeater) (Pan et al ’03) LOCC

Optimal Entanglement Distillation Protocol We apply entanglement distillation to show large entropy implies large correlations Entanglement distillation: Given Alice can distill -S(A|B) = S(B) – S(AB) EPR pairs with Bob by making a measurement with N≈ 2 I(A:E) elements, with I(A:E) := S(A) + S(E) – S(AE), and communicating the outcome to Bob. (Devetak, Winter ‘04) A BE

l X Y Z B E A Distillation Bound

l X Y Z S(X) – S(XZ) > 0 (EPR pair distillation rate) Prob. of getting one of the 2 I(X:Y) outcomes B E A

Area Law from “Subvolume Law” l X Y Z

l X Y Z

l X Y Z Suppose S(Y) < l/(4ξ) (“subvolume law” assumption) Since I(X:Y) < 2S(Y) < l/(2ξ), a correlation length ξ implies Cor(X:Z) < 2 -l/ξ < 2 -I(X:Y) Thus: S(X) < S(Y)

Actual Proof We apply the bound from entanglement distillation to prove finite correlation length -> Area Law in 3 steps: c. Get area law from finite correlation length under assumption there is a region with “subvolume law” b. Get region with “subvolume law” from finite corr. length and assumption there is a region of “small mutual information” a. Show there is always a region of “small mutual info” Each step uses the assumption of finite correlation length.

Area Law in Higher Dim? Wide open… Preliminary Result: It follows from stronger notion of decay of correlations X Z ψ Measurement on site k : postselected state after measurement on sites (1,…, k) with outcomes (i 1, …, i k ) Do ”physical states” satisfy it??

Product States A quantum state ψ of n qubits is a vector in ≅ Almost maximal entanglement Exceptional Set: Low Entanglement

Product States A quantum state ψ of n qubits is a vector in ≅ Almost maximal entanglement Exceptional Set: Low Entanglement No Entanglement

Approximation Scale We want to approximate the minimum energy (i.e. minimum eigenvalue of H): Small total error: Small extensive error: E o (H) E o (H)+εlAre all these low-lying states entangled?

Mean-Field… …consists in approximating the groundstate by a product state Successful heuristic in Quantum Chemistry (Hartree-Fock) Condensed matter Intuition: Mean-Field good when Many-particle interactions Low entanglement in state It’s a mapping from quantum to classical Hamiltonians

Product-State Approximation with Symmetry (Raggio, Werner ’89) Hamiltonians on the complete graph H ij (Kraus, Lewenstein, Cirac ’12) Translational and rotational symmetric Hamiltonians in D dimensions: H ij

Product-State Approximation without Symmetry (B., Harrow ‘12) Let H be a 2-local Hamiltonian on qudits with interaction graph G(V, E) and |E| local terms. Let {X i } be a partition of the sites with each X i having m sites. E i : expectation over X i Deg : degree of G S(X i ) : entropy of groundstate in X i X1X1 X2X2 size m

Product-State Approximation without Symmetry (B., Harrow ‘12) Let H be a 2-local Hamiltonian on qudits with interaction graph G(V, E) and |E| local terms. Let {X i } be a partition of the sites with each X i having m sites. Then there are states ψ i in X i s.t. E i : expectation over X i Deg : degree of G S(X i ) : entropy of groundstate in X i X1X1 X2X2 size m

Approximation in terms of degree 1-D 2-D 3-D ∞-D …shows mean field becomes exact in high dim

The Quantum PCP Conjecture (Kitaev ‘99, …., Gottesman-Irani ‘10) Groundstates of 1D translational- invariant models are as complex as groundstates of any local Ham. QMA-hardness theory main achievement: Ansatz for GS 1D TI Ham. Ansatz for GS any Ham.

The Quantum PCP Conjecture Quantum PCP conjecture There are models for which all states of energy below E 0 + εm are as complex as groundstates of any local Ham. Ansatz with small extensive error (state ψ for which ) Ansatz with small total error (state ψ for which ) PCP Theorem (Arora et al ‘98) For classical Hamiltonians, to find a configuration of energy E 0 + εm is as hard as finding the minimum energy configuration. Can we “quantize” the the PCP theorem?

Approximation in terms of degree Implications to the quantum PCP problem : Limits the range of possible ε for which the conjecture might be true. Shows that attempts to “quantize” known proofs of the classical PCP theorem (e.g. (Arad et al ’08) ) cannot work.

Approximation in terms of average entanglement Product-states do a good job if entanglement of groundstate satisfies a subvolume law: X1X1 X3X3 X2X2 m < O(log(n))

Approximation in terms of average entanglement If we have

Approximation in terms of average entanglement If we have In constrast, if merely, the theorem shows product states give error

Intuition: Monogamy of Entanglement Quantum correlations are non-shareable (e.g. (|0, 0> + |1, 1>)/√2) Idea behind QKD: Eve cannot be correlated with Alice and Bob Cannot be highly entangled with too many neighbors S(X i ) quantifies how much entangled X i can be with the rest Proof uses quantum information-theoretic techniques to make this intuition precise

Mutual Information 1.Mutual Information 1.Pinsker’s inequality 1.Conditional MI 1.Chain Rule 5.Upper bound 4+5 for some t ≤ k

Quantum Mutual Information 1.Mutual Information 1.Pinsker’s inequality 1.Conditional MI 1.Chain Rule 5.Upper bound 4+5 for some t ≤ k

But… …conditioning on quantum is problematic For X, Y, Z random variables No similar interpretation is known for I(X:Y|Z) with quantum Z

Conditioning Decouples Idea that almost works. Suppose we have a distribution p(z 1,…,z n ) 1. Choose i, j 1, …, j k at random from {1, …, n}. Then there exists t<k such that Define So i j1j1 j2j2 jkjk

Conditioning Decouples 2. Conditioning on subsystems j 1, …, j t causes, on average, error <k/n and leaves a distribution q for which, and so By Pinsker: j1j1 jtjt j2j2 Choosing k = εn

Informationally Complete Measurements There exists a POVM M( ρ ) = Σ k tr(M k ρ ) |k><k| s.t. for all k and ρ 1…k, σ 1…k in D((C d )  k ) (Lacien, Winter ‘12, Montanaro ‘12)

Proof Overview 1.Measure εn qudits with M and condition on outcomes. Incur error ε. 2.Most pairs of other qudits would have mutual information ≤ log(d) / ε deg(G) if measured. 3.Thus their state is within distance d 3 (log(d) / ε deg(G)) 1/2 of product. 4.Witness is a global product state. Total error is ε + d 6 (log(d) / ε deg(G)) 1/2. Choose ε to balance these terms. 5.General case follows by coarse graining sites (can replace log(d) by E i H(X i ))

Classical from Quantum How the classical world we perceive emerges from quantum mechanics? Decoherence: lost of coherence due to interactions with environment

Classical from Quantum How the classical world we perceive emerges from quantum mechanics? Decoherence: lost of coherence due to interactions with environment We only learn information about a quantum system indirectly by accessing a small part of its environment. E.g. we see an object by observing a tiny fraction of its photon environment

Quantum Darwinism in a Nutshell Objectivity of observables: Observers accessing a quantum system by proving part of its environment can only learn about the measurement of a preferred observer Objectivity of outcomes: Different observes accessing different parts of the environment have almost full information about the preferred observable and agree on what they observe only contains information about the measurement of on And almost all B j have close to full information about the outcome of the measurement (Zurek ’02; Blume-Kohout, Poulin, Riedel, Zwolak, ….)

Quantum Darwinism: Examples (Riedel, Zurek ‘10) Dieletric sphere interacting with photon bath: Proliferation of information about the position of the sphere (Blume-Kohout, Zurek ‘07) Particle in brownian motion (bosonic bath): Proliferation of information about position of the particle Is quantum Darwinism a general feature of quantum mechanics? No : Let For very mixing evolutions U = e -i t H, is almost maximally mixed for B j as big as half total system size Information is hidden (again, QECC is an example) …

Objectivity of Observables is Generic thm (B., Piani, Horodecki ‘13) For every, there exists a measurement {M_j} on S such that for almost all k, Proof by monogamy of entanglement and quantum information-theoretic techniques (similar to before)

Summary Thinking about entanglement from the perspective of quantum information theory is useful. Growing body of connections between concepts/techniques in quantum information science and other areas of physics. Thanks!