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

Doklady Mathematics

Diffusion and quantum dynamics on graphs

Vsevolod Zhanovich Sakbaev, Oleg Georgievich Smolyanov

Published Jul 1, 2013• 9 citations
Publisher
DOI
10.1134/s1064562413040108

Related papers

Transport and dynamics on open quantum graphs

Felipe Barra, Pierre Gaspard

We study the classical limit of quantum mechanics on graphs by introducing a Wigner function for graphs. The classical dynamics is compared to the quantum dynamics obtained from the propagator. In particular, we consider extended open graphs whose classical dynamics generate a diffusion process. The transport properties of the classical system are revealed in the scattering resonances and in the time evolution of the quantum system.

arXiv:cond-mat/0107285•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Dec 14, 2001•48 citations

Dynamics on quantum graphs as constrained systems

Gianfausto Dell’Antonio

Reports on Mathematical Physics•Jun 1, 2007•2 citations

Bosonic Random Walk Networks for Graph Learning

Shiv Shankar Shankar, Don Towsley

The development of Graph Neural Networks (GNNs) has led to great progress in machine learning on graph-structured data. These networks operate via diffusing information across the graph nodes while capturing the structure of the graph. Recently there has also seen tremendous progress in quantum computing techniques. In this work, we explore applications of multi-particle quantum walks on diffusing information across graphs. Our model is based on learning the operators that govern the dynamics of quantum random walkers on graphs. We demonstrate the effectiveness of our method on classification and regression tasks.

arXiv:2101.00082•Dec 31, 2020•1 citation

Quantum graphs

Theoretical and mathematical physics•Sep 22, 2008•0 citations

Quantum Chaos and Diffusive Transport from Geometric Randomness

Bibek Saha, Abhishek Dhar, Sthitadhi Roy

The physics of quantum chaos and diffusive transport is typically studied in settings with microscopic disorder or many-body interactions. In this Letter, we demonstrate that these phenomena can arise purely from geometric randomness. By studying non-interacting quantum particles on random locally tree-like layered graphs with uniform couplings, we show that the geometric randomness and effective graph dimensionality dictates the presence of chaotic dynamics or lack thereof. These graphs can be considered as structurally disordered generalisations of regular square lattices or ladders, or equivalently as multi-component one-dimensional chains with random links between the components. We find that an extensive layer size yields robust quantum chaos, level repulsion, and diffusive transport. Conversely, in the quasi-one-dimensional limit, we find the coexistence of extensive number of localised and delocalised states -- this leads to suppressed level repulsion accompanied by the latter driving ballistic transport. These results establish geometric randomness as a fundamental and independent mechanism for generating and tuning quantum chaos.

cond-mat.stat-mechCross-listedarXiv:2607.28579•Jul 31, 2026

Effective dissipation rate in a Liouvillian-graph picture of high-temperature quantum hydrodynamics

Christopher David White

At high temperature, generic strongly interacting spin systems are expected to display hydrodynamics: local transport of conserved quantities, governed by classical partial differential equations like the diffusion equation. I argue that the emergence of this dissipative long-wavelength dynamics from the system's unitary microscopic dynamics is controlled by the structure of the Liouvillian graph of the system's Hamiltonian, that is, the graph induced on Pauli strings by commutation with that Hamiltonian. The Liouvillian graph decomposes naturally into subgraphs of Pauli strings of constant diameter, and the coherent dynamics of these subgraphs determines the rate at which operator weight spreads to long operators. This argument provides a quantitative theory of the emergence of a dissipative effective dynamics from unitary microscopic dynamics; it also leads to an effective model with Hilbert space dimension linear in system size and exponential in the UV cutoff for diffusion.

arXiv:2108.00019•Physical review. B./Physical review. B•Mar 22, 2023•22 citations
The development of Graph Neural Networks (GNNs) has led to great progress in machine learning on graph-structured data. These networks operate via diffusing information across the graph nodes while capturing the structure of the graph. Recently there has also seen tremendous progress in quantum computing techniques. In this work, we explore applications of multi-particle quantum walks on diffusing information across graphs. Our model is based on learning the operators that govern the dynamics of quantum random walkers on graphs. We demonstrate the effectiveness of our method on classification and regression tasks.
The physics of quantum chaos and diffusive transport is typically studied in settings with microscopic disorder or many-body interactions. In this Letter, we demonstrate that these phenomena can arise purely from geometric randomness. By studying non-interacting quantum particles on random locally tree-like layered graphs with uniform couplings, we show that the geometric randomness and effective graph dimensionality dictates the presence of chaotic dynamics or lack thereof. These graphs can be considered as structurally disordered generalisations of regular square lattices or ladders, or equivalently as multi-component one-dimensional chains with random links between the components. We find that an extensive layer size yields robust quantum chaos, level repulsion, and diffusive transport. Conversely, in the quasi-one-dimensional limit, we find the coexistence of extensive number of localised and delocalised states -- this leads to suppressed level repulsion accompanied by the latter driving ballistic transport. These results establish geometric randomness as a fundamental and independent mechanism for generating and tuning quantum chaos.
At high temperature, generic strongly interacting spin systems are expected to display hydrodynamics: local transport of conserved quantities, governed by classical partial differential equations like the diffusion equation. I argue that the emergence of this dissipative long-wavelength dynamics from the system's unitary microscopic dynamics is controlled by the structure of the Liouvillian graph of the system's Hamiltonian, that is, the graph induced on Pauli strings by commutation with that Hamiltonian. The Liouvillian graph decomposes naturally into subgraphs of Pauli strings of constant diameter, and the coherent dynamics of these subgraphs determines the rate at which operator weight spreads to long operators. This argument provides a quantitative theory of the emergence of a dissipative effective dynamics from unitary microscopic dynamics; it also leads to an effective model with Hilbert space dimension linear in system size and exponential in the UV cutoff for diffusion.