Quantum sampling of mixed states

Size: px
Start display at page:

Download "Quantum sampling of mixed states"

Transcription

1 Quantum sampling of mixed states Philippe Lamontagne January 7th Philippe Lamontagne Quantum sampling of mixed states January 7th 1 / 9

2 The setup Philippe Lamontagne Quantum sampling of mixed states January 7th 2/9

3 The setup The goal of Alice is to pass while still being entangled with B 0. Philippe Lamontagne Quantum sampling of mixed states January 7th 2/9

4 What does sampling do? Bob has a reference n-qubit state ϕ and tests that ρ B ϕ ϕ by sampling the state, i.e., measuring random qubits and comparing results with expected ones. Philippe Lamontagne Quantum sampling of mixed states January 7th 3 / 9

5 What does sampling do? Bob has a reference n-qubit state ϕ and tests that ρ B ϕ ϕ by sampling the state, i.e., measuring random qubits and comparing results with expected ones. Example ϕ = : Bob measures random positions and check if result is 0. Philippe Lamontagne Quantum sampling of mixed states January 7th 3 / 9

6 What does sampling do? Bob has a reference n-qubit state ϕ and tests that ρ B ϕ ϕ by sampling the state, i.e., measuring random qubits and comparing results with expected ones. Example ϕ = : Bob measures random positions and check if result is 0. ϕ = H θ 1 x 1 H θn x n : Bob measures random positions i in basis θ i and check if result is x i. Philippe Lamontagne Quantum sampling of mixed states January 7th 3 / 9

7 What does sampling do? Bob has a reference n-qubit state ϕ and tests that ρ B ϕ ϕ by sampling the state, i.e., measuring random qubits and comparing results with expected ones. Example ϕ = : Bob measures random positions and check if result is 0. ϕ = H θ 1 x 1 H θn x n : Bob measures random positions i in basis θ i and check if result is x i. General form: ϕ = U 1 0 U n 0. Philippe Lamontagne Quantum sampling of mixed states January 7th 3 / 9

8 What does sampling do? Bob has a reference n-qubit state ϕ and tests that ρ B ϕ ϕ by sampling the state, i.e., measuring random qubits and comparing results with expected ones. Example ϕ = : Bob measures random positions and check if result is 0. ϕ = H θ 1 x 1 H θn x n : Bob measures random positions i in basis θ i and check if result is x i. General form: ϕ = U 1 0 U n 0. Bob tests that the state is pure. Philippe Lamontagne Quantum sampling of mixed states January 7th 3 / 9

9 The sampling theorem Theorem (Sampling, Bouman and Fehr) If Bob s measurement results coincide with the reference state, then the state resulting from the sampling is ɛ-close to the reference state. Philippe Lamontagne Quantum sampling of mixed states January 7th 4 / 9

10 The sampling theorem Theorem (Sampling, Bouman and Fehr) If Bob s measurement results coincide with the reference state, then the state resulting from the sampling is ɛ-close to the reference state. A consequence of this theorem is that if Alice passes in the experiment from slide 1, she has only approximately ɛn qubits entangled with B. Philippe Lamontagne Quantum sampling of mixed states January 7th 4 / 9

11 Why is this useful? In a cryptographic protocol, the reference state can be encoded by a classical cryptography: Bob can access the description of the state for the positions he wants to sample, but will have uncertainty on the state after sampling. Philippe Lamontagne Quantum sampling of mixed states January 7th 5 / 9

12 Why is this useful? In a cryptographic protocol, the reference state can be encoded by a classical cryptography: Bob can access the description of the state for the positions he wants to sample, but will have uncertainty on the state after sampling. Therefore, after sampling, Alice will have low entanglement with Bob s register and he will have high uncertainty on his register s state. This is a useful setup in quantum cryptography. Philippe Lamontagne Quantum sampling of mixed states January 7th 5 / 9

13 Sampling mixed states A restriction of the sampling theorem is that Bob needs a complete description of the reference state: it must be a pure state. Philippe Lamontagne Quantum sampling of mixed states January 7th 6 / 9

14 Sampling mixed states A restriction of the sampling theorem is that Bob needs a complete description of the reference state: it must be a pure state. If Bob only has a partial description of the reference string, Alice will have to fill the voids, but this leaves room to cheat. Philippe Lamontagne Quantum sampling of mixed states January 7th 6 / 9

15 Sampling mixed states A restriction of the sampling theorem is that Bob needs a complete description of the reference state: it must be a pure state. If Bob only has a partial description of the reference string, Alice will have to fill the voids, but this leaves room to cheat. Example Bob wants to check if Alice sent each qubit in either state 0 or + = 1 2 ( ), but does not know which. Philippe Lamontagne Quantum sampling of mixed states January 7th 6 / 9

16 Sampling mixed states A restriction of the sampling theorem is that Bob needs a complete description of the reference state: it must be a pure state. If Bob only has a partial description of the reference string, Alice will have to fill the voids, but this leaves room to cheat. Example Bob wants to check if Alice sent each qubit in either state 0 or + = 1 2 ( ), but does not know which. To sample a state of this form, he asks Alice to tell him in which basis (+ or ) he must measure to obtain 0. Philippe Lamontagne Quantum sampling of mixed states January 7th 6 / 9

