Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0309201

Local adiabatic quantum search with different paths

Recep Eryiğit, Y. Gündüç, Resul Eryiğit

Published Sep 28, 2003• 3 citations
arXivHTMLPDF

Abstract

We report on a detailed analysis of generalization of the local adiabatic search algorithm. Instead of evolving directly from an initial ground state Hamiltonian to a solution Hamiltonian a different evolution path is introduced and is shown that the time required to find an item in a database of size $N$ can be made to be independent of the size of the database by modifying the Hamiltonian used to evolve the system.

DOI
10.48550/arxiv.quant-ph/0309201

Related papers

Quantum search by local adiabatic evolution

Jérémie Roland, Nicolas J. Cerf

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. We apply this time-dependent Hamiltonian approach to Grover's problem, i.e., searching a marked item in an unstructured database. We find that by adjusting the evolution rate of the Hamiltonian so as to keep the evolution adiabatic on each infinitesimal time interval, the total running time is of order $\sqrt{N},$ where N is the number of items in the database. We thus recover the advantage of Grover's standard algorithm as compared to a classical search, scaling as N. This is in contrast with the constant-rate adiabatic approach of Farhi et al. (e-print quant-ph/0001106), where the requirement of adiabaticity is expressed only globally, resulting in a time of order N.

arXiv:quant-ph/0107015•Physical Review A•Mar 26, 2002•629 citations

Partial evolution based local adiabatic quantum search

Jie Sun, Songfeng Lu, Fang Liu +1 more

Recently, Zhang and Lu provided a quantum search algorithm based on partial adiabatic evolution, which beats the time bound of local adiabatic search when the number of marked items in the unsorted database is larger than one. Later, they found that the above two adiabatic search algorithms had the same time complexity when there is only one marked item in the database. In the present paper, following the idea of Roland and Cerf [Roland J and Cerf N J 2002 Phys. Rev. A 65 042308 ], if within the small symmetric evolution interval defined by Zhang et al., a local adiabatic evolution is performed instead of the original "global" one, this "new" algorithm exhibits slightly better performance, although they are progressively equivalent with M increasing. In addition, the proof of the optimality for this partial evolution based local adiabatic search when M = 1 is also presented. Two other special cases of the adiabatic algorithm obtained by appropriately tuning the evolution interval of partial adiabatic evolution based quantum search, which are found to have the same phenomenon above, are also discussed.

Chinese Physics B•Jan 1, 2012•12 citations

Quantum Adiabatic Evolution Algorithms with Different Paths

Edward Farhi, Jeffrey Goldstone, Sam Gutmann

In quantum adiabatic evolution algorithms, the quantum computer follows the ground state of a slowly varying Hamiltonian. The ground state of the initial Hamiltonian is easy to construct; the ground state of the final Hamiltonian encodes the solution of the computational problem. These algorithms have generally been studied in the case where the "straight line" path from initial to final Hamiltonian is taken. But there is no reason not to try paths involving terms that are not linear combinations of the initial and final Hamiltonians. We give several proposals for randomly generating new paths. Using one of these proposals, we convert an algorithmic failure into a success.

arXiv:quant-ph/0208135•Aug 21, 2002•64 citations

Quantum search algorithm by adiabatic evolution under a priori probability

Zhaohui Wei, Mingsheng Ying

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 algorithms, including Grover's algorithm. In this paper, we show that quantum search algorithm by adiabatic evolution has two properties that conventional quantum search algorithm doesn't have. Firstly, we show that in the initial state of the algorithm only the amplitude of the basis state corresponding to the solution affects the running time of the algorithm, while other amplitudes do not. Using this property, if we know a priori probability about the location of the solution before search, we can modify the adiabatic evolution to make the algorithm faster. Secondly, we show that by a factor for the initial and finial Hamiltonians we can reduce the running time of the algorithm arbitrarily. Especially, we can reduce the running time of adiabatic search algorithm to a constant time independent of the size of the database. The second property can be extended to other adiabatic algorithms.

arXiv:quant-ph/0412117•Dec 15, 2004•3 citations

Energy and efficiency of adiabatic quantum search algorithms

Saurya Das, Randy Kobes, G. Kunstatter

We present the results of a detailed analysis of a general, unstructured adiabatic quantum search of a database of N items. In particular, we examine the effects on the computation time of adding energy to the system. We find that by increasing the lowest eigenvalue of the time-dependent Hamiltonian temporarily to a maximum of ∝√ N , it is possible to do the calculation in constant time. This leads us to derive the general theorem which provides the adiabatic analogue of the √ N bound of conventional quantum searches. The result suggests that the action associated with the oracle term in the time-dependent Hamiltonian is a direct measure of the resources required by the adiabatic quantum search.

