首页/论文/quant-ph/9605034

arXiv quant-ph/96050341996-05-23quant-ph

Tight bounds on quantum searching

Michel Boyer, Gilles Brassard, Peter Hoeyer, Alain Tapp

备注：: 8 pages, LaTeX2e, PhysComp 96 submission
发表信息：: Fortsch.Phys.46:493-506,1998
DOI：: 10.1002/(SICI)1521-3978(199806)46:4/5<493::AID-PROP493>3.0.CO;2-P

英文摘要：

We provide a tight analysis of Grover's recent algorithm for quantum database searching. We give a simple closed-form formula for the probability of success after any given number of iterations of the algorithm. This allows us to determine the number of iterations necessary to achieve almost certainty of finding the answer. Furthermore, we analyse the behaviour of the algorithm when the element to be found appears more than once in the table and we provide a new algorithm to find such an element even when the number of solutions is not known ahead of time. Using techniques from Shor's quantum factoring algorithm in addition to Grover's approach, we introduce a new technique for approximate quantum counting, which allows to estimate the number of solutions. Finally we provide a lower bound on the efficiency of any possible quantum database searching algorithm and we show that Grover's algorithm nearly comes within a factor 2 of being optimal in terms of the number of probes required in the table.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Grover's quantum searching algorithm is optimal

I improve the tight bound on quantum searching by Boyer et al. (quant-ph/9605034) to a matching bound, thus showing that for any probability of success Grovers quantum searching algorithm is optimal. E.g. for near certain success we have to query the oracle pi/4 sqrt{N} times, where N is the size of the search space. I also show that unfortunately quantum searching cannot be parallelized better than by assigning different parts of the search space to independent quantum computers. Earlier results left open the possibility of a more efficient parallelization.

1999-12-02quant-ph

Bounds on quantum ordered searching

We prove that any exact quantum algorithm searching an ordered list of N elements requires more than \frac{1}π(\ln(N)-1) queries to the list. This improves upon the previously best known lower bound of {1/12}\log_2(N) - O(1). Our proof is based on a weighted all-pairs inner product argument, and it generalizes to bounded-error quantum algorithms. The currently best known upper bound for exact searching is roughly 0.526 \log_2(N). We give an exact quantum algorithm that uses \log_3(N) + O(1) queries, which is roughly 0.631 \log_2(N). The main principles in our algorithm are an quantum parallel …

2001-04-27quant-ph

On the Complexity of Searching Maximum of a Function on a Quantum Computer

We deal with a problem of finding maximum of a function from the Holder class on a quantum computer. We show matching lower and upper bounds on the complexity of this problem. We prove upper bounds by constructing an algorithm that uses the algorithm for finding maximum of a discrete sequence. To prove lower bounds we use results for finding logical OR of sequence of bits. We show that quantum computation yields a quadratic speed-up over deterministic and randomized algorithms.

2005-10-13quant-ph

Speed-up and entanglement in quantum searching

