1 / 26

Richard Cleve DC 3524 cleve@cs.uwaterloo Course web site at:

Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681. Richard Cleve DC 3524 cleve@cs.uwaterloo.ca Course web site at: http://www.cs.uwaterloo.ca/~cleve/courses/cs467. Lecture 17 (2005). Contents. Communication complexity

jun
Download Presentation

Richard Cleve DC 3524 cleve@cs.uwaterloo Course web site at:

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Introduction to Quantum Information ProcessingCS 467 / CS 667Phys 467 / Phys 767C&O 481 / C&O 681 Richard Cleve DC 3524 cleve@cs.uwaterloo.ca Course web site at: http://www.cs.uwaterloo.ca/~cleve/courses/cs467 Lecture 17 (2005)

  2. Contents • Communication complexity • Lower bound for the inner product problem • Simultaneous message passing and fingerprinting • Hidden matching problem • Nonlocality revisited

  3. Communication complexity • Lower bound for the inner product problem • Simultaneous message passing and fingerprinting • Hidden matching problem • Nonlocality revisited

  4. Inner product IP(x,y) = x1y1+x2y2+ +xnyn mod 2 Classically, (n) bits of communication are required, even for bounded-error protocols Quantum protocols also require (n) communication [KY ‘95] [CNDT ‘98] [NS ‘02]

  5. a1 0 x1 x1 H H f a2 0 x2 x2 H H     H H xn 0 an xn H H 1 1 b b  f(x1, x2, …, xn) H H The BV black-box problem Bernstein & Vazirani Let f(x1, x2, …, xn) =a1x1+a2x2+ +anxn mod 2 Given: Goal: determine a1, a2,…, an Classically, n queries are necessary Quantum mechanically, 1 query is sufficient

  6. Lower bound for inner product x1 x2 xn y1 y2 yn z Alice and Bob’s IP protocol Alice and Bob’s IP protocol inverted x1 x2 xn y1 y2 yn zIP(x,y) IP(x,y) = x1y1+x2y2+ +xnyn mod 2 Proof:

  7. Lower bound for inner product H H H H H H H H IP(x,y) = x1y1+x2y2+ +xnyn mod 2 0 0 0 1 x1 x2 xn Proof: Alice and Bob’s IP protocol Alice and Bob’s IP protocol inverted x1 x2 xn x1 x2 xn 1 Since n bits are conveyed from Alice to Bob, n qubits communication necessary (by Holevo’s Theorem)

  8. Communication complexity • Lower bound for the inner product problem • Simultaneous message passing and fingerprinting • Hidden matching problem • Nonlocality revisited

  9. Equality function: f (x,y)=1ifx = y 0 ifxy Equality revisitedin simultaneous message model x1x2  xn y1y2  yn f (x,y) Exactprotocols: require 2n bits communication

  10. Pr[00] = Pr[11] = ½ random k Equality revisitedin simultaneous message model x1x2  xn y1y2  yn classical correlations classical correlations f (x,y) Bounded-error protocols with a shared random key:require only O(1) bits communication Error-correcting code: e(x) = 1 0 1 1 1 1 0 1 0 1 1 0 0 1 1 0 0 1 e(y) = 0 1 1 0 1 0 0 1 0 0 1 1 0 0 1 0 1 0

  11. Equality revisitedin simultaneous message model x1x2  xn y1y2  yn Bounded-error protocols without a shared key: f (x,y) Classical: θ(n1/2) Quantum:θ(logn) [A ’96] [NS ’96] [BCWW ’01]

  12. Quantum fingerprints Question 1: how many orthogonal states in m qubits? Answer: 2m Let be an arbitrarily small positive constant Question 2: how many almost orthogonal* states in m qubits? (* where |xy|≤ ) Answer: 22am, for some constant a> 0 Construction of almost orthogonal states: start with a suitable (classical) error-correcting code, which is a function e:{0,1}n {0,1}cn where, for all x ≠ y, dcn≤Δ(e(x),e(y)) ≤ (1−d)cn (c, dare constants)

  13. Set x for each x{0,1}n (log(cn) qubits) Then xy Result:m = rlog(cn) qubits storing 2n= 2(1/c)2m/r different states Construction of almost orthogonal states Since dcn≤Δ(e(x),e(y))≤(1−d)cn, we have |xy| ≤1−2d By duplicating each state, xx … x, the pairwise inner products can be made arbitrarily small: (1−2d)r≤ (as opposed to n qubits!)

  14. What are almost orthogonal states good for? Question 3: can they be used to somehow store n bits using only O(log n) qubits? Answer: NO—recall that Holevo’s theorem forbids this • Here’s what we can do: given two states from an almost orthogonal set, we can distinguish between these two cases: • they’re both the same state • they’re almost orthogonal Question 4: How?

  15. 0 H H x S W A P y Intuition: 0xy +1yx Quantum fingerprints Let 000,001, …,111 be 2n states on O(log n) qubits such that |xy|≤ for all x≠y Given xy, one can check if x=y or x≠y as follows: if x=y, Pr[output= 0] = 1 if x≠y, Pr[output= 0] = (1+2)/2 Note: error probability can be reduced to((1+2)/2)r

  16. Equality revisitedin simultaneous message model x1x2  xn y1y2  yn Bounded-error protocols without a shared key: f (x,y) Classical: θ(n1/2) Quantum:θ(logn) [A ’96] [NS ’96] [BCWW ’01]

  17. Orthogonality test Quantum protocol for equality in simultaneous message model x1x2  xn y1y2  yn x y x y Recall that, with a shared key, the problem is easy classically ...

  18. Communication complexity • Lower bound for the inner product problem • Simultaneous message passing and fingerprinting • Hidden matching problem • Nonlocality revisited

  19. M= matching on {1, 2, …, n} x {0,1}n Inputs: (i, j,xixj), such that (i, j) M Output: Hidden matching problem For this problem, a quantum protocol is exponentially more efficient than any classical protocol—even with a shared key Only one-way communication (Alice to Bob) is permitted [Bar-Yossef, Jayram, Kerenidis, 2004]

  20. The hidden matching problem M= matching on {1,2, …, n} x {0,1}n Inputs: Output: (i, j,xixj), (i, j) M Classically, one-way communication is (n), even with a shared classical key (the proof is omitted here) Rough intuition: Alice doesn’t know which edges are in M, so she apparently has to send (n) bits of the form xixj …

  21. Quantum protocol: Alice sends (log n qubits) The hidden matching problem M= matching on {1,2, …, n} x {0,1}n Inputs: Output: (i, j,xixj), (i, j) M Bob measures in i  j basis, (i, j) M, and uses the outcome’s relative phase to determine xixj

  22. Communication complexity • Lower bound for the inner product problem • Simultaneous message passing and fingerprinting • Hidden matching problem • Nonlocality revisited

  23. Restricted-equality nonlocality x y inputs: (n bits) (n bits) a b outputs: (logn bits) (logn bits) Precondition: either x =y or (x,y) =n/2 Required postcondition: a =b iff x =y With classical resources, (n) bits of communication needed for an exact solution* With (00 + 11)logn prior entanglement, no communication is needed at all*  Technical details similar to restricted equality of Lecture 17 [BCT ‘99]

  24. Bit communication: Qubit communication: Cost:log n Cost:θ(n) Bit communication & prior entanglement: Qubit communication & prior entanglement: Cost: zero Cost: zero Restricted-equality nonlocality

  25. Nonlocality and communication complexity conclusions • Quantum information affects communication complexity in interesting ways • There is a rich interplay between quantum communication complexity and: • quantum algorithms • quantum information theory • other notions of complexity theory …

  26. THE END

More Related