Quantum search on Hanoi network

DOI10.1142/S0219749919500606zbMath1447.81076arXiv1903.08020OpenAlexW3006026856MaRDI QIDQ5219344

Pulak Ranjan Giri, Vladimir E. Korepin

Publication date: 11 March 2020

Published in: International Journal of Quantum Information (Search for Journal in Brave)

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

zbMATH Keywords

quantum algorithmquantum walklackadaisical quantum walk

Mathematics Subject Classification ID

Searching and sorting (68P10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Sums of independent random variables; random walks (60G50) Quantum computation (81P68)

Related Items (1)

Quantum walk search on a two-dimensional grid with extra edges

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Faster search by lackadaisical quantum walk
• Quantum partial search for uneven distribution of multiple target items
• Spatial quantum search in a triangular network
• Spatial search on a honeycomb network
• Spatial search and the Dirac equation
• Search by Quantum Walks on Two-Dimensional Grid without Amplitude Amplification
• Faster quantum-walk algorithm for the two-dimensional spatial search
• Lackadaisical quantum walk for spatial search
• Quantum walks and search algorithms

This page was built for publication: Quantum search on Hanoi network