We investigate the issue of speed-up and the necessity of entanglement in Grover's quantum search algorithm. We find that in a pure state implementation of Grover's algorithm entanglement is present even though the initial and target states are product states. In pseudo-pure state implementations, the separability of the states involved defines an entanglement boundary in terms of a bound on the purity parameter. Using this bound we investigate the necessity of entanglement in quantum searching for these pseudo-pure state implementations. If every active molecule involved in the ensemble is `c…

2002-07-17quant-ph

Quantum complexities of ordered searching, sorting, and element distinctness

We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all distinct. Letting N be the number of elements in the input list, we prove a lower bound of \frac{1}π(\ln(N)-1) accesses to the list elements for ordered searching, a lower bound of Ω(N\log{N}) binary comparisons for sorting, and a lower bound of Ω(\sqrt{N}\log{N}) binary comparisons for element distinctness. The previously best known lower bounds are {1/12}\log_2(N) - O(1) due to Ambainis, Ω(N), and Ω(\sqrt{N}), respecti…

2001-04-27quant-ph

A better lower bound for quantum algorithms searching an ordered list

We show that any quantum algorithm searching an ordered list of n elements needs to examine at least 1/12 log n-O(1) of them. Classically, log 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/9811046) and Farhi, Goldstone, Gutmann and Sipser (quant-ph/9812057).

1999-02-14cs.CCcs.DSquant-ph

更多相关论文收起更多论文

Obtaining tight bounds on higher-order interferences with a 5-path interferometer

Within the established theoretical framework of quantum mechanics, interference always occurs between pairs of trajectories. Higher order interferences with multiple constituents are, however, excluded by Born's rule and can only exist in generalized probabilistic theories. Thus, high-precision experiments searching for such higher order interferences are a powerful method to distinguish between quantum mechanics and more general theories. Here, we perform such a test in optical multi-path interferometers. Our results rule out the existence of higher order interference terms to an extent which…

2016-07-22physics.opticsquant-ph

Searching for new particles beyond the standard model with a single electron-spin quantum sensor

Searching for new particles beyond the standard model is crucial for understanding several fundamental conundrums in physics and astrophysics. Amongst them, axions or similar hypothetical pseudoscalar bosons would mediate electron-nucleon interactions. While previous experiments set stringent upper bounds of this interaction strength with force range over $20 ~μ$m, experimental searching at shorter force range remains elusive. We develop a method that utilizes a near-surface Nitrogen-vacancy center as a quantum sensor to explore such interaction. New constraints for axion-mediated electron-nuc…

2017-06-12quant-ph

Quantum searching's underlying SU(2) structure and its quantum decoherence effects

The search operation for a marked state by means of Grover's quantum searching algorithm is shown to be an element of group SU(2) which acts on a 2-dimensional space spanned by the marked state and the unmarked collective state. Based on this underlying structure, those exact bounds of the steps in various quantum search algorithms are obtained in a quite concise way. This reformulation of the quantum searching algorithm also enables a detailed analysis of the decoherence effects caused by its coupling with an environment. It turns out that the environment will not only make the quantum search…

1999-03-23quant-ph

Tight Bounds for the Entanglement of Formation of Gaussian States

We establish tight upper and lower bounds for the Entanglement of Formation of an arbitrary two-mode Gaussian state employing necessary properties of Gaussian channels. Both bounds are strictly given by the Entanglement of Formation of symmetric Gaussian states, which are simply constructed from the reduced states obtained by partial trace of the original one.

2014-01-31quant-ph

Tight bound on coherent states quantum key distribution with heterodyne detection

We propose a new upper bound for the eavesdropper's information in the direct and reverse reconciliated coherent states quantum key distribution protocols with heterodyne detection. This bound is derived by maximizing the leaked information over the symplectic group of transformations that spans every physical Gaussian attack on individual pulses. We exhibit four different attacks that reach this bound, which shows that this bound is tight. Finally, we compare the secret key rate obtained with this new bound to the homodyne rate.

2007-04-11quant-ph

A tight Cramér-Rao bound for joint parameter estimation with a pure two-mode squeezed probe

We calculate the Holevo Cramér-Rao bound for estimation of the displacement experienced by one mode of an two-mode squeezed vacuum state with squeezing r and find that it is equal to 4exp(-2r). This equals the sum of the mean squared error obtained from a dual homodyne measurement, indicating that the bound is tight and that the dual homodyne measurement is optimal.

2019-01-15quant-ph

On Searching for Small Kochen-Specker Vector Systems (extended version)

Kochen-Specker (KS) vector systems are sets of vectors in R^3 with the property that it is impossible to assign 0s and 1s to the vectors in such a way that no two orthogonal vectors are assigned 0 and no three mutually orthogonal vectors are assigned 1. The existence of such sets forms the basis of the Kochen-Specker and Free Will theorems. Currently, the smallest known KS vector system contains 31 vectors. In this paper, we establish a lower bound of 18 on the size of any KS vector system. This requires us to consider a mix of graph-theoretic and topological embedding problems, which we inves…

2011-11-14quant-ph

用于寻找最长线段和最大空矩形的量子算法

Quantum Algorithm for Searching for the Longest Segment and the Largest Empty Rectangle

本文提出了一种量子算法，用于在2D地图中寻找最大空矩形和最大空线段，实现了二次加速。

2025-12-03cs.DSquant-ph

Lower bounds for predecessor searching in the cell probe model

We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form "What is the predecessor of x in S?" can be answered efficiently. We study this problem in the cell probe model introduced by Yao. Recently, Beame and Fich obtained optimal bounds on the number of probes needed by any deterministic query scheme if the associated storage scheme uses only n^{O(1)} cells of word size (\log m)^{O(1)} bits. We give a new lower bound proof for this problem that matches the bounds of Beame and Fich. …

2003-09-17cs.CCcs.DSquant-ph

A Tight Bound of Tail Probabilities for a Discrete-time Martingale with Uniformly Bounded Jumps

We investigate the properties of a discrete-time martingale $\{X_m\}_{m\in \mathbb Z_{\geq 0}}$, where all differences between adjacent random variables are limited to be not more than a constant as a promise. In this situation, it is known that the Azuma-Hoeffding inequality holds, which gives an upper bound of a probability for exceptional events. The inequality gives a simple form of the upper bound, and it has been utilized for many investigations. However, the inequality is not tight. We give an explicit expression of a tight upper bound, and we show that it and the bound obtained from th…

2019-05-15math.PRquant-ph

Tight upper and lower bounds to the eigenvalues and critical parameters of a double well

By means of a suitable rational approximation to the logarithmic derivative of the wavefunction we obtain tight upper and lower bounds to the eigenvalues and critical parameters of the quartic double-well potential.

2016-07-13math-phmath.MPquant-ph

A Tight Uniform Continuity Bound for Equivocation

We prove a tight uniform continuity bound for the conditional Shannon entropy of discrete finitely supported random variables in terms of total variation distance.

2020-07-14cs.ITmath.ITquant-ph