Zobrazeno 1 - 10
of 9 096
pro vyhledávání: '"Spatial search"'
Spatial search is the problem of finding a marked vertex in a graph. A continuous-time quantum walk in the single-excitation subspace of an $n$ spin system solves the problem of spatial search by finding the marked vertex in $O(\sqrt{n})$ time. Here,
Externí odkaz:
http://arxiv.org/abs/2410.05945
We examine the impact of potential fields, particularly utilizing a bivariate Gaussian distribution function, on the dynamics of quantum walks in spatial search problems. Building on the Ambainis-Kempe-Rivosh (AKR) model for searching on a two-dimens
Externí odkaz:
http://arxiv.org/abs/2410.03269
This article presents a novel and succinct algorithmic framework via alternating quantum walks, unifying quantum spatial search, state transfer and uniform sampling on a large class of graphs. Using the framework, we can achieve exact uniform samplin
Externí odkaz:
http://arxiv.org/abs/2407.02530
Since quantum spatial searches on complex networks have a strong network dependence, the question arises whether the universal perspective exists in this quantum algorithm for complex networks. Here, we uncover the universal scaling laws of the quant
Externí odkaz:
http://arxiv.org/abs/2401.11922
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Spatial search is an important problem in quantum computation, which aims to find a marked vertex on a graph. We propose a novel approach for designing deterministic quantum search algorithms on a variety of graphs via alternating quantum walks. Our
Externí odkaz:
http://arxiv.org/abs/2307.16133