Energy and efficiency of adiabatic quantum search algorithms

DOI10.1088/0305-4470/36/11/313MaRDI QIDQ4466224zbMATH OpenOpenAlexFDO

Authors Saurya Das, R. Kobes, Gabor Kunstatter

Publication date 9 June 2004

Published in Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0204044

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum computation (81P68)

Abstract: We present the results of a detailed analysis of a general, unstructured adiabatic quantum search of a data base 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 {it temporarily} to a maximum of $proptosqrtN$, 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 $sqrtN$ 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.

Recommendations

• Unstructured adiabatic quantum search
• Optimality of partial adiabatic search and its circuit model
• On the efficiency of Hamiltonian-based quantum computation for low-rank matrices
• Hamiltonian and Measuring Time for Analog Quantum Search
• Nonadiabatic quantum search algorithms

Cited in

(30)

• Role of coherence in adiabatic search algorithms
• Nonadiabatic quantum search algorithm with analytical success rate
• Unstructured adiabatic quantum search
• How quantum is the speedup in adiabatic unstructured search?
• On the quantum adiabatic evolution with the most general system Hamiltonian
• Generalized relation between fidelity and quantum adiabatic evolution
• Partial adiabatic quantum search algorithm and its extensions
• Quantum search in structured database using local adiabatic evolution and spectral methods
• On the optimal schedule of adiabatic quantum computing
• On the efficiency of Hamiltonian-based quantum computation for low-rank matrices
• The adiabatic analogue of the Margolus–Levitin theorem
• Hamiltonian and Measuring Time for Analog Quantum Search
• Entanglement properties of adiabatic quantum algorithms
• Exponential vanishing of the ground-state gap of the quantum random energy model via adiabatic quantum computing
• LIMITATIONS OF SOME SIMPLE ADIABATIC QUANTUM ALGORITHMS
• ENTANGLEMENT IN ADIABATIC QUANTUM SEARCHING ALGORITHMS
• A family of system Hamiltonian in quantum adiabatic search type problem
• Optimality of partial adiabatic search and its circuit model
• Nonadiabatic quantum search algorithms
• On the adiabatic evolution of one-dimensional projector Hamiltonians
• Effects of dissipation on an adiabatic quantum search algorithm
• A class of time-energy uncertainty relations for time-dependent Hamiltonians
• Success rate versus finite run time in local adiabatic quantum search algorithm
• On the general class of models of adiabatic evolution
• Bounding Run-Times of Local Adiabatic Algorithms
• Quantum thermal search: computing ground states via quantum mixing thermal operations
• On the circuit model of two quantum adiabatic search algorithms
• The travelling salesman problem and adiabatic quantum computation: an algorithm
• On the quantum circuit model of a kind of quantum adiabatic evolution
• On the circuit model of global adiabatic search algorithm

This page was built for publication: Energy and efficiency of adiabatic quantum search algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4466224)