arXiv:quant-ph/0204044•Journal of Physics A Mathematical and General•Mar 6, 2003•34 citations

A quantum search algorithm based on partial adiabatic evolution

Yingyu Zhang, Heping Hu, Songfeng Lu

This paper presents and implements a specified partial adiabatic search algorithm on a quantum circuit. It studies the minimum energy gap between the first excited state and the ground state of the system Hamiltonian and it finds that, in the case of M = 1, the algorithm has the same performance as the local adiabatic algorithm. However, the algorithm evolves globally only within a small interval, which implies that it keeps the advantages of global adiabatic algorithms without losing the speedup of the local adiabatic search algorithm.

Chinese Physics B•Apr 1, 2011•13 citations
We report on a detailed analysis of generalization of the local adiabatic search algorithm. Instead of evolving directly from an initial ground state Hamiltonian to a solution Hamiltonian a different evolution path is introduced and is shown that the time required to find an item in a database of size NNN can be made to be independent of the size of the database by modifying the Hamiltonian used to evolve the system.
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. We apply this time-dependent Hamiltonian approach to Grover's problem, i.e., searching a marked item in an unstructured database. We find that by adjusting the evolution rate of the Hamiltonian so as to keep the evolution adiabatic on each infinitesimal time interval, the total running time is of order N,\sqrt{N},N​, where N is the number of items in the database. We thus recover the advantage of Grover's standard algorithm as compared to a classical search, scaling as N. This is in contrast with the constant-rate adiabatic approach of Farhi et al. (e-print quant-ph/0001106), where the requirement of adiabaticity is expressed only globally, resulting in a time of order N.
Recently, Zhang and Lu provided a quantum search algorithm based on partial adiabatic evolution, which beats the time bound of local adiabatic search when the number of marked items in the unsorted database is larger than one. Later, they found that the above two adiabatic search algorithms had the same time complexity when there is only one marked item in the database. In the present paper, following the idea of Roland and Cerf [Roland J and Cerf N J 2002 Phys. Rev. A 65 042308 ], if within the small symmetric evolution interval defined by Zhang et al., a local adiabatic evolution is performed instead of the original "global" one, this "new" algorithm exhibits slightly better performance, although they are progressively equivalent with M increasing. In addition, the proof of the optimality for this partial evolution based local adiabatic search when M = 1 is also presented. Two other special cases of the adiabatic algorithm obtained by appropriately tuning the evolution interval of partial adiabatic evolution based quantum search, which are found to have the same phenomenon above, are also discussed.
In quantum adiabatic evolution algorithms, the quantum computer follows the ground state of a slowly varying Hamiltonian. The ground state of the initial Hamiltonian is easy to construct; the ground state of the final Hamiltonian encodes the solution of the computational problem. These algorithms have generally been studied in the case where the "straight line" path from initial to final Hamiltonian is taken. But there is no reason not to try paths involving terms that are not linear combinations of the initial and final Hamiltonians. We give several proposals for randomly generating new paths. Using one of these proposals, we convert an algorithmic failure into a success.
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 algorithms, including Grover's algorithm. In this paper, we show that quantum search algorithm by adiabatic evolution has two properties that conventional quantum search algorithm doesn't have. Firstly, we show that in the initial state of the algorithm only the amplitude of the basis state corresponding to the solution affects the running time of the algorithm, while other amplitudes do not. Using this property, if we know a priori probability about the location of the solution before search, we can modify the adiabatic evolution to make the algorithm faster. Secondly, we show that by a factor for the initial and finial Hamiltonians we can reduce the running time of the algorithm arbitrarily. Especially, we can reduce the running time of adiabatic search algorithm to a constant time independent of the size of the database. The second property can be extended to other adiabatic algorithms.
We present the results of a detailed analysis of a general, unstructured adiabatic quantum search of a database of N items. In particular, we examine the effects on the computation time of adding energy to the system. We find that by increasing the lowest eigenvalue of the time-dependent Hamiltonian temporarily to a maximum of ∝√ N , it is possible to do the calculation in constant time. This leads us to derive the general theorem which provides the adiabatic analogue of the √ N bound of conventional quantum searches. The result suggests that the action associated with the oracle term in the time-dependent Hamiltonian is a direct measure of the resources required by the adiabatic quantum search.
This paper presents and implements a specified partial adiabatic search algorithm on a quantum circuit. It studies the minimum energy gap between the first excited state and the ground state of the system Hamiltonian and it finds that, in the case of M = 1, the algorithm has the same performance as the local adiabatic algorithm. However, the algorithm evolves globally only within a small interval, which implies that it keeps the advantages of global adiabatic algorithms without losing the speedup of the local adiabatic search algorithm.