with Weak Measurements

Slides:



Advertisements
Similar presentations
Quantum Information and the PCP Theorem Ran Raz Weizmann Institute.
Advertisements

Implementation of Practically Secure Quantum Bit Commitment Protocol Ariel Danan School of Physics Tel Aviv University September 2008.
MIT and James Orlin © Game Theory 2-person 0-sum (or constant sum) game theory 2-person game theory (e.g., prisoner’s dilemma)
1 12. Principles of Parameter Estimation The purpose of this lecture is to illustrate the usefulness of the various concepts introduced and studied in.
Tight Bounds for Unconditional Authentication Protocols in the Moni Naor Gil Segev Adam Smith Weizmann Institute of Science Israel Modeland Shared KeyManual.
Quantum Cryptography ( EECS 598 Presentation) by Amit Marathe.
Eran Omri, Bar-Ilan University Joint work with Amos Beimel and Ilan Orlov, BGU Ilan Orlov…!??!!
Short course on quantum computing Andris Ambainis University of Latvia.
Quantum Key Distribution (QKD) John A Clark Dept. of Computer Science University of York, UK
Quantum Cryptography Qingqing Yuan. Outline No-Cloning Theorem BB84 Cryptography Protocol Quantum Digital Signature.
Evaluating Hypotheses
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 {|+>,|->}
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.
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.
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 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:
Cryptography In the Bounded Quantum-Storage Model Christian Schaffner, BRICS University of Århus, Denmark ECRYPT Autumn School, Bertinoro Wednesday, October.
Cryptography In the Bounded Quantum-Storage Model Christian Schaffner, BRICS University of Århus, Denmark 9 th workshop on QIP 2006, Paris Tuesday, January.
1 A Randomized Space-Time Transmission Scheme for Secret-Key Agreement Xiaohua (Edward) Li 1, Mo Chen 1 and E. Paul Ratazzi 2 1 Department of Electrical.
Introduction to Quantum Key Distribution
CS555Topic 251 Cryptography CS 555 Topic 25: Quantum Crpytography.
PROBABILITY AND STATISTICS FOR ENGINEERING Hossein Sameti Department of Computer Engineering Sharif University of Technology Principles of Parameter Estimation.
Quantum Cryptography Slides based in part on “A talk on quantum cryptography or how Alice outwits Eve,” by Samuel Lomonaco Jr. and “Quantum Computing”
Cryptography In the Bounded Quantum-Storage Model
The question Can we generate provable random numbers? …. ?
Page 1 COMPSCI 290.2: Computer Security “Quantum Cryptography” including Quantum Communication Quantum Computing.
Quantum Cryptography Antonio Acín
Can small quantum systems learn? NATHAN WIEBE & CHRISTOPHER GRANADE, DEC
Evaluating Hypotheses. Outline Empirically evaluating the accuracy of hypotheses is fundamental to machine learning – How well does this estimate its.
Chapter 6 Sampling and Sampling Distributions
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.
Cryptography and Non-Locality Valerio Scarani Centre for Quantum Technologies National University of Singapore Ph.D. and post-doc positions available Barrett.
Le avventure di Alice, Bob & Eve nel mondo dei quanti Stefano Mancini Dipartimento di Fisica Università di Camerino.
CS480 Cryptography and Information Security Huiping Guo Department of Computer Science California State University, Los Angeles 14. Digital signature.
Chapter 10 Confidence Intervals for Proportions © 2010 Pearson Education 1.
TBAS: Enhancing Wi-Fi Authentication by Actively Eliciting Channel State Information Muye Liu, Avishek Mukherjee, Zhenghao Zhang, and Xiuwen Liu Florida.
Virtual University of Pakistan
Topic 36: Zero-Knowledge Proofs
J. Miranda University of Ottawa 21 November 2003
12. Principles of Parameter Estimation
COMPSCI 290.2: Computer Security
Quantum Information Promises new insights Anthony J
Public-key Cryptography
Weak Value Assisted Quantum Key Distribution
Quantum Cryptography Quantum Computing
Unconditional Security of the Bennett 1992 quantum key-distribution protocol over a lossy and noisy channel Kiyoshi Tamaki * *Perimeter Institute for.
Quantum Key Distribution
How to handle missing data values
Topic 25: Discrete LOG, DDH + Attacks on Plain RSA
CV Cryptography Using a Bidirectional Quantum Channel
Quantum Cryptography Alok.T.J EC 11.
Brandin L Claar CSE 597E 5 December 2001
Quantum Information with Continuous Variables
Quantum Information Theory Introduction
Richard Cleve DC 2117 Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871 Lecture 22 (2009) Richard.
Quantum Cryptography Scott Roberts CSE /01/2001.
Decoupling with random diagonal-unitaries
Authenticated QKD protocol using one-time ID
Capacity of Ad Hoc Networks
Information-Theoretic Security
Cryptography Lecture 4.
Model generalization Brief summary of methods
Learning From Observed Data
March 2019 Project: IEEE P Working Group for Wireless Personal Area Networks (WPANs) Submission Title: [Security vs. Sequence Length Considerations]
Encoding of Stimulus Probability in Macaque Inferior Temporal Cortex
12. Principles of Parameter Estimation
Presentation transcript:

with Weak Measurements Quantum Cryptography with Weak Measurements APS March Meeting 16 March 2017 Jake Farinholt Strategic & Computing Systems Department Naval Surface Warfare Center, Dahlgren Div. James Troupe Applied Research Laboratories The University of Texas at Austin arXiv:1702.04836

What are Weak Measurements? Suppose the measuring system, called the “measuring device” (MD), has an initial quantum state that is a real-valued Gaussian with unit uncertainty. Using the von Neumann representation of the measurement interaction between the MD and the system, we have 𝐻 𝑖𝑛𝑡 =𝑔 𝑡 𝑃 𝑀𝐷 ⊗ 𝐴 , where 𝑔(𝑡) is the coupling strength as a function of time. Let 𝑔=∫𝑔 𝑡 𝑑𝑡 be the time-integrated coupling. In the limit of very weak coupling 𝑔 𝐴 ≪𝜎 between the measuring device and the system, the weak measurement of the observable 𝐴 results in a shift in the measuring device’s wavefunction according to 𝜓 𝑥 →𝜓 𝑥 −𝑔Re 𝐴 𝑤 .

What are Weak Measurements? The outcome of a weak measurement of an observable on a single quantum system will provide essentially no information about the system, but it will also not significantly disturb the system by collapsing the initial state. If, however, a weak measurement of some observable 𝐴 is performed on a large ensemble of identically prepared systems in some initial state 𝜌 𝑖 , then the mean of the weak measurement results yields the expectation value: 𝜇=𝑔 𝐴 𝜌 𝑖 .

Including Weak Measurements in QKD BB84: Assumption: Parameter estimation can only be performed on the subset of signals for which the bases agree. Bob tries to enforce the assumed uniformity of Eve’s interactions by randomizing his basis choice. Bases Agree Eve Alice Bob RNG Bases Disagree Visually emphasize Bob needs to randomly switch bases to “enforce” the uniformity of noise assumption.

Including Weak Measurements in QKD BB84: Reality: Eve can correlate her measurements with Bob’s. Assumption is violated. Eve can assure that her interactions when the bases agree introduce no noise. INSECURE!! Bases Agree Eve Alice Bob RNG Eve Bases Disagree Visually emphasize Bob needs to randomly switch bases to “enforce” the uniformity of noise assumption.

Including Weak Measurements in QKD Adding Weak Measurements: Idea: Using weak measurements for parameter estimation, Bob is able to use information from EACH signal, regardless of basis agreement. Eliminates all measurement basis-dependent attacks. Bob no longer needs to randomize (strong) measurement basis. Eve Alice Bob WM Visually emphasize Bob needs to randomly switch bases to “enforce” the uniformity of noise assumption.

Including Weak Measurements in QKD THE INTUITION: If we know the quantum system was initially prepared in the pure state | 𝜓 𝑖 〉, then the difference between the measured and ideal expectation values should provide some information about the evolution of the initial state. 𝐴 𝜓 𝑖 𝜓 𝑖 → 𝐴 𝜌 𝑖 𝜓 𝑖 𝜓 𝑖 → 𝜌 𝑖 The weak measurement observables for this protocol are 𝐻 ± = 1 2 𝐼+ 1 2 𝑍±𝑋

The Weak Measurement QKD Protocol Alice generates a length 2𝑛 random string of bits, encoding each bit in either the 𝑋 or 𝑍 basis uniformly at random. Then she transmits each qubit to Bob. Bob performs weak measurements of 𝐻 + or 𝐻 − chosen uniformly at random on each signal he receives, then strongly measures in the 𝒁 basis, recording both his weak and strong measurement result. Bob publicly reveals the weak measurement results with Alice, who breaks them into subensembles conditioned on the transmitted state and averages each. She uses this information to calculate the 𝛿 𝑋 and 𝛿 𝑍 error rates. If the error rates are low enough, Alice announces which signals were prepared in the 𝑍 basis. Alice and Bob perform classical post-processing on this subset to distill a smaller secure shared key.

