GHZ correlations are just a bit nonlocal Carlton M. Caves University of New Mexico caves Seminar date Please join the APS Topical.

Slides:



Advertisements
Similar presentations
Department of Computer Science & Engineering University of Washington
Advertisements

Pretty-Good Tomography Scott Aaronson MIT. Theres a problem… To do tomography on an entangled state of n qubits, we need exp(n) measurements Does this.
Generating Random Stabilizer States in Matrix Multiplication Time: A Theorem in Search of an Application Scott Aaronson David Chen.
Quantum Computation and Quantum Information – Lecture 2
University of Queensland
Vlatko Vedral Oxford and Singapore Extreme nonlocality with a single photon.
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.
Frustration of Decoherence and Entanglement-sharing in the Spin-bath Andrew Hines Christopher Dawson Ross McKenzie Gerard Milburn.
Detecting Genuine Multi-qubit Entanglement with Two Local Measurement Settings Géza Tóth (MPQ) Otfried Gühne (Innsbruck) Quantum Optics II, Cozumel, Dec.
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 quantum teleportation David Riethmiller 28 May 2007.
Quantum Packet Switching A. Yavuz Oruç Department of Electrical and Computer Engineering University of Maryland, College Park.
Bell inequality & entanglement
Bell’s inequalities and their uses Mark Williamson The Quantum Theory of Information and Computation
Quantum Computing MAS 725 Hartmut Klauck NTU
1 Multiphoton Entanglement Eli Megidish Quantum Optics Seminar,2010.
Boris Altshuler Columbia University Anderson Localization against Adiabatic Quantum Computation Hari Krovi, Jérémie Roland NEC Laboratories America.
Quantum Error Correction Joshua Kretchmer Gautam Wilkins Eric Zhou.
Superdense coding. How much classical information in n qubits? Observe that 2 n  1 complex numbers apparently needed to describe an arbitrary n -qubit.
5 Qubits Error Correcting Shor’s code uses 9 qubits to encode 1 qubit, but more efficient codes exist. Given our error model where errors can be any of.
An Algebraic Foundation for Quantum Programming Languages Andrew Petersen & Mark Oskin Department of Computer Science The University of Washington.
Review from last lecture: A Simple Quantum (3,1) Repetition Code
Chapter 22 The EPR paper and Bell's theorem by Steve Kurtz.
CSEP 590tv: Quantum Computing
Quantum Mechanics from Classical Statistics. what is an atom ? quantum mechanics : isolated object quantum mechanics : isolated object quantum field theory.
Quantum Computing Lecture 1 Michele Mosca. l Course Outline
Simulating Physical Systems by Quantum Computers J. E. Gubernatis Theoretical Division Los Alamos National Laboratory.
Quantum Computation and Quantum Information – Lecture 2 Part 1 of CS406 – Research Directions in Computing Dr. Rajagopal Nagarajan Assistant: Nick Papanikolaou.
What Exists? The nature of existence. Dictionary definition (Merriam-Webster) To exist: To have real being whether material or spiritual. Being: The quality.
CLASSIFYING SIMULATORS Canada 10 iQST, Dongsheng Wang Calgary, 12/06/2015.
Quantum theory and Consciousness This is an interactive discussion. Please feel free to interrupt at any time with your questions and comments.
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
Quantum Error Correction Jian-Wei Pan Lecture Note 9.
Alice and Bob’s Excellent Adventure
In 1887,when Photoelectric Effect was first introduced by Heinrich Hertz, the experiment was not able to be explained using classical principles.
1 Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871 Richard Cleve DC 2117 Lecture 19 (2009)
Steering witnesses and criteria for the (non-)existence of local hidden state (LHS) models Eric Cavalcanti, Steve Jones, Howard Wiseman Centre for Quantum.
QCCC07, Aschau, October 2007 Miguel Navascués Stefano Pironio Antonio Acín ICFO-Institut de Ciències Fotòniques (Barcelona) Cryptographic properties of.
Device-independent security in quantum key distribution Lluis Masanes ICFO-The Institute of Photonic Sciences arXiv:
You Did Not Just Read This or did you?. Quantum Computing Dave Bacon Department of Computer Science & Engineering University of Washington Lecture 3:
1 Experimenter‘s Freedom in Bell‘s Theorem and Quantum Cryptography Johannes Kofler, Tomasz Paterek, and Časlav Brukner Non-local Seminar Vienna–Bratislava.
CS555Topic 251 Cryptography CS 555 Topic 25: Quantum Crpytography.
© Copyright McGraw-Hill Correlation and Regression CHAPTER 10.
Black-box Tomography Valerio Scarani Centre for Quantum Technologies & Dept of Physics National University of Singapore.
Quantum mechanical phenomena. The study between quanta and elementary particles. Quanta – an indivisible entity of a quantity that has the same value.
Nothing Here. or How we learned to put our pants on two legs at a time. Fast Quantum Algorithms Dave Bacon Institute for Quantum Information California.
A Monomial matrix formalism to describe quantum many-body states Maarten Van den Nest Max Planck Institute for Quantum Optics Montreal, October 19 th 2011.
CSEP 590tv: Quantum Computing Dave Bacon July 20, 2005 Today’s Menu n Qubit registers Begin Quantum Algorithms Administrivia Superdense Coding Finish Teleportation.
Uni-Heidelberg Physikalisches Insitut Jian-Wei Pan Multi-Particle Entanglement & It’s Application in Quantum Networks Jian-Wei Pan Lecture Note.
Minimal multipartite entanglement detecion Dr Marcin Wieśniak, Instytut Fizyki Teoretycznej i Astrofizyki, Uniwersytet Gdański Marcin Wieśniak, Koji Maruyama,
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.
Nonlocality test of continuous variable state 17, Jan,2003 QIPI meeting Wonmin Son Queen’s University, Belfast.
Multipartite Entanglement and its Role in Quantum Algorithms Special Seminar: Ph.D. Lecture by Yishai Shimoni.
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 Cryptography Antonio Acín
IPQI-2010-Anu Venugopalan 1 qubits, quantum registers and gates Anu Venugopalan Guru Gobind Singh Indraprastha Univeristy Delhi _______________________________________________.
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.
Debasis Sarkar * Department of Applied Mathematics, University of Calcutta *
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.
Beginner’s Guide to Quantum Computing Graduate Seminar Presentation Oct. 5, 2007.
Simulation and Design of Stabilizer Quantum Circuits Scott Aaronson and Boriska Toth CS252 Project December 10, X X +Z Z +ZI +IX
Intro to Quantum Algorithms SUNY Polytechnic Institute Chen-Fu Chiang Fall 2015.
Chapter 5 STATISTICS (PART 4).
Quantum mechanics from classical statistics
Quantum Computation and Information Chap 1 Intro and Overview: p 28-58
Quantum computation with classical bits
Time and Quantum from Correlations
Presentation transcript:

