Quantum Communication
|
|
- Nickolas Hampton
- 5 years ago
- Views:
Transcription
1 Quantum Communication Harry Buhrman CWI & University of Amsterdam
2 Physics and Computing Computing is physical Miniaturization quantum effects Quantum Computers ) Enables continuing miniaturization ) Fundamentally faster algorithms
3 Overview Introduction Quantum Mechanics & Notation. Deutsch-Jozsa Algorithm Distributed Deutsch-Jozsa: Communication Complexity Physics: Non-locality & Detection Loophole Quantum Fingerprinting
4 Quantum Mechanics
5 Quantum Mechanics Most complete description of Nature to date Superposition principle: particle can be at two positions at the same time Interference: particle in superposition can interfere with itself
6 Superposition Classical Bit: 0 or Quantum Bit: Superposition of 0 and Bit 0
7 Classical Bit: 0 or Superposition Quantum Bit: Superposition of 0 and α 0 +β Bit 0 0 Qubit
8 Qubit α 0 + β α 0 + β amplitudes Rule: α + β =, α, β are complex numbers.
9 Measurement α 0 +β Projection on the 0 axis or axis. 0 Rule: observe 0 with probability α observe with probability β after measurement qubit is 0 or
10 Example ψ = 0 +
11 Example ψ = 0 + Measuring ψ: Prob [] = / Prob [0] = /
12 Example ψ = 0 + Measuring ψ: Prob [] = / Prob [0] = / After measurement: with prob / ψ = 0 with prob / ψ =
13 Quantis QUANTUM RANDOM NUMBER GENERATOR Although random numbers are required in many applications, their generation is often overlooked. Being deterministic, computers are not capable of producing random numbers. A physical source of randomness is necessary. Quantum physics being intrinsically random, it is natural to exploit a quantum process for such a source. Quantum random number generators have the advantage over conventional randomness sources of being invulnerable to environmental perturbations and of allowing live status verification. Quantis is a physical random number generator exploiting an elementary quantum optics process. Photons - light particles - are sent one by one onto a semi-transparent mirror and detected. The exclusive events (reflection - transmission) are associated to "0" - "" bit values.
14 Two Qubits α 00 + α 0 + α 0 + α 4 3 α + α + α 3 + α 4 = Prob[00] = α, Prob[0] = α, Prob[0] = α 3, Prob[] = α 4,
15 n Qubits Prob[observing j] = α j
16 Dirac Notation norm vector complex conjucate transpose
17 inner product inner product between ai and bi
18 inner product()
19 Evolution
20 Evolution. Postulate: the evolution is a linear operation. quantum states maped to quantum states & implies that operation is Unitary length preserving rotations. U U * = I. (U * : complex conjugate, transpose)
21 Hadamard Transform = H = * H I H H = = 0 0 *
22 Hadamard on 0 = = = + 0 H 0 + = ψ 0 interference H
23 Hadamard on 0 = = = + 0 H 0 + = ψ 0 interference H
24 Hadamard on = = = + 0 H H 0 = ψ
25 Hadamard on = = = + 0 H H 0 = ψ
26 Hadamard on n qubits inner product modulo
27 Quantum Algorithms
28 Black Box Model Input N (= n ) bits (variables): X = X X X 3 X N Compute some function F of X: F(X) {0,} Only Count how many bits/variables of X are read.
29 Deutsch-Jozsa Problem Promise on X: () For all i: X i = (0) or (constant) () {i X i = } = {j X j = 0} (balanced) Goal: determine case () or () Classical: N/ + probes. Quantum: probe.
30 Quantum query Querying X i General query:
31 Deutsch-Jozsa Algorithm () () (3)
32 Deutsch-Jozsa cont. measure state Constant: see with prob. Balanced: see with prob. 0
33 Quantum Algorithms Deutsch-Jozsa Simon s algorithm Shor s factoring algorithm Grover s search algorithm Impossibility results
34 Alice and Bob
35
36 Communication? qubits
37 Communication? qubits Theorem [Holevo 73] Can not compress k classical bits into k- qubits
38 Communication Complexity Classical bits X = x x x N Y = y y y N Goal: Compute some function F(X,Y) {0,} minimizing communication bits.
39 Communication Complexity F(X,Y) Classical bits X = x x x N Y = y y y N Goal: Compute some function F(X,Y) {0,} minimizing communication bits.
40 Equality Classical bits X = x x x N F(X,Y) = iff X=Y Y = y y y N
41 Equality Classical bits X = x x x N Y = y y y N F(X,Y) = iff X=Y N bits necessary and sufficient: C(EQ) = N
42 Quantum Communication Complexity F(X,Y) {0,} qubits X = x x x N Y = y y y N F(X,Y) = iff X=Y Question: Can qubits reduce communication for certain F s?
43 Qubits Can Reduce Cost Theorem [B-Cleve-Wigderson 98] EQ (X,Y) = iff X=Y Promise (X,Y) = N/ or 0 Need Ω(N) classical bits. Hamming Distance Can be done with O(log(N)) qubits.
44 Reduction to D-J X X.. X N Y Y.. Y N Z Z.. Z N (X,Y) = N/ Z is balanced (X,Y) = 0 Z is constant
45 The quantum protocol Finishes Deutsch-Josza Algorithm
46 Cost Alice sends n= log(n) qubits to Bob Bob sends n= log(n) qubits to Alice Total cost is *log(n)
47 Classical Lower Bound
48 Lower Bound * Theorem [Frankl-Rödl 87] S,T families of N/ size sets {,,N} for all s,t in S,T : s t N/4 then: S * T N *$50 problem of Erdös
49 Lower Bound Theorem [Frankl-Rödl 87] S,T families of N/ size sets {,,N} for all s,t in S,T : s t N/4 then: S * T N protocol solving EQ in N/00 bits induces S and T satisfying: S * T N
50 Sets and Strings interpret X X N as set x: { i X i = } only use X with exactly N/ ones N N log(n) of such strings N/ N (X,Y) N/ x y N/4
51 Rectangle Claim if - (X,Y) induce conversation M and -(X,Y ) induce conversation M then -(X,Y ) and (X,Y) also induce conversation M
52 N/00 Bit Protocol (X,X ) (X,X ).. (X N, X N) M M. M N/00
53 N/00 Bit Protocol (X,X ) (X,X ).. (X N, X N) M M. M N/00 M k induced by N / N/00 = 0.99N inputs: (X,X ) (X 0.99N, X 0.99N )
54 N/00 Bit Protocol (X,X ) (X,X ).. (X N, X N) M M. M N/00 M k induced by N / N/00 = 0.99N inputs: (X,X ) (X 0.99N, X 0.99N ) all (X i,x j ) induce M k : (X i, X j ) N/ x i x j N/4
55 N/00 Bit Protocol (X,X ) (X,X ).. (X N, X N) M M. M N/00 M k induced by N / N/00 = 0.99N inputs: (X,X ) (X 0.99N, X 0.99N ) all (X i,x j ) induce M k : (X i, X j ) N/ x i x j N/4 S = T = {X, X,,X 0.99N } S * T N
56 other quantum algorithms
57 Quantum Algorithm O U 0 U... O T U T k i = α i i T Black Box queries Prob [output = ] = α i all i that end in > / 3 { < /3 Prob [output = 0] = - Prob [output = ]
58 Generalization O U 0 U... O T U T
59 Grover s Algorithm Find i such that X i = OR(X,,X N ) Classical Probabilistic: N/ queries Quantum: O( N) queries No promise!
60 Non-Disjointness Goal: exists i such that X i = and Y i =? Grover X X.. X N Y Y.. Y N Z Z.. Z N
61 Disjointness Bounded Error probabilistic Ω(N) bits [Kalyanasundaram-Schnitger 87] Grover s algorithm + reduction O(log(N)* N) qubits [BCW 98] O( N) qubits [AA 04] Ω ( N) lower bound [Razborov 03]
62 Apointment Scheduling qubits Quantum: n qubits communication Classical: n bits communication
63 Other Functions Exponential gap [Raz 99] O(log(N)) with qubits, Ω (N /4 ) bits classically. partial Domain, bounded error Computing certificates for total AND-OR relation [Buhrman-Cleve-deWolf- Zalka 99/Klauck 000] O(N /3 ) qubits, Ω(N) bits randomized total Domain, zero error
64 back to physics
65 Einstein Podolsky Rosen paradox
66 EPR Pair Bob Alice if Alice measures: 0/ with prob. ½ if Bob measures: 0/ with prob. ½
67 EPR Pair Bob Alice Alice measures: 0 state will collapse!
68 EPR Pair Bob Alice Alice measures: 0 state will collapse! Bob s state has changed! he will also measure 0
69 EPR Pair Bob Alice Alice measures: state will collapse!
70 EPR Pair Bob Alice Alice measures: state will collapse! Bob s state has changed! he will also measure
71
72 Einstein: nothing, including information, can go faster than the speed of light, hence quantum mechanics is incomplete
73 Communication? bits 0 with EPR pairs 0 + Can not compress k bits into k- bits
74 Teleportation
75
76 Teleportation α 0 + β 0 0 +
77 Teleportation Φ Φ Classical bits: b b
78 Teleportation b b Φ Φ Classical bits: b b
79 Teleportation Φ Φ Classical bits: b b b b
80 Teleportation Φ U b b Φ Classical bits: b b b b
81 Teleportation Φ α 0 + β Classical bits: b b b b
82 Alice s protocol H
83 Alice s protocol H
84 Alice s protocol H
85 Alice s protocol H
86 Alice s protocol H
87 Bob s protocol Alice with prob. ¼ in one of: Bob do nothing bit flip phase flip bit flip and phase flip
88
89 Quantum Communication Complexity F(X,Y) F(X,Y) {0,} Classical bits X = x x x n 0 With EPR pairs Y = y y y n 0 + Question: Can EPR pairs reduce communication for certain F s?
90 Teleportation Qubit Model can be simulated by EPR model. Teleport qubit at cost of classical bits and EPR pair. EPR-pairs can reduce communication cost: use qubit protocol + teleportation
91 Apoinment Scheduling EPR-pairs bits Quantum: n bits communicatie Classical: n bits communicatie
92 EPR en information EPR-pairs Alice can not send information to Bob, but she can save information for certain communication problems
93 application to experimental physics
94 Bell inequalities and nonlocality
95 Non locality k (>) parties each party i has part of an entangled state φ> receives input x i performs measurent M x i outputs measurement value o i Induces correlations: P Q (o o k x x k ) no communication!
96 0 Quantum Setup EPR-pair 0 + x x M x M x o induces correlations: P Q (o o x x ) o
97 Non locality Question: Can these correlations be reproduced classically?
98 Local hidden var. model Classical setup Each party has: copy of random bits (shared randomness) input x i Performs computation (protocol) Oututs o i Induces correlations: P C (o o k x x k )
99 Classical Setup r r..r k shared randomness r r..r k x computation x computation o induces correlations: P C (o o x x ) o
100 Non locality If for every protocol: P C (o o k x x k ) P Q (o o k x x k ) Non locality Requires State + measurements to obtain P Q Prove that for every classical lhv protocol: P C (o o k x x k ) P Q (o o k x x k )
101 Examples of states parties: EPR pair: Bell inequalities 3 parties GHZ state: Mermin state: n parties
102 non locality experiments
103 0 Quantum Setup EPR-pair 0 + x M x o induces correlations: P Q (o o x x ) x M x o
104 Quantum Setup 0 EPR-pair 0 + x detector source detector x M x M x o induces correlations: P Q (o o x x ) o
105 Quantum Setup 0 EPR-pair 0 + x detector source detector x M x M x o induces correlations: P Q (o o x x ) o
106 prob. -η detection loophole sometimes detector(s) don t click Alice and/or Bob don t have an output can only test correlations when both Alice and Bob have an output Classical non clicking: classical lhv protocol sometimes no output only check whenever there is an output η = detector efficiency = prob. of clicking small η allows for lhv protocols prob. η
107 example r r k r k+ r k x=x x k shared randomness correlation P(o xy) η = -k r r k r k+ r k y=y y k if x x k r r k No Click if x x k = r r k assume y = r k+ r k output P(o xy) if y yk rk+ rk No Click if y y k = r k+ r k assume x = r r k output P(o xy)
108 detection loophole All experiments that show non locality have η such that a lhv model exist! Solution: Design tests that allow small η test also useful to test devices that claim to behave non local (eg quantum crypto) No good tests known
109 η * definition η * is the maximum detector efficiency for which a lhv model exists. Goal: design correlation problem/test prove upper bounds on η *
110 from quantum communication complexity back to non locality
111 Monochromatic rectangles X,X set of inputs for Alice and Bob Rectangle R = A B, A X & B X Ris a-monochromatic if for all(x,x ) R D: F(x,x ) = a D = set of promise inputs R a = max {R D R is a-monochr.} R a yields lower bound on C(F)
112 Monochromatic rectangles X,X set of inputs for Alice and Bob Rectangle R = A B, A X & B X Ris a-monochromatic if for all(x,x ) R D: F(x,x ) = a D = set of promise inputs R a = max {R D R is a-monochr.} R a yields lower bound on C(F)
113 set of inputs that have a as output C ( F ) log D R a a
114 EPR-pairs Can Reduce Cost exponential gap [BCW 98] EQ (x,x ) = iff x =x Promise (x,x ) = n/ or 0 need Ω(n) classical bits. can be done with log(n)) bits +EPR-pairs. Protocol: distributed Deutsch-Jozsa Hamming Distance
115 EQ set of inputs that have as output D C ( F ) log R =.04n R 0.96n D = n hard comb. theorem due to Frankl & Rödl
116 non-locality test Promise (x,x ) = n/ or 0 Alice outputs log(n) bits o Bob outputs log(n) bits o correlation: x =x o = o D-J algorithm on EPR-pairs [BCT 99] [Massar 0]
117 0 DJ-test log(n) EPR-pairs 0 + promise (x,x ) = n/ or 0 x H+ph-flip o x =x o =o x H+ph-flip o log(n) bits
118 Monochromatic rectangles X,X set of inputs for Alice and Bob Rectangle R = A B, A X & B X Ris a-monochromatic if for all(x,x ) R D: D = set of promise inputs P(a x x )>0 R A = max {R D R is a-mon. a A} R A yields upper bound on η *
119 Bound on η * number of possible outputs = A * R A η d D a A is set of other outputs {b x P(a x)>0 & P(b x)>0} set of inputs x s.t. P(a x)>0
120 proof * R A η d D a lhv protocol is distribution of deterministic prot. Q i : for all x Alice & Bob yield admissible outcome, or at least one doesn t click [prob. η] exist Q j Alice & Bob yield admissible outcome on η fraction of a-inputs det. protocol Alice & Bob yield outcome on at most dr A of the inputs dr A / D a η
121 Application of bound
122 0 DJ-test log(n) EPR-pairs 0 + promise (x,x ) = n/ or 0 x H+ph-flip o x =x o =o x H+ph-flip o log(n) bits
123 Bound on η * for DJ-test number of possible outputs * R A η d D aa A= {a i a i } d = n R A 0.96n D aa = n set of inputs x s.t. P(aa x)>0
124 Bound on η * for DJ-test number of possible outputs η * R A n d = 0. 0 D aa A= {a i a i } n d = n R A 0.96n D aa = n set of inputs x s.t. P(aa x)>0
125 n parties
126 n party test [BvDHT 99] input party i: promise: output a i : detector:
127 n-party bound largest mon. rectangle R * d D η n inputs d = n R (n-/n) n D = nlog(n) number of possible outputs
128 n-party bound largest mon. rectangle n R η * d = D n inputs d = n R (n-/n) n D = nlog(n) number of possible outputs
129 error s DJ-test can be simulated classically with small error. n-party test is even robust against error! Can not be simulated classically with: error prob. < ½-/n and η * /n
130 Bounded error One way communication complexity Two Parties exponential separation between randomized classical en quantum communication complexity [B-YJK 04] party nonlocality test: error prob< ½-/n c and η * /n c
131 open problems construct party test: η * / n and prob. of error < /n quantum gives perfect correlation Other applications of non-locality tests? What is the relation between EPR assisted communication complexity and qubit communication complexity? What are the best bounds for total functions?
Quantum Information Processing
Quantum Information Processing Harry Buhrman CWI & University of Amsterdam Physics and Computing Computing is physical Miniaturization quantum effects Quantum Computers 1) Enables continuing miniaturization
More informationQuantum Communication Complexity
Quantum Communication Complexity Ronald de Wolf Communication complexity has been studied extensively in the area of theoretical computer science and has deep connections with seemingly unrelated areas,
More informationAn 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 informationQuantum 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 informationDistributed Quantum Computing
Distributed Quantum Computing Harry Buhrman and Hein Röhrig Centrum voor Wiskunde en Informatica (CWI) P.O. Box 94079, 090 GB Amsterdam, The Netherlands Harry.Buhrman@cwi.nl, hein@acm.org Abstract. Quantum
More informationTutorial 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 informationNon-locality and Communication Complexity
Non-locality and Communication Complexity Harry Buhrman Richard Cleve Serge Massar Ronald de Wolf July 21, 2009 Abstract Quantum information processing is the emerging field that defines and realizes computing
More informationCompute the Fourier transform on the first register to get x {0,1} n x 0.
CS 94 Recursive Fourier Sampling, Simon s Algorithm /5/009 Spring 009 Lecture 3 1 Review Recall that we can write any classical circuit x f(x) as a reversible circuit R f. We can view R f as a unitary
More informationUnitary 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 informationLecture 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 informationQuantum Pseudo-Telepathy
Quantum Pseudo-Telepathy Michail Lampis mlambis@softlab.ntua.gr NTUA Quantum Pseudo-Telepathy p.1/24 Introduction In Multi-Party computations we are interested in measuring communication complexity. Communication
More informationHilbert 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 informationShort introduction to Quantum Computing
November 7, 2017 Short introduction to Quantum Computing Joris Kattemölle QuSoft, CWI, Science Park 123, Amsterdam, The Netherlands Institute for Theoretical Physics, University of Amsterdam, Science Park
More informationRecasting Mermin s multi-player game into the framework of pseudo-telepathy
Recasting Mermin s multi-player game into the framework of pseudo-telepathy arxiv:quant-ph/040805v 16 Jun 005 Gilles Brassard Anne Broadbent Alain Tapp Département IRO, Université de Montréal C.P. 618,
More information1 Measurements, Tensor Products, and Entanglement
Stanford University CS59Q: Quantum Computing Handout Luca Trevisan September 7, 0 Lecture In which we describe the quantum analogs of product distributions, independence, and conditional probability, and
More informationNon-locality and Communication Complexity
Non-locality and Communication Complexity Harry Buhrman Richard Cleve Serge Massar Ronald de Wolf July 20, 2009 Abstract Quantum information processing is the emerging field that defines and realizes computing
More informationQuantum Computing. Thorsten Altenkirch
Quantum Computing Thorsten Altenkirch Is Computation universal? Alonzo Church - calculus Alan Turing Turing machines computable functions The Church-Turing thesis All computational formalisms define the
More informationLecture 1: Overview of quantum information
CPSC 59/69: Quantum Computation John Watrous, University of Calgary References Lecture : Overview of quantum information January 0, 006 Most of the material in these lecture notes is discussed in greater
More informationLecture 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 informationQuantum 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 informationProblem 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 informationSUPERDENSE CODING AND QUANTUM TELEPORTATION
SUPERDENSE CODING AND QUANTUM TELEPORTATION YAQIAO LI This note tries to rephrase mathematically superdense coding and quantum teleportation explained in [] Section.3 and.3.7, respectively (as if I understood
More informationQuantum Information Processing and Diagrams of States
Quantum Information and Diagrams of States September 17th 2009, AFSecurity Sara Felloni sara@unik.no / sara.felloni@iet.ntnu.no Quantum Hacking Group: http://www.iet.ntnu.no/groups/optics/qcr/ UNIK University
More informationTeleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters)
Teleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters) Rahul Jain U. Waterloo and Institute for Quantum Computing, rjain@cs.uwaterloo.ca entry editor: Andris Ambainis
More informationIntroduction to Quantum Computing for Folks
Introduction to Quantum Computing for Folks Joint Advanced Student School 2009 Ing. Javier Enciso encisomo@in.tum.de Technische Universität München April 2, 2009 Table of Contents 1 Introduction 2 Quantum
More informationThe Future. Currently state of the art chips have gates of length 35 nanometers.
Quantum Computing Moore s Law The Future Currently state of the art chips have gates of length 35 nanometers. The Future Currently state of the art chips have gates of length 35 nanometers. When gate lengths
More informationFourier Sampling & Simon s Algorithm
Chapter 4 Fourier Sampling & Simon s Algorithm 4.1 Reversible Computation A quantum circuit acting on n qubits is described by an n n unitary operator U. Since U is unitary, UU = U U = I. This implies
More informationQuantum 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 informationPhysics 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 informationCS257 Discrete Quantum Computation
CS57 Discrete Quantum Computation John E Savage April 30, 007 Lect 11 Quantum Computing c John E Savage Classical Computation State is a vector of reals; e.g. Booleans, positions, velocities, or momenta.
More informationIntroduction to Quantum Algorithms Part I: Quantum Gates and Simon s Algorithm
Part I: Quantum Gates and Simon s Algorithm Martin Rötteler NEC Laboratories America, Inc. 4 Independence Way, Suite 00 Princeton, NJ 08540, U.S.A. International Summer School on Quantum Information, Max-Planck-Institut
More informationA Superluminal communication solution based on Four-photon entanglement
A Superluminal communication solution based on Four-photon entanglement Jia-Run Deng cmos001@163.com Abstract : Based on the improved design of Four-photon entanglement device and the definition of Encoding
More information6.896 Quantum Complexity Theory September 9, Lecture 2
6.96 Quantum Complexity Theory September 9, 00 Lecturer: Scott Aaronson Lecture Quick Recap The central object of study in our class is BQP, which stands for Bounded error, Quantum, Polynomial time. Informally
More informationQuantum Computing: Foundations to Frontier Fall Lecture 3
Quantum Computing: Foundations to Frontier Fall 018 Lecturer: Henry Yuen Lecture 3 Scribes: Seyed Sajjad Nezhadi, Angad Kalra Nora Hahn, David Wandler 1 Overview In Lecture 3, we started off talking about
More informationEPR 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 informationLecture 4. QUANTUM MECHANICS FOR MULTIPLE QUBIT SYSTEMS
Lecture 4. QUANTUM MECHANICS FOR MULTIPLE QUBIT SYSTEMS 4.1 Multiple Qubits Next we consider a system of two qubits. If these were two classical bits, then there would be four possible states,, 1, 1, and
More informationNothing Here. Fast Quantum Algorithms
Nothing Here Fast Quantum Algorithms or How we learned to put our pants on two legs at a time. Dave Bacon Institute for Quantum Information California Institute of Technology ? A prudent question is one-half
More informationIntroduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871
Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871 Lecture 1 (2017) Jon Yard QNC 3126 jyard@uwaterloo.ca TAs Nitica Sakharwade nsakharwade@perimeterinstitute.ca
More informationThe one-way communication complexity of the Boolean Hidden Matching Problem
The one-way communication complexity of the Boolean Hidden Matching Problem Iordanis Kerenidis CRS - LRI Université Paris-Sud jkeren@lri.fr Ran Raz Faculty of Mathematics Weizmann Institute ran.raz@weizmann.ac.il
More informationINTRODUCTION TO QUANTUM COMPUTING
INTRODUCTION TO QUANTUM COMPUTING Writen by: Eleanor Rieffel and Wolfgang Polak Presented by: Anthony Luaders OUTLINE: Introduction Notation Experiment Quantum Bit Quantum Key Distribution Multiple Qubits
More informationCSCI 2570 Introduction to Nanocomputing. Discrete Quantum Computation
CSCI 2570 Introduction to Nanocomputing Discrete Quantum Computation John E Savage November 27, 2007 Lect 22 Quantum Computing c John E Savage What is Quantum Computation It is very different kind of computation
More informationRichard Cleve David R. Cheriton School of Computer Science Institute for Quantum Computing University of Waterloo
CS 497 Frontiers of Computer Science Introduction to Quantum Computing Lecture of http://www.cs.uwaterloo.ca/~cleve/cs497-f7 Richard Cleve David R. Cheriton School of Computer Science Institute for Quantum
More informationD. 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 informationarxiv:quant-ph/ v3 12 Mar 1998
Quantum Entanglement and the Communication Complexity of the Inner Product Function Richard Cleve, Wim van Dam, Michael Nielsen, and Alain Tapp arxiv:quant-ph/970809v Mar 998 University of Calgary University
More informationThe controlled-not (CNOT) gate exors the first qubit into the second qubit ( a,b. a,a + b mod 2 ). Thus it permutes the four basis states as follows:
C/CS/Phys C9 Qubit gates, EPR, ell s inequality 9/8/05 Fall 005 Lecture 4 Two-qubit gate: COT The controlled-not (COT) gate exors the first qubit into the second qubit ( a,b a,a b = a,a + b mod ). Thus
More information10 - 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 informationLecture 4: Elementary Quantum Algorithms
CS 880: Quantum Information Processing 9/13/010 Lecture 4: Elementary Quantum Algorithms Instructor: Dieter van Melkebeek Scribe: Kenneth Rudinger This lecture introduces several simple quantum algorithms.
More informationAn 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 informationSimultaneous Communication Protocols with Quantum and Classical Messages
Simultaneous Communication Protocols with Quantum and Classical Messages Oded Regev Ronald de Wolf July 17, 2008 Abstract We study the simultaneous message passing model of communication complexity, for
More informationQuantum 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 informationB. BASIC CONCEPTS FROM QUANTUM THEORY 93
B. BASIC CONCEPTS FROM QUANTUM THEORY 93 B.5 Superposition B.5.a Bases 1. In QM certain physical quantities are quantized, such as the energy of an electron in an atom. Therefore an atom might be in certain
More informationProbabilistic exact cloning and probabilistic no-signalling. Abstract
Probabilistic exact cloning and probabilistic no-signalling Arun Kumar Pati Quantum Optics and Information Group, SEECS, Dean Street, University of Wales, Bangor LL 57 IUT, UK (August 5, 999) Abstract
More informationQuantum 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 informationInstantaneous 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 informationBasics on quantum information
Basics on quantum information Mika Hirvensalo Department of Mathematics and Statistics University of Turku mikhirve@utu.fi Thessaloniki, May 2016 Mika Hirvensalo Basics on quantum information 1 of 52 Brief
More informationINTRODUCTORY NOTES ON QUANTUM COMPUTATION
INTRODUCTORY NOTES ON QUANTUM COMPUTATION Keith Hannabuss Balliol College, Oxford Hilary Term 2009 Notation. In these notes we shall often use the physicists bra-ket notation, writing ψ for a vector ψ
More informationChallenges in Quantum Information Science. Umesh V. Vazirani U. C. Berkeley
Challenges in Quantum Information Science Umesh V. Vazirani U. C. Berkeley 1 st quantum revolution - Understanding physical world: periodic table, chemical reactions electronic wavefunctions underlying
More informationBell s inequalities and their uses
The Quantum Theory of Information and Computation http://www.comlab.ox.ac.uk/activities/quantum/course/ Bell s inequalities and their uses Mark Williamson mark.williamson@wofson.ox.ac.uk 10.06.10 Aims
More informationBasics on quantum information
Basics on quantum information Mika Hirvensalo Department of Mathematics and Statistics University of Turku mikhirve@utu.fi Thessaloniki, May 2014 Mika Hirvensalo Basics on quantum information 1 of 49 Brief
More informationQuantum 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 informationBit-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 informationQuantum Computing based on Tensor Products Overview and Introduction
Quantum Computing based on Tensor Products Overview and Introduction Guillermo Morales Luna Computer Science Section CINVESTAV-IPN E-mail: gmorales@cs.cinvestav.mx 5-th International Workshop on Applied
More informationQuantum Computing. Quantum Computing. Sushain Cherivirala. Bits and Qubits
Quantum Computing Bits and Qubits Quantum Computing Sushain Cherivirala Quantum Gates Measurement of Qubits More Quantum Gates Universal Computation Entangled States Superdense Coding Measurement Revisited
More informationb) (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 informationSeminar 1. Introduction to Quantum Computing
Seminar 1 Introduction to Quantum Computing Before going in I am also a beginner in this field If you are interested, you can search more using: Quantum Computing since Democritus (Scott Aaronson) Quantum
More informationQuantum 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 informationThe Relativistic Quantum World
The Relativistic Quantum World A lecture series on Relativity Theory and Quantum Mechanics Marcel Merk University of Maastricht, Sept 24 Oct 15, 2014 Relativity Quantum Mechanics The Relativistic Quantum
More informationA review on quantum teleportation based on: Teleporting an unknown quantum state via dual classical and Einstein- Podolsky-Rosen channels
JOURNAL OF CHEMISTRY 57 VOLUME NUMBER DECEMBER 8 005 A review on quantum teleportation based on: Teleporting an unknown quantum state via dual classical and Einstein- Podolsky-Rosen channels Miri Shlomi
More informationQuantum 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 informationQuantum 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 informationEntanglement and nonlocality
Entanglement and nonlocality (collected notes) Fabio Grazioso 2015-06-24 23:06 EDT 2 Contents 1 Introduction 5 1.1 foreword.................................... 5 1.2 general picture................................
More information. Here we are using the standard inner-product over C k to define orthogonality. Recall that the inner-product of two vectors φ = i α i.
CS 94- Hilbert Spaces, Tensor Products, Quantum Gates, Bell States 1//07 Spring 007 Lecture 01 Hilbert Spaces Consider a discrete quantum system that has k distinguishable states (eg k distinct energy
More informationChapter 10. Quantum algorithms
Chapter 10. Quantum algorithms Complex numbers: a quick review Definition: C = { a + b i : a, b R } where i = 1. Polar form of z = a + b i is z = re iθ, where r = z = a 2 + b 2 and θ = tan 1 y x Alternatively,
More informationMultiparty 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 informationQuantum mechanics and reality
Quantum mechanics and reality Margaret Reid Centre for Atom Optics and Ultrafast Spectroscopy Swinburne University of Technology Melbourne, Australia Thank you! Outline Non-locality, reality and quantum
More information6.080/6.089 GITCS May 6-8, Lecture 22/23. α 0 + β 1. α 2 + β 2 = 1
6.080/6.089 GITCS May 6-8, 2008 Lecturer: Scott Aaronson Lecture 22/23 Scribe: Chris Granade 1 Quantum Mechanics 1.1 Quantum states of n qubits If you have an object that can be in two perfectly distinguishable
More informationGrothendieck Inequalities, XOR games, and Communication Complexity
Grothendieck Inequalities, XOR games, and Communication Complexity Troy Lee Rutgers University Joint work with: Jop Briët, Harry Buhrman, and Thomas Vidick Overview Introduce XOR games, Grothendieck s
More informationQuantum Communication Complexity
Quantum Communication Complexity Hartmut Klauck FB Informatik, Johann-Wolfgang-Goethe-Universität 60054 Frankfurt am Main, Germany Abstract This paper surveys the field of quantum communication complexity.
More informationNondeterminism LECTURE Nondeterminism as a proof system. University of California, Los Angeles CS 289A Communication Complexity
University of California, Los Angeles CS 289A Communication Complexity Instructor: Alexander Sherstov Scribe: Matt Brown Date: January 25, 2012 LECTURE 5 Nondeterminism In this lecture, we introduce nondeterministic
More informationDiscrete Quantum Theories
Discrete Quantum Theories Andrew J. Hanson 1 Gerardo Ortiz 2 Amr Sabry 1 Yu-Tsung Tai 3 (1) School of Informatics and Computing (2) Department of Physics (3) Mathematics Department Indiana University July
More informationLecture 11 September 30, 2015
PHYS 7895: Quantum Information Theory Fall 015 Lecture 11 September 30, 015 Prof. Mark M. Wilde Scribe: Mark M. Wilde This document is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike
More information2. Introduction to quantum mechanics
2. Introduction to quantum mechanics 2.1 Linear algebra Dirac notation Complex conjugate Vector/ket Dual vector/bra Inner product/bracket Tensor product Complex conj. matrix Transpose of matrix Hermitian
More informationMulti-Party Quantum Communication Complexity with Routed Messages
Multi-Party Quantum Communication Complexity with Routed Messages Seiichiro Tani Masaki Nakanishi Shigeru Yamashita Abstract This paper describes a general quantum lower bounding technique for the communication
More informationIs Entanglement Sufficient to Enable Quantum Speedup?
arxiv:107.536v3 [quant-ph] 14 Sep 01 Is Entanglement Sufficient to Enable Quantum Speedup? 1 Introduction The mere fact that a quantum computer realises an entangled state is ususally concluded to be insufficient
More informationOn the tightness of the Buhrman-Cleve-Wigderson simulation
On the tightness of the Buhrman-Cleve-Wigderson simulation Shengyu Zhang Department of Computer Science and Engineering, The Chinese University of Hong Kong. syzhang@cse.cuhk.edu.hk Abstract. Buhrman,
More informationIntroduction to Quantum Computing
Introduction to Quantum Computing Petros Wallden Lecture 7: Complexity & Algorithms I 13th October 016 School of Informatics, University of Edinburgh Complexity - Computational Complexity: Classification
More informationIntroduction to Quantum Computing
Introduction to Quantum Computing Part II Emma Strubell http://cs.umaine.edu/~ema/quantum_tutorial.pdf April 13, 2011 Overview Outline Grover s Algorithm Quantum search A worked example Simon s algorithm
More informationShort Course in Quantum Information Lecture 2
Short Course in Quantum Information Lecture Formal Structure of Quantum Mechanics Course Info All materials downloadable @ website http://info.phys.unm.edu/~deutschgroup/deutschclasses.html Syllabus Lecture
More informationEntanglement 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 informationarxiv: v2 [quant-ph] 19 Mar 2016
Time-space tradeoffs for two-way finite automata Shenggen Zheng zhengshenggen@gmail.com Sun Yat-sen University Daowen Qiu issqdw@mail.sysu.edu.cn Sun Yat-sen University Jozef Gruska gruska@fi.muni.cz Masaryk
More informationEntanglement. arnoldzwicky.org. Presented by: Joseph Chapman. Created by: Gina Lorenz with adapted PHYS403 content from Paul Kwiat, Brad Christensen
Entanglement arnoldzwicky.org Presented by: Joseph Chapman. Created by: Gina Lorenz with adapted PHYS403 content from Paul Kwiat, Brad Christensen PHYS403, July 26, 2017 Entanglement A quantum object can
More informationLecture 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 informationAlgebraic Problems in Computational Complexity
Algebraic Problems in Computational Complexity Pranab Sen School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai 400005, India pranab@tcs.tifr.res.in Guide: Prof. R.
More informationPh 219b/CS 219b. Exercises Due: Wednesday 4 December 2013
1 Ph 219b/CS 219b Exercises Due: Wednesday 4 December 2013 4.1 The peak in the Fourier transform In the period finding algorithm we prepared the periodic state A 1 1 x 0 + jr, (1) A j=0 where A is the
More informationQuantum Computers. Todd A. Brun Communication Sciences Institute USC
Quantum Computers Todd A. Brun Communication Sciences Institute USC Quantum computers are in the news Quantum computers represent a new paradigm for computing devices: computers whose components are individual
More informationAn 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 informationComplex numbers: a quick review. Chapter 10. Quantum algorithms. Definition: where i = 1. Polar form of z = a + b i is z = re iθ, where
Chapter 0 Quantum algorithms Complex numbers: a quick review / 4 / 4 Definition: C = { a + b i : a, b R } where i = Polar form of z = a + b i is z = re iθ, where r = z = a + b and θ = tan y x Alternatively,
More information1 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 informationEinstein-Podolsky-Rosen correlations and Bell correlations in the simplest scenario
Einstein-Podolsky-Rosen correlations and Bell correlations in the simplest scenario Huangjun Zhu (Joint work with Quan Quan, Heng Fan, and Wen-Li Yang) Institute for Theoretical Physics, University of
More informationComputational Complexity: A Modern Approach. Draft of a book: Dated January 2007 Comments welcome!
i Computational Complexity: A Modern Approach Draft of a book: Dated January 2007 Comments welcome! Sanjeev Arora and Boaz Barak Princeton University complexitybook@gmail.com Not to be reproduced or distributed
More information