17 Sampling mixed states A restriction of the sampling theorem is that Bob needs a complete description of the reference state: it must be a pure state. If Bob only has a partial description of the reference string, Alice will have to fill the voids, but this leaves room to cheat. Example Bob wants to check if Alice sent each qubit in either state 0 or + = 1 2 ( ), but does not know which. To sample a state of this form, he asks Alice to tell him in which basis (+ or ) he must measure to obtain 0. In the previous example, the reference state is a mixed state of the form θ α θh θ 0 0 H θ. Philippe Lamontagne Quantum sampling of mixed states January 7th 6 / 9

18 Alice can always cheat There is no sampling method that can prevent Alice from being entangled in the previous example. Alice can prepare n states of the form 1 2 ( ) and send the second qubit to Bob. Philippe Lamontagne Quantum sampling of mixed states January 7th 7 / 9

19 Alice can always cheat There is no sampling method that can prevent Alice from being entangled in the previous example. Alice can prepare n states of the form 1 2 ( ) and send the second qubit to Bob.When asked to announce the basis, Alice measures the qubit she kept. Therefore, Bob will always measure 0, and Alice will be entangled with each qubit not sampled. Philippe Lamontagne Quantum sampling of mixed states January 7th 7 / 9

20 Alice can always cheat There is no sampling method that can prevent Alice from being entangled in the previous example. Alice can prepare n states of the form 1 2 ( ) and send the second qubit to Bob.When asked to announce the basis, Alice measures the qubit she kept. Therefore, Bob will always measure 0, and Alice will be entangled with each qubit not sampled. We want a sampling theorem that shows that only states of the form θ α θ θ A H θ 0 B can pass the sampling. Philippe Lamontagne Quantum sampling of mixed states January 7th 7 / 9

21 How do you sample a mixed state? Philippe Lamontagne Quantum sampling of mixed states January 7th 8/9

22 Questions? Philippe Lamontagne Quantum sampling of mixed states January 7th 9 / 9

Cryptography CS 555. Topic 25: Quantum Crpytography. CS555 Topic 25 1

Cryptography CS 555. Topic 25: Quantum Crpytography. CS555 Topic 25 1 Cryptography CS 555 Topic 25: Quantum Crpytography CS555 Topic 25 1 Outline and Readings Outline: What is Identity Based Encryption Quantum cryptography Readings: CS555 Topic 25 2 Identity Based Encryption

More information

CS/Ph120 Homework 8 Solutions

CS/Ph120 Homework 8 Solutions CS/Ph0 Homework 8 Solutions December, 06 Problem : Thinking adversarially. Solution: (Due to De Huang) Attack to portocol : Assume that Eve has a quantum machine that can store arbitrary amount of quantum

More information

Lecture 3: Superdense coding, quantum circuits, and partial measurements

Lecture 3: Superdense coding, quantum circuits, and partial measurements CPSC 59/69: Quantum Computation John Watrous, University of Calgary Lecture 3: Superdense coding, quantum circuits, and partial measurements Superdense Coding January 4, 006 Imagine a situation where two

More information

Quantum Simultaneous Contract Signing

Quantum Simultaneous Contract Signing Quantum Simultaneous Contract Signing J. Bouda, M. Pivoluska, L. Caha, P. Mateus, N. Paunkovic 22. October 2010 Based on work presented on AQIS 2010 J. Bouda, M. Pivoluska, L. Caha, P. Mateus, N. Quantum

More information

Quantum Setting with Applications

Quantum Setting with Applications in the Quantum Setting with Applications Frédéric Dupuis 1 Serge Fehr 2 Philippe Lamontagne 3 Louis Salvail 3 2 CWI, Amsterdam, The Netherlands 1 Faculty of Informatics, Masaryk University, Brno, Czech

More information

Lecture: Quantum Information

Lecture: Quantum Information Lecture: Quantum Information Transcribed by: Crystal Noel and Da An (Chi Chi) November 10, 016 1 Final Proect Information Find an issue related to class you are interested in and either: read some papers

More information

Quantum Cryptography. Areas for Discussion. Quantum Cryptography. Photons. Photons. Photons. MSc Distributed Systems and Security

Quantum Cryptography. Areas for Discussion. Quantum Cryptography. Photons. Photons. Photons. MSc Distributed Systems and Security Areas for Discussion Joseph Spring Department of Computer Science MSc Distributed Systems and Security Introduction Photons Quantum Key Distribution Protocols BB84 A 4 state QKD Protocol B9 A state QKD

More information

Security Implications of Quantum Technologies

Security Implications of Quantum Technologies Security Implications of Quantum Technologies Jim Alves-Foss Center for Secure and Dependable Software Department of Computer Science University of Idaho Moscow, ID 83844-1010 email: jimaf@cs.uidaho.edu

More information

Quantum information and quantum computing

Quantum information and quantum computing Middle East Technical University, Department of Physics January 7, 009 Outline Measurement 1 Measurement 3 Single qubit gates Multiple qubit gates 4 Distinguishability 5 What s measurement? Quantum measurement

More information

LECTURE NOTES ON Quantum Cryptography

LECTURE NOTES ON Quantum Cryptography Department of Software The University of Babylon LECTURE NOTES ON Quantum Cryptography By Dr. Samaher Hussein Ali College of Information Technology, University of Babylon, Iraq Samaher@itnet.uobabylon.edu.iq

More information

Quantum Gates, Circuits & Teleportation

Quantum Gates, Circuits & Teleportation Chapter 3 Quantum Gates, Circuits & Teleportation Unitary Operators The third postulate of quantum physics states that the evolution of a quantum system is necessarily unitary. Geometrically, a unitary

More information

Quantum Error Correcting Codes and Quantum Cryptography. Peter Shor M.I.T. Cambridge, MA 02139

Quantum Error Correcting Codes and Quantum Cryptography. Peter Shor M.I.T. Cambridge, MA 02139 Quantum Error Correcting Codes and Quantum Cryptography Peter Shor M.I.T. Cambridge, MA 02139 1 We start out with two processes which are fundamentally quantum: superdense coding and teleportation. Superdense

More information

Entanglement and information

Entanglement and information Ph95a lecture notes for 0/29/0 Entanglement and information Lately we ve spent a lot of time examining properties of entangled states such as ab è 2 0 a b è Ý a 0 b è. We have learned that they exhibit

More information

+ = OTP + QKD = QC. ψ = a. OTP One-Time Pad QKD Quantum Key Distribution QC Quantum Cryptography. θ = 135 o state 1

+ = OTP + QKD = QC. ψ = a. OTP One-Time Pad QKD Quantum Key Distribution QC Quantum Cryptography. θ = 135 o state 1 Quantum Cryptography Quantum Cryptography Presented by: Shubhra Mittal Instructor: Dr. Stefan Robila Intranet & Internet Security (CMPT-585-) Fall 28 Montclair State University, New Jersey Introduction

More information

Ping Pong Protocol & Auto-compensation

Ping Pong Protocol & Auto-compensation Ping Pong Protocol & Auto-compensation Adam de la Zerda For QIP seminar Spring 2004 02.06.04 Outline Introduction to QKD protocols + motivation Ping-Pong protocol Security Analysis for Ping-Pong Protocol

More information

Introduction to Quantum Key Distribution

Introduction to Quantum Key Distribution Fakultät für Physik Ludwig-Maximilians-Universität München January 2010 Overview Introduction Security Proof Introduction What is information? A mathematical concept describing knowledge. Basic unit is

More information

Entanglement and Quantum Teleportation

Entanglement and Quantum Teleportation Entanglement and Quantum Teleportation Stephen Bartlett Centre for Advanced Computing Algorithms and Cryptography Australian Centre of Excellence in Quantum Computer Technology Macquarie University, Sydney,

More information

Quantum Teleportation Pt. 1

Quantum Teleportation Pt. 1 Quantum Teleportation Pt. 1 PHYS 500 - Southern Illinois University April 17, 2018 PHYS 500 - Southern Illinois University Quantum Teleportation Pt. 1 April 17, 2018 1 / 13 Types of Communication In the

More information

Classical Verification of Quantum Computations

Classical Verification of Quantum Computations Classical Verification of Quantum Computations Urmila Mahadev UC Berkeley September 12, 2018 Classical versus Quantum Computers Can a classical computer verify a quantum computation? Classical output (decision

More information

Lecture 21: Quantum communication complexity

Lecture 21: Quantum communication complexity CPSC 519/619: Quantum Computation John Watrous, University of Calgary Lecture 21: Quantum communication complexity April 6, 2006 In this lecture we will discuss how quantum information can allow for a

More information

arxiv: v7 [quant-ph] 20 Mar 2017

arxiv: v7 [quant-ph] 20 Mar 2017 Quantum oblivious transfer and bit commitment protocols based on two non-orthogonal states coding arxiv:1306.5863v7 [quant-ph] 0 Mar 017 Li Yang State Key Laboratory of Information Security, Institute

More information

Cryptography in a quantum world

Cryptography in a quantum world T School of Informatics, University of Edinburgh 25th October 2016 E H U N I V E R S I T Y O H F R G E D I N B U Outline What is quantum computation Why should we care if quantum computers are constructed?

More information

Introduction to Cryptography Lecture 13

Introduction to Cryptography Lecture 13 Introduction to Cryptography Lecture 13 Benny Pinkas June 5, 2011 Introduction to Cryptography, Benny Pinkas page 1 Electronic cash June 5, 2011 Introduction to Cryptography, Benny Pinkas page 2 Simple

More information

CS/Ph120 Homework 1 Solutions

CS/Ph120 Homework 1 Solutions CS/Ph0 Homework Solutions October, 06 Problem : State discrimination Suppose you are given two distinct states of a single qubit, ψ and ψ. a) Argue that if there is a ϕ such that ψ = e iϕ ψ then no measurement

More information

Lecture 38: Secure Multi-party Computation MPC

Lecture 38: Secure Multi-party Computation MPC Lecture 38: Secure Multi-party Computation Problem Statement I Suppose Alice has private input x, and Bob has private input y Alice and Bob are interested in computing z = f (x, y) such that each party

More information

Tutorial on Quantum Computing. Vwani P. Roychowdhury. Lecture 1: Introduction

Tutorial on Quantum Computing. Vwani P. Roychowdhury. Lecture 1: Introduction Tutorial on Quantum Computing Vwani P. Roychowdhury Lecture 1: Introduction 1 & ) &! # Fundamentals Qubits A single qubit is a two state system, such as a two level atom we denote two orthogonal states

More information

Quantum Teleportation Pt. 3

Quantum Teleportation Pt. 3 Quantum Teleportation Pt. 3 PHYS 500 - Southern Illinois University March 7, 2017 PHYS 500 - Southern Illinois University Quantum Teleportation Pt. 3 March 7, 2017 1 / 9 A Bit of History on Teleportation

More information

Chapter 13: Photons for quantum information. Quantum only tasks. Teleportation. Superdense coding. Quantum key distribution

Chapter 13: Photons for quantum information. Quantum only tasks. Teleportation. Superdense coding. Quantum key distribution Chapter 13: Photons for quantum information Quantum only tasks Teleportation Superdense coding Quantum key distribution Quantum teleportation (Theory: Bennett et al. 1993; Experiments: many, by now) Teleportation

More information

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

Bit-Commitment and Coin Flipping in a Device-Independent Setting Bit-Commitment and Coin Flipping in a Device-Independent Setting J. Silman Université Libre de Bruxelles Joint work with: A. Chailloux & I. Kerenidis (LIAFA), N. Aharon (TAU), S. Pironio & S. Massar (ULB).

More information

CS120, Quantum Cryptography, Fall 2016

CS120, Quantum Cryptography, Fall 2016 CS10, Quantum Cryptography, Fall 016 Homework # due: 10:9AM, October 18th, 016 Ground rules: Your homework should be submitted to the marked bins that will be by Annenberg 41. Please format your solutions

More information

Quantum Information & Quantum Computation

Quantum Information & Quantum Computation CS90A, Spring 005: Quantum Information & Quantum Computation Wim van Dam Engineering, Room 509 vandam@cs http://www.cs.ucsb.edu/~vandam/teaching/cs90/ Administrative The Final Examination will be: Monday

More information

Quantum Entanglement and Cryptography. Deepthi Gopal, Caltech

Quantum Entanglement and Cryptography. Deepthi Gopal, Caltech + Quantum Entanglement and Cryptography Deepthi Gopal, Caltech + Cryptography Concisely: to make information unreadable by anyone other than the intended recipient. The sender of a message scrambles/encrypts

More information

Quantum Communication. Serge Massar Université Libre de Bruxelles

Quantum Communication. Serge Massar Université Libre de Bruxelles Quantum Communication Serge Massar Université Libre de Bruxelles Plan Why Quantum Communication? Prepare and Measure schemes QKD Using Entanglement Teleportation Communication Complexity And now what?

More information

9. Distance measures. 9.1 Classical information measures. Head Tail. How similar/close are two probability distributions? Trace distance.

9. Distance measures. 9.1 Classical information measures. Head Tail. How similar/close are two probability distributions? Trace distance. 9. Distance measures 9.1 Classical information measures How similar/close are two probability distributions? Trace distance Fidelity Example: Flipping two coins, one fair one biased Head Tail Trace distance

More information

arxiv:quant-ph/ v1 13 Jan 2003

arxiv:quant-ph/ v1 13 Jan 2003 Deterministic Secure Direct Communication Using Ping-pong protocol without public channel Qing-yu Cai Laboratory of Magentic Resonance and Atom and Molecular Physics, Wuhan Institute of Mathematics, The

More information

Hilbert Space, Entanglement, Quantum Gates, Bell States, Superdense Coding.

Hilbert Space, Entanglement, Quantum Gates, Bell States, Superdense Coding. CS 94- Bell States Bell Inequalities 9//04 Fall 004 Lecture Hilbert Space Entanglement Quantum Gates Bell States Superdense Coding 1 One qubit: Recall that the state of a single qubit can be written as

More information

An Introduction to Quantum Information. By Aditya Jain. Under the Guidance of Dr. Guruprasad Kar PAMU, ISI Kolkata

An Introduction to Quantum Information. By Aditya Jain. Under the Guidance of Dr. Guruprasad Kar PAMU, ISI Kolkata An Introduction to Quantum Information By Aditya Jain Under the Guidance of Dr. Guruprasad Kar PAMU, ISI Kolkata 1. Introduction Quantum information is physical information that is held in the state of

More information

High Fidelity to Low Weight. Daniel Gottesman Perimeter Institute

High Fidelity to Low Weight. Daniel Gottesman Perimeter Institute High Fidelity to Low Weight Daniel Gottesman Perimeter Institute A Word From Our Sponsor... Quant-ph/0212066, Security of quantum key distribution with imperfect devices, D.G., H.-K. Lo, N. Lutkenhaus,

More information

AQI: Advanced Quantum Information Lecture 6 (Module 2): Distinguishing Quantum States January 28, 2013

AQI: Advanced Quantum Information Lecture 6 (Module 2): Distinguishing Quantum States January 28, 2013 AQI: Advanced Quantum Information Lecture 6 (Module 2): Distinguishing Quantum States January 28, 2013 Lecturer: Dr. Mark Tame Introduction With the emergence of new types of information, in this case

More information

Lecture 20: Bell inequalities and nonlocality

Lecture 20: Bell inequalities and nonlocality CPSC 59/69: Quantum Computation John Watrous, University of Calgary Lecture 0: Bell inequalities and nonlocality April 4, 006 So far in the course we have considered uses for quantum information in the

