Stronger Subadditivity Fernando G.S.L. Brandão University College London -> Microsoft Research Coogee 2015 based on arXiv:1411.4921 with Aram Harrow Jonathan.

Slides:



Advertisements
Similar presentations
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,
Advertisements

Equilibration and Unitary k- Designs Fernando G.S.L. Brandão UCL Joint work with Aram Harrow and Michal Horodecki arXiv: IMS, September 2013.
I NFORMATION CAUSALITY AND ITS TESTS FOR QUANTUM COMMUNICATIONS I- Ching Yu Host : Prof. Chi-Yee Cheung Collaborators: Prof. Feng-Li Lin (NTNU) Prof. Li-Yi.
Monogamy of Quantum Entanglement Fernando G.S.L. Brandão ETH Zürich Princeton EE Department, March 2013.
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,
Erasing correlations, destroying entanglement and other new challenges for quantum information theory Aram Harrow, Bristol Peter Shor, MIT quant-ph/
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,
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.
New Variants of the Quantum de Finetti Theorem with Applications Fernando G.S.L. Brandão ETH Zürich Based on joint work with Aram Harrow Arxiv:
Quantum Hammersley-Clifford Theorem Winton Brown CRM-Workshop on quantum information in Quantum many body physics 2011.
CS774. Markov Random Field : Theory and Application Lecture 04 Kyomin Jung KAIST Sep
Chapter 6 Information Theory
Network Coding Theory: Consolidation and Extensions Raymond Yeung Joint work with Bob Li, Ning Cai and Zhen Zhan.
Gate robustness: How much noise will ruin a quantum gate? Aram Harrow and Michael Nielsen, quant-ph/0212???
Avraham Ben-Aroya (Tel Aviv University) Oded Regev (Tel Aviv University) Ronald de Wolf (CWI, Amsterdam) A Hypercontractive Inequality for Matrix-Valued.
A Family of Quantum Protocols Igor Devetak, IBM Aram Harrow, MIT Andreas Winter, Bristol quant-ph/ IEEE Symposium on Information Theory June 28,
Quantum Algorithms II Andrew C. Yao Tsinghua University & Chinese U. of Hong Kong.
Erasing correlations, destroying entanglement and other new challenges for quantum information theory Aram Harrow, Bristol Peter Shor, MIT quant-ph/
EECS 598 Fall ’01 Quantum Cryptography Presentation By George Mathew.
Shengyu Zhang The Chinese University of Hong Kong.
T he Separability Problem and its Variants in Quantum Entanglement Theory Nathaniel Johnston Institute for Quantum Computing University of Waterloo.
Quantum Shannon Theory Patrick Hayden (McGill) 17 July 2005, Q-Logic Meets Q-Info.
Quantum Information Theory in Quantum Hamiltonian Complexity Aram Harrow (MIT) Simons Institute 16 Jan 2014.
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,
ENTROPIC CHARACTERISTICS OF QUANTUM CHANNELS AND THE ADDITIVITY PROBLEM A. S. Holevo Steklov Mathematical Institute, Moscow.
The Operational Meaning of Min- and Max-Entropy
Entangling without Entanglement T. Cubitt, F. Verstraete, W. Dür, J. I. Cirac “Separable State can be used to Distribute Entanglement” (to appear in PRL.
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,
On the Dimension of Subspaces with Bounded Schmidt Rank Toby Cubitt, Ashley Montanaro, Andreas Winter and also Aram Harrow, Debbie Leung (who says there's.
Thermalization and Quantum Information Fernando G.S.L. Brandão University College London New Perspectives on Thermalization, Aspen 2014 partially based.
The private capacities of a secret shared reference frame Patrick Hayden (McGill) with: PRA 75: (2005) ??? Stephen Bartlett Robert Spekkens arXiv:quant-ph/
The Operational Meaning of Min- and Max-Entropy Christian Schaffner – CWI Amsterdam, NL joint work with Robert König – Caltech Renato Renner – ETH Zürich,
Quantum Gibbs Samplers Fernando G.S.L. Brandão QuArC, Microsoft Research Based on joint work with Michael Kastoryano University of Copenhagen Quantum Hamiltonian.
Counterexamples to the maximal p -norm multiplicativity conjecture Patrick Hayden (McGill University) || | | N(½)N(½) p C&QIC, Santa Fe 2008.
A reversible framework for entanglement and other resource theories Fernando G.S.L. Brandão Universidade Federal de Minas Gerais, Brazil Martin B. Plenio.
A limit on nonlocality in any world in which communication complexity is not trivial IFT6195 Alain Tapp.
Entanglement sampling and applications Omar Fawzi (ETH Zürich) Joint work with Frédéric Dupuis (Aarhus University) and Stephanie Wehner (CQT, Singapore)
Coherent Communication of Classical Messages Aram Harrow (MIT) quant-ph/
The Complexity of Quantum Entanglement Fernando G.S.L. Brandão ETH Zürich Based on joint work with M. Christandl and J. Yard Journees Deferation de Reserche.
The Classically Enhanced Father Protocol
Information Complexity: an Overview Rotem Oshman, Princeton CCI Based on work by Braverman, Barak, Chen, Rao, and others Charles River Science of Information.
Optimal Trading of Classical Communication, Quantum Communication, and Entanglement Mark M. Wilde arXiv: ERATO-SORST Min-Hsiu Hsieh 4 th Workshop.
A generalization of quantum Stein’s Lemma Fernando G.S.L. Brandão and Martin B. Plenio Tohoku University, 13/09/2008.
The question Can we generate provable random numbers? …. ?
Coherent Classical Communication Aram Harrow, MIT Quantum Computing Graduate Research Fellow Objective Objective ApproachStatus Determine.
On Minimum Reversible Entanglement Generating Sets Fernando G.S.L. Brandão Cambridge 16/11/2009.
SDP hierarchies and quantum states Aram Harrow (MIT)Simons Institute
Operator norms & covering nets Fernando Brandão (UCL/MSR) Aram Harrow (MIT) QIP arXiv:
Secret Sharing Non-Shannon Information Inequalities Presented in: Theory of Cryptography Conference (TCC) 2009 Published in: IEEE Transactions on Information.
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.
Coherent Communication of Classical Messages Aram Harrow (MIT) quant-ph/
Boaz Barak (MSR New England) Fernando G.S.L. Brandão (Universidade Federal de Minas Gerais) Aram W. Harrow (University of Washington) Jonathan Kelner (MIT)
Compression for Fixed-Width Memories Ori Rottenstriech, Amit Berman, Yuval Cassuto and Isaac Keslassy Technion, Israel.
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.
The Concavity of the Auxiliary Function for Classical-Quantum Channels Speaker: Hao-Chung Cheng Co-work: Min-Hsiu Hsieh Date: 01/09/
Random Access Codes and a Hypercontractive Inequality for
Fernando G.S.L. Brandão and Martin B. Plenio
Information Complexity Lower Bounds
Fernando G.S.L. Brandão Microsoft Research MIT 2016
Quantum de Finetti theorems for local measurements
Information-Theoretical Analysis of the Topological Entanglement Entropy and Multipartite correlations Kohtaro Kato (The University of Tokyo) based on.
Unconstrained distillation capacities of
Effcient quantum protocols for XOR functions
Linear sketching over
ALGEBRA 1.6 Inequalities.
Presentation transcript:

Stronger Subadditivity Fernando G.S.L. Brandão University College London -> Microsoft Research Coogee 2015 based on arXiv: with Aram Harrow Jonathan Oppenheim Sergii Strelchuk

Strong Subadditivity (Lieb and Ruskai ‘73) For ρ CRB Conjectured by (Robinson, Ruelle ’66) and ( Lanford, Robinson ’68)

Strong Subadditivity (Lieb and Ruskai ‘73) For ρ CRB Equivalent to data processing: For every ρ, σ and channel Λ Relative Entropy: Several applications in quantum information theory and beyond E.g. used to prove converses for almost all protocols (channel capacity, entanglement distillation, key distribution)

Strong Subadditivity (Lieb and Ruskai ‘73) For ρ CRB Equivalent to data processing: For every ρ, σ and channel Λ Many different proofs: Petz ’84 Carlen, Lieb ‘99 Nielsen, Petz ’04 Devetak, Yard ’06 Ruskai ’06 Kim ’12 Beaudry, Renner ’11 Headrick, Takayanagi ‘07

Strong Subadditivity and CMI (Lieb and Ruskai ‘73) For ρ CRB Conditional Mutual Information (CMI) By SSA:

Strong Subadditivity and CMI (Lieb and Ruskai ‘73) For ρ CRB Conditional Mutual Information (CMI) By SSA: Can we have a stronger subadditivity? I.e. Is there a positive non-identically-zero function f s.t.

For a probability distribution p XYZ : CMI for Probability Distributions

For a probability distribution p XYZ : and MC := {q : x-z-y form a Markov chain} CMI for Probability Distributions Relative entropy:

For a probability distribution p XYZ : and MC := {q : x-z-y form a Markov chain} CMI for Probability Distributions Relative entropy: Since (Pinsker’s inequality), I(X:Y|Z) ≤ε implies p is O(ε 1/2 ) close to a Markov chain

For a probability distribution p XYZ : and MC := {q : x-z-y form a Markov chain} CMI for Probability Distributions Relative entropy: Since (Pinsker’s inequality), I(X:Y|Z) ≤ε implies p is O(ε 1/2 ) close to a Markov chain How about for quantum states? We don’t know how to condition on quantum information… The second equality could still work. But what is the set of “quantum Markov chains”? ???

Quantum Markov States Classical: i) x-z-y Markov if x and y are independent conditioned on z ii) x-z-y Markov iff there is a channel Λ : Z -> YZ s.t. Λ(p XZ ) = 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

