Experimentally Generated Random Numbers Certified by the Impossibility of Superluminal Signaling

Similar documents
Experimentally Generated Random Numbers Certified by the Impossibility of Superluminal Signaling arxiv: v1 [quant-ph] 16 Feb 2017

More Randomness From Noisy Sources

Toward the Generation of Bell Certified Randomness Using Photons

Device-Independent Quantum Information Processing (DIQIP)

A Superluminal communication solution based on Four-photon entanglement

Bell tests with Entangled Photons what is left?

Spatio-Temporal Quantum Steering

Tutorial: Device-independent random number generation. Roger Colbeck University of York

Has CHSH-inequality any relation to EPR-argument?

arxiv: v2 [quant-ph] 28 Jun 2017

Quantum Supremacy and its Applications

Device-Independent Quantum Information Processing

From a loophole-free Bell test to a quantum Internet

Transmitting and Hiding Quantum Information

No Fine theorem for macroscopic realism

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science Quantum Optical Communication

Testing Quantum Mechanics and Bell's Inequality with Astronomical Observations

No Fine Theorem for Macrorealism

Device-independent Quantum Key Distribution and Randomness Generation. Stefano Pironio Université Libre de Bruxelles

Quantum Entanglement, Quantum Cryptography, Beyond Quantum Mechanics, and Why Quantum Mechanics Brad Christensen Advisor: Paul G.

Untrusted quantum devices. Yaoyun Shi University of Michigan updated Feb. 1, 2014

Lecture 14, Thurs March 2: Nonlocal Games

Quantum Supremacy and its Applications

The relation between Hardy s non-locality and violation of Bell inequality

Bell s inequalities and their uses

Non-local setting and outcome information for violation of Bell's inequality

Multi-Particle Entanglement & It s Application in Quantum Networks

arxiv: v2 [quant-ph] 21 Oct 2013

Classical probability model for Bell inequality

Entropy Accumulation in Device-independent Protocols

Bit-Commitment and Coin Flipping in a Device-Independent Setting

Entanglement. arnoldzwicky.org. Presented by: Joseph Chapman. Created by: Gina Lorenz with adapted PHYS403 content from Paul Kwiat, Brad Christensen

Odd Things about Quantum Mechanics: Abandoning Determinism In Newtonian physics, Maxwell theory, Einstein's special or general relativity, if an initi

Local Realism Explains Bell Violations

Quantum Teleportation Pt. 3

Secure heterodyne-based QRNG at 17 Gbps

A computational proof of locality in entanglement.

Probing the quantum classical boundary with compression software

Asymptotic Pure State Transformations

Some limits on non-local randomness expansion

arxiv: v2 [quant-ph] 21 Nov 2017

10. Physics from Quantum Information. I. The Clifton-Bub-Halvorson (CBH) Theorem.

arxiv: v1 [quant-ph] 12 Dec 2016

Challenges in Quantum Information Science. Umesh V. Vazirani U. C. Berkeley

Algorithmic pseudorandomness in quantum setups

How to use the simulator

Entanglement. Michelle Victora Advisor: Paul G. Kwiat. Physics 403 talk: March 13, 2017

Free randomness can be amplified

Entanglement and Quantum Teleportation

arxiv: v2 [quant-ph] 22 Sep 2008

Spatial Locality: A hidden variable unexplored in entanglement experiments

CS/Ph120 Homework 8 Solutions

Contextuality and the Kochen-Specker Theorem. Interpretations of Quantum Mechanics

Randomness in nonlocal games between mistrustful players

Lecture 6 Sept. 14, 2015

Quantum Entanglement, Beyond Quantum Mechanics, and Why Quantum Mechanics

Quantum Correlations from Black Boxes

Practical quantum-key. key- distribution post-processing

Interconversion of nonlocal correlations

QUANTUM INFORMATION -THE NO-HIDING THEOREM p.1/36

Universal security for randomness expansion

Detection of photonic Bell states

Cryptography in a quantum world

A semi-device-independent framework based on natural physical assumptions

Quantum Nonlocality Pt. 4: More on the CHSH Inequality

Quantum entanglement and macroscopic quantum superpositions

arxiv: v7 [quant-ph] 20 Mar 2017

(Non-)Contextuality of Physical Theories as an Axiom

Testing Quantum Mechanics and bell s inequality with Observations of Causally Disconnected cosmological events Andrew Friedman

Asymptotic Analysis of a Three State Quantum Cryptographic Protocol

