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

DOI10.1007/S11128-013-0563-3zbMATH Open1283.81037arXiv1208.0262OpenAlexW1996426652MaRDI QIDQ2436417FDOQ2436417

Authors: N. Bahari, R. Sufiani 

Publication date: 25 February 2014

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

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.

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

Recommendations

• Unstructured adiabatic quantum search
• Energy and efficiency of adiabatic quantum search algorithms
• Search via Quantum Walk
• scientific article; zbMATH DE number 2020426
• Controlled quantum search

zbMATH Keywords

graphspectral distributionKrylov subspaceLanczos algorithmquantum search algorithmsecond-order perturbation theorylocal adiabatic evolution

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Introduction to spectral theory. With applications to Schrödinger operators
• Quantum search of spatial regions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Investigation of continuous-time quantum walk via modules of Bose–Mesner and Terwilliger algebras
• Title not available (Why is that?)
• Investigation of continuous-time quantum walk via spectral distribution associated with adjacency matrix
• Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm
• Perfect state transfer of a qudit over underlying networks of group association schemes

Cited In (5)

• Spectral approach to quantum searching on the interpolated Markov chains: the complete bipartite graph
• Diagrammatic approach to quantum search
• Unstructured adiabatic quantum search
• Quantum database search with certainty by a single query
• The generalized quantum database search algorithm

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)