Quantum Markov States Classical: i) x-z-y Markov if x and y are independent conditioned on z ii) x-z-y Markov if there is a channel Λ : Z -> YZ s.t. Λ(p XZ ) = 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 Z Λ X Z Y

Quantum Markov States Classical: i) x-z-y Markov if x and y are independent conditioned on z ii) x-z-y Markov if there is a channel Λ : Z -> YZ s.t. Λ(p XZ ) = p XYZ Quantum: i) ρ CRB Markov quantum state if 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

Quantum Markov States Classical: i) x-z-y Markov if x and y are independent conditioned on z ii) x-z-y Markov if there is a channel Λ : Z -> YZ s.t. Λ(p XZ ) = p XYZ Quantum: i) ρ CRB Markov quantum state if C and R are independent conditioned on B, i.e. and ii)ρ CRB Markov if there is channel Λ : B -> RB s.t. Λ(ρ CB ) = ρ CRB

Quantum Markov States vs CMI (Hayden, Jozsa, Petz, Winter ’03) I(C:R|B)=0 iff ρ CRB is quantum Markov

Quantum Markov States vs CMI (Hayden, Jozsa, Petz, Winter ’03) I(C:R|B)=0 iff ρ CRB is quantum Markov obs:

Applications (Brown and Poulin ’12, …) (Quantum Hammersley-Clifford thm ) Every many body state with vanishing CMI is the Gibbs state of a commuting model (on triangle-free graphs) Useful in Quantum Belief Propagation (Hastings, Poulin ‘10) (Lewin and Wen ‘06) CMI is equal to twice topological entanglement entropy. If, I(A:C|B) = 2γ (Kitaev, unpublished) If γ=0, the state (+ ancilas) can be created by a constant depth circuit What if merely CMI ≈ 0? (Ex. ) A C BB