More information

Problem Set: TT Quantum Information

Problem Set: TT Quantum Information Problem Set: TT Quantum Information Basics of Information Theory 1. Alice can send four messages A, B, C, and D over a classical channel. She chooses A with probability 1/, B with probability 1/4 and C

More information

Physics is becoming too difficult for physicists. David Hilbert (mathematician)

Physics is becoming too difficult for physicists. David Hilbert (mathematician) Physics is becoming too difficult for physicists. David Hilbert (mathematician) Simple Harmonic Oscillator Credit: R. Nave (HyperPhysics) Particle 2 X 2-Particle wave functions 2 Particles, each moving

More information

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

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science Quantum Optical Communication Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.453 Quantum Optical Communication Date: Thursday, November 3, 016 Lecture Number 16 Fall 016 Jeffrey H.

More information

arxiv: v1 [quant-ph] 23 Mar 2012

arxiv: v1 [quant-ph] 23 Mar 2012 Unconditionally verifiable blind computation Joseph F. Fitzsimons 1 and Elham Kashefi 2 arxiv:1203.5217v1 [quant-ph] 23 Mar 2012 1 Centre for Quantum Technologies, National University of Singapore, 3 Science

More information

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

10. Physics from Quantum Information. I. The Clifton-Bub-Halvorson (CBH) Theorem. 10. Physics from Quantum Information. I. The Clifton-Bub-Halvorson (CBH) Theorem. Clifton, Bub, Halvorson (2003) Motivation: Can quantum physics be reduced to information-theoretic principles? CBH Theorem:

More information

Entanglement Manipulation

Entanglement Manipulation Entanglement Manipulation Steven T. Flammia 1 1 Perimeter Institute for Theoretical Physics, Waterloo, Ontario, N2L 2Y5 Canada (Dated: 22 March 2010) These are notes for my RIT tutorial lecture at the

More information

Secrecy and the Quantum

Secrecy and the Quantum Secrecy and the Quantum Benjamin Schumacher Department of Physics Kenyon College Bright Horizons 35 (July, 2018) Keeping secrets Communication Alice sound waves, photons, electrical signals, paper and

More information

Other Topics in Quantum Information

Other Topics in Quantum Information p. 1/23 Other Topics in Quantum Information In a course like this there is only a limited time, and only a limited number of topics can be covered. Some additional topics will be covered in the class projects.

More information

C. QUANTUM INFORMATION 111

C. QUANTUM INFORMATION 111 C. QUANTUM INFORMATION 111 C Quantum information C.1 Qubits C.1.a Single qubits 1. Qubit: Just as the bits 0 and 1 are represented by distinct physical states, so the quantum bits (or qubits) 0i and 1i

More information

An Introduction to Quantum Information and Applications

An Introduction to Quantum Information and Applications An Introduction to Quantum Information and Applications Iordanis Kerenidis CNRS LIAFA-Univ Paris-Diderot Quantum information and computation Quantum information and computation How is information encoded

More information

b) (5 points) Give a simple quantum circuit that transforms the state

b) (5 points) Give a simple quantum circuit that transforms the state C/CS/Phy191 Midterm Quiz Solutions October 0, 009 1 (5 points) Short answer questions: a) (5 points) Let f be a function from n bits to 1 bit You have a quantum circuit U f for computing f If you wish

More information

Quantum Cryptography

Quantum Cryptography Quantum Cryptography Christian Schaffner Research Center for Quantum Software Institute for Logic, Language and Computation (ILLC) University of Amsterdam Centrum Wiskunde & Informatica Winter 17 QuantumDay@Portland

More information

The Laws of Cryptography Zero-Knowledge Protocols

The Laws of Cryptography Zero-Knowledge Protocols 26 The Laws of Cryptography Zero-Knowledge Protocols 26.1 The Classes NP and NP-complete. 26.2 Zero-Knowledge Proofs. 26.3 Hamiltonian Cycles. An NP-complete problem known as the Hamiltonian Cycle Problem

More information

Lecture 11: Quantum Information III - Source Coding

Lecture 11: Quantum Information III - Source Coding CSCI5370 Quantum Computing November 25, 203 Lecture : Quantum Information III - Source Coding Lecturer: Shengyu Zhang Scribe: Hing Yin Tsang. Holevo s bound Suppose Alice has an information source X that

More information

EPR paradox, Bell inequality, etc.

EPR paradox, Bell inequality, etc. EPR paradox, Bell inequality, etc. Compatible and incompatible observables AA, BB = 0, then compatible, can measure simultaneously, can diagonalize in one basis commutator, AA, BB AAAA BBBB If we project

More information

Quantum communication protocols based on entanglement swapping

Quantum communication protocols based on entanglement swapping Journal of Physics: Conference Series PAPER OPEN ACCESS Quantum communication protocols based on entanglement swapping To cite this article: Guillermo Morales-Luna 015 J. Phys.: Conf. Ser. 64 01003 View

More information

quantum distribution of a sudoku key Sian K. Jones University of South Wales

quantum distribution of a sudoku key Sian K. Jones University of South Wales Games and Puzzles quantum distribution of a sudoku key Sian K. Jones University of South Wales sian-kathryn.jones@southwales.ac.uk Abstract: Sudoku grids are often cited as being useful in cryptography

