Quick Navigation

Overview Topics Abstract Importance Paper Tools References Reactions Discussion Publication Related

Topics

Quantum Simulation

Spatial quantum search in a triangular network

arXiv

Authors: G. Abal, R. Donangelo, M. Forets, R. Portugal

Year

2010

Paper ID

11381

Status

Preprint

Abstract Read

~2 min

Abstract Words

109

Citations

N/A

Abstract

The spatial search problem consists in minimizing the number of steps required to find a given site in a network, under the restriction that only oracle queries or translations to neighboring sites are allowed. We propose a quantum algorithm for the spatial search problem on a triangular lattice with N sites and torus-like boundary conditions. The proposed algortithm is a special case of the general framework for abstract search proposed by Ambainis, Kempe and Rivosh [AKR05] (AKR) and Tulsi [Tulsi08], applied to a triangular network. The AKR-Tulsi formalism was employed to show that the time complexity of the quantum search on the triangular lattice is O(sqrt(N logN)).

Why This Paper Matters

This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
It adds a 2010 reference point for readers tracking recent quantum research.
The spatial search problem consists in minimizing the number of steps required to find a given site in a network, under the restriction that only oracle queries or translations...

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Become a member Sign in

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

[1] DOI https://doi.org/arXiv:1009.1422 [2] arXiv https://arxiv.org/abs/1009.1422 [3] Publisher https://arxiv.org/abs/1009.1422

Local Citation Graph (Related-Paper Links)

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0

Likes: 0 Dislikes: 0

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.