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

Quantum Information Processing

Transport distance between Grover walks on graphs and coarse Ricci curvature

Yasuaki Fujitani, Chusei Kiumi

Published May 11, 2024• 0 citations
Publisher
DOI
10.1007/s11128-024-04373-2

Related papers

Periodicities of Grover Walks on Distance-Regular Graphs

Yusuke Yoshie

Graphs and Combinatorics•Jul 10, 2019•21 citations

Periodicity of Grover walks on complete graphs with self-loops

Naoharu Ito, Toyoki Matsuyama, Tatsuya Tsurii

Linear Algebra and its Applications•Apr 9, 2020•9 citations

Quaternionic Grover Walks and Zeta Functions of Graphs with Loops

Norio Konno, Hideo Mitsuhashi, Iwao Sato

Graphs and Combinatorics•May 25, 2017•0 citations

Quantum Algorithm for Estimating Ollivier-Ricci Curvature

Nhat A. Nghiem, Linh Nguyen, Tuan K. Do +2 more

We introduce a quantum algorithm for computing the Ollivier Ricci curvature, a discrete analogue of the Ricci curvature defined via optimal transport on graphs and general metric spaces. This curvature has seen applications ranging from signaling fragility in financial networks to serving as basic quantities in combinatorial quantum gravity. For inputs given as a point cloud with pairwise distances, we show that our algorithm can achieve an exponential speedup over the best-known classical methods for two particular classes of problem. Our work is another step toward quantum algorithms for geometrical problems that are capable of delivering practical value while also informing fundamental theory.

quant-pharXiv:2512.09822•Physical Review Research•Dec 11, 2025•1 citation

Grover Walk on finite graphs with infinite tails

Fuard Mohamed Sabri Mohamed

•Jan 7, 2021•0 citations

Regular graphs to induce even periodic Grover walks

Sho Kubota, Hiroto Sekido, Kiyoto Yoshino

arXiv:2307.13227•Discrete Mathematics•Nov 29, 2024•1 citation
We introduce a quantum algorithm for computing the Ollivier Ricci curvature, a discrete analogue of the Ricci curvature defined via optimal transport on graphs and general metric spaces. This curvature has seen applications ranging from signaling fragility in financial networks to serving as basic quantities in combinatorial quantum gravity. For inputs given as a point cloud with pairwise distances, we show that our algorithm can achieve an exponential speedup over the best-known classical methods for two particular classes of problem. Our work is another step toward quantum algorithms for geometrical problems that are capable of delivering practical value while also informing fundamental theory.