Spectral approach to quantum searching on the interpolated Markov chains: the complete bipartite graph

DOI10.1007/s11128-024-04435-5zbMath1542.81462MaRDI QIDQ6566184

Min Ho Lee

Publication date: 3 July 2024

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

zbMATH Keywords

complete bipartite graphquantum walkabsorbing Markov chainquantum search

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• Unnamed Item
• Unnamed Item
• Quantum walks can find a marked element on any graph
• QUANTUM HITTING TIME ON THE COMPLETE GRAPH
• Spatial search and the Dirac equation
• Grover search with lackadaisical quantum walks
• Faster quantum-walk algorithm for the two-dimensional spatial search
• Fixed-Point Quantum Search
• Quadratic speedup for finding marked vertices by Quantum walks
• Quantum walks and search algorithms

This page was built for publication: Spectral approach to quantum searching on the interpolated Markov chains: the complete bipartite graph