More information

Instantaneous Nonlocal Measurements

Instantaneous Nonlocal Measurements Instantaneous Nonlocal Measurements Li Yu Department of Physics, Carnegie-Mellon University, Pittsburgh, PA July 22, 2010 References Entanglement consumption of instantaneous nonlocal quantum measurements.

More information

C. QUANTUM INFORMATION 99

C. QUANTUM INFORMATION 99 C. QUANTUM INFORMATION 99 C Quantum information C.1 Qubits C.1.a Single qubits Just as the bits 0 and 1 are represented by distinct physical states in a conventional computer, so the quantum bits (or qubits)

More information

Bell inequality for qunits with binary measurements

Bell inequality for qunits with binary measurements Bell inequality for qunits with binary measurements arxiv:quant-ph/0204122v1 21 Apr 2002 H. Bechmann-Pasquinucci and N. Gisin Group of Applied Physics, University of Geneva, CH-1211, Geneva 4, Switzerland

More information

Squashed entanglement

Squashed entanglement Squashed Entanglement based on Squashed Entanglement - An Additive Entanglement Measure (M. Christandl, A. Winter, quant-ph/0308088), and A paradigm for entanglement theory based on quantum communication

More information

Grover s algorithm based multi-qubit secret sharing scheme

Grover s algorithm based multi-qubit secret sharing scheme Grover s algorithm based multi-qubit secret sharing scheme Arti Chamoli and C. M. Bhandari Indian Institute of Information Technology, Allahabad, Deoghat, Jhalwa, Allahabad-20, India. Email: achamoli@iiita.ac.in,

More information

YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE

YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE CPSC 467a: Cryptography and Computer Security Notes 23 (rev. 1) Professor M. J. Fischer November 29, 2005 1 Oblivious Transfer Lecture Notes 23 In the locked

More information

arxiv: v3 [quant-ph] 6 Sep 2009

arxiv: v3 [quant-ph] 6 Sep 2009 Semi-quantum secret sharing using entangled states Qin Li, 1 W. H. Chan, and Dong-Yang Long 1 1 Department of Computer Science, Sun Yat-sen University, Guangzhou 51075, China Department of Mathematics,

More information

Logic gates. Quantum logic gates. α β 0 1 X = 1 0. Quantum NOT gate (X gate) Classical NOT gate NOT A. Matrix form representation

Logic gates. Quantum logic gates. α β 0 1 X = 1 0. Quantum NOT gate (X gate) Classical NOT gate NOT A. Matrix form representation Quantum logic gates Logic gates Classical NOT gate Quantum NOT gate (X gate) A NOT A α 0 + β 1 X α 1 + β 0 A N O T A 0 1 1 0 Matrix form representation 0 1 X = 1 0 The only non-trivial single bit gate

More information

Introduction to Quantum Computing

Introduction to Quantum Computing Introduction to Quantum Computing Petros Wallden Lecture 3: Basic Quantum Mechanics 26th September 2016 School of Informatics, University of Edinburgh Resources 1. Quantum Computation and Quantum Information

More information

Why does nature like the square root of negative one? William K. Wootters Williams College

Why does nature like the square root of negative one? William K. Wootters Williams College Why does nature like the square root of negative one? William K. Wootters Williams College A simple quantum experiment Computing probabilities in a sensible way (½)(½)+(½)(½) = ½ ½ ½ Computing probabilities

More information

Theory of Computation Chapter 12: Cryptography

Theory of Computation Chapter 12: Cryptography Theory of Computation Chapter 12: Cryptography Guan-Shieng Huang Dec. 20, 2006 0-0 Introduction Alice wants to communicate with Bob secretely. x Alice Bob John Alice y=e(e,x) y Bob y??? John Assumption

More information

arxiv:quant-ph/ v1 10 Dec 1997

arxiv:quant-ph/ v1 10 Dec 1997 A brief review on the impossibility of quantum bit commitment Gilles Brassard Claude Crépeau Université de Montréal December 10, 1997 Dominic Mayers Princeton University Louis Salvail BRICS arxiv:quant-ph/9712023v1

More information

Quantum Cryptography

Quantum Cryptography Quantum Cryptography (Notes for Course on Quantum Computation and Information Theory. Sec. 13) Robert B. Griffiths Version of 26 March 2003 References: Gisin = N. Gisin et al., Rev. Mod. Phys. 74, 145

More information

Lecture 21: Quantum Communication

Lecture 21: Quantum Communication CS 880: Quantum Information Processing 0/6/00 Lecture : Quantum Communication Instructor: Dieter van Melkebeek Scribe: Mark Wellons Last lecture, we introduced the EPR airs which we will use in this lecture

More information

Multiparty Quantum Remote Control

Multiparty Quantum Remote Control Multiparty Quantum Remote Control Yu-Ting Chen and Tzonelih Hwang Abstract This paper proposes a multiparty quantum remote control (MQRC) protocol, which allows several controllers to perform remote operations

More information

Advanced Cryptography Quantum Algorithms Christophe Petit

Advanced Cryptography Quantum Algorithms Christophe Petit The threat of quantum computers Advanced Cryptography Quantum Algorithms Christophe Petit University of Oxford Christophe Petit -Advanced Cryptography 1 Christophe Petit -Advanced Cryptography 2 The threat

