Non-locality and quantum games Dmitry Kravchenko University of Latvia Theory days at Jõulumäe, 2008.

Slides:



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

Quantum Computation and Quantum Information – Lecture 3
Tony Short University of Cambridge (with Sabri Al-Safi – PRA 84, (2011))
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.
Introduction to Entanglement Allan Solomon, Paris VI.
Nonlocal Boxes And All That Daniel Rohrlich Atom Chip Group, Ben Gurion University, Beersheba, Israel 21 January 2010.
1 quantum teleportation David Riethmiller 28 May 2007.
Modern Physics 5/10/11 Spring 2011 Ben Miller, Alexander DeCarli, Kevin Shaw.
Cove: A Practical Quantum Computer Programming Framework Matt Purkeypile Fall 2008.
Quantum Packet Switching A. Yavuz Oruç Department of Electrical and Computer Engineering University of Maryland, College Park.
Bell’s inequalities and their uses Mark Williamson The Quantum Theory of Information and Computation
Quantum Computing MAS 725 Hartmut Klauck NTU
A Brief Introduction to Quantum Computation 1 Melanie Mitchell Portland State University 1 This talk is based on the following paper: E. Rieffel & W. Polak,
Quantum Theory Made Easy 0 1 Classical p0p0 p1p1 probabilities Quantum a0a0 a1a1 0 1 amplitudes p 0 +p 1 =1|a 0 | 2 +|a 1 | 2 =1 bit qubit p i is a real.
Given the Uncertainty Principle, how do you write an equation of motion for a particle? First, remember that a particle is only a particle sort of, and.
1 A Quantum self- Routing Packet Switching Manish Kumar Shukla, Rahul Ratan and A. Yavuz Oruc, Department of Electrical and Computer Engineering, University.
Quantum fermions from classical statistics. quantum mechanics can be described by classical statistics !
CSEP 590tv: Quantum Computing
Quantum Computing Joseph Stelmach.
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.
Quantum Computation and Quantum Information – Lecture 2 Part 1 of CS406 – Research Directions in Computing Dr. Rajagopal Nagarajan Assistant: Nick Papanikolaou.
Paraty, Quantum Information School, August 2007 Antonio Acín ICFO-Institut de Ciències Fotòniques (Barcelona) Quantum Cryptography.
Study and characterisation of polarisation entanglement JABIR M V Photonic sciences laboratory, PRL.
Is Communication Complexity Physical? Samuel Marcovitch Benni Reznik Tel-Aviv University arxiv
Alice and Bob’s Excellent Adventure
Quantum Information, Communication and Computing Jan Kříž Department of physics, University of Hradec Králové Doppler Institute for mathematical physics.
Institute of Technical Physics Entanglement – Beamen – Quantum cryptography The weird quantum world Bernd Hüttner CPhys FInstP DLR Stuttgart.
Quantum Computing Presented by: Don Davis PHYS
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.
خودکار آبی دات کام دانلود مقاله تحقیق ، پروژه ، انواع خدمات دانشجویی ، ترجمه ، اخبار فناوری در : خودکار.
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 hardware of quantum computer 1. quantum registers 2. quantum gates.
You Did Not Just Read This or did you?. Quantum Computing Dave Bacon Department of Computer Science & Engineering University of Washington Lecture 3:
A limit on nonlocality in any world in which communication complexity is not trivial IFT6195 Alain Tapp.
Borsós, K.; Benedict, M. G. University of Szeged, Szeged, Hungary Animation of experiments in modern quantum physics Animation of experiments in modern.
A brief introduction to Quantum computer
Bell Measurements and Teleportation. Overview Entanglement Bell states and Bell measurements Limitations on Bell measurements using linear devices Teleportation.
Quantum mechanical phenomena. The study between quanta and elementary particles. Quanta – an indivisible entity of a quantity that has the same value.
Quantum correlations with no causal order OgnyanOreshkov, Fabio Costa, ČaslavBrukner Bhubaneswar arXiv: December2011 Conference on Quantum.
Worst case analysis of non-local games
1 entanglement-quantum teleportation entanglement-quantum teleportation entanglement (what is it?) quantum teleportation (intuitive & mathematical) ‘ quantum.
Nawaf M Albadia
Quantum computing, teleportation, cryptography Computing Teleportation Cryptography.
CSEP 590tv: Quantum Computing Dave Bacon July 20, 2005 Today’s Menu n Qubit registers Begin Quantum Algorithms Administrivia Superdense Coding Finish Teleportation.
Quantum Mechanics(14/2) Hongki Lee BIOPHOTONICS ENGINEERING LABORATORY School of Electrical and Electronic Engineering, Yonsei University Quantum Computing.
Introduction to Quantum Computing
A SEMINAR ON Q UANTUM C OMPUTING Institute Of Engineering & Management (CSE 3 rd year batch) Submitted to- Submitted by- Mr. D.P.S. Rathor Sudhir.
FNI 1H Quantum Mechanics 1 Quantum Mechanics I don't like it, and I'm sorry I ever had anything to do with it. -- Erwin Schrodinger talking about Quantum.
Indefinite causal order in quantum mechanics Faculty of Physics, University of Vienna & Institute for Quantum Optics and Quantum Information, Vienna Mateus.
PHYSICAL CHEMISTRY - ADVANCED MATERIALS Particles and Waves Two opposing concepts Particle theory Field theory Quantum Mechanics Position, mass, velocity,
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.
Quantum Computers The basics. Introduction 2/47 Dušan Gajević.
Quantum Computing Charles Bloomquist CS147 Fall 2009.
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.
QUANTUM PHYSICS BY- AHRAZ, ABHYUDAI AND AKSHAY LECTURE SECTION-5 GROUP NO. 6.
Intro to Quantum Algorithms SUNY Polytechnic Institute Chen-Fu Chiang Fall 2015.
Quantum Mechanics.
Quantum mechanics from classical statistics
Study of nonlocal correlations in macroscopic measurement scenario
Quantum Information Theory Introduction
Quantum computation with classical bits
Quantum Computing Joseph Stelmach.
Presentation transcript:

