Quantum information and the monogamy of entanglement Aram Harrow (MIT) Brown SUMS March 9, 2013.

Slides:



Advertisements
Similar presentations
Quantum Computation and Quantum Information – Lecture 2
Advertisements

Random non-local games Andris Ambainis, Artūrs Bačkurs, Kaspars Balodis, Dmitry Kravchenko, Juris Smotrovs, Madars Virza University of Latvia.
Random non-local games Andris Ambainis, Artūrs Bačkurs, Kaspars Balodis, Dmitry Kravchenko, Juris Smotrovs, Madars Virza University of Latvia.
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.
QUANTUM MECHANICS Probability & Uncertainty 1.Probability 2.Uncertainty 3.Double-slit photons.
Quantum Cryptography ( EECS 598 Presentation) by Amit Marathe.
Nonlocal Boxes And All That Daniel Rohrlich Atom Chip Group, Ben Gurion University, Beersheba, Israel 21 January 2010.
Short course on quantum computing Andris Ambainis University of Latvia.
Some Limits on Non-Local Randomness Expansion Matt Coudron and Henry Yuen /12/12 God does not play dice. --Albert Einstein Einstein, stop telling.
Bell’s inequalities and their uses Mark Williamson The Quantum Theory of Information and Computation
Quantum Computing MAS 725 Hartmut Klauck NTU
Entanglement and Bell’s Inequalities Aaron Michalko Kyle Coapman Alberto Sepulveda James MacNeil Madhu Ashok Brian Sheffler.
6/9/2015Bell's Theorem1 Spooky Action at a Distance Bell’s Theorem and the Demise of Local Reality Natalia Parshina Peter Johnson Josh Robertson Denise.
QUANTUM CRYPTOGRAPHY Narayana D Kashyap Security through Uncertainty CS 265 Spring 2003.
Princeton University COS 433 Cryptography Fall 2007 Boaz Barak COS 433: Cryptography Princeton University Fall 2007 Boaz Barak Lecture 12: Idiot’s Guide.
Superdense coding. How much classical information in n qubits? Observe that 2 n  1 complex numbers apparently needed to describe an arbitrary n -qubit.
CNS2009handout 21 :: quantum cryptography1 ELEC5616 computer and network security matt barrie
Quantum Key Establishment Wade Trappe. Talk Overview Quantum Demo Quantum Key Establishment.
Princeton University COS 433 Cryptography Fall 2005 Boaz Barak COS 433: Cryptography Princeton University Fall 2005 Boaz Barak Lecture 12: Idiot’s Guide.
BB84 Quantum Key Distribution 1.Alice chooses (4+  )n random bitstrings a and b, 2.Alice encodes each bit a i as {|0>,|1>} if b i =0 and as {|+>,|->}
Quantum Mechanics from Classical Statistics. what is an atom ? quantum mechanics : isolated object quantum mechanics : isolated object quantum field theory.
Quantum Cryptography Prafulla Basavaraja CS 265 – Spring 2005.
Lo-Chau Quantum Key Distribution 1.Alice creates 2n EPR pairs in state each in state |  00 >, and picks a random 2n bitstring b, 2.Alice randomly selects.
Quantum Cryptography December, 3 rd 2007 Philippe LABOUCHERE Annika BEHRENS.
Quantum Computation and Quantum Information – Lecture 2 Part 1 of CS406 – Research Directions in Computing Dr. Rajagopal Nagarajan Assistant: Nick Papanikolaou.
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 Shannon Theory Patrick Hayden (McGill) 17 July 2005, Q-Logic Meets Q-Info.
1 Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871 Richard Cleve QNC 3129 Lecture 18 (2014)
Physics is becoming too difficult for physicists. — David Hilbert (mathematician)
Quantum Information, Communication and Computing Jan Kříž Department of physics, University of Hradec Králové Doppler Institute for mathematical physics.
1 Introduction to Quantum Information Processing QIC 710 / CS 667 / PH 767 / CO 681 / AM 871 Richard Cleve DC 2117 Lecture 16 (2011)
A Few Simple Applications to Cryptography Louis Salvail BRICS, Aarhus University.
Paraty, Quantum Information School, August 2007 Antonio Acín ICFO-Institut de Ciències Fotòniques (Barcelona) Quantum Cryptography (III)
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 2117 Lecture.
1 Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871 Richard Cleve DC 2117 Lecture 19 (2009)
QCCC07, Aschau, October 2007 Miguel Navascués Stefano Pironio Antonio Acín ICFO-Institut de Ciències Fotòniques (Barcelona) Cryptographic properties of.
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.
Device-independent security in quantum key distribution Lluis Masanes ICFO-The Institute of Photonic Sciences arXiv:
Quantum Cryptography Zelam Ngo, David McGrogan. Motivation Age of Information Information is valuable Protecting that Information.
Borsós, K.; Benedict, M. G. University of Szeged, Szeged, Hungary Animation of experiments in modern quantum physics Animation of experiments in modern.
Introduction to Quantum Key Distribution
CS555Topic 251 Cryptography CS 555 Topic 25: Quantum Crpytography.
What is Qu antum In formation and T echnology? Prof. Ivan H. Deutsch Dept. of Physics and Astronomy University of New Mexico Second Biannual Student Summer.
Quantum Cryptography Slides based in part on “A talk on quantum cryptography or how Alice outwits Eve,” by Samuel Lomonaco Jr. and “Quantum Computing”
Quantum Mechanics1 Schrodinger’s Cat. Quantum Mechanics2 A particular quantum state, completely described by enough quantum numbers, is called a state.
Nawaf M Albadia
CENTER FOR EXOTIC QUANTUM SYSTEMS CEQS Preskill 1983 Kitaev 2002 Refael 2005 Motrunich 2006 Fisher 2009 Historically, Caltech physics has focused on the.
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.
Page 1 COMPSCI 290.2: Computer Security “Quantum Cryptography” including Quantum Communication Quantum Computing.
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.
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.
An Introduction to Quantum Computation Sandy Irani Department of Computer Science University of California, Irvine.
Non-Locality Swapping and emergence of quantum correlations Nicolas Brunner Paul Skrzypczyk, Sandu Popescu University of Bristol.
A1 “BASIC QUANTUM MECHANICS, AND SOME SURPRISING CONSEQUENCES” Anthony J. Leggett Department of Physics University of Illinois at Urbana-Champaign.
Lecture 11: Quantum Cryptography Wayne Patterson SYCS 654 Spring 2009.
Secret keys and random numbers from quantum non locality Serge Massar.
Beginner’s Guide to Quantum Computing Graduate Seminar Presentation Oct. 5, 2007.
Non-locality and quantum games Dmitry Kravchenko University of Latvia Theory days at Jõulumäe, 2008.
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 information and the monogamy of entanglement Aram Harrow MIT (UCL until Jan 2015)
COMPSCI 290.2: Computer Security
Paul M. Dooley Tamer Tayea Wenlin Zhou Ian M. Johson Joshua Tarlow
Quantum Information Promises new insights Anthony J
Quantum Cryptography Alok.T.J EC 11.
Lecture on Linear Algebra
Quantum Information Theory Introduction
Quantum Mechanics and atomic structure
Quantum Technology programme
Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Lecture 17 (2005) Richard Cleve DC 3524
Presentation transcript:

Quantum information and the monogamy of entanglement Aram Harrow (MIT) Brown SUMS March 9, 2013

Quantum mechanics QM has also explained: the stability of atoms the photoelectric effect everything else we’ve looked at Classical theory (1900): const / ¸ 4 Quantum theory (1900 – 1924): Blackbody radiation paradox: How much power does a hot object emit at wavelength ¸? Bose-Einstein condensate (1995)

Difficulties of quantum mechanics Heisenberg’s uncertainty principle Topological effects Entanglement Exponential complexity: Simulating N objects requires effort »exp(N)

The doctrine of quantum information Abstract away physics to device-independent fundamentals: “qubits” operational rather than foundational statements: Not “what is quantum information” but “what can we do with quantum information.”

example: photon polarization Photon polarization states: Measurement: Questions of the form “Are you or ?” Uncertainty principle: No photon will yield a definite answer to both measurements. Rule: Pr[ | ] = cos 2 (µ) µ

StateMeasurementOutcome or Quantum key distribution 2. Bob randomly chooses to measure with either or Protocol: 1. Alice chooses a random sequence of bits and encodes each one using either 3. They publically reveal their choice of axes and discard pairs that don’t match. 4. If remaining bits are perfectly correlated, then they are also secret.

Quantum Axioms Classical probabilityQuantum mechanics

