On Minimum Reversible Entanglement Generating Sets Fernando G.S.L. Brandão Cambridge 16/11/2009.

Slides:



Advertisements
Similar presentations
Multilinear Formulas and Skepticism of Quantum Computing Scott Aaronson UC Berkeley IAS.
Advertisements

Limitations of Quantum Advice and One-Way Communication Scott Aaronson UC Berkeley IAS Useful?
The Complexity of Agreement A 100% Quantum-Free Talk Scott Aaronson MIT.
Ulams Game and Universal Communications Using Feedback Ofer Shayevitz June 2006.
Tony Short University of Cambridge (with Sabri Al-Safi – PRA 84, (2011))
Boyce/DiPrima 9th ed, Ch 2.8: The Existence and Uniqueness Theorem Elementary Differential Equations and Boundary Value Problems, 9th edition, by William.
1 Decomposing Hypergraphs with Hypertrees Raphael Yuster University of Haifa - Oranim.
Introduction to Entanglement Allan Solomon, Paris VI.
Quantum Computing MAS 725 Hartmut Klauck NTU
Lecture 24 Coping with NPC and Unsolvable problems. When a problem is unsolvable, that's generally very bad news: it means there is no general algorithm.
Frustration of Decoherence and Entanglement-sharing in the Spin-bath Andrew Hines Christopher Dawson Ross McKenzie Gerard Milburn.
UCL, 23 Feb 2006 UCL, 23 Feb 2006 Entanglement Probability Distribution of Random Stabilizer States Oscar C.O. Dahlsten Martin B. Plenio.
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/
Separable States can be Used to Distribute Entanglement Toby Cubitt 1, Frank Verstraete 1, Wolfgang Dür 2, and Ignacio Cirac 1 1 Max Planck Institüt für.
Stronger Subadditivity Fernando G.S.L. Brandão University College London -> Microsoft Research Coogee 2015 based on arXiv: with Aram Harrow Jonathan.
The main idea of the article is to prove that there exist a tester of monotonicity with query and time complexity.
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.
13. The Weak Law and the Strong Law of Large Numbers
Oded Regev (Tel Aviv University) Ben Toner (CWI, Amsterdam) Simulating Quantum Correlations with Finite Communication.
1 More Applications of the Pumping Lemma. 2 The Pumping Lemma: Given a infinite regular language there exists an integer for any string with length we.
CSEP 590tv: Quantum Computing
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.
T he Separability Problem and its Variants in Quantum Entanglement Theory Nathaniel Johnston Institute for Quantum Computing University of Waterloo.
Is Communication Complexity Physical? Samuel Marcovitch Benni Reznik Tel-Aviv University arxiv
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)
Generalized Deutsch Algorithms IPQI 5 Jan Background Basic aim : Efficient determination of properties of functions. Efficiency: No complete evaluation.
A Few Simple Applications to Cryptography Louis Salvail BRICS, Aarhus University.
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.
College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson.
Motivation and goals One particle, two particles: previous work Three particles: flow through particles Many particles: flow along networks Application:
Test for entanglement: realignment criterion, entanglement witness and positive maps Kai Chen † CQIQC, Toronto, July 2004 † Kai Chen is now a postdoctoral.
PROBABILITY AND STATISTICS FOR ENGINEERING Hossein Sameti Department of Computer Engineering Sharif University of Technology The Weak Law and the Strong.
Quantum information Theory: Separability and distillability SFB Coherent Control €U TMR J. Ignacio Cirac Institute for Theoretical Physics University of.
The Integers. The Division Algorithms A high-school question: Compute 58/17. We can write 58 as 58 = 3 (17) + 7 This forms illustrates the answer: “3.
Quantum Teleportation and Bit Commitment Chi-Yee Cheung Chung Yuan Christian University June 9, 2009.
A reversible framework for entanglement and other resource theories Fernando G.S.L. Brandão Universidade Federal de Minas Gerais, Brazil Martin B. Plenio.
You Did Not Just Read This or did you?. Quantum Computing Dave Bacon Department of Computer Science & Engineering University of Washington Lecture 3:
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)
March 24, 2006 Fixed Point Theory in Fréchet Space D. P. Dwiggins Systems Support Office of Admissions Department of Mathematical Sciences Analysis Seminar.
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.
Quantum Entanglement and Distillation in Information Processing Shao-Ming Fei
Unraveling Entanglement O. Brodier M. Busse, C. Viviescas, A. R. R. Carvalho, A. Buchleitner M.P.I.P.K.S. Nöthnitzer Str. 38, D DRESDEN, ALLEMAGNE.
Detecting Incapacity Graeme Smith IBM Research Joint Work with John Smolin QECC 2011 December 6, 2011 TexPoint fonts used in EMF. Read the TexPoint manual.
A generalization of quantum Stein’s Lemma Fernando G.S.L. Brandão and Martin B. Plenio Tohoku University, 13/09/2008.
CS 203: Introduction to Formal Languages and Automata
Coherent Classical Communication Aram Harrow, MIT Quantum Computing Graduate Research Fellow Objective Objective ApproachStatus Determine.
1 Conference key-agreement and secret sharing through noisy GHZ states Kai Chen and Hoi-Kwong Lo Center for Quantum Information and Quantum Control, Dept.
Multipartite Entanglement and its Role in Quantum Algorithms Special Seminar: Ph.D. Lecture by Yishai Shimoni.
Quantum Cryptography Antonio Acín
B OUNDS ON E NTANGLEMENT D ISTILLATION & S ECRET K EY A GREEMENT C APACITIES FOR Q UANTUM B ROADCAST C HANNELS Kaushik P. Seshadreesan Joint work with.
Coherent Communication of Classical Messages Aram Harrow (MIT) quant-ph/
Debasis Sarkar * Department of Applied Mathematics, University of Calcutta *
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.
Density matrix and its application. Density matrix An alternative of state-vector (ket) representation for a certain set of state-vectors appearing with.
Extending a displacement A displacement defined by a pair where l is the length of the displacement and  the angle between its direction and the x-axix.
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.
Proof And Strategies Chapter 2. Lecturer: Amani Mahajoub Omer Department of Computer Science and Software Engineering Discrete Structures Definition Discrete.
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 and Martin B. Plenio
Twirling states to simplify separability
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
Presentation transcript:

On Minimum Reversible Entanglement Generating Sets Fernando G.S.L. Brandão Cambridge 16/11/2009

Quantum Entanglement

Cannot be created by local operations and classical communication ( LOCC )

LOCC asymptotic entanglement transformations

Bipartite pure state entanglement transformations Transformations are reversible ( Bennett, Bernstein, Popescu, Schumacher 96 ) Unique entanglement measure Entropy of Entanglement: The asymptotic limit is crucial!

Bipartite pure state entanglement transformations Transformations are reversible ( Bennett, Bernstein, Popescu, Schumacher 96 ) Unique entanglement measure Entropy of Entanglement: The asymptotic limit is crucial!

Bipartite pure state entanglement transformations Transformations are reversible ( Bennett, Bernstein, Popescu, Schumacher 96 ) Unique entanglement measure Entropy of Entanglement: The asymptotic limit is crucial

Multipartite pure state entanglement transformations A lice B ob C harlie

Multipartite pure state entanglement transformations There are inequivalent types of entanglement A lice B ob C harlie

Multipartite pure state entanglement transformations ??? A lice B ob C harlie

Multipartite pure state entanglement transformations A lice B ob C harlie (Linden, Popescu, Schumacher, Westmoreland 99)

?? Multipartite pure state entanglement transformations A lice B ob C harlie (Linden, Popescu, Schumacher, Westmoreland 99)

Multipartite pure state entanglement transformations A lice B ob C harlie (Linden, Popescu, Schumacher, Westmoreland 99) (Acin, Vidal, Cirac 02)

(Bennett, Popescu, Rohrlich, Smolin, Thapliyal 99) Is there a finite set of states such that This is the MREGS question... B ob A lice C harlie Multipartite pure state entanglement transformations ??? THIS TALK GOAL: To expose poor state of MREGS (Minimum Reversible Entanglement Generating Set)

MREGS We say is a MREGS if and N is the minimum number for which this holds Conjecture: There is no finite MREGS Rest of the talk: two arguments supporting the conjecture

No MREGS under 1-LOCC A lice B ob C harlie Theo 1: Under 1-way LOCC (Alice to Bob and Bob to Charlie), there is no finite MREGS for tripartite states of qubits (2 x 2 x 2 states)

Sometimes1-LOCC is enough For bipartite pure states 1-LOCC is enough (Bennett, Bernstein, Popescu, Schumacher 96) For the only two known classes of multipartite states for which a MREGS exist, 1-LOCC is enough 1.Schmidt decomposable states (Bennett, Popescu, Rohrlich, Smolin, Thapliyal): 2. The family (Vidal, Dür, Cirac):

Sometimes1-LOCC is enough For bipartite pure states 1-LOCC is enough (Bennett, Bernstein, Popescu, Schumacher 96) For the only two known classes of multipartite states for which a MREGS exist, 1-LOCC is enough 1.Schmidt decomposable states (Bennett, Popescu, Rohrlich, Smolin, Thapliyal): 2. The family (Vidal, Dür, Cirac):

Sometimes1-LOCC is enough For bipartite pure states 1-LOCC is enough (Bennett, Bernstein, Popescu, Schumacher 96) For the only two known classes of multipartite states for which a MREGS exist, 1-LOCC is enough 1.Schmidt decomposable states (Bennett, Popescu, Rohrlich, Smolin, Thapliyal): 2. The family (Vidal, Dür, Cirac 01):

(proof theo 1) Suppose there is a finite MREGS: From tripartite pure to bipartite mixed states

(proof theo 1) Suppose there is a finite MREGS: Since Charlie cannot communicate, we must have From tripartite pure to bipartite mixed states