The Weak Measurement QKD Protocol: Parameter Estimation Suppose Alice prepares the state 𝛼 𝛼 (𝛼∈{0,1,+,−}), but the mixed state 𝜌 𝛼 = 1 2 𝐼+ 𝑟 𝑥 𝛼 𝑋+ 𝑟 𝑦 𝛼 𝑌+ 𝑟 𝑧 𝛼 𝑍 arrives at Bob’s weak measurements. We have 𝑟 𝑥 𝛼 = 2 𝐻 + 𝜌 𝛼 − 𝐻 − 𝜌 𝛼 , 𝑟 𝑧 𝛼 = 2 𝐻 + 𝜌 𝛼 + 𝐻 − 𝜌 𝛼 −1 , and 𝛿 𝑋 = 1 4 2− 𝑟 𝑥 + + 𝑟 𝑥 − , 𝛿 𝑍 = 1 4 2− 𝑟 𝑧 0 + 𝑟 𝑧 1 .

The Weak Measurement QKD Protocol: Parameter Estimation Let 𝑔 ± denote the coupling constant associated with the weak measurement of observable 𝐻 ± . Average of the weak measurement results of 𝐻 ± conditioned on initial state 𝛼 𝛼 is given by 𝜇 𝛼 ± = 𝑔 ± 𝐻 ± 𝜌 𝛼 . Assuming unital noise, we have 𝐻 ± 𝜌 𝛼 + 𝐻 ± 𝜌 𝛼 ⊥ =1, so that 𝜇 𝛼 ± + 𝜇 𝛼 ⊥ ± = 𝑔 ± . We can calculate the coupling constant independently from the error rates. We do not need to trust the coupling!

The Weak Measurement QKD Protocol: Device Imperfections Imperfect, but unbiased weak measurement observables: Expectation values stay the same, but variance of measurement results increases. We place an upper bound on permissible variance, 𝜎 𝑈 2 .

The Weak Measurement QKD Protocol: Device Imperfections Uniformly biased weak measurement observables: Let 𝛿 𝑏 ≈ 1 2 𝛿 𝑋 + 𝛿 𝑍 . Then uniformly biasing the observables always increases the estimate of 𝛿 𝑏 . In fact, this holds (within modest noise environments) even when the bias is not uniform (e.g. 𝐻 + and 𝐻 − can have separate biases applied).

The Weak Measurement QKD Protocol: Towards Weak Measurement Device Independence Suppose weak measurements occur inside a black box in possession of Eve. Eve receives the weak measurement result and can choose to either broadcast it or broadcast some other number. Assumption 1: Eve cannot manipulate the path between weak measurement and post-selection. (She has not covertly placed any components inside of Bob’s measurement device.) Assumption 2: Eve has limited knowledge of which observable is weakly measured on each signal. (She can correctly guess the observable choice with some probability 1 2 ≤ 𝑝 𝐻 <1.)

The Weak Measurement QKD Protocol: Towards Weak Measurement Device Independence QUESTION: Can Eve fake the error estimates to her benefit? Answer: Probably not. We designed several weak measurement attack strategies we believe to be optimal given the constraints. Weak Measurement Certification Step: Verify 𝛿 𝑋 , 𝛿 𝑍 ≥0. Verify estimated WM variance 𝜎 𝑀𝐷 2 is below some predefined threshold bound 𝜎 𝑈 2 . These checks place very tight restrictions on what Eve can do given limited knowledge of the source and choice of WM observable The threshold bound 𝜎 𝑈 2 determines the upper bound we place on Eve’s access to the choice of WM observable.

The Weak Measurement QKD Protocol: Expected Performance MDI-QKD with decoys (blue) and WM-QKD with decoys (red) asymptotic performance using standard APDs and varying decoy parameters. As can be seen, WM-QKD is far more robust to varying decoy parameters than MDI-QKD.

Thank You! Acknowledgements This research was funded in part by ONR Grants N00014-15-1-2225 and N0001416WX01474, as well as an NSWCDD In-house Laboratory Independent Research (ILIR) grant. Thank You!

Backup Slides

The Weak Measurement QKD Protocol: An Implementation

The Weak Measurement QKD Protocol: Expected Performance WM-QKD with decoy states (red) and BB84 with decoy states (blue), using standard APDs (solid lines) and High Efficiency APDs (dotted lines). The asymptotic performance of WM-QKD is almost indistinguishable from that of BB84.

The Weak Measurement QKD Protocol: Expected Performance MDI-QKD with decoys (blue) and WM-QKD with decoys (red) asymptotic performance using standard APDs and varying signal intensities.

The Weak Measurement QKD Protocol: Expected Performance MDI-QKD with decoys (blue) and WM-QKD with decoys (red) asymptotic performance using SNSPDs and varying signal intensities.