GHZ correlations are just a bit nonlocal Carlton M. Caves University of New Mexico caves Seminar date Please join the APS Topical Group on Quantum Information, Concepts, and Computation

Locality, realism, or nihilism We consider the consequences of the observed violations of Bell’s inequalities. Two common responses are (i) the rejection of realism and the retention of locality and (ii) the rejection of locality and the retention of realism. Here we critique response (i). We argue that locality contains an implicit form of realism, since in a worldview that embraces locality, spacetime, with its usual, fixed topology, has properties independent of measurement. Hence we argue that response (i) is incomplete, in that its rejection of realism is only partial. R. Y. Chiao and J. C. Garrison “Realism or Locality: Which Should We Abandon?” Foundations of Physics 29, (1999). Locality Realism Nihilism

Locality, realism, or nihilism Locality Realism Nihilism Local HV models for product states. Bell inequalities satisfied. Nonlocal HV models for entangled states. Violation of Bell inequalities. No influences between spatially separated parts. Violation of Bell inequalities.

Reductionism or realism Reductionism Realism Reductionist HV models for product states. Bell inequalities satisfied. Holistic HV models for entangled states. Violation of Bell inequalities. Things made of parts. No influences between noninteracting parts. Violation of Bell inequalities.

Reductionism Realism Holistic realistic account of states, dynamics, and measurements. Holistic HV models. Objective quantum states. Things made of parts. Parts identified by the attributes we can manipulate and measure. No influences between noninteracting parts. Attributes do not have realistic values. Subjective quantum states. Quantum mechanics or Stories about a reality beneath quantum mechanics Reductionist HV models for product states.

Why not a different story, one that comes from quantum information science?

Nonlocal realistic description Local realistic description Product states Entangled states The old story

A new story from quantum information? Inefficient realistic description Local realistic description Efficient realistic description Product states Globally entangled states

Realistic description A new story from quantum information Local realistic description Product states Efficient realistic description Globally entangled states How nonlocal is the realistic description of these states?

Measure XYY, YXY, and YYX: All yield result -1. Local realism implies XXX = -1, but quantum mechanics says XXX = +1. Efficient (nonlocal) realistic description of states, dynamics, and measurements GHZ (cat) entangled state Modeling GHZ (cat) correlations Stabilizer formalism

GHZ (cat) entangled state Modeling GHZ (cat) correlations ZZI = ZIZ = IZZ = XXX = +1; XYY = YXY = YYX = -1. To get correlations right requires 1 bit of classical communication: party 2 tells party 1 whether Y is measured on qubit 2; party 1 flips her result if Y is measured on either 1 or 2. When party 1 flips her result, this can be thought of as a nonlocal disturbance that passes from qubit 2 to qubit 1. The communication protocol quantifies the required amount of nonlocality.

