Related papers: Quantum circuit implementation of the Hamiltonian …
Grover's algorithm is one of the most important quantum algorithms, which performs the task of searching an unsorted database without a priori probability. Recently the adiabatic evolution has been used to design and reproduce quantum…
Quantum algorithm, as compared to classical algorithm, plays a notable role in solving linear systems of equations with an exponential speedup. Here, we demonstrate a method for solving a particular system of equations by using the concept…
The adiabatic theorem has been recently used to design quantum algorithms of a new kind, where the quantum computer evolves slowly enough so that it remains near its instantaneous ground state which tends to the solution [Farhi et al.,…
We propose a quantum algorithm for solving combinatorial search problems that uses only a sequence of measurements. The algorithm is similar in spirit to quantum computation by adiabatic evolution, in that the goal is to remain in the…
Given a parameterized quantum circuit such that a certain setting of these real-valued parameters corresponds to Grover's celebrated search algorithm, can a variational algorithm recover these settings and hence learn Grover's algorithm? We…
Grover's quantum search algorithm drives a quantum computer from a prepared initial state to a desired final state by using selective transformations of these states. Here, we analyze a framework when one of the selective trasformations is…
Quantum hardware continues to advance, yet finding new quantum algorithms - quantum software - remains a challenge, with classically trained computer programmers having little intuition of how computational tasks may be performed in the…
Grover's search algorithm was originally proposed for circuit-based quantum computers. A crucial part of it is to query an oracle -- a black-box unitary operation. Generation of this oracle is formally beyond the original algorithm design.…
Search is one of the most commonly used primitives in quantum algorithm design. It is known that quadratic speedups provided by Grover's algorithm are optimal, and no faster quantum algorithms for Search exist. While it is known that at…
Quantum adiabatic algorithm is a method of solving computational problems by evolving the ground state of a slowly varying Hamiltonian. The technique uses evolution of the ground state of a slowly varying Hamiltonian to reach the required…
We review some of quantum algorithms for search problems: Grover's search algorithm, its generalization to amplitude amplification, the applications of amplitude amplification to various problems and the recent quantum algorithms based on…
We present a continuous time quantum search algorithm analogous to Grover's. In particular, the optimal search time for this algorithm is proportional to $\sqrt{N}$, where $N$ is the database size. This search algorithm can be implemented…
A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum…
Recent studies have been spurred on by the promise of advanced quantum computing technology, which has led to the development of quantum computer simulations on classical hardware. Grover's quantum search algorithm is one of the well-known…
Grover's unstructured search algorithm is one of the best examples to date for the superiority of quantum algorithms over classical ones. Its applicability, however, has been questioned by many due to its oracular nature. We propose a…
We apply a hybrid evolutionary algorithm to minimize the depth of circuits in quantum computing. More specifically, we evaluate two different variants of the algorithm. In the first approach, we combine the evolutionary algorithm with an…
We construct a completely analog framework that emulates universal quantum gates and quantum algorithms. It is based on electronic circuits made of operational amplifiers, resistors and capacitors. In these circuits, input and output lines…
This paper presented two general quantum search algorithms. We derived the iterated formulas and the simpler approximate formulas and the precise formula for the amplitude in the desired state. A mathematical proof of Grover's algorithm…
We recast Grover's generalised search algorithm in a geometric language even when the states are not approximately orthogonal. We provide a possible search algorithm based on an arbitrary unitary transformation which can speed up the steps…
We introduce an iterative method to search for time-optimal Hamiltonians that drive a quantum system between two arbitrary, and in general mixed, quantum states. The method is based on the idea of progressively improving the efficiency of…