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

Multi-Particle Quantum Walks

Jamie Smith

Published Jan 1, 2012• 0 citations
OpenAlex

Related papers

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

Two-dimensional Quantum Walk Models

Kyohei Watanabe

•Jul 1, 2008•0 citations

Quantum random walks

Luigi Accardi, G. S. Watson

Lecture notes in mathematics•Jan 1, 1989•24 citations

Multi-particle Quantum Walks with 2D & 3D Arrayed Waveguides

Konstantinos Poulios, Daniel Fry, Mirko Lobino +12 more

Multi-photon quantum walks on integrated circuits are emonstrated, showing non-classical correlations, in one and two dimensional networks. Time evolution of quantum walks and a scheme for simulating fermionic quantum walks using entanglement are demonstrated.

•Apr 17, 2012•0 citations

Multiparticle quantum walks for distinguishing hard graphs

Sachin Kasture, Shaheen Acheche, Loïc Henriet +1 more

Quantum random walks have been shown to be powerful quantum algorithms for certain tasks on graphs like database searching, quantum simulations etc. In this work we focus on its applications for the graph isomorphism problem. In particular we look at how we can compare multi-particle quantum walks and well known classical WL tests and how quantum walks can be used to distinguish hard graphs like CFI graphs which k-WL tests cannot distinguish. We provide theoretical proofs and empirical results to show that a k-QW with input superposition states distinguishes k-CFI graphs. In addition we also prove that a k-1 QW with localized input states distinguishes k-CFI graphs. We also prove some additional results about strongly regular graphs (SRGs).

arXiv:2501.03683•Jan 7, 2025•3 citations

Quantum Random Walks with General Particle States

Alexander C. R. Belton

Communications in Mathematical Physics•Feb 16, 2014•3 citations
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.
Quantum random walks have been shown to be powerful quantum algorithms for certain tasks on graphs like database searching, quantum simulations etc. In this work we focus on its applications for the graph isomorphism problem. In particular we look at how we can compare multi-particle quantum walks and well known classical WL tests and how quantum walks can be used to distinguish hard graphs like CFI graphs which k-WL tests cannot distinguish. We provide theoretical proofs and empirical results to show that a k-QW with input superposition states distinguishes k-CFI graphs. In addition we also prove that a k-1 QW with localized input states distinguishes k-CFI graphs. We also prove some additional results about strongly regular graphs (SRGs).