Quantum Teleportation. Gur Yaari for HEisenberg's Seminar on Quantum Optics

Quantum Information Transfer and Processing Miloslav Dušek

arxiv: v1 [quant-ph] 23 May 2015

High Fidelity to Low Weight. Daniel Gottesman Perimeter Institute

Baby's First Diagrammatic Calculus for Quantum Information Processing

Teleporting an Unknown Quantum State Via Dual Classical and Einstein Podolsky Rosen Channels 1

August 26, :27 WSPC/INSTRUCTION FILE ws-ijmpcbellcomputerref 2 CHSH AND A SIMPLE VIOLATING PROGRAM BASED ON LOCALITY.

Lecture 20: Bell inequalities and nonlocality

Violation of Bell s inequality: Must the Einstein locality really be abandoned?

arxiv: v3 [quant-ph] 19 Oct 2010

Kolmogorov complexity of sequences of random numbers generated in Bell s experiments.

Analysis of the Christensen et al. Clauser-Horne (CH)-Inequality-Based Test of Local Realism Donald A. Graft

Attacks against a Simplified Experimentally Feasible Semiquantum Key Distribution Protocol

Lecture: Quantum Information

Quantum Communication. Serge Massar Université Libre de Bruxelles

On a proposal for Quantum Signalling

Quantum sampling of mixed states

arxiv: v2 [quant-ph] 11 Nov 2014

A review on quantum teleportation based on: Teleporting an unknown quantum state via dual classical and Einstein- Podolsky-Rosen channels

Entanglement and non-locality of pure quantum states

REALISM VERSUS QUANTUM MECHANICS: IMPLICATIONS OF SOME RECENT EXPERIMENTS

The Communication Complexity of Correlation. Prahladh Harsha Rahul Jain David McAllester Jaikumar Radhakrishnan

From Quantum Foundations to Applications and Back

Introduction to Quantum Key Distribution

Quantum Nonlocality of N-qubit W States

Quantum Bilinear Optimisation

Closing the Debates on Quantum Locality and Reality: EPR Theorem, Bell's Theorem, and Quantum Information from the Brown-Twiss Vantage

Security of Device-Independent Quantum Key Distribution Protocols

Bell's Theorem cannot close the loophole of spatial locality

Introduction to Quantum Cryptography

Transcription:

Experimentally Generated Random Numbers Certified by the Impossibility of Superluminal Signaling Peter Bierhorst, Lynden K. Shalm, Alan Mink, Stephen Jordan, Yi-Kai Liu, Scott Glancy, Bradley Christensen, Andrea Rommal, Sae Woo Nam, Emanuel Knill National Institute of Standards and Technology, Boulder, CO peter.bierhorst@nist.gov September 16, 2016 1 / 33

First Loophole-Free Bell Experiments Multiple experimental groups have recently reported loophole-free Bell experiments: Hensen et al., Nature 526 682, October 2015 Shalm et al., Phys. Rev. Lett. 115 250402, December 2015 Giustina et al., Phys. Rev. Lett. 115 250401, December 2015 Weinfurter et al., QCrypt conference presentation, September 2016 2 / 33

First Loophole-Free Bell Experiments Local realism is falsified. Now what? Quantum Information Theory! 3 / 33

First Loophole-Free Bell Experiments Local realism is falsified. Now what? Quantum Information Theory! 4 / 33

First Loophole-Free Bell Experiments Local realism is falsified. Now what? Quantum Information Theory! 5 / 33

Randomness in Bell Experiments Nonlocality + Prohibition of FTL signaling Randomness 6 / 33

Experimental Scheme Alice Bob Alice measures a, Bob measures b 7 / 33

Experimental Scheme Alice Bob Alice measures a, Bob measures b 8 / 33

Experimental Scheme Alice Bob Alice measures a, Bob measures b 9 / 33

Experimental Scheme Alice Bob Alice measures a, Bob measures b. 10 / 33

Experimental Distributions ab.4268.0732.0732.4268 ab.4268.0732.0732.4268 a b.4268.0732.0732.4268 a b.0732.4268.4268.0732 P(+0 ab ) =.0732 11 / 33

Experimental Distributions A Local Realist Distribution ab 1/2 0 0 1/2 ab 1/2 0 0 1/2 a b 1/2 0 0 1/2 a b 1/2 0 0 1/2.5 ab 1 0 0 0 ab 1 0 0 0 a b 1 0 0 0 a b 1 0 0 0 +.5 ab 0 0 0 1 ab 0 0 0 1 a b 0 0 0 1 a b 0 0 0 1 12 / 33