More information

Lecture 28: Public-key Cryptography. Public-key Cryptography

Lecture 28: Public-key Cryptography. Public-key Cryptography Lecture 28: Recall In private-key cryptography the secret-key sk is always established ahead of time The secrecy of the private-key cryptography relies on the fact that the adversary does not have access

More information

Quantum computing. Jan Černý, FIT, Czech Technical University in Prague. České vysoké učení technické v Praze. Fakulta informačních technologií

Quantum computing. Jan Černý, FIT, Czech Technical University in Prague. České vysoké učení technické v Praze. Fakulta informačních technologií České vysoké učení technické v Praze Fakulta informačních technologií Katedra teoretické informatiky Evropský sociální fond Praha & EU: Investujeme do vaší budoucnosti MI-MVI Methods of Computational Intelligence(2010/2011)

More information

Lecture 14: Quantum information revisited

Lecture 14: Quantum information revisited CPSC 59/69: Quantum Computation John Watrous, University of Calgary Lecture 4: Quantum information revisited March 4, 006 So far, this course has focused almost entirely on quantum algorithms The next

More information

A New Wireless Quantum Key Distribution Protocol based on Authentication And Bases Center (AABC)

A New Wireless Quantum Key Distribution Protocol based on Authentication And Bases Center (AABC) A New Wireless Quantum Key Distribution Protocol based on Authentication And Bases Center (AABC) Majid Alshammari and Khaled Elleithy Department of Computer Science and Engineering University of Bridgeport

More information

Quantum Dense Coding and Quantum Teleportation

Quantum Dense Coding and Quantum Teleportation Lecture Note 3 Quantum Dense Coding and Quantum Teleportation Jian-Wei Pan Bell states maximally entangled states: ˆ Φ Ψ Φ x σ Dense Coding Theory: [C.. Bennett & S. J. Wiesner, Phys. Rev. Lett. 69, 88

More information

10 - February, 2010 Jordan Myronuk

10 - February, 2010 Jordan Myronuk 10 - February, 2010 Jordan Myronuk Classical Cryptography EPR Paradox] The need for QKD Quantum Bits and Entanglement No Cloning Theorem Polarization of Photons BB84 Protocol Probability of Qubit States

More information

1 1D Schrödinger equation: Particle in an infinite box

1 1D Schrödinger equation: Particle in an infinite box 1 OF 5 1 1D Schrödinger equation: Particle in an infinite box Consider a particle of mass m confined to an infinite one-dimensional well of width L. The potential is given by V (x) = V 0 x L/2, V (x) =

More information

Quantum Cryptography : On the Security of the BB84 Key-Exchange Protocol

Quantum Cryptography : On the Security of the BB84 Key-Exchange Protocol Quantum Cryptography : On the Security of the BB84 Key-Exchange Protocol Thomas Baignères EPFL - LASEC thomas.baigneres@epfl.ch Abstract. In 984, C.H. Bennet and G. Brassard proposed a new protocol aimed

More information

An exponential separation between quantum and classical one-way communication complexity

An exponential separation between quantum and classical one-way communication complexity An exponential separation between quantum and classical one-way communication complexity Ashley Montanaro Centre for Quantum Information and Foundations, Department of Applied Mathematics and Theoretical

More information

Lecture 15 - Zero Knowledge Proofs

Lecture 15 - Zero Knowledge Proofs Lecture 15 - Zero Knowledge Proofs Boaz Barak November 21, 2007 Zero knowledge for 3-coloring. We gave a ZK proof for the language QR of (x, n) such that x QR n. We ll now give a ZK proof (due to Goldreich,

More information

Lecture 6: Quantum error correction and quantum capacity

Lecture 6: Quantum error correction and quantum capacity Lecture 6: Quantum error correction and quantum capacity Mark M. Wilde The quantum capacity theorem is one of the most important theorems in quantum hannon theory. It is a fundamentally quantum theorem

More information

Experimental demonstrations of teleportation of photons. Manuel Chinotti and Nikola Đorđević

Experimental demonstrations of teleportation of photons. Manuel Chinotti and Nikola Đorđević Experimental demonstrations of teleportation of photons Manuel Chinotti and Nikola Đorđević Outline Quantum teleportation (QT) protocol. Laboratory experimental demonstration: Bouwmeester at al. (1997).

More information

arxiv:quant-ph/ v1 6 Dec 2005

arxiv:quant-ph/ v1 6 Dec 2005 Quantum Direct Communication with Authentication Hwayean Lee 1,,4, Jongin Lim 1,, HyungJin Yang,3 arxiv:quant-ph/051051v1 6 Dec 005 Center for Information Security TechnologiesCIST) 1, Graduate School

More information

D. Bouwmeester et. al. Nature (1997) Joep Jongen. 21th june 2007