CMI vs Quantum Markov States Does ? or just ? QMC := { σ CRB : }

CMI vs Quantum Markov States Does ? or just ? QMC := { σ CRB : } (Ibinson, Linden, Winter ’06; Christandl, Schuch, Winter ‘11) If ρ CRB is QMC, ρ CR is separable ( ) For an extension ρ CRB of the d x d anti-symmetric state ρ CR, NO!

One Stronger Subadditivity (B., Christandl, Yard ’10; Li, Winter ’12; B., Harrow, Lee, Peres ‘13)

Applications: quasipolynomial-time algorithm for testing separability, faithfulness squashed entanglement, SoS hierarchy, etc… One Stronger Subadditivity

(B., Christandl, Yard ’10; Li, Winter ’12; B., Harrow, Lee, Peres ‘13) Applications: quasipolynomial-time algorithm for testing separability, faithfulness squashed entanglement, SoS hierarchy, etc… How about the distance to QMC? Open question: ? One Stronger Subadditivity

Approximate Reconstruction “Small CMI” and “being close to QMC state” are not equivalent (in a dimensional independent way for trace norm or fidelity) Classically: Conjecture (I. Kim, A. Kitaev, L. Zhang, …) or just

Approximate Reconstruction “Small CMI” and “being close to QMC state” are not equivalent (in a dimensional independent way for trace norm or fidelity) Classically: Conjecture (I. Kim, A. Kitaev, L. Zhang, …) or just Conjecture (A. Kitaev; I. Kim; L. Zhang; Berta, Seshadreesan, Wilde, …) or