Experimental Distributions A Local Realist Distribution ab 1/2 0 0 1/2 ab 1/2 0 0 1/2 a b 1/2 0 0 1/2 a b 1/2 0 0 1/2.5 ab 1 0 0 0 ab 1 0 0 0 a b 1 0 0 0 a b 1 0 0 0 +.5 ab 0 0 0 1 ab 0 0 0 1 a b 0 0 0 1 a b 0 0 0 1 13 / 33

Experimental Distributions The PR box, a nonlocal distribution: ab 1/2 0 0 1/2 ab 1/2 0 0 1/2 a b 1/2 0 0 1/2 a b 0 1/2 1/2 0 14 / 33

Experimental Distributions A possible decomposition? ab 1 0 0 0 ab 1 0 0 0 a b 1 0 0 0 a b 0 1 0 0 and ab 0 0 0 1 ab 0 0 0 1 a b 0 0 0 1 a b 0 0 1 0 When Bob chooses b, Alice can signal Bob. 15 / 33

Experimental Distributions A possible decomposition? ab 1 0 0 0 ab 1 0 0 0 a b 1 0 0 0 a b 0 1 0 0 and ab 0 0 0 1 ab 0 0 0 1 a b 0 0 0 1 a b 0 0 1 0 When Bob chooses b, Alice can signal Bob. 16 / 33

Experimental Distributions If one cannot send signals between Alice and Bob, then the randomness in the PR box cannot be eliminated. ab 1/2 0 0 1/2 ab 1/2 0 0 1/2 a b 1/2 0 0 1/2 a b 0 1/2 1/2 0 17 / 33

Data from a photonic loophole-free experiment Raw Counts from a data run: ab 6547 3415 3276 33036105 ab 7080 2931 24396 33007876 a b 6853 22536 3062 33005133 a b 117 28740 31300 32971848 Induced empirical distribution (No-signaling adjusted): ab 0.00019868 0.00010348 0.00009916 0.99959860 ab 0.00021368 0.00008848 0.00073796 0.99895980 a b 0.00020532 0.00067616 0.00009252 0.99902592 a b 0.00000356 0.00087792 0.00094812 0.99817032 18 / 33

Data from a photonic loophole-free experiment Raw Counts from a data run: ab 6547 3415 3276 33036105 ab 7080 2931 24396 33007876 a b 6853 22536 3062 33005133 a b 117 28740 31300 32971848 Induced empirical distribution (No-signaling adjusted): ab 0.00019868 0.00010348 0.00009916 0.99959860 ab 0.00021368 0.00008848 0.00073796 0.99895980 a b 0.00020532 0.00067616 0.00009252 0.99902592 a b 0.00000356 0.00087792 0.00094812 0.99817032 19 / 33

Data from a photonic loophole-free experiment Induced empirical distribution (No-signaling adjusted): ab 0.00019868 0.00010348 0.00009916 0.99959860 ab 0.00021368 0.00008848 0.00073796 0.99895980 a b 0.00020532 0.00067616 0.00009252 0.99902592 a b 0.00000356 0.00087792 0.00094812 0.99817032 Can be induced by:.999972 Local Realist Distribution +.000028 PR box 20 / 33

Data from a photonic loophole-free experiment.000028 PR Box Over the course of 132,161,215 trials, this means 3,700 PR boxes. 21 / 33

Extracting the Randomness To certify the min-entropy and extract the randomness, we need a protocol that is: Effective in a very low-violation regime (CHSH 2.0000564) Robust to possible memory effects Handles finite statistics effects (no asymptotic bounds) 22 / 33

Extracting the Randomness Existing methods are not effective in our regime Pironio et al., Pironio/Massar, Fehr/Gelles/Schaffner Vidick/Vazirani Chung/Shi/Wu, Miller/Shi Coudron/Yuen Bancal/Sheridan/Scarani, Nieto-Silleras/Pironio/Silman Thinh et al. 23 / 33

Extracting the Randomness The following papers develop statistical analysis techniques that are effective for falsifying local realism in low-violation photonic experiments, and suggest a way forward for certifying min-entropy. A robust mathematical model for a loophole-free ClauserHorne experiment, P. Bierhorst, J. Phys. A 2015 Requirements for a loophole-free photonic Bell test using imperfect setting generators, J. Kofler, M. Giustina, J.-A. Larsson, M. W. Mitchell, Phys. Rev. A 2016 Asymptotically optimal data analysis for rejecting local realism, Y. Zhang, S. Glancy, E. Knill, Phys. Rev. A 2011 24 / 33

