Spatial quantum search in a triangular network

DOI10.1017/S0960129511000600zbMath1281.68109arXiv1009.1422MaRDI QIDQ2888857

G. Abal, Marcelo Forets, Raul Donangelo, Renato Portugal

Publication date: 4 June 2012

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (7)

Establishing the equivalence between Szegedy's and coined quantum walks using the staggered model ⋮ Quantum walks on simplicial complexes ⋮ Quantum search of matching on signed graphs ⋮ Quantum search on Hanoi network ⋮ Quantum search on simplicial complexes ⋮ A quantum searching model finding one of the edges of a subgraph in a complete graph ⋮ Lackadaisical quantum walks on 2D grids with multiple marked vertices

Cites Work

• Spatial search on a honeycomb network
• Finding Is as Easy as Detecting for Quantum Walks

This page was built for publication: Spatial quantum search in a triangular network