Continuous-Time Quantum Walk on Biological Network
Open accessThe DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Abstract
Disease gene prioritization is a computational strategy that assigns scores to genes or proteins to estimate their likelihood of being associated with a specific disease, helping reduce the cost and effort of experimental validation. Given the large number of candidate genes and limited laboratory resources, effective prioritization techniques are essential for focusing experimental efforts on the most promising targets. In this study, we introduce a novel disease gene prioritization method based on continuous-time quantum walks applied to a heterogeneous biological network comprising both gene and disease nodes. This heterogeneous formulation enables a more comprehensive representation of biological interactions compared to traditional homogeneous models. By propagating quantum amplitudes through the network, the proposed framework captures complex structural patterns and interaction dynamics that classical approaches may overlook. To assess its effectiveness, we perform two types of evaluation: (i) comparison of our predictions with established findings reported in the literature, and (ii) benchmarking against a widely used classical prioritization technique. Experimental results show that our quantum walk-based model consistently outperforms the classical baseline, achieving an area under the curve (AUC) of 0.912 versus 0.804. These results demonstrate the potential of quantum-inspired algorithms to enhance accuracy in disease gene discovery and highlight their value for advancing computational methods in omics research.We further validated the robustness of our approach by incorporating the Precision–Recall AUC, which confirmed the superior predictive performance of the quantum walk model across multiple seed genes.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
WGCNA: an R package for weighted correlation network analysis
Langfelder, P., & Horvath, S. (2008) · BMC Bioinformatics · doi:10.1186/1471-2105-9-559 · Cited by 27,252
Goh, K.-I., Cusick, M. E., Valle, D., Childs, B., Vidal, M., & Barabási, A.-L. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0701361104 · Cited by 3,242
TP53 mutations in human cancers: origins, consequences, and clinical use.
Olivier, M., Hollstein, M., & Hainaut, P. (2010) · Cold Spring Harbor Perspectives in Biology · doi:10.1101/cshperspect.a001008 · Cited by 2,199 · cited 2×
“According to the literature, gene TP53 plays a key role in regulating cell division and apoptosis and is therefore implicated in many human cancers as well as in Li-Fraumeni syndrome [30].”
Uncovering disease-disease relationships through the incomplete interactome
Menche, J., Sharma, A., Kitsak, M., Ghiassian, S. D., Vidal, M., Loscalzo, J., & Barabási, A.-L. (2015) · Science · doi:10.1126/science.1257601 · Cited by 1,546 · cited 1×
“Network medicine aims to identify sets of genes associated with a specific disease [3], [4].”
Quantum computation and decision trees
Farhi, E., & Gutmann, S. (1998) · Physical Review A · doi:10.1103/physreva.58.915 · Cited by 1,215 · cited 2×
“Continuous-time quantum walks (CTQWs) were first introduced by Farhi and Gutmann in 1998 [10].”
Universal Computation by Quantum Walk
Childs, A. M. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.180501 · Cited by 1,002 · cited 1×
“In continuous-time quantum walks, both the adjacency matrix A and the graph Laplacian L have been proposed as generators of the quantum dynamics [21].”
Evaluation of clustering algorithms for protein-protein interaction networks
Brohée, S., & van Helden, J. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-488 · Cited by 892 · cited 1×
“Several studies, including [5], [6], [7], and [8], have focused on detecting communities The associate editor coordinating the review of this manuscript and approving it for publication was Siddhartha Bhattacharyya . of genes involved in the same biological processes or pathways.”
Exponential algorithmic speedup by a quantum walk
Childs, A. M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., & Spielman, D. A. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780552 · Cited by 825 · cited 1×
“For example, Childs et al. [11] demonstrated that certain problems solvable by CTQWs can achieve polynomial-time solutions where classical algorithms require subexponential time.”
Predicting disease genes using protein–protein interactions
Oti, M., Snel, B., Huynen, M. A., & Brunner, H. G. (2006) · Journal of Medical Genetics · doi:10.1136/jmg.2006.041376 · Cited by 574 · cited 1×
“Early approaches focused on exploring direct interactors of disease-associated proteins within a protein–protein interaction (PPI) network [9].”
Genome-wide inferring gene–phenotype relationship by walking on the heterogeneous network
Li, Y., & Patra, J. C. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq108 · Cited by 418 · cited 1×
“Most existing studies on network-based gene prioritization [16], [17] have employed classical random walks, leaving quantum random walks largely underexplored.”
Research works printed but not linked: 1
- Csárdi, 2006, The IGRAPH software package for complex network research, Inter. J. Complex Syst., 2006, 1695
Cited by
Ventrapragada, G. S., Narendrababu, A., & Sriramula, T. (2026) · IEEE International Conference on Sustainable Energy and Future Electric Transportation (SEFET) · doi:10.1109/sefet69291.2026.11687166
“It has been shown that chaotic, and quantum enhanced heuristic algorithms are effective in solving sensor network task allocation problems when the system is dynamic [16].”
Metadata
- Authors
- Revythi, M., Koukiou, G., & Anastassopoulos, V.
- Affiliations
- University of Patras (GR)
- Physics Department, Electronics Laboratory, University of Patras, Patras, Greece
- Venue
- IEEE Access
- Published
- 2025
- Volume
- 13
- Pages
- 212856-212866
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W4417438798
- Cited by
- 1
- References
- 40
- Citations by year
- 2026: 1
- FWCI
- 0.30
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- IEEE Access (publishedVersion, cc-by)
- Topics
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Bioinformatics and Genomic Networks
- Life Sciences › Pharmacology, Toxicology and Pharmaceutics › Drug Discovery › Computational Drug Discovery Methods
- Health Sciences › Medicine › Health Informatics › Biomedical Text Mining and Ontologies
- Keywords
- continuous-time quantum walks, disease gene prioritization, heterogeneous biological networks, gene-disease networks, quantum-inspired algorithms, disease gene discovery
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Continuous-Time Quantum Walk on Biological Network. https://app.cochat.ai/papers/10.1109/access.2025.3644962
- The paper
- Revythi, M., Koukiou, G., & Anastassopoulos, V. (2025). Continuous-Time Quantum Walk on Biological Network. IEEE Access. https://doi.org/10.1109/access.2025.3644962
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.