Quantum search in structured database using local adiabatic evolution and spectral methods

DOI10.1007/S11128-013-0563-3MaRDI QIDQ2436417zbMATH OpenOpenAlexFDO

Publication date 25 February 2014

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1208.0262

graph spectral distribution Krylov subspace Lanczos algorithm quantum search algorithm second-order perturbation theory local adiabatic evolution

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum computation (81P68) Perturbation theories for operators and differential equations in quantum theory (81Q15)

Abstract: Since Grover's seminal work which provides a way to speed up combinatorial search, quantum search has been studied in great detail. We propose a new method for designing quantum search algorithms for finding a marked element in the state space of a graph. The algorithm is based on a local diabatic evolution of the Hamiltonian associated with the graph. The main new idea is to apply some techniques such as Krylov bspace projection methods, Lanczos algorithm and spectral distribution methods. Indeed, using these techniques together with the second-order perturbation theory, we give a systematic method for calculating the approximate search time at which the marked state can be reached. That is, for any undirected regular connected graph which is considered as the state space of the database, the introduced algorithm provides a systematic and programmable way for evaluation of the search time, in terms of the corresponding graph polynomials.

Recommendations

Cites work

Cited in

(5)

This page was built for publication: Quantum search in structured database using local adiabatic evolution and spectral methods

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