Communication equivalent of non-locality Mario Szegedy, Rutgers University Grant: NSF 0523866 Emerging Technotogies (joint work with Jérémie Roland)

Slides:



Advertisements
Similar presentations
Random non-local games Andris Ambainis, Artūrs Bačkurs, Kaspars Balodis, Dmitry Kravchenko, Juris Smotrovs, Madars Virza University of Latvia.
Advertisements

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.
CIVL3310 STRUCTURAL ANALYSIS Professor CC Chang Introduction to Matrix based techniques.
Position-Based Quantum Cryptography Christian Schaffner ILLC, University of Amsterdam Centrum Wiskunde & Informatica Logic Tea, ILLC Tuesday, 14/02/2012.
1 quantum teleportation David Riethmiller 28 May 2007.
Tsuyoshi Ito (McGill U) Hirotada Kobayashi (NII & JST) Keiji Matsumoto (NII & JST) QIP 2009, January 12–16, 2009 arXiv:
Blaylock - Clark University 2/17/10 Wringing John Bell vocabulary the EPR paradox Bell’s theorem Bell’s assumptions what does it mean? Guy Blaylock Clark.
Short course on quantum computing Andris Ambainis University of Latvia.
Quantum Computing MAS 725 Hartmut Klauck NTU
1 of 9 ON ALMOST LYAPUNOV FUNCTIONS Daniel Liberzon University of Illinois, Urbana-Champaign, U.S.A. TexPoint fonts used in EMF. Read the TexPoint manual.
Class notes for ISE 201 San Jose State University
Superdense coding. How much classical information in n qubits? Observe that 2 n  1 complex numbers apparently needed to describe an arbitrary n -qubit.
Avraham Ben-Aroya (Tel Aviv University) Oded Regev (Tel Aviv University) Ronald de Wolf (CWI, Amsterdam) A Hypercontractive Inequality for Matrix-Valued.
Communication and Cooperation General Game PlayingLecture 8 Michael Genesereth / Nat Love Spring 2006.
Chapter 5. Operations on Multiple R. V.'s 1 Chapter 5. Operations on Multiple Random Variables 0. Introduction 1. Expected Value of a Function of Random.
Finite probability space set  (sample space) function P:  R + (probability distribution)  P(x) = 1 x 
EECS 598 Fall ’01 Quantum Cryptography Presentation By George Mathew.
Is Communication Complexity Physical? Samuel Marcovitch Benni Reznik Tel-Aviv University arxiv
A Counterexample to Strong Parallel Repetition Ran Raz Weizmann Institute.
1 Algorithms CSCI 235, Fall 2012 Lecture 9 Probability.
In 1887,when Photoelectric Effect was first introduced by Heinrich Hertz, the experiment was not able to be explained using classical principles.
Feynman Festival, Olomouc, June 2009 Antonio Acín N. Brunner, N. Gisin, Ll. Masanes, S. Massar, M. Navascués, S. Pironio, V. Scarani Quantum correlations.
A Few Simple Applications to Cryptography Louis Salvail BRICS, Aarhus University.
Position-Based Quantum Cryptography Christian Schaffner ILLC, University of Amsterdam Centrum Wiskunde & Informatica Advances in Quantum Cryptography Workshop.
1 Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871 Richard Cleve DC 2117 Lecture 19 (2009)
~Spooky~ Action at a Distance by Karah Manninng. The Non-Local Universe  EPR Paradox oEinstein and Bohr debates about uncertainty oEinstein and colleagues.
QCCC07, Aschau, October 2007 Miguel Navascués Stefano Pironio Antonio Acín ICFO-Institut de Ciències Fotòniques (Barcelona) Cryptographic properties of.
Fall 2002CMSC Discrete Structures1 One, two, three, we’re… Counting.
Aug 2, Quantum Communication Complexity Richard Cleve Institute for Quantum Computing University of Waterloo.
Languages with Bounded Multiparty Communication Complexity Arkadev Chattopadhyay (McGill) Joint work with: Andreas Krebs (Tubingen) Michal Koucky (Czech.
Chapter 4 Probability ©. Sample Space sample space.S The possible outcomes of a random experiment are called the basic outcomes, and the set of all basic.
Blaylock - Williams College 4/17/15 Wringing John Bell vocabulary the EPR paradox Bell’s theorem Bell’s assumptions what does it mean? Guy Blaylock Williams.
A limit on nonlocality in any world in which communication complexity is not trivial IFT6195 Alain Tapp.
Black-box Tomography Valerio Scarani Centre for Quantum Technologies & Dept of Physics National University of Singapore.
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.
1 entanglement-quantum teleportation entanglement-quantum teleportation entanglement (what is it?) quantum teleportation (intuitive & mathematical) ‘ quantum.
Marcos Curty 1,2 Coauthors: Tobias Moroder 2,3, and Norbert Lütkenhaus 2,3 1.Center for Quantum Information and Quantum Control (CQIQC), University of.
1 Lecture 7 System Models Attributes of a man-made system. Concerns in the design of a distributed system Communication channels Entropy and mutual information.
Properties of Inverse Matrices King Saud University.
An importer of Herbs and Spices claims that average weight of packets of Saffron is 20 grams. However packets are actually filled to an average weight,
Quantum Cryptography Christian Schaffner Research Center for Quantum Software Institute for Logic, Language and Computation (ILLC) University of Amsterdam.
Quantum Cryptography Christian Schaffner Research Center for Quantum Software Institute for Logic, Language and Computation (ILLC) University of Amsterdam.
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.
Tight Bound for the Gap Hamming Distance Problem Oded Regev Tel Aviv University TexPoint fonts used in EMF. Read the TexPoint manual before you delete.
Quantum Cryptography Christian Schaffner Research Center for Quantum Software Institute for Logic, Language and Computation (ILLC) University of Amsterdam.
Properties of Real Numbers Objective: Review Properties of Real Numbers.
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.
2/24/20161 One, two, three, we’re… Counting. 2/24/20162 Basic Counting Principles Counting problems are of the following kind: “How many different 8-letter.
Department of Statistics University of Rajshahi, Bangladesh
Non-Locality Swapping and emergence of quantum correlations Nicolas Brunner Paul Skrzypczyk, Sandu Popescu University of Bristol.
Quantum Non-locality: From Bell to Information Causality Alex Thompson Physics 486 March 7, 2016.
Secret keys and random numbers from quantum non locality Serge Massar.
MA/CSSE 474 Theory of Computation Regular Expressions Intro.
Cryptography and Non-Locality Valerio Scarani Centre for Quantum Technologies National University of Singapore Ph.D. and post-doc positions available Barrett.
Non-Locality and Communication Complexity Stefan Wolf Università della Svizzera italiana Darmstadt,
Ch5.4 Central Limit Theorem
Homomorphic encryption of quantum data
COCS DISCRETE STRUCTURES
Simulating entanglement without communication
LATTICES AND BOOLEAN ALGEBRA
Invitation to Quantum Information III
Translating Iff ‘Iff’ abbreviates ‘if and only if’ A iff B
Boolean Algebra.
Quantum Information Theory Introduction
Recap lecture 18 NFA corresponding to union of FAs,example, NFA corresponding to concatenation of FAs,examples, NFA corresponding to closure of an FA,examples.
Sequential sharing of nonlocal correlations
A Series of Slides in 5 Parts Movement 1. DFS
A Series of Slides in 5 Parts Movement 3. IDFS
Presentation transcript:

Communication equivalent of non-locality Mario Szegedy, Rutgers University Grant: NSF Emerging Technotogies (joint work with Jérémie Roland)

EPR paradox (Einstein, Podolsky, and Rosen)EinsteinPodolskyRosen e

EPR paradox (Einstein, Podolsky, and Rosen)EinsteinPodolskyRosen ee |00  + |11  √2

EPR paradox (Einstein, Podolsky, and Rosen)EinsteinPodolskyRosen ee |00  + |11  √2

EPR paradox (Einstein, Podolsky, and Rosen)EinsteinPodolskyRosen e 0 1 Measurement in the standard basis

EPR paradox (Einstein, Podolsky, and Rosen)EinsteinPodolskyRosen e |0 

EPR paradox (Einstein, Podolsky, and Rosen)EinsteinPodolskyRosen ee 0 1 Measurement in a rotated basis

EPR paradox (Einstein, Podolsky, and Rosen)EinsteinPodolskyRosen e |0  + |1  √2

General EPR experiment ψ ba

EPR experiment ψ b a 0 1

EPR experiment B A 0 1

Joint distribution of A and B: P(A,B|a,b) = (1 – A∙B a.b) / 4 EPR experiment a B A b

Distributed Sampling Problem λ ba Random string

Given distribution D ( A,B|a,b), design λ, A, B s.t. P(A(a, λ), B(b, λ) | a,b) = D ( A,B|a,b) Distributed Sampling Problem λ ba B(b, λ)A(a, λ) Computational task Random string

There is no distribution λ, and functions A and B for which the DSP would give the joint distribution (1 – A∙B a.b) / 4 Distributed Sampling Problem λ ba B(b, λ)A(a, λ) EPR paradox Random string

Additional resources are needed such as: Classical communication (Maudlin) or Post selection (Gisin and Gisin) or Non-local box (N. J. Cerf, N. Gisin, S. Massar, and S. Popescu)

Classical communication Maudlin 1.17unbounded1992 G. Brassard, R. Cleve, and A. Tapp Steiner 1.48bounded Cerf, Gisin and Massar 1.19bounded Toner and Bacon avg max year

Our result One bit of communication on average is not only sufficient, but also necessary Previous best lower bound of √2-1 = by Pironio

New Bell inequality ∫∫ S ( δ θ (a,b)+2δ 0 (a,b)- 2δ π (a,b) ) E(A,B|a,b) da db ≤ 5- θ/ π δ θ (a,b) = ∫∫ S δ θ (a,b) da db= 1. ∞, if angle(a,b)= θ 0, if angle(a,b)= θ

Isoperimetric inequality For every odd 1,-1 valued function on the sphere ∫∫ S δ θ (a,b) A(a) A(b) da db ≤ 1- θ/ π Note (for what function is the extreme value taken?): 1- θ/ π = ∫∫ S δ θ (a,b) H(a) H(b) da db. Here H is the function that takes 1 on the Northern Hemisphere and -1 on the Southern Hemisphere.

Product Theorems for Semidefinite Programs By Rajat Mittal and Mario Szegedy, Rutgers University Presented by Mario Szegedy

Product of general semidefinite programs Π = (J,A,b); Π’= (J’,A’,b’). Π Π’= (J J’, A A’, b b’),

Main Problem Under what condition on Π and Π’ does it hold that ω(Π Π’)= ω(Π) x ω(Π’)?

Positivity of the objective matrices Theorem: J, J’ ≥ 0 → ω(Π Π’)= ω(Π) x ω(Π’)