Measurement Quantum state: α ∊ N Measurement: An orthonormal basis {v 1, …, v N } Outcome: Pr[v i |α] = |hv i,αi| 2 More generally, if M is Hermitian, then hα, Mαi is observable. Example: Pr[v i |α] = |α i | 2

Product and entangled states Entanglement “Not product” := “entangled” ~ correlated random variables state of system A state of system B joint state of A and B probability analogue: independent random variables e.g. The power of [quantum] computers One qubit ´ n qubits ´

Measuring entangled states AB joint state Rule: Pr[ A observes and B observes ] = cos 2 (θ) / 2 General rule: Pr[A,B observe v,w | state α] = |hv­w, αi| 2 Instantaneous signalling? Alice measures {v 1,v 2 }, Bob measures {w 1,w 2 }. Pr[w 1 |v 1 ] = cos 2 (θ) Pr[v 1 ] = 1/2 Pr[w 1 |v 2 ] = sin 2 (θ) Pr[v 2 ] = 1/2 Pr[w 1 | Alice measures {v 1,v 2 }] = cos 2 (θ)/2 + sin 2 (θ)/2 = 1/2 v1v1 v2v2 w1w1 w2w2 θ

CHSH game Alice Bob a ∊ {0,1} b ∊ {0,1} Goal: xy = ab a bx,y 00same different Max win probability is 3/4. Randomness doesn’t help. shared randomness x2{0,1} y2{0,1}

CHSH with entanglement Alice and Bob share state Alice measures a=0 a=1 x=0 x=1 Bob measures x=0 x=1 b=0 b=1 y=0 y=1 y=0 win prob cos 2 (π/8) ≈ 0.854

CHSH with entanglement a=0 x=0 b=0 y=0 a=1 x=0 b=1 y=1 b=1 y=0 a=0 x=1 b=0 y=1 a=1 x=1 Why it works Winning pairs are at angle π/8 Losing pairs are at angle 3π/8 ∴ Pr[win]=cos 2 (π/8)

Monogamy of entanglement AliceBobCharlie a ∊ {0,1} max Pr[AB win] + Pr[AC win] = max Pr[xy = ab] + Pr[xz = ac] < 2 cos 2 (π/8) b ∊ {0,1}c ∊ {0,1} x ∊ {0,1} y ∊ {0,1} z ∊ {0,1}

Marginal quantum states General monogamy relation: The distributions over AB and AC cannot both be very entangled. More general bounds from considering AB 1 B 2 …B k. Given a state of A, B, C Q: What is the state of AB? or AC? A: Measure C. Outcomes {0,1} have probability AB are left with or

Application to optimization Given a Hermitian matrix M: max α hα, Mαi is easy max α,β hαβ, M αβi is hard B1B1 B2B2 B3B3 B4B4 A Approximate with Computational effort: N O(k) Key question: approximation error as a function of k and N

For more information General quantum information: M.A. Nielsen and I.L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2000.M.A. Nielsen and I.L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, google “David Mermin lecture notes”google “David Mermin lecture notes” M. M. Wilde, From Classical to Quantum Shannon Theory, arxiv.org/abs/ M. M. Wilde, From Classical to Quantum Shannon Theory, arxiv.org/abs/ Monogamy of Entanglement: arxiv.org/abs/ Application to Optimization: arxiv.org/abs/