Non-locality and quantum games Dmitry Kravchenko University of Latvia Theory days at Jõulumäe, 2008

Agenda Distributed computation Quantum mechanics basics Quantum non-local games Results and ideas

Distributed computation Node 1 Node 2Node N … … Main server distributes subtasks Subtask 1 Subtask 2 Subtask N

Distributed computation If subtasks are correlated but communications between nodes is allowed nodes can compute any computable function However node abilities to communicate can be limited or even completely prohibited

Distributed computation Long distances between nodes (space) Environment (ocean) Communication takes too much energy Etc.

Distributed computation Node 1 Node 2Node N … … If communications are prohibited some distributed functions can not be computed (with certainty)

Computational model Node 1 Node 2Node N … … More formally: nodes compute a set of functions on shared data x1x1 x2x2 xnxn

Computational model Node 1 Node 2Node N … … More formally: nodes compute a set of functions on shared data F 1 (x 1, …, x n ) F 2 (x 1, …, x n ) F n (x 1, …, x n )

Classical and quantum bits Classical bit  Regardless a physical representation can be 0 or 1 Quantum bit  Regardless a physical representation can be 0, 1 or a superposition of both

Quantum bits : superposition If a quantum bit can be in state 0 and 1 it can also be in state where α and β are complex numbers called probability amplitudes.

Quantum bits : measurement If a quantum bit can be in state 0 and 1 it can also be in state Measuring the bit the probability of outcome 0 is |α| 2 and the probability of outcome 1 is |β| 2. α and β must be constrained by the equation

Quantum bits : generalization If a quantum system can be in states it can also be in state Measuring the system the probability of outcome i is |α i | 2 α i must be constrained by the equation

Entanglement Entanglement is a non-local property that allows a set of qubits to express higher correlation than is possible in classical systems. It gives rise to some of the most counterintuitive phenomena of quantum mechanics

Entanglement We have a system consisting of two bits. In classical case it is always possible to describe a state of each bit. In quantum case the system can be in a state there individual qubits do not have their own state.

Entanglement : example We have a system consisting of two qubits. The system can be in any superposition For example, in superposition

We have a pair of entangled qubits As qubits are particles they can be physically separated If we measure one of qubits other will “get” same state Entanglement 100 light years

We can not transmit information using entanglement as this violates relativity theory Static observer has horizontal worldline Synchronism

We can not transmit information using entanglement as this violates relativity theory Static observer has horizontal worldline Observer in motion has inclined worldline Synchronism

If one exceeds speed of light, there may exist an observer that has opposite time flow Cause-and-effect law is violated Synchronism

If one exceeds speed of light, there may exist an observer that has opposite time flow Cause-and-effect law is violated Synchronism FUTURE PAST

We have a pair of entangled qubits As qubits are particles they can be physically separated If we measure one of qubits other will “get” same state Entanglement once again 100 light years

We have a pair of entangled qubits As qubits are particles they can be physically separated If we measure one of qubits other will “get” same state IMMEDIATELY ! Entanglement once again 100 light years

The CHSH game John Clauser, Michael Horne, Abner Shimony and Richard Holt CHSH inequality 1969

Bob Alice Referee No communication The CHSH game

Bob Alice Referee No communication The CHSH game

Bob Alice Referee No communication The CHSH game |Input|=2  |Output|=1

Input Output Best classical strategy

Input Output Best classical strategy

Input Output Best classical strategy

Entanglement : measurement

Either  

Entanglement : measurement Either   or  

Entanglement : measurement θ   (cos 2 θ)   (sin 2 θ)

Entanglement : measurement θ   (cos 2 θ)   (sin 2 θ)   (cos 2 θ)   (sin 2 θ)

Quantum strategy What if Alice and Bob share 2 qubit system? x=0, y=0: 1 

Quantum strategy What if Alice and Bob share 2 qubit system? x=1, y=0: 1 – sin 2 θ θ 

Quantum strategy What if Alice and Bob share 2 qubit system? x=0, y=1: 1 – sin 2 θ θ 

Quantum strategy What if Alice and Bob share 2 qubit system? θ x=1, y=1: 0 + ??? θ

Quantum strategy What if Alice and Bob share 2 qubit system? θ x=1, y=1: 0 + sin 2 2θ θ

Best quantum strategy  +  +  + =

The CHSH game There is a quantum strategy which is better than any classical strategy This is one of the cores of quantum non-locality

Games of four All symmetrical games can be written in form like |Input|  {0,1,4}  |Output|  {0,2,3}

Games of four All symmetrical games can be written in form like |Input|  {0,1,4}  |Output|  {0,2,3} Best known “quantum achievements” for such 4 player games are: {1}  {2}0,75 vs 0, {3}  {2}0,75 vs 0, {0,3}  {2}0,6875 vs 0, {1,4}  {2}0,6875 vs 0,734375

Quantum non-local games Other examples of non-local games need research The main task: define function pairs set that represent games which allow non-local quantum tricks In particular, describe the [quite strict!] restriction that comes from relativity theory

Thank you!