Related papers: Partial oracles quantum algorithm framework -- Par…
The simplest technique for simulating a quantum algorithm - QA described based on the direct matrix representation of the quantum operators. Using this approach, it is relatively simple to simulate the operation of a QA and to perform…
We introduce a novel deterministic quantum search algorithm that provides a practical alternative to conventional probabilistic search approaches. Our scheme eliminates the inherent uncertainty of quantum search without relying on arbitrary…
This paper initiates a systematic study of quantum functions, which are (partial) functions defined in terms of quantum mechanical computations. Of all quantum functions, we focus on resource-bounded quantum functions whose inputs are…
When are two algorithms the same? How can we be sure a recently proposed algorithm is novel, and not a minor twist on an existing method? In this paper, we present a framework for reasoning about equivalence between a broad class of…
Quantum computation, in particular Grover's algorithm, has aroused a great deal of interest since it allows for a quadratic speedup to be obtained in search procedures. Classical search procedures for an $N$ element database require at most…
In a fundamental paper [Phys. Rev. Lett. 78, 325 (1997)] Grover showed how a quantum computer can find a single marked object in a database of size N by using only O(N^{1/2}) queries of the oracle that identifies the object. His result was…
We present a new method to perform variation after projection in many-body systems on quantum computers that does not require performing explicit projection. The technique employs the notion of ``oracle'', generally used in quantum search…
One of the significant breakthroughs in quantum computation is Grover's algorithm for unsorted database search. Recently, the applications of Grover's algorithm to solve global optimization problems have been demonstrated, where unknown…
Reinforcement learning (RL) provides a principled framework for decision-making in partially observable environments, which can be modeled as Markov decision processes and compactly represented through dynamic decision Bayesian networks.…
This paper considers the quantum query complexity of {\it $\eps$-biased oracles} that return the correct value with probability only $1/2 + \eps$. In particular, we show a quantum algorithm to compute $N$-bit OR functions with…
Optimizing high-degree of freedom robotic manipulators requires searching complex, high-dimensional configuration spaces, a task that is computationally challenging for classical methods. This paper introduces a quantum native framework…
Algorithms with unitary oracles can be nested, which makes them extremely versatile. An example is the phase estimation algorithm used in many candidate algorithms for quantum speed-up. The search for new quantum algorithms benefits from…
This paper describes a novel approach to solving unstructured search problems using a classical, signal-based emulation of a quantum computer. The classical nature of the representation allows one to perform subspace projections in addition…
A randomly walking quantum particle searches in Grover's $\Theta(\sqrt{N})$ iterations for a marked vertex on the complete graph of $N$ vertices by repeatedly querying an oracle that flips the amplitude at the marked vertex, scattering by a…
The reciprocal function, 1/x, is important for many real-time algorithms. It is used in a large variety of algorithms from areas ranging from iterative estimation to machine learning. Many of these algorithms are iterative in nature and…
A quantum algorithm for combinatorial search is presented that provides a simple framework for utilizing search heuristics. The algorithm is evaluated in a new case that is an unstructured version of the graph coloring problem. It performs…
The search problem is to find a state satisfying certain properties out of a given set. Grover's algorithm drives a quantum computer from a prepared initial state to the target state and solves the problem quadratically faster than a…
Using Grover algorithm, this work investigates a technique for encoding search phrases used in wildcard searches. The technique involves creating a phase Oracle that loads data into a quantum circuit together with the search terms that have…
In a previous paper [quant-ph/0408045] we described a quantum algorithm to prepare an arbitrary state of a quantum register with arbitrary fidelity. Here we present an alternative algorithm which uses a small number of quantum oracles…
This paper employs a powerful argument, called an algorithmic argument, to prove lower bounds of the quantum query complexity of a multiple-block ordered search problem in which, given a block number i, we are to find a location of a target…