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

arXiv:2003.02450 · Computer Physics Communications

QSW_MPI: A framework for parallel simulation of quantum stochastic walks

Edric Matwiejew, Jingbo B. Wang

Published Nov 20, 2020• 9 citations
arXivHTMLPDF
DOI
10.1016/j.cpc.2020.107724

Related papers

Quantum stochastic walks: A generalization of classical random walks and quantum walks

Alán Aspuru‐Guzik

Bulletin of the American Physical Society•Mar 17, 2010•0 citations

From classical to quantum walks with stochastic resetting on networks

Sascha Wald, Lucas Böttcher

Random walks are fundamental models of stochastic processes with applications in various fields, including physics, biology, and computer science. We study classical and quantum random walks under the influence of stochastic resetting on arbitrary networks. Based on the mathematical formalism of quantum stochastic walks, we provide a framework of classical and quantum walks whose evolution is determined by graph Laplacians. We study the influence of quantum effects on the stationary and long-time average probability distribution by interpolating between the classical and quantum regime. We compare our analytical results on stationary and long-time average probability distributions with numerical simulations on different networks, revealing differences in the way resets affect the sampling properties of classical and quantum walks.

arXiv:2008.00510•Physical review. E•Jan 19, 2021•28 citations

QuOp_MPI: A framework for parallel simulation of quantum variational algorithms

Edric Matwiejew, Jingbo B. Wang

arXiv:2110.03963•Journal of Computational Science•May 23, 2022•4 citations

Quantum trajectory method using MPI parallel computing

Asmaʼ Ahmad Bahari, Muhammad Salihi Abdul Hadi

IIUM Press eBooks•Jan 1, 2011•0 citations

Quantum simulation of a discrete-time quantum stochastic walk

Peter K. Schuhmacher, Luke C. G. Govia, Bruno G. Taketani +1 more

Abstract Quantum walks have been shown to have a wide range of applications, from artificial intelligence, to photosynthesis, and quantum transport. Quantum stochastic walks (QSWs) generalize this concept to additional non-unitary evolution. In this paper, we propose a trajectory-based quantum simulation protocol to effectively implement a family of discrete-time QSWs in a quantum device. After deriving the protocol for a 2-vertex graph with a single edge, we show how our protocol generalizes to a graph with arbitrary topology and connectivity. The straightforward generalization leads to simple scaling of the protocol to complex graphs. Finally, we show how to simulate a restricted class of continuous-time QSWs by a discrete-time QSW, and how this is amenable to our simulation protocol for discrete-time QSWs.

arXiv:2004.06151•Europhysics Letters (EPL)•Mar 1, 2021•4 citations

A Probabilistic Representation for Multi-State Discrete-time Quantum Walks

Hoang Vu

Building upon the pioneering framework of Vu (2026), we construct a probabilistic representation for three-state discrete-time quantum walks on integer lattices and validate it through empirical examples. Furthermore, we establish that this representation converges to the continuum solution of multi-state Dirac partial differential equations. Broadly, our findings demonstrate that this probabilistic paradigm serves as a robust alternative for simulating higher-dimensional quantum walks, opening new theoretical avenues to analyze quantum dynamics using classical stochastic processes.

quant-pharXiv:2607.23569•Jul 28, 2026•0 citations
Random walks are fundamental models of stochastic processes with applications in various fields, including physics, biology, and computer science. We study classical and quantum random walks under the influence of stochastic resetting on arbitrary networks. Based on the mathematical formalism of quantum stochastic walks, we provide a framework of classical and quantum walks whose evolution is determined by graph Laplacians. We study the influence of quantum effects on the stationary and long-time average probability distribution by interpolating between the classical and quantum regime. We compare our analytical results on stationary and long-time average probability distributions with numerical simulations on different networks, revealing differences in the way resets affect the sampling properties of classical and quantum walks.
Abstract Quantum walks have been shown to have a wide range of applications, from artificial intelligence, to photosynthesis, and quantum transport. Quantum stochastic walks (QSWs) generalize this concept to additional non-unitary evolution. In this paper, we propose a trajectory-based quantum simulation protocol to effectively implement a family of discrete-time QSWs in a quantum device. After deriving the protocol for a 2-vertex graph with a single edge, we show how our protocol generalizes to a graph with arbitrary topology and connectivity. The straightforward generalization leads to simple scaling of the protocol to complex graphs. Finally, we show how to simulate a restricted class of continuous-time QSWs by a discrete-time QSW, and how this is amenable to our simulation protocol for discrete-time QSWs.
Building upon the pioneering framework of Vu (2026), we construct a probabilistic representation for three-state discrete-time quantum walks on integer lattices and validate it through empirical examples. Furthermore, we establish that this representation converges to the continuum solution of multi-state Dirac partial differential equations. Broadly, our findings demonstrate that this probabilistic paradigm serves as a robust alternative for simulating higher-dimensional quantum walks, opening new theoretical avenues to analyze quantum dynamics using classical stochastic processes.