The role of tessellation intersection in staggered quantum walks

DOI10.1007/s11047-019-09758-2zbMath1530.81045arXiv1810.02387OpenAlexW2970890244WikidataQ127311775 ScholiaQ127311775MaRDI QIDQ6151197

Raqueline Azevedo Medeiros Santos

Publication date: 9 February 2024

Published in: Natural Computing (Search for Journal in Brave)

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

zbMATH Keywords

quantum walksstaggered modeltessellation intersection

Mathematics Subject Classification ID

Quantum computation (81P68) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Random walks on graphs (05C81) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)

Cites Work

• Unnamed Item
• The staggered quantum walk model
• Establishing the equivalence between Szegedy's and coined quantum walks using the staggered model
• Element distinctness revisited
• The graph tessellation cover number: extremal bounds, efficient algorithms and hardness
• Quantum walks on graphs
• Quantum Walk Algorithm for Element Distinctness
• Discretization of continuous-time quantum walks via the staggered model with Hamiltonians

This page was built for publication: The role of tessellation intersection in staggered quantum walks