Entanglement sampling and applications Omar Fawzi (ETH Zürich) Joint work with Frédéric Dupuis (Aarhus University) and Stephanie Wehner (CQT, Singapore)

Slides:



Advertisements
Similar presentations
How Much Information Is In Entangled Quantum States? Scott Aaronson MIT |
Advertisements

Foundations of Cryptography Lecture 3 Lecturer: Moni Naor.
QCRYPT 2011, Zurich, September 2011 Lluis Masanes 1, Stefano Pironio 2 and Antonio Acín 1,3 1 ICFO-Institut de Ciencies Fotoniques, Barcelona 2 Université.
Short seed extractors against quantum storage Amnon Ta-Shma Tel-Aviv University 1.
A Tight High-Order Entropic Quantum Uncertainty Relation with Applications Serge Fehr, Christian Schaffner (CWI Amsterdam, NL) Renato Renner (ETH Zürich,
Information theory Multi-user information theory A.J. Han Vinck Essen, 2004.
Spin chains and channels with memory Martin Plenio (a) & Shashank Virmani (a,b) quant-ph/ , to appear prl (a)Institute for Mathematical Sciences.
Fixing the lower limit of uncertainty in the presence of quantum memory Archan S. Majumdar S. N. Bose National Centre for Basic Sciences, Kolkata Collaborators:
Christian Schaffner CWI Amsterdam, Netherlands Position-Based Quantum Cryptography: Impossibility and Constructions Seminar Eindhoven, Netherlands Wednesday,
Tight Bounds for Unconditional Authentication Protocols in the Moni Naor Gil Segev Adam Smith Weizmann Institute of Science Israel Modeland Shared KeyManual.
Eran Omri, Bar-Ilan University Joint work with Amos Beimel and Ilan Orlov, BGU Ilan Orlov…!??!!
NON-MALLEABLE EXTRACTORS AND SYMMETRIC KEY CRYPTOGRAPHY FROM WEAK SECRETS Yevgeniy Dodis and Daniel Wichs (NYU) STOC 2009.
Quantum Spectrum Testing Ryan O’Donnell John Wright (CMU)
Short course on quantum computing Andris Ambainis University of Latvia.
Yan Huang, Jonathan Katz, David Evans University of Maryland, University of Virginia Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose.
Seminar in Foundations of Privacy Gil Segev Message Authentication in the Manual Channel Model.
A Tight High-Order Entropic Quantum Uncertainty Relation with Applications Serge Fehr, Christian Schaffner (CWI Amsterdam, NL) Renato Renner (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.
Quantum Cryptography Marshall Roth March 9, 2007.
Interactive Proofs For Quantum Computations Dorit Aharonov, Michael Ben-Or, Elad Eban School of Computer Science and Engineering The Hebrew University.
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 {|+>,|->}
Quantum Algorithms II Andrew C. Yao Tsinghua University & Chinese U. of Hong Kong.
An Arbitrary Two-qubit Computation in 23 Elementary Gates or Less Stephen S. Bullock and Igor L. Markov University of Michigan Departments of Mathematics.
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.
Public-Key Encryption with Lazy Parties Kenji Yasunaga Institute of Systems, Information Technologies and Nanotechnologies (ISIT), Japan Presented at SCN.
Witnesses for quantum information resources Archan S. Majumdar S. N. Bose National Centre for Basic Sciences, Kolkata, India Collaborators: S. Adhikari,
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.
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.
The Operational Meaning of Min- and Max-Entropy
Application of quantum universal composability theorem 1. Motivation : e.g. is QKD secure? 2. Tool : universal composability 3. Application 1: composability.
Christian Schaffner CWI Amsterdam, Netherlands Quantum Cryptography beyond Key Distribution Workshop on Post-Quantum Security Models Paris, France Tuesday,
QCCC07, Aschau, October 2007 Miguel Navascués Stefano Pironio Antonio Acín ICFO-Institut de Ciències Fotòniques (Barcelona) Cryptographic properties of.
Rei Safavi-Naini University of Calgary Joint work with: Hadi Ahmadi iCORE Information Security.
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.
TECH Computer Science Problem: Selection Design and Analysis: Adversary Arguments The selection problem >  Finding max and min Designing against an adversary.
The Operational Meaning of Min- and Max-Entropy Christian Schaffner – CWI Amsterdam, NL joint work with Robert König – Caltech Renato Renner – ETH Zürich,
1 hardware of quantum computer 1. quantum registers 2. quantum gates.
Practical Aspects of Quantum Coin Flipping Anna Pappa Presentation at ACAC 2012.
On the Communication Complexity of SFE with Long Output Daniel Wichs (Northeastern) joint work with Pavel Hubáček.
1 Information Theory Nathanael Paul Oct. 09, 2002.
Christian Schaffner, PhD student NF-årsfest 2005 A A R H U S U N I V E R S I T E T DAIMI – Department of Computer Science BRICS – Basic Research in Computer.
CS555Topic 251 Cryptography CS 555 Topic 25: Quantum Crpytography.
Quantum correlations with no causal order OgnyanOreshkov, Fabio Costa, ČaslavBrukner Bhubaneswar arXiv: December2011 Conference on Quantum.
Nawaf M Albadia
Christian Schaffner CWI Amsterdam, Netherlands Quantum Cryptography beyond Key Distribution Tropical QKD Waterloo, ON, Canada Wednesday, 16 June 2010.
Cryptography In the Bounded Quantum-Storage Model
Quantum Cryptography Christian Schaffner Research Center for Quantum Software Institute for Logic, Language and Computation (ILLC) University of Amsterdam.
The question Can we generate provable random numbers? …. ?
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.
Quantum Cryptography Christian Schaffner Research Center for Quantum Software Institute for Logic, Language and Computation (ILLC) University of Amsterdam.
1 Leonid Reyzin Boston University Adam Smith Weizmann  IPAM  Penn State Robust Fuzzy Extractors & Authenticated Key Agreement from Close Secrets Yevgeniy.
Page 1 COMPSCI 290.2: Computer Security “Quantum Cryptography” including Quantum Communication Quantum Computing.
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
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.
Locking of correlations Debbie Leung U. Waterloo From: Charles Bennett Date: Sept 06, 2001 Subject: Pictures from Huangshan China Dear Friends, Here is.
Secret keys and random numbers from quantum non locality Serge Massar.
Cryptography in the Bounded-Quantum-Storage Model Christian Schaffner BRICS, University of Aarhus PhD Defense Friday, April 27 th 2007.
Entropic uncertainty relations for anti-commuting observables
Sampling of min-entropy relative to quantum knowledge Robert König in collaboration with Renato Renner TexPoint fonts used in EMF. Read the TexPoint.
When are Fuzzy Extractors Possible?
Quantum Information Theory Introduction
When are Fuzzy Extractors Possible?
Sequential sharing of nonlocal correlations
Presentation transcript:

Entanglement sampling and applications Omar Fawzi (ETH Zürich) Joint work with Frédéric Dupuis (Aarhus University) and Stephanie Wehner (CQT, Singapore) arXiv: Process

Uncertainty relation game Choose n-qubit state Choose random Guess X … X1X1 X2X2 X n-1 XnXn Eve Alice Maximum ? Choose n-qubit state Choose random Guess X … X1X1 X2X2 X n-1 XnXn EVE Maximum P guess ?

Uncertainty relation game Can Eve do better with different ? No [Damgard, Fehr, Salvail, Shaffner, Renner, 2008] Measure in X Guess X Notation: Between 0 and n

Uncertainty relations with quantum Eve Eve has a quantum memory Measure in X A E Guess X using E and Maximum ? [Berta, Christandl, Colbeck, Renes, Renner, 2010]

Uncertainty relations with quantum Eve Measure in X A E X

Uncertainty relations with quantum Eve E.g., if storage of Eve is bounded? Uncertainty relation + chain rule  Converse Is maximal entanglement necessary for large P guess ? At least n/2 qubits of memory necessary using maximal entanglement Main result: YES

The uncertainty relation Measure for closeness to maximal entanglement Log of guessing prob. E=X Max entangled between –n and n between 0 and n Max entangled

The uncertainty relation Max entanglement

General statement Mea s in Θ E A X M M E A C More generally: Example: Gives bounds on Q Rand Access Codes

Application to two-party cryptography Equal? passwordStored password Yes/No “I’m Alice!” Malicious ATM: tries to learn passwords Malicious user: tries to learn other customers passwords ??

Application to secure two- party computation Unconditional security impossible [Mayers 1996; Lo, Chau, 1996] Physical assumption: bounded/noisy quantum storage [Damgard, Fehr, Salvail, Schaffner 2005; Wehner, Schaffner, Terhal 2008] o Security if Using new uncertainty relation o Security if n: number of communicated qubits

Proof of uncertainty relation Step 1: Conditional state Mea s in Θ E A X

Proof of uncertainty relation Step 2: Write by expanding in Pauli basis

Proof of uncertainty relation Relate and Observation 1: Not good enough

Proof of uncertainty relation Relate and Observation 1: Observation 2: Combine 1 and 2  done!

Conclusion Summary o Uncertainty relation with quantum adversary for BB84 measurements o Generic tool to lower bound output entropy using input entropy Open question o Combine with other methods to improve? ?