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

• Published in: Quantum information processing Vol. 12; no. 8; pp. 2813 - 2831
• Main Authors: Sufiani, R., Bahari, N.
• Format: Journal Article
• Language: English
• Published: Boston Springer US 01.08.2013; Springer
• Subjects: Classical and quantum physics: mechanics and fields; Data Structures and Information Theory; Exact sciences and technology; Mathematical Physics; Physics; Physics and Astronomy; Quantum computation; Quantum Computing; Quantum information; Quantum Information Technology; Quantum Physics; Spintronics; Lanczos algorithm; Quantum search algorithm; Graph; Spectral distribution; Krylov subspace; Local adiabatic evolution; Second-order perturbation theory; Software maintenance; Adiabatic passage; Spectral method; Krylov subspace method; Search time; Connected graph; State-space methods; Lanczos method; Search algorithm; Quantum computing; Hamiltonian graph; Database; Second order theory; Version management; Non directed graph; Regular graph
• ISSN: 1570-0755; 1573-1332
• DOI: 10.1007/s11128-013-0563-3

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 adiabatic evolution of the Hamiltonian associated with the graph. The main new idea is to apply some techniques such as Krylov subspace 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.