D. Bouwmeester et. al. Nature (1997) Joep Jongen. 21th june 2007 al D. Bouwmeester et. al. Nature 390 575 (1997) Universiteit Utrecht 1th june 007 Outline 1 3 4 5 EPR Paradox 1935: Einstein, Podolsky & Rosen Decay of a π meson: π 0 e + e + Entangled state: ψ = 1 ( +

More information

Quantum Teleportation with Photons. Bouwmeester, D; Pan, J-W; Mattle, K; et al. "Experimental quantum teleportation". Nature 390, 575 (1997).

Quantum Teleportation with Photons. Bouwmeester, D; Pan, J-W; Mattle, K; et al. Experimental quantum teleportation. Nature 390, 575 (1997). Quantum Teleportation with Photons Jessica Britschgi Pascal Basler Bouwmeester, D; Pan, J-W; Mattle, K; et al. "Experimental quantum teleportation". Nature 390, 575 (1997). Outline The Concept of Quantum

More information

arxiv: v1 [quant-ph] 3 Jul 2018

arxiv: v1 [quant-ph] 3 Jul 2018 Counterfactual Quantum Bit Commitment arxiv:1807.0160v1 [quant-ph] 3 Jul 018 Ya-Qi Song 1,,3, Li Yang 1,,3 1 State Key Laboratory of Information Security, Institute of Information Engineering, Chinese

More information

A central problem in cryptography: the key distribution problem.

A central problem in cryptography: the key distribution problem. Scientific American 314, 48-55 (2016) A central problem in cryptography: the key distribution problem. Mathematics solution: public key cryptography. Public-key cryptography relies on the computational

More information

CS 282A/MATH 209A: Foundations of Cryptography Prof. Rafail Ostrovsky. Lecture 10

CS 282A/MATH 209A: Foundations of Cryptography Prof. Rafail Ostrovsky. Lecture 10 CS 282A/MATH 209A: Foundations of Cryptography Prof. Rafail Ostrovsky Lecture 10 Lecture date: 14 and 16 of March, 2005 Scribe: Ruzan Shahinian, Tim Hu 1 Oblivious Transfer 1.1 Rabin Oblivious Transfer

More information

Experimental quantum teleportation. Dirk Bouwmeester, Jian Wei Pan, Klaus Mattle, Manfred Eibl, Harald Weinfurter & Anton Zeilinger

Experimental quantum teleportation. Dirk Bouwmeester, Jian Wei Pan, Klaus Mattle, Manfred Eibl, Harald Weinfurter & Anton Zeilinger Experimental quantum teleportation Dirk Bouwmeester, Jian Wei Pan, Klaus Mattle, Manfred Eibl, Harald Weinfurter & Anton Zeilinger NATURE VOL 390 11 DECEMBER 1997 Overview Motivation General theory behind

More information

Quantum Cryptography. Chris1an Schaffner. Research Center for Quantum So8ware

Quantum Cryptography. Chris1an Schaffner. Research Center for Quantum So8ware Quantum Cryptography Chris1an Schaffner Research Center for Quantum So8ware Ins1tute for Logic, Language and Computa1on (ILLC) University of Amsterdam Centrum Wiskunde & Informa1ca Physics@FOM, Veldhoven

More information

arxiv: v1 [quant-ph] 1 Mar 2016

arxiv: v1 [quant-ph] 1 Mar 2016 A comparative study of protocols for secure quantum communication under noisy environment: single-qubit-based protocols versus entangled-state-based protocols arxiv:1603.00178v1 [quant-ph] 1 Mar 016 Vishal

More information

arxiv:quant-ph/ v2 2 Jan 2007

arxiv:quant-ph/ v2 2 Jan 2007 Revisiting controlled quantum secure direct communication using a non-symmetric quantum channel with quantum superdense coding arxiv:quant-ph/06106v Jan 007 Jun Liu 1, Yan Xia and Zhan-jun Zhang 1,, 1

More information

Quantum Cryptography

Quantum Cryptography Quantum Cryptography Umesh V. Vazirani CS 161/194-1 November 28, 2005 Why Quantum Cryptography? Unconditional security - Quantum computers can solve certain tasks exponentially faster; including quantum

More information

Unitary evolution: this axiom governs how the state of the quantum system evolves in time.

Unitary evolution: this axiom governs how the state of the quantum system evolves in time. CS 94- Introduction Axioms Bell Inequalities /7/7 Spring 7 Lecture Why Quantum Computation? Quantum computers are the only model of computation that escape the limitations on computation imposed by the

More information

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

QUANTUM INFORMATION -THE NO-HIDING THEOREM p.1/36 QUANTUM INFORMATION - THE NO-HIDING THEOREM Arun K Pati akpati@iopb.res.in Instititute of Physics, Bhubaneswar-751005, Orissa, INDIA and Th. P. D, BARC, Mumbai-400085, India QUANTUM INFORMATION -THE NO-HIDING

More information

Teleportation-based quantum homomorphic encryption scheme with quasi-compactness and perfect security

Teleportation-based quantum homomorphic encryption scheme with quasi-compactness and perfect security Teleportation-based quantum homomorphic encryption scheme with quasi-compactness and perfect security Min Liang Data Communication Science and Technology Research Institute, Beijing 100191, China liangmin07@mails.ucas.ac.cn

More information

Universal Blind Quantum Computing

Universal Blind Quantum Computing Universal Blind Quantum Computing Elham Kashefi Laboratoire d Informatique de Grenoble Joint work with Anne Broadbent Montreal Joe Fitzsimons Oxford Classical Blind Computing Fundamentally asymmetric unlike

More information