Spatial search on a honeycomb network

DOI10.1017/S0960129510000332zbMath1217.68102arXiv1001.1139MaRDI QIDQ3061155

G. Abal, F. L. Marquezino, Renato Portugal, Raul Donangelo

Publication date: 14 December 2010

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

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (12)

Spatial quantum search in a triangular network ⋮ Establishing the equivalence between Szegedy's and coined quantum walks using the staggered model ⋮ Robust quantum spatial search ⋮ The quantum walk search algorithm: factors affecting efficiency ⋮ Faster search by lackadaisical quantum walk ⋮ Spatial search using the discrete time quantum walk ⋮ Construction of distinct discrete time scattering quantum walk formulations on the honeycomb lattice ⋮ Quantum search on Hanoi network ⋮ Quantum search on simplicial complexes ⋮ Fast quantum search of multiple vertices based on electric circuits ⋮ Lackadaisical quantum walks on 2D grids with multiple marked vertices ⋮ Strong dispersion property for the quantum walk on the hypercube

Cites Work

• Strengths and Weaknesses of Quantum Computing
• Faster quantum-walk algorithm for the two-dimensional spatial search
• The Band Theory of Graphite

This page was built for publication: Spatial search on a honeycomb network