A better lower bound for quantum algorithms searching an ordered list
|
|
- Geraldine Kelley Horn
- 6 years ago
- Views:
Transcription
1 A better lower bound for quantum algorithms searching an ordered list Andris Ambainis Computer Science Division University of California Berkeley, CA 94720, Abstract We show that any quantum algorithm searching an ordered list of n elements needs to examine at least log 2 n 2 O() of them. Classically, log 2 n queries are both necessary and sufficient. This shows that quantum algorithms can achieve only a constant speedup for this problem. Our result improves lower bounds of Buhrman and de Wolf(quant-ph/98046) and Farhi, Goldstone, Gutmann and Sipser (quantph/982057). Introduction One of main results in quantum computation is Grover s algorithm[0]. This quantum algorithm allows to search an unordered list of n elements by examining just O( n) of them. Any classical algorithm needs to examine all n elements. Grover s algorithm is very important because it can be applied to any search problem (not just searching a list). For example, it can be used to find a Hamilton cycle in an n-vertex graph by checking only n! out of n! possible Hamilton cycles. After Grover s paper appeared, unordered search and related problems received a lot of attention in quantum computation community. It was shown that O( n) is optimal[2]. Then, Grover s algorithm has been used as subroutine in other quantum algorithms[5, 4]. Optimality proof of [2] has been generalized as well[, 6]. Grover s algorithm works well for unordered lists but cannot be used for searching ordered lists. An ordered list of n elements can be searched by examining just log 2 n elements Supported by Berkeley Fellowship for Graduate Studies.
2 classically and there is no evident way of speeding it up by methods similar to Grover s algorithm. Searching ordered lists by a quantum algorithm was first considered by Buhrman and de Wolf[6] who proved a log n/ log log n lower bound for quantum case. This lower bound was improved to log n/2 log log n by Farhi, Goldstone, Gutmann and Sipser[7]. The log n/2 log log n bound was independently discovered (but not published) by the author of this paper in June 998. We improve the lower bound to log n O(), showing that only a constant speedup 2 is possible for the ordered search. The best quantum algorithm for ordered search uses 0.53 log n queries[8]. Thus, a constant speedup is possible. The proof of our lower bound combines the method of [2] (adapted to ordered case by [7]) with a new idea inspired by weighted majority algorithms in the learning theory[9, ]. 2 Preliminaries 2. Quantum binary search In the binary search problem, we are given x IR,..., x n IR, y IR such that x x 2... x n and have to find the smallest i such that y x i. Normally, x,..., x n are accessed by queries. The input to the query is i, the answer is x i. This is a classical problem in computer science and it is well known that log 2 n queries are both necessary and sufficient to solve it classically. In this paper, we consider how many queries one needs in the quantum world. We will prove a log n O() lower bound. For our proof, it is enough to consider the case when 2 x {0, },..., x n {0, } and y =. Then the problem becomes following. 0- valued binary search. Given x {0, },..., x n {0, } such that x x 2... x n, find the smallest i such that x i =. Similarly to classical world, we consider algorithms that access the input by queries. A quantum algorithm A can be represented as a sequence of unitary transformations U 0 O U O... U T O U T on a state space with finitely many basis states. U j s are arbitrary unitary transformations that do not depend on x,..., x N and O s are queries to the input. We use O k to denote the query transformation corresponding to the input x =... = x k = 0, x k+ =... = x n =. To define O k, we represent the basis states as i, b, z where i consists of log n bits, b is one bit and z consists of all other qubits. Then, O k maps i, b, z to i, b x i, z. (I.e., the first log n qubits are interpreted as an index i for an input bit x i and this input bit is XORed on the next qubit.) A different quantum algorithm with c log n queries for c < was claimed in [2]. However, a bug was discovered in the proof of [2] and it is not clear whether the proof can be fixed. 2
3 Running a quantum algorithm A on an input x =... = x k = 0, x k+ =... = x n = means applying the transformation U T O k U T... U O k U 0 to the initial state 0 and measuring the first log n bits of the final state. The algorithm computes the binary search function if, for any input x =... = x k = 0, x k+ =... = x n =, this process gives k with probability at least 3/ Technical lemmas In this section, we state several results that we will use. The first result is the well-known formula for the sum of decreasing geometric progression. If q >, then i=0 q = i, q q = () i q The second result is a lemma from [3]. It relates the l 2 -distance between two superpositions and the variational distance between probability distributions that we obtain by observing two superpositions. The variational distance between two probability distributions p(x) and p (x) is just the sum x p(x) p (x). Lemma 3 [3] Let ψ and φ be superpositions such that ψ φ ɛ. Then the total variational distance resulting from measurements of φ and ψ is at most 4ɛ. In our case, ψ and φ are final superpositions of a quantum algorithm A on two different inputs x =... = x j = 0, x j+ =... = x n = and x =... = x k = 0, x k+ =... = x n =. For the first input, j is the correct answer and the measurement must return j with probability at least 3. The probability that the measurement gives k can be at most 4 3 =. For the second input, the probability of j can be at most and the probability of k must be at least 3. This means that the variational distance must be at least 2( 3 ) = By Lemma, this is only possible if ψ φ. We have shown 4 Lemma 2 If ψ and φ are final superpositions of a quantum binary search algorithm, then ψ φ 4. 3 Result 3. log n/2 log log n lower bound We start with a sketch of log n/2 log log n lower bound discovered independently by the author of this paper and Farhi, Gutmann, Goldstone and Sipser[7]. After that, we describe how to modify this argument to obtain an Ω(log n) lower bound. 2 One can replace 3/4 by any other constant in (0, ) and our proof would still give a 2 log n O() lower bound, with a slightly different constant in the O() term. 3 Ronald de Wolf has shown that 4ɛ can be improved to 2ɛ in this lemma. This can be used to improve O() constant in our 2 log n O() lower bound. 3
4 Assume we are given a quantum algorithm A for binary search that uses less than log n/2 log log n queries. We construct an input on which A works incorrectly. In the first stage, we partition [, n] into log 2 n intervals of length n/ log 2 n each. We simulate A up to the first query. There is an interval [(l ) n/ log 2 n +, l n/ log 2 n] that is queried with probability that less than or equal to / log 2 n. We answer the first query of A with x i = 0 for i l n/ log 2 n and x i = for i > l n/ log 2 n. Then, we split the interval [(l ) n/ log 2 n +, l n/ log 2 n] into log 2 n parts of size n/ log 4 n, find the one queried with the smallest probability, answer the second query by x i = 0 for i up to this interval and x i = for greater i and so on. We repeat the splitting until the interval is smaller than log 2 n. This means doing log n/ log(log 2 n) = log n/2 log log n splittings. Let [(l )m +, lm] be the final interval. Consider two inputs x =... = x lm = 0, x lm =... = x n = and x =... = x lm = 0, x lm+ =... = x n =. The only value where these two inputs differ is x lm and, by our construction, it is queried with a probability at most / log 2 n in each of log n/2 log log n steps. By a hybrid argument similar to [2], this implies that the final superpositions of the quantum algorithm A on these two inputs are within distance O(/ log log n). Hence, the results of measuring final superpositions on two inputs will be close as well (cf. Lemma ). 3.2 log n/2 lower bound To obtain an Ω(log n) lower bound, we must split the interval into a constant number of pieces at every step (rather than log 2 n pieces). However, if we split the interval into a constant number of pieces, we can only guarantee that the new interval has the probability of being queried smaller than some constant (not smaller than / log 2 n). Then, it may happen that x lm gets queried with a constant probability in each of c log n queries, giving the total probability much higher than. In this case, the quantum algorithm A can easily distinguish two inputs that differ only in x lm. To avoid this, we do the splitting in a different way. Instead of considering just the probabilities of an interval being queried in the last step, we consider the probabilities of it being queried in the previous steps as well and try to decrease them all. This is done by using a weighted sum of these probabilities. The precise argument follows. Theorem Let q IR, q >, t IN, u IN and be such that q(q ) u <. Then, at least binary search on n elements. q = t + 2 q log n O() queries are necessary for the quantum u log t Proof: Assume we are given a quantum algorithm A doing binary search on x,..., x n with less than log n c queries where the constant c will be specified later. We construct two u log t inputs that A cannot distinguish. 4
5 First, we describe an auxiliary procedure subdivide. This procedure takes an interval [(l )m +, lm] and returns a subinterval [(l )m +, l m ]. subdivide(m, l, s):. Let m = m/t. Split [(l )m +, lm] into t subintervals: [(l )m +, (l )m + m ], [(l )m + m +, (l )m + 2m ],..., [(l )m + (t )m +, (l )m + tm ]. 2. Simulate the first s query steps (and unitary transformations between these steps) of A on the input x =... = x lm = 0, x lm+ =... = x n =. Let φ i = U i O lm U i 2... U O lm U 0 ( 0 ) be the superposition before the i th query step, ψ i be its part corresponding to querying x k for k [(l )m +, lm] and ψ i,r be the part of ψ i corresponding to querying x k for k [(l )m + (r )m +, (l )m + rm ]. 3. For every r {,..., t}, compute the sum S r = ψ s,r + q ψ (s ),r + q 2 ψ (s 2),r q s ψ,r. 4. Take the r minimizing S r and set l = (l )k + r. Then, [(l )m +, l m ] is equal to [(l )m + (r )m +, (l )m + rm ]. Next, we analyze this procedure. Let S = ψ s + q ψ s + q 2 ψ s q s ψ,j. Let φ i and ψ i be the counterparts for φ i and ψ i, given the input x =... = x l m = 0, x l m + =... = x n =. We define S = ψ s + q ψ s + q 2 ψ s Lemma 3 S q S. Proof: We bound the difference between superpositions ψ i (used to define S ) and ψ i,r (used to define S r ). To do that, we first bound the difference between φ i and φ i. Claim φ i φ i 2( ψ ψ i ). 5
6 Proof: By induction. If i =, then φ i = φ i. Next, we assume that φ i φ i 2( ψ ψ i 2 ). φ i is the result of applying U i O lm to φ i and φ i is the result of applying U i O l m to φ i. U i is just a unitary transformation and it does not change distances. Hence, we have φ i φ i = U io lm ( φ i ) U i O l m ( φ i ) = O lm( φ i ) O l m ( φ i ) O lm ( φ i ) O l m ( φ i ) + O l m ( φ i ) O l m ( φ i ). The second part is just φ i φ i and it is at most 2( ψ ψ i 2 ) by inductive assumption. To bound the first part, let ϕ i = φ i ψ i. Then, ϕ i is the part of superposition φ i corresponding to querying k / [(l )m +, lm]. O lm and O l m are the same for such k. Therefore, O lm( ϕ i ) = O l m ( ϕ i ) and O lm ( φ i ) O l m ( φ i ) = O lm ( ψ i ) O l m ( ψ i ) O lm ( ψ i ) + O l m ( ψ i ) = 2 ψ i. Consider the subspace of the Hilbert space consisting of states that correspond to querying k [(l )m, l m ]. ψ i,r and ψ i are projections of φ i and φ i to this subspace. Hence, ψ i,r ψ i is the projection of φ i φ i. For any vector, the norm of its projection is at most the norm of the vector itself. Therefore, we have Claim 2 This means ψ i,r ψ i 2( ψ ψ i ). S = q s i ψ i q s i ( ψ i,r + 2( ψ ψ i )) = q s i ψ i,r + 2 (q s i i ψ j ). (2) j= The first term is just S r. Next, we bound the second term. (q s i i ψ j ) = ( ψ j q s i ) < ( ψ j q s i ) = j= j= i=j+ j= i=j+ ( ψ j q s j j= q ) = ψ i j qs j j= q = S. (3) q Putting (2), (3) together, we get S S r + 2 q S. Next, we bound S r. 6
7 Claim 3 S r t S. (4) Proof: We have ψ i = ψ i, ψ i,t. This implies By a Cauchy-Schwartz inequality Therefore, ψ i 2 = ψ i, ψ i,t 2. ψ i, ψ i,t 2 ( ψ i, ψ i,t ) 2. t ψ i ψ i, ψ i,t t. S is just a weighted sum of ψ i and S,..., S t are weighted sums of ψ i,,..., ψ i,t, respectively. Hence, S S +...+S t t and S S t ts. By definition of r, S r is the smallest of S,..., S t. This implies (4). Claim 3 gives S S r + 2 q S ( + 2 t q )S = q S. This completes the proof of Lemma 3. Next, we use the subdivide procedure to construct two inputs that are not distinguished by A. This is done as follows. Let v be (log( ( 0 q(q ) u )( ))/ log q q.. Let m = n, l =, s =. 2. While m t v, repeat: 2.. u times do subdivide(m, l, s) and set l = l, m = m s = s v u times do subdivide(m, l, s) and set l = l, m = m. At the beginning, m = n. Each execution of step 2 decreases m by a factor of t u and step 2 is repeated while m t v. Hence, it gets repeated at least log(n/t v ) log(t u ) = log n v log t u log t = log n u log t v u = log n u log t O() times. The final interval [(l )m+, lm] has a small probability of being queried and, therefore it is impossible to distinguish x =... = x k = 0, x k+ =... x n = for different k [(l )m +, lm] one from another. To prove this, we first show the following invariant: 7
8 Lemma 4. At the beginning of step 2.., S is at most q(q ) u. 2. At the end of step 2.., S is at most (q ) u q(q ) u. Proof: By induction. When we first start step 2.., s =, S = ψ and <. q(q ) u For the inductive case, if we have S at the beginning of step, each subdivide decreases it q times and S (q ) u q(q ) u q(q ) u at the end of the step. Also, if S = q s i ψ i at the end of one step, then, in the next step, S will be s+ q s+ i ψ i = ψ s+ + q q s i (q ) u ψ i + q q(q ) = u q(q ). u This completes the proof of the lemma. By the same argument, S at the end of step 3. The definition of v implies S (q ) v q(q ) u 0 ( q(q ) u )( q ) q(q ) u = 0 ( q ). Together with S = s q s i ψ i q s i ψ i, this implies ψ i q. (5) 0qs i Now, we use a hybrid argument similar to [2, 7]. Consider A working on the input x =... = x lm = 0, x lm+ =... = x n = and on the input x =... = x lm = 0, x lm =... = x n =. The final superpositions on these two inputs are ϕ = U T O lm U T... U 0 ( 0 ), ϕ = U T O lm U T... U 0 ( 0 ). We are going to show that ϕ and ϕ are close. superpositions (also called hybrids) To show this, we introduce intermediate Then, ϕ = ϕ s, ϕ = ϕ 0. ϕ i = U T O lm U T... U i+ O lm U i O lm U i... U 0 ( 0 ). Claim 4 ϕ i ϕ i q. (6) 5qs i 8
9 Proof: The only different transformation is the i th query which is O lm for ϕ i and O lm for ϕ i. Before this transformation, the state is φ i = U i O lm U i 2... U 0 ( 0 ) The part of this superposition corresponding to querying [(l )m +, lm] is ψ i. This is the only part of φ i on which O lm and O lm are different. Therefore, O lm ( φ i ) O lm ( φ i ) = O lm ( ψ i ) O lm ( ψ i ) 2 ψ i 5 q q s i. The next transformations (U T O lm U T... U i ) are the same again. This implies (6). By triangle inequality (and formulas (6) and ()), s q ϕ 0 ϕ s ϕ i ϕ i i=0 5q i = q 5 s i=0 q q i 5 q = 5. However, ϕ 0 is the final superposition for the input x =... = x lm = 0, x lm =... = x n =, ϕ s is the final superposition for the input x =... = x lm = 0, x lm+ =... = x n = and, by Lemma 2, the distance between them must be at least /4. This shows that there is no quantum algorithm A that solves the binary search problem with at most log n v queries. u log t u By optimizing the parameters in theorem, we get Corollary At least log n O() queries are necessary for quantum binary search on n 2 elements. Proof: Substitute q = 8.3, t = 8, u = 4 into Theorem. 4 Conclusion We have shown that any quantum algorithm needs at least log 2 n/2 queries to do binary search. This shows that at most a constant speedup is possible for this problem in the query model (compared to the best classical algorithm). Similarly to other lower bounds on quantum algorithms, this result should not be considered as pessimistic. First, the classical binary search is very sequential algorithm and, therefore, it is not so surprising that it is impossible to speed it up by using quantum algorithms. Second, the classical binary search is already fast enough for most (if not all) practical purposes. We hope that our lower bound technique will be useful for proving other lower bounds on quantum algorithms. One of main open problems in this area is the collision problem[4] for which there is no quantum lower bounds at all. Acknowledgments. I thank Ashwin Nayak for suggesting this problem and Ronald de Wolf for useful comments. 9
10 References [] R. Beals, H. Buhrman, R. Cleve, M. Mosca, R. de Wolf. Quantum lower bounds by polynomials. Proceedings of FOCS 98. Also quant-ph/ [2] C. Bennett, E. Bernstein, G. Brassard, U. Vazirani. Strengths and weaknesses of quantum computing. SIAM Journal on Computing, 26(3):50-523, 997, quantph/ [3] E. Bernstein, U. Vazirani, Quantum complexity theory. SIAM Journal on Computing, 26:4-473, 997. [4] G. Brassard, P. Hoyer, A. Tapp. Quantum algorithm for the collision problem, quantph/ [5] G. Brassard, P. Hoyer, A. Tapp. Quantum counting. Proceedings of ICALP 98, Lecture Notes in Computer Science, 443:820-83, 998. Also quant-ph/ [6] H. Buhrman, R. de Wolf. Lower bounds for quantum search and derandomization, quant-ph/ [7] E. Farhi, J. Goldstone, S. Gutmann, M. Sipser. A limit on the speed of quantum computation for insertion into an ordered list, quant-ph/ [8] E. Farhi, J. Goldstone, S. Gutmann, M. Sipser. Invariant quantum algorithms for insertion into an ordered list, quant-ph/ [9] R. Freivalds, J. Bārzdiņš, K. Podnieks. Inductive inference of recursive functions: complexity bounds, in Baltic Computer Science, Lecture Notes in Computer Science, 502:-55, 99. [0] L. Grover. A fast quantum mechanical algorithm for database search, Proceedings of the 28th ACM Symposium on Theory of Computing, pp , 996, quant-ph/ [] N. Littlestone, M. Warmuth. The weighted majority algorithm, Information and Computation, 08(2):22-26, 994. [2] H. Röhrig. An upper bound for searching an ordered list, quant-ph/
Lecture 13: Lower Bounds using the Adversary Method. 2 The Super-Basic Adversary Method [Amb02]
Quantum Computation (CMU 18-859BB, Fall 015) Lecture 13: Lower Bounds using the Adversary Method October 1, 015 Lecturer: Ryan O Donnell Scribe: Kumail Jaffer 1 Introduction There are a number of known
More informationarxiv:quant-ph/ v1 29 May 2003
Quantum Lower Bounds for Collision and Element Distinctness with Small Range arxiv:quant-ph/0305179v1 29 May 2003 Andris Ambainis Abstract We give a general method for proving quantum lower bounds for
More informationarxiv: v1 [quant-ph] 6 Feb 2013
Exact quantum query complexity of EXACT and THRESHOLD arxiv:302.235v [quant-ph] 6 Feb 203 Andris Ambainis Jānis Iraids Juris Smotrovs University of Latvia, Raiņa bulvāris 9, Riga, LV-586, Latvia February
More informationQuantum Algorithms for Element Distinctness
Quantum Algorithms for Element Distinctness Harry Buhrman Christoph Dürr Mark Heiligman Peter Høyer Frédéric Magniez Miklos Santha Ronald de Wolf Abstract We present several applications of quantum amplitude
More informationQuantum Algorithms for Element Distinctness
Quantum Algorithms for Element Distinctness Harry Buhrman Christoph Dürr Þ Mark Heiligman Ü Peter Høyer ß Frédéric Magniez Miklos Santha Ronald de Wolf ÝÝ Abstract We present several applications of quantum
More informationHow Low Can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions?
How Low Can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions? Andris Ambainis Ronald de Wolf Abstract It has long been known that any Boolean function that depends on n input
More informationThe Quantum Query Complexity of Algebraic Properties
The Quantum Query Complexity of Algebraic Properties Sebastian Dörn Institut für Theoretische Informatik Universität Ulm 89069 Ulm, Germany Thomas Thierauf Fak. Elektronik und Informatik HTW Aalen 73430
More informationBounds for Error Reduction with Few Quantum Queries
Bounds for Error Reduction with Few Quantum Queries Sourav Chakraborty, Jaikumar Radhakrishnan 2,3, and andakumar Raghunathan Department of Computer Science, University of Chicago, Chicago, IL 60637, USA
More informationThe Quantum Query Complexity of the Determinant
The Quantum Query Complexity of the Determinant Sebastian Dörn Inst. für Theoretische Informatik Universität Ulm 89069 Ulm, Germany Thomas Thierauf Fak. Elektronik und Informatik HTW Aalen 73430 Aalen,
More informationQuantum Counting. 1 Introduction. Gilles Brassard 1, Peter Høyer 2, and Alain Tapp 1
Quantum Counting Gilles Brassard 1, Peter Høyer 2, and Alain Tapp 1 1 Université de Montréal, {brassard,tappa}@iro.umontreal.ca 2 Odense University, u2pi@imada.ou.dk arxiv:quant-ph/9805082v1 27 May 1998
More informationQuantum Algorithms for Graph Traversals and Related Problems
Quantum Algorithms for Graph Traversals and Related Problems Sebastian Dörn Institut für Theoretische Informatik, Universität Ulm, 89069 Ulm, Germany sebastian.doern@uni-ulm.de Abstract. We study the complexity
More informationQuantum complexities of ordered searching, sorting, and element distinctness
Quantum complexities of ordered searching, sorting, and element distinctness Peter Høyer Jan Neerbek Yaoyun Shi September 7, 00 Abstract We consider the quantum complexities of the following three problems:
More informationQuantum Algorithms for Evaluating Min-Max Trees
Quantum Algorithms for Evaluating Min-Max Trees Richard Cleve 1,2,DmitryGavinsky 1, and D. L. Yonge-Mallo 1 1 David R. Cheriton School of Computer Science and Institute for Quantum Computing, University
More informationOptimal quantum adversary lower bounds for ordered search
Optimal quantum adversary lower bounds for ordered search Andrew M. Childs Troy Lee Abstract The goal of the ordered search problem is to find a particular item in an ordered list of n items. Using the
More informationNew Results on Quantum Property Testing
New Results on Quantum Property Testing Sourav Chakraborty 1, Eldar Fischer 2, Arie Matsliah 3, and Ronald de Wolf 3 1 Chennai Mathematical Institute, Chennai, India. sourav@cmi.ac.in 2 Computer Science
More informationThe quantum query complexity of read-many formulas
The quantum query complexity of read-many formulas Andrew Childs Waterloo Shelby Kimmel MIT Robin Kothari Waterloo Boolean formulas ^ x 1 x 2 _ x 3 ^ x 1 x 3 A formula is read-once if every input appears
More informationImproved Quantum Algorithm for Triangle Finding via Combinatorial Arguments
Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments François Le Gall The University of Tokyo Technical version available at arxiv:1407.0085 [quant-ph]. Background. Triangle finding
More informationarxiv:quant-ph/ v2 26 Apr 2007
Every NAND formula of size N can be evaluated in time O(N 1 2 +ε ) on a quantum computer arxiv:quant-ph/0703015v2 26 Apr 2007 Andrew M. Childs amchilds@caltech.edu Robert Špalek spalek@eecs.berkeley.edu
More informationQuantum speedup of backtracking and Monte Carlo algorithms
Quantum speedup of backtracking and Monte Carlo algorithms Ashley Montanaro School of Mathematics, University of Bristol 19 February 2016 arxiv:1504.06987 and arxiv:1509.02374 Proc. R. Soc. A 2015 471
More informationHow Powerful is Adiabatic Quantum Computation?
How Powerful is Adiabatic Quantum Computation? Wim van Dam Michele Mosca Umesh Vazirani Abstract We analyze the computational power limitations of the recently proposed quantum adiabatic evolution algorithm
More informationQuantum Algorithms Lecture #2. Stephen Jordan
Quantum Algorithms Lecture #2 Stephen Jordan Last Time Defined quantum circuit model. Argued it captures all of quantum computation. Developed some building blocks: Gate universality Controlled-unitaries
More informationQuantum computers can search arbitrarily large databases by a single query
Quantum computers can search arbitrarily large databases by a single query Lov K. Grover, 3C-404A Bell Labs, 600 Mountain Avenue, Murray Hill J 07974 (lkgrover@bell-labs.com) Summary This paper shows that
More informationarxiv: v1 [quant-ph] 24 Jul 2015
Quantum Algorithm for Triangle Finding in Sparse Graphs François Le Gall Shogo Nakajima Department of Computer Science Graduate School of Information Science and Technology The University of Tokyo, Japan
More informationOn the solution of trivalent decision problems by quantum state identification
On the solution of trivalent decision problems by quantum state identification Karl Svozil Institut für Theoretische Physik, University of Technology Vienna, Wiedner Hauptstraße 8-10/136, A-1040 Vienna,
More informationA New Lower Bound Technique for Quantum Circuits without Ancillæ
A New Lower Bound Technique for Quantum Circuits without Ancillæ Debajyoti Bera Abstract We present a technique to derive depth lower bounds for quantum circuits. The technique is based on the observation
More informationThe query register and working memory together form the accessible memory, denoted H A. Thus the state of the algorithm is described by a vector
1 Query model In the quantum query model we wish to compute some function f and we access the input through queries. The complexity of f is the number of queries needed to compute f on a worst-case input
More information6.896 Quantum Complexity Theory October 2, Lecture 9
6896 Quantum Complexity heory October, 008 Lecturer: Scott Aaronson Lecture 9 In this class we discuss Grover s search algorithm as well as the BBBV proof that it is optimal 1 Grover s Algorithm 11 Setup
More informationQuantum Property Testing
Quantum Property Testing Harry Buhrman Lance Fortnow Ilan ewman Hein Röhrig ovember 24, 2003 Abstract A language L has a property tester if there exists a probabilistic algorithm that given an input x
More informationQuantum algorithms for testing Boolean functions
Quantum algorithms for testing Boolean functions Dominik F. Floess Erika Andersson SUPA, School of Engineering and Physical Sciences Heriot-Watt University, Edinburgh EH4 4AS, United Kingdom dominikfloess@gmx.de
More informationQuantum Queries for Testing Distributions
Quantum Queries for Testing Distributions Sourav Chakraborty Eldar Fischer Arie Matsliah Ronald de Wolf Abstract We consider probability distributions given in the form of an oracle f : [n] [m] that we
More informationarxiv:quant-ph/ v1 15 Apr 2005
Quantum walks on directed graphs Ashley Montanaro arxiv:quant-ph/0504116v1 15 Apr 2005 February 1, 2008 Abstract We consider the definition of quantum walks on directed graphs. Call a directed graph reversible
More information1 Bernstein-Vazirani Algorithm
CMSC 33001: Novel Computing Architectures and Technologies Lecturer: Yongshan Ding, Pranav Gokhale Scribe: Shankar G. Menon Lecture 08: More on Algorithms November 1, 018 1 Bernstein-Vazirani Algorithm
More informationImproving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision
Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision Stacey Jeffery 1,2, Robin Kothari 1,2, and Frédéric Magniez 3 1 David R. Cheriton School of Computer Science, University
More informationarxiv: v6 [quant-ph] 9 Jul 2014
arxiv:1211.0721v6 [quant-ph] 9 Jul 2014 Superlinear Advantage for Exact Quantum Algorithms Andris Ambainis Faculty of Computing University of Latvia Raiņa bulvāris 19 Rīga, LV-1586, Latvia E-mail: ambainis@lu.lv
More informationPolynomials, quantum query complexity, and Grothendieck s inequality
Polynomials, quantum query complexity, and Grothendieck s inequality Scott Aaronson 1, Andris Ambainis 2, Jānis Iraids 2, Martins Kokainis 2, Juris Smotrovs 2 1 Computer Science and Artificial Intelligence
More informationQuantum Property Testing
Quantum Property Testing Harry Buhrman Lance Fortnow Ilan ewman Hein Röhrig March 24, 2004 Abstract A language L has a property tester if there exists a probabilistic algorithm that given an input x only
More informationDiscrete quantum random walks
Quantum Information and Computation: Report Edin Husić edin.husic@ens-lyon.fr Discrete quantum random walks Abstract In this report, we present the ideas behind the notion of quantum random walks. We further
More informationAn Analog Analogue of a Digital Quantum Computation
An Analog Analogue of a Digital Quantum Computation arxiv:quant-ph/9612026v1 6 Dec 1996 Edard Farhi Center for Theoretical Physics Massachusetts Institute of Technology Cambridge, MA 02139 Sam Gutmann
More informationAn Improved Quantum Fourier Transform Algorithm and Applications
An Improved Quantum Fourier Transform Algorithm and Applications Lisa Hales Group in Logic and the Methodology of Science University of California at Berkeley hales@cs.berkeley.edu Sean Hallgren Ý Computer
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 informationarxiv: v2 [quant-ph] 6 Feb 2018
Quantum Inf Process manuscript No. (will be inserted by the editor) Faster Search by Lackadaisical Quantum Walk Thomas G. Wong Received: date / Accepted: date arxiv:706.06939v2 [quant-ph] 6 Feb 208 Abstract
More informationQuantum Complexity of Testing Group Commutativity
Quantum Complexity of Testing Group Commutativity Frédéric Magniez 1 and Ashwin Nayak 2 1 CNRS LRI, UMR 8623 Université Paris Sud, France 2 University of Waterloo and Perimeter Institute for Theoretical
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 1: Quantum circuits and the abelian QFT
Quantum algorithms (CO 78, Winter 008) Prof. Andrew Childs, University of Waterloo LECTURE : Quantum circuits and the abelian QFT This is a course on quantum algorithms. It is intended for graduate students
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 informationOptimal bounds for quantum bit commitment
Optimal bounds for quantum bit commitment André Chailloux LRI Université Paris-Sud andre.chailloux@gmail.fr Iordanis Kerenidis CNRS - LIAFA Université Paris 7 jkeren@liafa.jussieu.fr 1 Introduction Quantum
More informationExponential algorithmic speedup by quantum walk
Exponential algorithmic speedup by quantum walk Andrew Childs MIT Center for Theoretical Physics joint work with Richard Cleve Enrico Deotto Eddie Farhi Sam Gutmann Dan Spielman quant-ph/0209131 Motivation
More informationGraph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go? Xiaoming Sun Computer Science Department, Tsinghua University, Beijing, 100084, P. R. China. sun xm97@mails.tsinghua.edu.cn
More informationQuantum Lower Bound for Recursive Fourier Sampling
Quantum Lower Bound for Recursive Fourier Sampling Scott Aaronson Institute for Advanced Study, Princeton aaronson@ias.edu Abstract One of the earliest quantum algorithms was discovered by Bernstein and
More informationAn Introduction to Quantum Computation and Quantum Information
An to and Graduate Group in Applied Math University of California, Davis March 13, 009 A bit of history Benioff 198 : First paper published mentioning quantum computing Feynman 198 : Use a quantum computer
More informationQuantum parity algorithms as oracle calls, and application in Grover Database search
Abstract Quantum parity algorithms as oracle calls, and application in Grover Database search M. Z. Rashad Faculty of Computers and Information sciences, Mansoura University, Egypt Magdi_z2011@yahoo.com
More informationA Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity
Electronic Colloquium on Computational Complexity, Report No. 27 (2014) A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity Krišjānis Prūsis and Andris Ambainis
More information6.896 Quantum Complexity Theory September 18, Lecture 5
6.896 Quantum Complexity Theory September 18, 008 Lecturer: Scott Aaronson Lecture 5 Last time we looked at what s known about quantum computation as it relates to classical complexity classes. Today we
More informationQuantum algorithms based on span programs
Quantum algorithms based on span programs Ben Reichardt IQC, U Waterloo [arxiv:0904.2759] Model: Complexity measure: Quantum algorithms Black-box query complexity Span programs Witness size [KW 93] [RŠ
More informationHow behavior of systems with sparse spectrum can be predicted on a quantum computer
How behavior of systems with sparse spectrum can be predicted on a quantum computer arxiv:quant-ph/0004021v2 26 Jun 2000 Yuri Ozhigov Abstract Call a spectrum of Hamiltonian sparse if each eigenvalue can
More informationQuantum Query Algorithm Constructions for Computing AND, OR and MAJORITY Boolean Functions
LATVIJAS UNIVERSITĀTES RAKSTI. 008, 733. sēj.: DATORZINĀTNE UN INFORMĀCIJAS TEHNOLOĢIJAS 15. 38. lpp. Quantum Query Algorithm Constructions for Computing AND, OR and MAJORITY Boolean Functions Alina Vasiljeva
More informationQUANTUM COMMUNICATIONS BASED ON QUANTUM HASHING. Alexander Vasiliev. Kazan Federal University
QUANTUM COMMUNICATIONS BASED ON QUANTUM HASHING Alexander Vasiliev Kazan Federal University Abstract: In this paper we consider an application of the recently proposed quantum hashing technique for computing
More informationarxiv:quant-ph/ v2 15 Nov 1998
The quantum query complexity of approximating the median and related statistics Ashwin Nayak Felix Wu arxiv:quant-ph/9804066v2 15 Nov 1998 Abstract Let X = (x 0,...,x n 1 ) be a sequence of n numbers.
More informationC/CS/Phys C191 Grover s Quantum Search Algorithm 11/06/07 Fall 2007 Lecture 21
C/CS/Phys C191 Grover s Quantum Search Algorithm 11/06/07 Fall 2007 Lecture 21 1 Readings Benenti et al, Ch 310 Stolze and Suter, Quantum Computing, Ch 84 ielsen and Chuang, Quantum Computation and Quantum
More informationQuantum Computation, NP-Completeness and physical reality [1] [2] [3]
Quantum Computation, NP-Completeness and physical reality [1] [2] [3] Compiled by Saman Zarandioon samanz@rutgers.edu 1 Introduction The NP versus P question is one of the most fundamental questions in
More informationarxiv: v1 [cs.cc] 31 May 2014
Size of Sets with Small Sensitivity: a Generalization of Simon s Lemma Andris Ambainis and Jevgēnijs Vihrovs arxiv:1406.0073v1 [cs.cc] 31 May 2014 Faculty of Computing, University of Latvia, Raiņa bulv.
More informationSearch via Quantum Walk
Search via Quantum Walk Frédéric Magniez Ashwin Nayak Jérémie Roland Miklos Santha Abstract We propose a new method for designing quantum search algorithms for finding a marked element in the state space
More informationA fast quantum mechanical algorithm for estimating the median
A fast quantum mechanical algorithm for estimating the median Lov K Grover 3C-404A Bell Labs 600 Mountain Avenue Murray Hill J 07974 lkg@mhcnetattcom Summary Consider the problem of estimating the median
More informationZero-Knowledge Against Quantum Attacks
Zero-Knowledge Against Quantum Attacks John Watrous Department of Computer Science University of Calgary January 16, 2006 John Watrous (University of Calgary) Zero-Knowledge Against Quantum Attacks QIP
More informationLecture 12: Lower Bounds for Element-Distinctness and Collision
Quantum Computation (CMU 18-859BB, Fall 015) Lecture 1: Lower Bounds for Element-Distinctness and Collision October 19, 015 Lecturer: John Wright Scribe: Titouan Rigoudy 1 Outline In this lecture, we will:
More informationSpeedup of Iterated Quantum Search by Parallel Performance
Speedup of Iterated Quantum Search by Parallel Performance Yuri Ozhigov Department of Applied Mathematics, Moscow State University of Technology Stankin, Vadkovsky per. 3a, 101472, Moscow, Russia Given
More informationQuantum walk algorithms
Quantum walk algorithms Andrew Childs Institute for Quantum Computing University of Waterloo 28 September 2011 Randomized algorithms Randomness is an important tool in computer science Black-box problems
More informationQuantum Symmetrically-Private Information Retrieval
Quantum Symmetrically-Private Information Retrieval Iordanis Kerenidis UC Berkeley jkeren@cs.berkeley.edu Ronald de Wolf CWI Amsterdam rdewolf@cwi.nl arxiv:quant-ph/0307076v 0 Jul 003 Abstract Private
More informationQuantum Computing Lecture Notes, Extra Chapter. Hidden Subgroup Problem
Quantum Computing Lecture Notes, Extra Chapter Hidden Subgroup Problem Ronald de Wolf 1 Hidden Subgroup Problem 1.1 Group theory reminder A group G consists of a set of elements (which is usually denoted
More informationLower Bounds of Quantum Search for Extreme Point
arxiv:quant-ph/9806001v3 18 Dec 1998 Lower Bounds of Quantum Search for Extreme Point Yuri Ozhigov Abstract We show that Durr-Hoyer s quantum algorithm of searching for extreme point of integer function
More informationNumerical Analysis on a Quantum Computer
Numerical Analysis on a Quantum Computer Stefan Heinrich Fachbereich Informatik Universität Kaiserslautern D-67653 Kaiserslautern, Germany heinrich@informatik.uni-kl.de http://www.uni-kl.de/ag-heinrich
More informationSubstituting a qubit for an arbitrarily large amount of classical communication
Substituting a qubit for an arbitrarily large amount of classical communication Ernesto F. Galvão and Lucien Hardy Centre for Quantum Computation, Clarendon Laboratory, University of Oxford, Parks Road,
More informationarxiv:quant-ph/ v1 23 Dec 2001
From Monte Carlo to Quantum Computation Stefan Heinrich arxiv:quant-ph/0112152v1 23 Dec 2001 Abstract Fachbereich Informatik Universität Kaiserslautern D-67653 Kaiserslautern, Germany e-mail: heinrich@informatik.uni-kl.de
More informationQuantum search in a four-complex-dimensional subspace
Quantum search in a four-complex-dimensional subspace Wenliang Jin July 24, 2013 Abstract For there to be M > 1 target items to be searched in an unsorted database of size N, with M/N 1 for a sufficiently
More informationarxiv: v3 [quant-ph] 3 Jul 2012
MIT-CTP 4242 Super-Polynomial Quantum Speed-ups for Boolean Evaluation Trees with Hidden Structure Bohua Zhan Shelby Kimmel Avinatan Hassidim November 2, 2018 arxiv:1101.0796v3 [quant-ph] 3 Jul 2012 Abstract
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 informationQuantum algorithms for hidden nonlinear structures
Quantum algorithms for hidden nonlinear structures Andrew Childs Waterloo Leonard Schulman Caltech Umesh Vazirani Berkeley Shor s algorithm finds hidden linear structures [Shor 94]: Efficient quantum algorithms
More informationExtended Superposed Quantum State Initialization Using Disjoint Prime Implicants
Extended Superposed Quantum State Initialization Using Disjoint Prime Implicants David Rosenbaum, Marek Perkowski Portland State University, Department of Computer Science Portland State University, Department
More informationImpossibility of a Quantum Speed-up with a Faulty Oracle
Imossibility of a Quantum Seed-u with a Faulty Oracle Oded Regev Liron Schiff Abstract We consider Grover s unstructured search roblem in the setting where each oracle call has some small robability of
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 informationLecture 10: Eigenvalue Estimation
CS 880: Quantum Information Processing 9/7/010 Lecture 10: Eigenvalue Estimation Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený Last time we discussed the quantum Fourier transform, and introduced
More informationQuantum algorithms for testing properties of distributions
Quantum algorithms for testing properties of distributions Sergey Bravyi, Aram W. Harrow, and Avinatan Hassidim July 8, 2009 Abstract Suppose one has access to oracles generating samples from two unknown
More informationarxiv: v3 [quant-ph] 29 Oct 2009
Efficient quantum circuit implementation of quantum walks B L Douglas and J B Wang School of Physics, The University of Western Australia, 6009, Perth, Australia arxiv:07060304v3 [quant-ph] 29 Oct 2009
More informationQuantum Mechanics & Quantum Computation
Quantum Mechanics & Quantum Computation Umesh V. Vazirani University of California, Berkeley Lecture 16: Adiabatic Quantum Optimization Intro http://www.scottaaronson.com/blog/?p=1400 Testing a quantum
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 informationarxiv:quant-ph/ v1 28 Jan 2000
Quantum Computation by Adiabatic Evolution Edward Farhi, Jeffrey Goldstone Center for Theoretical Physics Massachusetts Institute of Technology Cambridge, MA 039 arxiv:quant-ph/00006 v 8 Jan 000 Sam Gutmann
More informationQuantum Hashing for Finite Abelian Groups arxiv: v1 [quant-ph] 7 Mar 2016
Quantum Hashing for Finite Abelian Groups arxiv:1603.02209v1 [quant-ph] 7 Mar 2016 Alexander Vasiliev Abstract We propose a generalization of the quantum hashing technique based on the notion of the small-bias
More informationQuantum query complexity of entropy estimation
Quantum query complexity of entropy estimation Xiaodi Wu QuICS, University of Maryland MSR Redmond, July 19th, 2017 J o i n t C e n t e r f o r Quantum Information and Computer Science Outline Motivation
More informationarxiv: v1 [quant-ph] 21 Jun 2011
arxiv:1106.4267v1 [quant-ph] 21 Jun 2011 An optimal quantum algorithm to approximate the mean and its application for approximating the median of a set of points over an arbitrary distance Gilles Brassard,
More informationLower Bounds for Testing Bipartiteness in Dense Graphs
Lower Bounds for Testing Bipartiteness in Dense Graphs Andrej Bogdanov Luca Trevisan Abstract We consider the problem of testing bipartiteness in the adjacency matrix model. The best known algorithm, due
More informationRATIONAL APPROXIMATIONS AND QUANTUM ALGORITHMS WITH POSTSELECTION
Quantum Information and Computation, Vol. 15, No. 3&4 (015) 095 0307 c Rinton Press RATIONAL APPROXIMATIONS AND QUANTUM ALGORITHMS WITH POSTSELECTION URMILA MAHADEV University of California, Berkeley,
More informationIntroduction The Search Algorithm Grovers Algorithm References. Grovers Algorithm. Quantum Parallelism. Joseph Spring.
Quantum Parallelism Applications Outline 1 2 One or Two Points 3 4 Quantum Parallelism We have discussed the concept of quantum parallelism and now consider a range of applications. These will include:
More informationProofs Not Based On POMI
s Not Based On POMI James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University February 12, 2018 Outline 1 Non POMI Based s 2 Some Contradiction s 3
More informationQuantum Searching. Robert-Jan Slager and Thomas Beuman. 24 november 2009
Quantum Searching Robert-Jan Slager and Thomas Beuman 24 november 2009 1 Introduction Quantum computers promise a significant speed-up over classical computers, since calculations can be done simultaneously.
More informationarxiv:quant-ph/ v1 18 Nov 2004
Improved Bounds on Quantum Learning Algorithms arxiv:quant-ph/0411140v1 18 Nov 2004 Alp Atıcı Department of Mathematics Columbia University New York, NY 10027 atici@math.columbia.edu March 13, 2008 Abstract
More informationIntroduction to Quantum Information Processing
Introduction to Quantum Information Processing Lecture 6 Richard Cleve Overview of Lecture 6 Continuation of teleportation Computation and some basic complexity classes Simple quantum algorithms in the
More informationImplementing Competitive Learning in a Quantum System
Implementing Competitive Learning in a Quantum System Dan Ventura fonix corporation dventura@fonix.com http://axon.cs.byu.edu/dan Abstract Ideas from quantum computation are applied to the field of neural
More informationQuantum Algorithms for Computing the Boolean Function AND and Verifying Repetition Code
Scientific Papers, University of Latvia, 2010 Vol 756 Computer Science and Information echnologies 227 247 P Quantum Algorithms for Computing the Boolean Function AND and Verifying Repetition Code Alina
More informationAn approach from classical information theory to lower bounds for smooth codes
An approach from classical information theory to lower bounds for smooth codes Abstract Let C : {0, 1} n {0, 1} m be a code encoding an n-bit string into an m-bit string. Such a code is called a (q, c,
More informationSPECTRAL THEOREM FOR COMPACT SELF-ADJOINT OPERATORS
SPECTRAL THEOREM FOR COMPACT SELF-ADJOINT OPERATORS G. RAMESH Contents Introduction 1 1. Bounded Operators 1 1.3. Examples 3 2. Compact Operators 5 2.1. Properties 6 3. The Spectral Theorem 9 3.3. Self-adjoint
More informationQUANTUM FINITE AUTOMATA. Andris Ambainis 1 1 Faculty of Computing, University of Latvia,
QUANTUM FINITE AUTOMATA Andris Ambainis 1 1 Faculty of Computing, University of Latvia, Raiņa bulv. 19, Rīga, LV-1586, Latvia. Email: ambainis@lu.lv Abstract Quantum finite automata (QFAs) are quantum
More information