An information-theoretic analysis of Grover’s algorithm
نویسنده
چکیده
Grover discovered a quantum algorithm for identifying a target element in an unstructured search universe of N items in approximately π/4 √ N queries to a quantum oracle. For classical search using a classical oracle, the search complexity is of order N/2 queries since on average half of the items must be searched. In work preceding Grover’s, Bennett et al. had shown that no quantum algorithm can solve the search problem in fewer than O( √ N) queries. Thus, Grover’s algorithm has optimal order of complexity. Here, we present an information-theoretic analysis of Grover’s algorithm and show that the square-root speed-up by Grover’s algorithm is the best possible by any algorithm using the same quantum oracle.
منابع مشابه
NGTSOM: A Novel Data Clustering Algorithm Based on Game Theoretic and Self- Organizing Map
Identifying clusters is an important aspect of data analysis. This paper proposes a noveldata clustering algorithm to increase the clustering accuracy. A novel game theoretic self-organizingmap (NGTSOM ) and neural gas (NG) are used in combination with Competitive Hebbian Learning(CHL) to improve the quality of the map and provide a better vector quantization (VQ) for clusteringdata. Different ...
متن کاملQuantum Computing: A Distributed Approach
Quantum Computation literature, though bursting with interesting paradigms and problems, is still in its nascent phase and a careful focus is necessary on scaling the problem size so that an efficient physical realization is possible. In this work, we explore potential improvement in the run-time of quantum algorithms. Our proposed scheme of distributed quantum computing environment overcomes t...
متن کاملQuantum Distributed Computing Applied to Grover's Search Algorithm
Grover’s Algorithm finds a unique element in an unsorted stock of N -elements in √ N queries through quantum search. A singlequery solution can also be designed, but with an overhead of N log2 N steps to prepare and post process the query, which is worse than the classical N/2 queries. We show here that by distributing the computing load on a set of quantum computers, we achieve better informat...
متن کاملA Family of Grover’s Quantum Searching Algorithms
We introduce the concepts of Grover operators and Grover kernels to systematically analyse Grover’s searching algorithms. Then, we investigate a one-parameter family of quantum searching algorithms of Grover’s type and we show that the standard Grover’s algorithm is a distinguished member of this family. We show that all the algorithms of this class solve the searching problem with an efficienc...
متن کاملCombination of real options and game-theoretic approach in investment analysis
Investments in technology create a large amount of capital investments by major companies. Assessing such investment projects is identified as critical to the efficient assignment of resources. Viewing investment projects as real options, this paper expands a method for assessing technology investment decisions in the linkage existence of uncertainty and competition. It combines the game-theore...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008