Related papers: Space Searches with a Quantum Robot
Local search algorithms use the neighborhood relations among search states and often perform well for a variety of NP-hard combinatorial search problems. This paper shows how quantum computers can also use these neighborhood relations. An…
In this work I describe a classical analog of Grover's quantum searching algorithm, explaining why a quantum algorithm should be able to perform search in O(sqrtN) steps and also acting as a useful pedagogic demonstration.
Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel…
This paper shows that a quantum mechanical algorithm that can query information relating to multiple items of the database, can search a database in a single query (a query is defined as any question to the database to which the database…
The theory of decoherent histories is an attempt to derive classical physics from positing only quantum laws at the fundamental level without notions of a classical apparatus or collapse of the wave-function. Searching for a marked target…
These notes discuss the quantum algorithms we know of that can solve problems significantly faster than the corresponding classical algorithms. So far, we have only discovered a few techniques which can produce speed up versus classical…
The logic which describes quantum robots is not orthodox quantum logic, but a deductive calculus which reproduces the quantum tasks (computational processes, and actions) taking into account quantum superposition and quantum entanglement. A…
We discuss the quantum search algorithm using complex queries that has recently been published by Grover (quant-ph/9706005). We recall the algorithm adding some details showing which complex query has to be evaluated. Based on this version…
Quantum algorithms have demonstrated provable speedups over classical counterparts, yet establishing a comprehensive theoretical framework to understand the quantum advantage remains a core challenge. In this work, we decode the quantum…
Generic quantum search algorithm searches for target entity in an unsorted database by repeatedly applying canonical Grover's quantum rotation transform to reach near the vicinity of the target entity represented by a basis state in the…
In this letter we introduce the concept of a driven quantum walk. This work is motivated by recent theoretical and experimental progress that combines quantum walks and parametric down- conversion, leading to fundamentally different…
Grover's search algorithm is designed to be executed on a quantum mechanical computer. In this paper, the probabilistic wp-calculus is used to model and reason about Grover's algorithm. It is demonstrated that the calculus provides a…
The paper considers the problem of finding a given substring in a text. It is known that the complexity of a classical search query in an unordered database is linear in the length of the text and a given substring. At the same time,…
Quantum partial search algorithm is approximate search. It aims to find a target block (which has the target items). It runs a little faster than full Grover search. In this paper, we consider quantum partial search algorithm for multiple…
We describe a simulation method for a quantum spin model of a generic, general purpose quantum computer. The use of this quantum computer simulator is illustrated through several implementations of Grover's database search algorithm. Some…
Quantum walks are widely and successfully used to model diverse physical processes. This leads to computation of the models, to explore their properties. Quantum walks have also been shown to be universal for quantum computing. This is a…
Quantum computer is the key to controlling complex processes. If its hardware, in general is successfully created on the basis of the physical baggage of the 20th century, the mathematical software is fundamentally lagging behind. Feynman's…
We assess the potential of quantum computing to accelerate computation of central tasks in genomics, focusing on often-neglected theoretical limitations. We discuss state-of-the-art challenges of quantum search, optimization, and machine…
Machine learning, a branch of artificial intelligence, learns from previous experience to optimize performance, which is ubiquitous in various fields such as computer sciences, financial analysis, robotics, and bioinformatics. A challenge…
Quantum algorithms are conventionally formulated for implementation on a single system of qubits amenable to projective measurements. However, in expectation value quantum computation, such as nuclear magnetic resonance realizations, the…