Quick Navigation
Topics
Trapped Ion Quantum Computing
Link prediction with swarms of chiral quantum walks
arXiv
Authors: Gaia Forghieri, Viacheslav Dubovitskii, Matteo A. C. Rossi, Matteo G. A. Paris
Year
2025
Paper ID
16980
Status
Preprint
Abstract Read
~2 min
Abstract Words
191
Citations
N/A
Abstract
Reconstructing protein-protein interaction networks is a central challenge in network medicine, often addressed using link prediction algorithms. Recent studies suggest that quantum walk-based approaches hold promise for this task. In this paper, we build on these algorithms by introducing chirality through the addition of random phases in the Hamiltonian generators. The resulting additional degrees of freedom enable a more diverse exploration of the network, which we exploit by employing a swarm of chiral quantum walks. Thus, we enhance the predictive power of quantum walks on complex networks. Indeed, compared to a non-chiral algorithm, the chiral version exhibits greater robustness, making its performance less dependent on the optimal evolution time--a critical hyperparameter of the non-chiral model. This improvement arises from complementary dynamics introduced by chirality within the swarm. By analyzing multiple phase-sampling strategies, we identify configurations that achieve a practical trade-off: retaining the high predictive accuracy of the non-chiral algorithm at its optimal time while gaining the robustness typical of chirality. Our findings highlight the versatility of chiral quantum walks and their potential to outperform both classical and non-chiral quantum methods in realistic scenarios, including comparisons between successive versions of evolving databases.
Why This Paper Matters
- This paper contributes to the Trapped-Ion Quantum Computing research area in the Quantum Articles archive.
- It adds a 2025 reference point for readers tracking recent quantum research.
- Reconstructing protein-protein interaction networks is a central challenge in network medicine, often addressed using link prediction algorithms.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.