The average search probabilities of discrete-time quantum walks

DOI10.1007/s11128-022-03681-9OpenAlexW3196006293MaRDI QIDQ2104770

Hanmeng Zhan

Publication date: 7 December 2022

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

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

zbMATH Keywords

quantum searchdistance regular graphsdiscrete-time quantum walks

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)

Cites Work

• Distance-regular graphs
• Discrete-time quantum walk search on Johnson graphs
• The vertex-connectivity of a distance-regular graph
• A characterization of classical and semiclassical orthogonal polynomials from their dual polynomials
• A new perspective on the average mixing matrix
• Spatial search on Johnson graphs by continuous-time quantum walk
• Discrete-time quantum walks and graph structures
• Quantum walk search on Johnson graphs
• Quantum walks on graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The average search probabilities of discrete-time quantum walks