Discrete-time quantum walk search on Johnson graphs

DOI10.1007/S11128-018-2158-5zbMath1409.81034OpenAlexW2906805507WikidataQ128687175 ScholiaQ128687175MaRDI QIDQ669924

Zhi-hao Liu, Xi-ling Xue, Yue Ruan

Publication date: 15 March 2019

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

Full work available at URL: https://doi.org/10.1007/s11128-018-2158-5

zbMATH Keywords

Johnson graphsquantum spatial searchdiscrete-time quantum walks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Sums of independent random variables; random walks (60G50) Quantum computation (81P68) Random walks on graphs (05C81) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (8)

Spatial search on Johnson graphs by discrete-time quantum walk ⋮ Quantum walk and its application domains: a systematic review ⋮ One-dimensional quantum walks with two-step memory ⋮ Search on vertex-transitive graphs by lackadaisical quantum walk ⋮ Spatial search algorithms on graphs with multiple targets using discrete-time quantum walk ⋮ Spatial search on Johnson graphs by continuous-time quantum walk ⋮ The average search probabilities of discrete-time quantum walks ⋮ Quantum partial search algorithm with smaller oracles for multiple target items

Cites Work

• Unnamed Item
• Constructing quantum hash functions based on quantum walks on Johnson graphs
• Universal Computation by Multiparticle Quantum Walk
• Quantum walk search on Johnson graphs
• Finding structural anomalies in star graphs using quantum walks: a general approach
• Graph isomorphism in quasipolynomial time [extended abstract]
• Quantum Walk Algorithm for Element Distinctness
• A characterization of tetrahedral graphs

This page was built for publication: Discrete-time quantum walk search on Johnson graphs