Extracting the Randomness The following papers develop statistical analysis techniques that are effective for falsifying local realism in low-violation photonic experiments, and suggest a way forward for certifying min-entropy. A robust mathematical model for a loophole-free ClauserHorne experiment, P. Bierhorst, J. Phys. A 2015 Requirements for a loophole-free photonic Bell test using imperfect setting generators, J. Kofler, M. Giustina, J.-A. Larsson, M. W. Mitchell, Phys. Rev. A 2016 Asymptotically optimal data analysis for rejecting local realism, Y. Zhang, S. Glancy, E. Knill, Phys. Rev. A 2011 25 / 33

The Protocol 1 Choose a Bell function T from experimental outcomes to R +, satisfying T > 0, E LR (T ) 1, E PR (T ) = 1 + m, m > 0 2 In an experiment of n trials, compute n i=1 T i = V. 3 For values of V >> 1, our result puts a lower bound on the amount of min-entropy σ s present in the data 4 Extract randomness to ɛ-uniform bits using Trevisan extractor 26 / 33

The Protocol 1 Choose a Bell function T from experimental outcomes to R +, satisfying T > 0, E LR (T ) 1, E PR (T ) = 1 + m, m > 0 2 In an experiment of n trials, compute n i=1 T i = V. 3 For values of V >> 1, our result puts a lower bound on the amount of min-entropy σ s present in the data 4 Extract randomness to ɛ-uniform bits using Trevisan extractor ab 1.0244 0.9643 0.9638 1 ab 1.0315 0.9393 0.9958 1 a b 1.0318 0.9955 0.9399 1 a b 0.9123 1.0044 1.0041 1 m = 0.012 Generate T with method of Zhang, Glancy, Knill, Phys. Rev. A 2011 27 / 33

The Protocol 1 Choose a Bell function T from experimental outcomes to R +, satisfying T > 0, E LR (T ) 1, E PR (T ) = 1 + m, m > 0 2 In an experiment of n trials, compute n i=1 T i = V. 3 For values of V >> 1, our result puts a lower bound on the amount of min-entropy σ s present in the data 4 Extract randomness to ɛ-uniform bits using Trevisan extractor n = 132, 161, 215 V = 2.76 10 9 28 / 33

The Protocol 1 Choose a Bell function T from experimental outcomes to R +, satisfying T > 0, E LR (T ) 1, E PR (T ) = 1 + m, m > 0 2 In an experiment of n trials, compute n i=1 T i = V. 3 For values of V >> 1, our result puts a lower bound on the amount of min-entropy σ s present in the data 4 Extract randomness to ɛ-uniform bits using Trevisan extractor Key result: [ ] 2m + 1 n V ɛ s σ s n log 2 2m When the protocol is passed, σ s is the average min entropy of the output string, conditioned on the setting string. 29 / 33

The Protocol 1 Choose a Bell function T from experimental outcomes to R +, satisfying T > 0, E LR (T ) 1, E PR (T ) = 1 + m, m > 0 2 In an experiment of n trials, compute n i=1 T i = V. 3 For values of V >> 1, our result puts a lower bound on the amount of min-entropy σ s present in the data 4 Extract randomness to ɛ-uniform bits using Trevisan extractor We use updated software we wrote based on the Mauerer, Portmann, Scholz (arxiv:1212:.0520) implementation of Trevisan s extractor. We can extract up to t ɛ-uniform bits where t obeys the following formula: t + 4 log 2 t σ s 6 + 4 log 2 ɛ ext 30 / 33

Extractable Bits Results 1400 Error vs. Extractable Bits 1200 1000 800 600 400 200 0-10 -9-8 -7-6 -5-4 -3-2 -1 0 Log 10 Error Probability 31 / 33

Extractable Bits Results 2500 Blind 1 Blind 2 Error vs. Extractable Bits: New Data 2000 1500 1000 500 0-10 -9-8 -7-6 -5-4 -3-2 -1 0 Log 10 Error Probability 32 / 33

Conclusion 256 Extracted Bits: 1011000000101000101000011010100111001010110000111001010011101111 1001101101100010011110100101010100101001100101101110011000101001 0000100001011000100100101111110011001000000111111110001110111100 0111101101110110001100100001110101001100100101010000111101010100 Thank you! Peter Bierhorst National Institute of Standards and Technology, Boulder, CO 33 / 33