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:2510.03836 · The European Physical Journal Special Topics

From qubits to rhythm: exploring quantum random walks in rhythmspaces

María Aguado Yáñez, Karl Jansen, Daniel Gómez-Marín, Sergi Jordà

Published Sep 19, 2026• 1 citation
arXivHTMLPDF
DOI
10.1140/epjs/s11734-026-02587-2

Related papers

Quantum aspects of evolution: a contribution towards evolutionary explorations of genotype networks via quantum walks

Diego Santiago‐Alarcón, Horacio Tapia‐McClung, Sergio Lerma-Hernández +1 more

Abstract Quantum biology seeks to explain biological phenomena via quantum mechanisms, such as enzyme reaction rates via tunneling and photosynthesis energy efficiency via coherent superposition of states. However, less effort has been devoted to study the role of quantum mechanisms in biological evolution. In this paper, we used transcription factor networks with two and four different phenotypes, and used classical random walks (CRW) and quantum walks (QW) to compare network search behavior and efficiency at finding novel phenotypes between CRW and QW. In the network with two phenotypes, at temporal scales comparable to decoherence time T D , QW are as efficient as CRW at finding new phenotypes. In the case of the network with four phenotypes, the QW had a higher probability of mutating to a novel phenotype than the CRW, regardless of the number of mutational steps (i.e., 1, 2 or 3) away from the new phenotype. Before quantum decoherence, the QW probabilities become higher turning the QW effectively more efficient than CRW at finding novel phenotypes under different starting conditions. Thus, our results warrant further exploration of the QW under more realistic network scenarios (i.e., larger genotype networks) in both closed and open systems (e.g., by considering Lindblad terms).

Journal of The Royal Society Interface•Nov 1, 2020•15 citations

Quantum random walks: an introductory overview

Julia Kempe

Contemporary Physics•Jan 1, 2009•130 citations

Quantum Random Walk Algorithms for Feature Extraction

Jincheng Zhang

This paper explores the application of quantum random walks (QRWs) to feature extraction from high-dimensional data. Classical random walks often struggle with the curse of dimensionality, leading to inefficient exploration of the data space. QRWs, leveraging the inherent randomness of quantum mechanics, offer a potential solution by enabling more efficient exploration and potentially uncovering hidden correlations. This work details the theoretical framework for implementing QRWs on graph-based representations of data, presenting algorithms for both discrete and continuous graphs. We investigate the key differences between classical and quantum random walks, focusing on the role of superposition and entanglement in expanding the search space. The core claim is that QRWs can be utilized to extract meaningful features from high-dimensional data. We provide a mathematical formulation for analyzing the convergence and efficiency of QRWs, demonstrating the potential advantages over traditional methods. The paper concludes with a discussion on the challenges and future directions for this emerging field.

•Aug 31, 2026•0 citations

Quantum Walks: A Markovian Perspective

Diego de Falco, Dario Tamascelli

arXiv:0801.4515•Lecture notes in computer science•Jan 1, 2008•0 citations

Quantum walks : a Markovian perspective

Diego de Falco, Dario Tamascelli, Centro Interdipartimentale +1 more

•Jan 1, 2008•2 citations

Bandit Algorithm Driven by a Classical Random Walk and a Quantum Walk

Tomoki Yamagami, Etsuo Segawa, Takatomo Mihana +3 more

Quantum walks (QWs) have a property that classical random walks (RWs) do not possess-the coexistence of linear spreading and localization-and this property is utilized to implement various kinds of applications. This paper proposes RW- and QW-based algorithms for multi-armed-bandit (MAB) problems. We show that, under some settings, the QW-based model realizes higher performance than the corresponding RW-based one by associating the two operations that make MAB problems difficult-exploration and exploitation-with these two behaviors of QWs.

arXiv:2304.10118•Entropy•May 25, 2023•7 citations
Abstract Quantum biology seeks to explain biological phenomena via quantum mechanisms, such as enzyme reaction rates via tunneling and photosynthesis energy efficiency via coherent superposition of states. However, less effort has been devoted to study the role of quantum mechanisms in biological evolution. In this paper, we used transcription factor networks with two and four different phenotypes, and used classical random walks (CRW) and quantum walks (QW) to compare network search behavior and efficiency at finding novel phenotypes between CRW and QW. In the network with two phenotypes, at temporal scales comparable to decoherence time T D , QW are as efficient as CRW at finding new phenotypes. In the case of the network with four phenotypes, the QW had a higher probability of mutating to a novel phenotype than the CRW, regardless of the number of mutational steps (i.e., 1, 2 or 3) away from the new phenotype. Before quantum decoherence, the QW probabilities become higher turning the QW effectively more efficient than CRW at finding novel phenotypes under different starting conditions. Thus, our results warrant further exploration of the QW under more realistic network scenarios (i.e., larger genotype networks) in both closed and open systems (e.g., by considering Lindblad terms).
This paper explores the application of quantum random walks (QRWs) to feature extraction from high-dimensional data. Classical random walks often struggle with the curse of dimensionality, leading to inefficient exploration of the data space. QRWs, leveraging the inherent randomness of quantum mechanics, offer a potential solution by enabling more efficient exploration and potentially uncovering hidden correlations. This work details the theoretical framework for implementing QRWs on graph-based representations of data, presenting algorithms for both discrete and continuous graphs. We investigate the key differences between classical and quantum random walks, focusing on the role of superposition and entanglement in expanding the search space. The core claim is that QRWs can be utilized to extract meaningful features from high-dimensional data. We provide a mathematical formulation for analyzing the convergence and efficiency of QRWs, demonstrating the potential advantages over traditional methods. The paper concludes with a discussion on the challenges and future directions for this emerging field.
Quantum walks (QWs) have a property that classical random walks (RWs) do not possess-the coexistence of linear spreading and localization-and this property is utilized to implement various kinds of applications. This paper proposes RW- and QW-based algorithms for multi-armed-bandit (MAB) problems. We show that, under some settings, the QW-based model realizes higher performance than the corresponding RW-based one by associating the two operations that make MAB problems difficult-exploration and exploitation-with these two behaviors of QWs.