(proof theo 1) Suppose there is a finite MREGS: Since Charlie cannot communicate, we must have Thus there must exist a mixed bipartite MREGS under 1-LOCC... but we can show it cannot exist!

k -Extendible States We say a state is k-extendible if there is a state such that for all j Only separable states are k-extendable for every k (Raggio and Werner 89)...and for every k there are k-extendable yet entangled states

k -Extendible States We say a state is k-extendable if there is a state such that for all j Only separable states are k-extendible for every k (Raggio and Werner 89)...and for every k there are k-extendable yet entangled states

k -Extendible States We say a state is k-extendable if there is a state such that for all j Only separable states are k-extendable for every k (Raggio and Werner 89)...and for every k there are k-extendible yet entangled states

k -Extendability is preserved by 1-LOCC ( ) the set of k-extendible states is preserved under 1-LOCC and under tensoring Let k max be the max. k such that all are k-ext. Take to be a (k max +1)-ext. state. QED 1-ext2-extSEP

k -Extendability is preserved by 1-LOCC ( ) the set of k-extendible states is preserved under 1-LOCC and under tensoring Let k max be the max. k such that all are k-ext. Take to be a (k max +1)-ext. state. QED 1-ext2-extSEP

Intermezzo: Interconverting two useless channels We just saw there are infinitely many different types of 1-LOCC undistillable states (namely, k-extendible states) By Jamiolkowski/Choi isomorphism, we find there are infinitely many inequivalent classes of zero-capacity channels too: There is an infinite sequence such that for all n, E.g. Erasure channel with 1/n erasure probability.

Intermezzo: Interconverting two useless channels We just saw there are infinitely many different types of 1-LOCC undistillable states (namely, k-extendible states) By Jamiolkowski/Choi isomorphism, we find there are infinitely many inequivalent classes of zero-capacity channels too: There is an infinite sequence such that for all n, E.g. Erasure channel with 1/n erasure probability.

No MREGS under LOCC? A lice B ob C harlie In the general case of unrestricted LOCC communication among the parties, all proof fails completely Reason: general LOCC do not preserve the sets of k-extendible states. Is there a good replacement for k-ext. states??

No MREGS under LOCC? A lice B ob C harlie Theo 2: Assuming a certain conjecture about bipartite mixed states, there is no MREGS for tripartite systems (already for 3 x 3 x 2).

There are infinitely many inequivalent types of bipartite entanglement, i.e. such that for all k, n The Conjecture

We know two classes: 1. distillable states: 2. bound entanglement: (Horodecki, Horodecki, Horodecki 98) Bound Entanglement

We know two classes: 1. distillable states: 2. bound entanglement: (Horodecki, Horodecki, Horodecki 98) The conjecture is really about bound entanglement: We want a sequence of bound entangled states s.t. Bound Entanglement

Why is it reasonable? “ The same evidences that we have for bound entangled Werner states with a non-positive partial transpose apply to the conjecture.” Namely Let For any n there is a non-zero interval (a, b) for which But the interval might shrink to zero when n grows.... Supporting the Conjecture

(proof sketch) Assume there is a finite MREGS As before, the strategy is to relate it to a problem about bipartite mixed states... The basic idea dates back to Linden, Popescu, Schumacher, Westmoreland 99 who used it to show that the GHZ state is not equivalent to EPR pairs. From Tripartite Pure to Bipartite Mixed, Again

The Relative Entropy Must Be Preserved Linden, Popescu, Schumacher, Westmoreland proved that implies where the regularized relative entropy of entanglement reads

Some New Entanglement Measures We do the same, but for infinitely many related measures. Let s.t. and define Where the asymptotic orbit of reads

The Relative Entropies Must Be Preserved We can show: If For all k The proof is an easy adaptation of the result of Popescu et al. (the measures have all the nice properties: monotone under LOCC, non-lockable, asymptotically continuous, subadditive,...)

One Last Nice Property From a result of B., Plenio 09 on extensions of quantum Stein’s Lemma we find The proof is the same as for the regularized relative entropy of entanglement. See also M. Piani 09.

The final part Assuming MREGS, we have 1) 2) Therefore there for every k there is a j such that But this cannot be, as by assumption there are only finitely many j. QED

The final part Assuming MREGS, we have 1) 2) Therefore there for every k there is a j such that But this cannot be, as by assumption there are only finitely many j. QED

The final part Assuming MREGS, we have 1) 2) Therefore for every k there is a j such that But this cannot be, as by assumption there are only finitely many j. QED

The final part Assuming MREGS, we have 1) 2) Therefore for every k there is a j such that But this cannot be, as by assumption there are only finitely many j. QED

Conclusion and Open Questions We showed that there is no finite MREGS 1. Under 1-LOCC 2. Assuming there are infinitely many classes of bipartite bound entanglement Open questions: 1. Is backward classical communication helpful? 2. Can we prove there are more than 2 types of of bound entanglement? Related to NPPTBE! 3. Is there a finite MREGS?

Thank you!