Fawzi-Renner Inequality thm (Fawzi, Renner ’14) Fidelity: ½ Renyi Relative Entropy: We have: Weaker than classical inequality

Strengthening of Fawzi-Renner thm (B., Harrow, Oppenheim, Strelchuk ‘14)

Strengthening of Fawzi-Renner

thm (B., Harrow, Oppenheim, Strelchuk ‘14) Strengthening of Fawzi-Renner For classical ρ BCR, we recover the original bound on CMI:

thm (B., Harrow, Oppenheim, Strelchuk ‘14) Strengthening of Fawzi-Renner For, big gap:

thm (B., Harrow, Oppenheim, Strelchuk ‘14) From: and Strengthening of Fawzi-Renner

thm (B., Harrow, Oppenheim, Strelchuk ‘14) From: and From: Properties relative entropy (Piani ‘09) Strengthening of Fawzi-Renner

thm (B., Harrow, Oppenheim, Strelchuk ‘14) From: and From: Properties relative entropy (Piani ‘09) From: State Redistribution Protocol (Devetak, Yard ‘04) Strengthening of Fawzi-Renner

Comparison Lower Bounds on CMI 1.State Redistribution: 1.Hypothesis Testing: Regularized relative entropy of entanglement: 1.State Redistribution: 2. Hypothesis Testing:

State Redistribution AliceBob A C Reference BR X Y

State Redistribution AliceBob Reference A C BR X Y (Devetak, Yard ‘06) Optimal quantum communication rate: ½ I(C:R|B) I.e. there exist encodings E n : A n C n X n -> A n G n and decodings D n : B n G n Y n -> B n C n s.t.

Proof of … Idea: Consider the optimal state redistribution protocol and replace the quantum communication by white noise (maximally mixed state) …

Proof of … Idea: Consider the optimal state redistribution protocol and replace the quantum communication by white noise (maximally mixed state) After encoding: …

Proof of … Idea: Consider the optimal state redistribution protocol and replace the quantum communication by white noise (maximally mixed state) After encoding: As and …

Proof of … Idea: Consider the optimal state redistribution protocol and replace the quantum communication by white noise (maximally mixed state) After encoding: As and By op monotonicity of the log: 0 …

Multiplicativity Fidelity of Recovery (Berta, Tomamichel ‘15) Let: Can get Fawzi-Renner bound as follows:

Open questions: Improve bound to relative entropy (like the classical) Prove the bound for the transpose channel Prove Li-Winter conjecture: For every states ρ, σ and channel Λ there is a channel Γ s.t. Γ(Λ(σ)) = σ and see (Berta, Lemm, Wilde ‘14) for partial progress Find (more) applications of the FR inequality! Find more improvements of SSA; see (Kim ‘12) for another (dis)Prove: