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

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

Quantum Information Transfer and Processing Miloslav Dušek

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

Entanglement and information

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

Security Implications of Quantum Technologies

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

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

Cryptography in a quantum world

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

Quantum Cryptography

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

LECTURE NOTES ON Quantum Cryptography

Quantum Cryptography

C. QUANTUM INFORMATION 111

SUPERDENSE CODING AND QUANTUM TELEPORTATION

Quantum Cryptography and Security of Information Systems

5th March Unconditional Security of Quantum Key Distribution With Practical Devices. Hermen Jan Hupkes

Ping Pong Protocol & Auto-compensation

Entanglement and Quantum Teleportation

Technical Report Communicating Secret Information Without Secret Messages

C. QUANTUM INFORMATION 99

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

10 - February, 2010 Jordan Myronuk

arxiv:quant-ph/ v1 13 Jan 2003

Secrecy and the Quantum

Quantum information and quantum computing

arxiv:quant-ph/ v2 2 Jan 2007

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

arxiv:quant-ph/ v1 13 Mar 2007

Quantum Cryptography

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

EPR paradox, Bell inequality, etc.

arxiv:quant-ph/ v1 27 Dec 2004

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

Problem Set: TT Quantum Information

A probabilistic quantum key transfer protocol

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

Quantum Cryptography Bertrand Bonnefoy-Claudet Zachary Estrada

Realization of B92 QKD protocol using id3100 Clavis 2 system

Introduction to Quantum Key Distribution

Network Security Based on Quantum Cryptography Multi-qubit Hadamard Matrices

Quantum Teleportation Pt. 3

Quantum key distribution for the lazy and careless

Research Proposal for Secure Double slit experiment. Sandeep Cheema Security Analyst, Vichara Technologies. Abstract

Quantum Cryptography. Marshall Roth March 9, 2007

Quantum Hacking. Feihu Xu Dept. of Electrical and Computer Engineering, University of Toronto

An Introduction. Dr Nick Papanikolaou. Seminar on The Future of Cryptography The British Computer Society 17 September 2009

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

Quantum Information & Quantum Computation

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

Quantum Gates, Circuits & Teleportation

CS120, Quantum Cryptography, Fall 2016

State Decoding in Multi-Stage Cryptography Protocols

Introduction to Quantum Cryptography

Enigma Marian Rejewski, Jerzy Róz ycki, Henryk Zygalski

Quantum Entanglement and Cryptography. Deepthi Gopal, Caltech

An Introduction to Quantum Information and Applications

arxiv:quant-ph/ v2 3 Oct 2000

Device-Independent Quantum Information Processing

Quantum Computing. Quantum Computing. Sushain Cherivirala. Bits and Qubits

Detection of Eavesdropping in Quantum Key Distribution using Bell s Theorem and Error Rate Calculations

Research, Development and Simulation of Quantum Cryptographic Protocols

Trustworthiness of detectors in quantum key distribution with untrusted detectors

A Matlab Realization of Shor s Quantum Factoring Algorithm

arxiv:quant-ph/ v2 17 Sep 2002

Efficient controlled quantum secure direct communication based on GHZ-like states

Experimental realization of quantum cryptography communication in free space

Teleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters)

Hiding Data in a QImage File

Seminar Report On QUANTUM CRYPTOGRAPHY. Submitted by SANTHIMOL A. K. In the partial fulfillment of requirements in degree of

Lecture 11 September 30, 2015

A Genetic Algorithm to Analyze the Security of Quantum Cryptographic Protocols

Security and implementation of differential phase shift quantum key distribution systems

Ground-Satellite QKD Through Free Space. Steven Taylor

Multiparty Quantum Secret Sharing via Introducing Auxiliary Particles Using a Pure Entangled State

Stop Conditions Of BB84 Protocol Via A Depolarizing Channel (Quantum Cryptography)

Quantum Cryptography

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

Lecture 22: RSA Encryption. RSA Encryption

Quantum Information Processing and Diagrams of States

DEVELOPMENT OF MECHANISM FOR ENHANCING DATA SECURITY IN QUANTUM CRYPTOGRAPHY.

Practical quantum-key. key- distribution post-processing

Quantum cryptography. Quantum cryptography has a potential to be cryptography of 21 st century. Part XIII

Deterministic secure communications using two-mode squeezed states

Quantum Cryptography: A Short Historical overview and Recent Developments

INTRODUCTION TO QUANTUM COMPUTING

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

Using Quantum Effects for Computer Security

EXPERIMENTAL DEMONSTRATION OF QUANTUM KEY

arxiv:quant-ph/ v1 6 Dec 2005

SECURITY OF QUANTUM KEY DISTRIBUTION USING WEAK COHERENT STATES WITH NONRANDOM PHASES

Quantum Teleportation Pt. 1

The Laws of Cryptography Zero-Knowledge Protocols

Physics ; CS 4812 Problem Set 4

High Fidelity to Low Weight. Daniel Gottesman Perimeter Institute

Quantum cryptography and quantum hacking. Dr. Lars Lydersen

Security of Quantum Cryptography using Photons for Quantum Key Distribution. Karisa Daniels & Chris Marcellino Physics C191C

Quantum Information Processing

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

Transcription:

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 = some kind of disembodied transport. (S.L. Braunstein 1995) Only information (not matter) is transferred to another location, such that the state of a quantum system can be reconstructed (not copied) perfectly. If Alice and Bob own two identical quantum systems they can try to transfer the quantum state of Alice s system to Bob s system: ψ A something B something else A ψ B

from N. Gisin and R. Thew, Nature Photonics 1, 165 (2007)

The simplest system is a qubit, in a state ψ = α 0 + β 1. (with unkown α and β). Alice and Bob also need a shared pair of qubits in a Bell state (an EPR pair) φ = 1 2 ( 00 + 11 ).

Initial state of the combined three-qubit system: χ := ψ φ = 1 2 [α 0 ( 00 + 11 ) + β 1 ( 00 + 11 )]. Alice applies CNOT(1,2) followed by a Hadamard gate H 1 acting on the first qubit. This entangles ψ with φ : χ = H 1 CNOT (1, 2) χ = H 1 1 2 [α 0 ( 00 + 11 ) + β 1 ( 10 + 01 )] = 1 2 [α( 0 + 1 )( 00 + 11 ) + β( 0 1 )( 10 + 01 )]. We rewrite this state in order to see clearly what has happened on Bob s end of the EPR pair χ = 1 [ 00 (α 0 + β 1 ) + 01 (α 1 + β 0 ) + 10 (α 0 β 1 ) + 11 (α 1 β 0 )] 2 = 1 00 ψ + 01 X 3 ψ + 10 Z 3 ψ + 11 ( iy 3 ) ψ = 1 1 1 M 2 }{{} 1 M 2 X M 2 3 2 ZM 1 3 ψ X 3 Z 3 M 1 =0 M 2 =0 X 3, Y 3, and Z 3 are the Pauli matrices applied to the qubit 3 (Bob s qubit).

Bob s state: a superposition of four distorted variants of Alice s original state. Alice now measures the states of her two qubits. one of the four combinations M 1 M 2. The state of the complete system has collapsed to M 1 M 2 X M 2 3 ZM 1 3 ψ Bob now possesses a definite modification of the desired state ψ, but he does not yet know which one! Alice tells Bob the two measured classical bits (M 1, M 2 ), Bob applies to his qubit the operator Z M 1 3 XM 2 3 = (X M 2 3 ZM 1 3 ) 1 and can enjoy the state ψ which he now owns, while Alice s original qubit is in the state M 1. Note: No spooky action at a distance since the classical transmission of measurement results between Alice and Bob obeys the Einstein speed limit c.

Secure quantum communication (Theory: Bennett and Brassard 1984; Experiments: many, by now) Data transmission always was a matter of confidence: Even in Cleopatra s times, however, people rather relied on cryptography.

Secure communication with a one-time pad Symmetric key: all communication partners (and only they) have identical copies of the key. Beispiel: Alice wants to tell Bob her date of birth: Alice s message 2 1 1 2 8 2...binary 0010 0001 0001 0010 1000 0010 Alice s key 0101 1101 1001 1110 0011 1011 encrypted text 0111 1100 1000 1100 1011 1001 Bob s key 0101 1101 1001 1110 0011 1011 decrypted text 0010 0001 0001 0010 1000 0010 decimal 2 1 1 2 8 2 Encryption and decryption by bitwise addition without carry ( ) according to the rules 0 0 = 0 0 1 = 1 1 1 = 0 The key is a purely random bit string which masks all structure in the original message. It must be discarded after use, because otherwise evil Eve, the eavesdropper, can get a handle on the message. The one-time pad is the only mathematically provably secure encryption method. Drawbacks: persistent need for fresh key; key distribution is risky quantum key distribution (QKD).

The BB84 protocol Alice and Bob protect their privacy by the protocol introduced by Charles H. Bennett (r.) and Gilles Brassard(l.) at a conference in Bangalore in 1984 (!). With that BB84 protocol they can securely share a one-time key. Alice s shopping list 1 photon source, with 4 polarization filters:,,, and Bob s shopping list 1 photon detector, containing 2 polarization filters:, 1 random number generator 1 random number generator Starting at a previously fixed time, Alice transmits, say, 2000 photons. Bob knows exactly when to expect each photon. Alice chooses the polarization (,,, ) of the transmitted photons completely randomly. Bob also switches completely randomly between the two polarization filters in his detector. Both of them keep records of their random sequences.

Depending on the polarization of the photon and the orientation of Bob s filter the reaction of Bob s detector is either predictable or random: photon (A) filter (B) detector 1 0 50/50 50/50 50/50 50/50 1 0 Bob does not know which of Alice s 2000 photons he has identified correctly until Alice tells him which photon pair ( basis ) she has used for each of the 2000 photons transmitted: + =(, ) or x =(, ). Bob tells her the orientation of his polarization filter in each case. After that, both of them (plus all eavesdroppers) know which of Alice s photons have been identified correctly by Bob. The results of that identification are known only to Alice and Bob and constitute roughly 1000 bits of key: photon (A) filter (B) detector (B) 1 1 0 0 1 1 0 0 0 0 basis (A) + x x + + + x + + + key (A,B) 1 1 0 1 0 0

What about Eve? Eve could buy the same equipment as Alice and Bob, intercept Alice s photons and measure them in the way Bob does, transmit forged photons to Bob. Eve s problem: She does not know which polarization filter ( oder ) Bob uses until it is too late. In 50% of all cases she uses a filter different from Bob s and thus sends him a photon with a polarization mismatch (of 45 o ) to Bob s filter. Due to the 45 o angle half of these wrong photons are nevertheless registered correctly. Error rate of 25% in the key. Alice s and Bob s espionage protection: Draw 100 bits from the key randomly and compare them publicly. Probability that all 100 bits are equal although Eve generates 25% errors: Eve does not go unnoticed. ( ) 100 3 = 3 10 13 4

...or does she? DON T PANIC Quantum Mechanics is still valid. Imperfections of existing hardware are used to perform an intercept and resend attack, as in some previous studies intended to make quantum key distribution safer. The quantum hacking group at NTNU Trondheim: http://www.iet.ntnu.no/groups/optics/qcr/ Index to focus issue on quantum cryptography: New Journal of Physics 11, 045005 (2009) Details underlying this particular hack: V. Makarov, Controlling passively quenched single photon detectors by bright light, New Journal of Physics 11, 065003 (2009).

Eve s scheme Eve could buy the same equipment as Alice and Bob, intercept Alice s photons and measure them in the way Bob does, transmit forged photons to Bob. Eve s problem: She does not know which polarization filter ( oder ) Bob uses until it is too late. Eve s solution: She manipulates Bob s detectors so that Bob s measurement is exactly equal to her own measurement, including his polarization filter setting. From the abstract of Makarov s paper: Single photon detectors (SPDs) based on passively quenched avalanche photodiodes can be temporarily blinded by relatively bright light......all SPDs in the receiver Bob are uniformly blinded by continuous illumination coming from the eavesdropper Eve. When Eve needs a certain detector in Bob to produce a click, she modifies the polarization (or other parameters used to encode quantum states) of the light she sends to Bob such that the target detector stops receiving light, while the other detector(s) continue to be illuminated. The target detector regains single photon sensitivity and, when Eve modifies the polarization again, produces a single click. Thus, Eve has full control of Bob...

More on Eve s scheme The basis: detector characteristics (adapted from Makarov, op. cit.) How does Eve know which polarization basis Bob is about to use for measurement? She does not know, and does not have to know! The trick: Eve does not send a single photon, but a carefully manipulated light pulse, based on her own choice of basis and result of measurement: Bob s basis = Eve s basis = One of Bob s detectors clicks, if Eve s corresponding detector has clicked. Bob s basis Eve s basis = All of Bob s detectors remain blinded and do not click.