informtion-theoretic.pptVIP

Quantum Algorithms II Andrew C. Yao Tsinghua University Chinese U. of Hong Kong Outline of Talk I. Introduction II. Element Distinctness Sorting III. Quantum Algorithm -- element distinctness IV. Lower Bounds -- sorting problems V. Conclusions Quantum Mechanics More generally A quantum state is a unit vector u in CN A measurement is a family of orthogonal subspaces (V1, V2 , …,Vk): u = u1+u2 +…+uk will be measured as ui with prob |ui|2 A computation step is a unitary operator (a ‘rotation’) A Quantum Algorithm specifies an initial quantum state a sequence of unitary operators a final measurement. Classical algorithm Quantum Algorithm I. Introduction Shor (‘94): Fast factorization of integers Grover (‘96): Searching n-item list in time Exactly one is 1, all other are 0 Problem: Find j I. Introduction Hilbert space with base vectors -- Start with -- Use a unitary operator to compute (where ) Grover’s Theorem: I. Introduction Initially, After t steps, Take measurement in base the probability of seeing |j is Random Walk Hitting j by classical random walks takes n steps Quantum Random Walk Hitting j by quantum random walks takes steps I. Introduction Optimality Theorem (Bernstein et al ‘97): Any quantum algorithm must use steps to locate j Question: What other problems can be speeded up with quantum algorithms? This talk: Progress on sorting-like problems -- Element Distinctness Problem -- Sorting Problem I. Introduction Element Distinctness: Given decide whether there exist such that Sorting: Given distinct