Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Better algorithms for search by quantum walks on two-dimensional grid

Andris Ambainis, Artūrs Bačkurs, Nikolajs Nahimovs, Alexander Rivosh

Published Jan 1, 2012• 0 citations
OpenAlex

Related papers

Quantum Walk Search on a Two-dimensional Grid with Extra Edges

Pulak Ranjan Giri

arXiv:2503.04016•International Journal of Theoretical Physics•Jun 5, 2023•9 citations

Search by Quantum Walks on Two-Dimensional Grid without Amplitude Amplification

Andris Ambainis, Artūrs Bačkurs, Nikolajs Nahimovs +2 more

arXiv:1112.3337•Lecture notes in computer science•Jan 1, 2013•46 citations

On applying the lackadaisical quantum walk algorithm to search for multiple solutions on grids

Jonathan H. A. de Carvalho, Luciano S. de Souza, Fernando M. de Paula Neto +1 more

arXiv:2106.06274•Information Sciences•Dec 5, 2022•8 citations

Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations

Nikolajs Nahimovs, Alexander Rivosh

Lecture notes in computer science•Jan 1, 2016•16 citations

Mixing times in quantum walks on two-dimensional grids

Franklin de Lima Marquezino, Renato Portugal, Gonzalo Abal

Mixing properties of discrete-time quantum walks on two-dimensional grids with toruslike boundary conditions are analyzed, focusing on their connection to the complexity of the corresponding abstract search algorithm. In particular, an exact expression for the stationary distribution of the coherent walk over odd-sided lattices is obtained after solving the eigenproblem for the evolution operator for this particular graph. The limiting distribution and mixing time of a quantum walk with a coin operator modified as in the abstract search algorithm are obtained numerically. On the basis of these results, the relation between the mixing time of the modified walk and the running time of the corresponding abstract search algorithm is discussed.

arXiv:1006.4625•Physical Review A•Oct 29, 2010•18 citations

Multi-particle quantum walk search on a two-dimensional lattice

Gonçalo Meneses, D. O. Oriekhov

In the present paper we study the formulation of a search problem and the efficiency of multi-particle quantum walk search algorithms. The discrete-time evolution of each particle in space is treated according to Grover's quantum walk evolution operator. We focus on the local interactions models, where the particles' states are modified only when two or more of them appear on the same grid site. The main focus is given to the two-dimensional grid in space. We study the dependence of the search algorithm asymptotic success time and probability on the interaction strength and the generated maximal entanglement between particles. We show that the interacting and non-interacting two- and three-particle search algorithm attains a constant factor improvement over the single-particle counterpart. In addition, we provide a new generalized model of interactions for multi-particle quantum walks.

arXiv:2611.17061•Nov 12, 2026•0 citations
Mixing properties of discrete-time quantum walks on two-dimensional grids with toruslike boundary conditions are analyzed, focusing on their connection to the complexity of the corresponding abstract search algorithm. In particular, an exact expression for the stationary distribution of the coherent walk over odd-sided lattices is obtained after solving the eigenproblem for the evolution operator for this particular graph. The limiting distribution and mixing time of a quantum walk with a coin operator modified as in the abstract search algorithm are obtained numerically. On the basis of these results, the relation between the mixing time of the modified walk and the running time of the corresponding abstract search algorithm is discussed.
In the present paper we study the formulation of a search problem and the efficiency of multi-particle quantum walk search algorithms. The discrete-time evolution of each particle in space is treated according to Grover's quantum walk evolution operator. We focus on the local interactions models, where the particles' states are modified only when two or more of them appear on the same grid site. The main focus is given to the two-dimensional grid in space. We study the dependence of the search algorithm asymptotic success time and probability on the interaction strength and the generated maximal entanglement between particles. We show that the interacting and non-interacting two- and three-particle search algorithm attains a constant factor improvement over the single-particle counterpart. In addition, we provide a new generalized model of interactions for multi-particle quantum walks.