GHZ (cat) entangled state For N-qubit GHZ states, this same procedure gives a local realistic description, aided by N-2 bits of classical communication (provably minimal), of states, dynamics, and measurements (of Pauli products). Communication- assisted LHV model T. E. Tessier, C. M. Caves, I. H. Deutsch, B. Eastin, and D. Bacon, ``Optimal classical- communication-assisted local model of n-qubit Greenberger- Horne-Zeilinger correlations,'‘ Phys. Rev. A 72, (2005). Modeling GHZ (cat) correlations ZZI = ZIZ = IZZ = XXX = +1; XYY = YXY = YYX = -1. To get correlations right requires 1 bit of classical communication: party 2 tells party 1 whether Y is measured on qubit 2; party 1 flips her result if Y is measured on either 1 or 2.

4-qubit GHZ entangled state Assume 1 bit of communication between qubits 1 and 2. Let S=XXII and T=XYII be Pauli products for qubits 1 and 2; then we have SYY=TXY=TYX = -1. Local realism implies SXX = -1, but quantum mechanics says SXX = +1. For N-qubit GHZ states, a simple extension of this argument shows that N-2 bits of classical communication is the minimum required to mimic the predictions of quantum mechanics for measurements of Pauli products. Modeling GHZ (cat) correlations

Global entanglement but Efficient (nonlocal) realistic description of states, dynamics, and measurements (in terms of stabilizer generators) This kind of global entanglement, when measurements are restricted to the Pauli group, can be simulated efficiently and thus does not provide an exponential speedup for quantum computation. Clifford circuits: Gottesman-Knill theorem

All stabilizer (Clifford) states are related to graph states by Z, Hadamard, and S gates. Graph states

4-qubit GHZ graph state

Graph states 2 x 2 cluster state

Graph states: LHV model J. Barrett, C. M. Caves, B. Eastin, M. B. Elliott, and S. Pironio, “Modeling Pauli measurements on graph states with nearest-neighbor classical communication,” submitted to PRA.

Graph states: Nearest-neighbor (single-round) communication protocol

Site-invariant nearest- neighbor communication protocols Graph states: Nearest-neighbor communication protocol

Graph states: Subcorrelations

Certain result -1 Overall random result Protocol gets submeasurement wrong.

Site-invariant protocols can get all correlations right, but even with unlimited-distance communication, such protocols fail on some subcorrelations for some graphs. Overall random resultCertain result -1 A site-invariant protocol cannot introduce an overall sign flip when this measurement is viewed as a submeasurement of the one on the left. Graph states: Site invariance and communication distance

Nonetheless, any protocol with limited-distance communication, site-invariant or not, fails for some graphs; thus for a protocol to be successful for all graphs, it (i) must not be site invariant and (ii) must have unlimited-distance communication. Graph states: Site invariance and communication range

Graph states: Getting it all right 1.Select a special qubit that knows the adjacency matrix of the graph. 2.Each qubit tells the special qubit if it measures X or Y. 3.From the adjacency matrix, the special qubit calculates a generating set of certain submeasurements (stabilizer elements), each of which has a representative qubit that participates in none of the other submeasurements. Since these submeasurements commute term by term, the overall sign for any certain submeasurement is a product of the signs for the participating submeasurements. 4.The special qubit tells each of the representative qubits whether to flip the sign of its table entry. M. B. Elliott, B. Eastin, and C. M. Caves, “Local-hidden-variables models assisted by classical communication for stabilizer states,” in preparation. Non-site-invariant, unlimited- distance communication protocol

Stabilizer states A non-site-invariant, unlimited-distance protocol like that for graph states, based on the adjacency matrix of the qubits connected by solid lines, gets everything right. Generalized graph

Stabilizer states Simulation of Clifford circuits leads to local-complementation rules for generalized graphs subjected to Clifford gates, which can be expressed as powerful circuit identities. Generalized graph

Stabilizer states Simulation of Clifford circuits leads to local-complementation rules for generalized graphs subjected to Clifford gates, which can be expressed as powerful circuit identities. Generalized graph

Global entanglement but Efficient (nonlocal) realistic description of states, dynamics, and measurements (in terms of stabilizer generators) This kind of global entanglement, when measurements are restricted to the Pauli group, can be simulated efficiently because it can be described efficiently by local hidden variables assisted by classical communication. Clifford circuits: Gottesman-Knill theorem

The problem is that it’s not just dogs, so … Quantum information science is the discipline that explores information processing within the quantum context where the mundane constraints of realism and determinism no longer apply. What better way could there be to explore the foundations of quantum mechanics?