Link prediction with swarms of chiral quantum walks

• URL: http://arxiv.org/abs/2511.14513v1
• Date: Tue, 18 Nov 2025 14:10:45 GMT
• Title: Link prediction with swarms of chiral quantum walks
• Authors: Gaia Forghieri, Viacheslav Dubovitskii, Matteo A. C. Rossi, Matteo G. A. Paris,
• Abstract summary: Reconstructing protein-protein interaction networks is a central challenge in network medicine.<n>Recent studies suggest that quantum walk-based approaches hold promise for this task.<n>We build on these algorithms by introducing chirality through the addition of random phases in the Hamiltonian generators.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Reinforcement Learning for Quantum Network Control with Application-Driven Objectives [53.03367590211247]
  Dynamic programming and reinforcement learning offer promising tools for optimizing control strategies.<n>We propose a novel RL framework that directly optimize non-linear, differentiable objective functions.<n>Our work comprises the first step towards non-linear objective function optimization in quantum networks with RL, opening a path towards more advanced use cases.
  arXiv  Detail & Related papers  (2025-09-12T18:41:10Z)
• Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
  Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
  arXiv  Detail & Related papers  (2025-05-24T02:51:34Z)
• QAMA: Scalable Quantum Annealing Multi-Head Attention Operator for Deep Learning [48.12231190677108]
  Quantum Annealing Multi-Head Attention (QAMA) is proposed, a novel drop-in operator that reformulates attention as an energy-based Hamiltonian optimization problem.<n>In this framework, token interactions are encoded into binary quadratic terms, and quantum annealing is employed to search for low-energy configurations.<n> Empirically, evaluation on both natural language and vision benchmarks shows that, across tasks, accuracy deviates by at most 2.7 points from standard multi-head attention.
  arXiv  Detail & Related papers  (2025-04-15T11:29:09Z)
• Complex-Phase Extensions of Szegedy Quantum Walk on Graphs [0.0]
  This work introduces a graph-phased Szegedy's quantum walk, which incorporates link phases and local arbitrary phase rotations (APR)<n>We demonstrate how to adapt quantum circuits to these advancements, allowing phase patterns that ensure computational practicality.<n>Our findings illuminate the path towards more versatile and powerful quantum computing paradigms.
  arXiv  Detail & Related papers  (2024-10-29T12:57:31Z)
• Spectral chaos bounds from scaling theory of maximally efficient quantum-dynamical scrambling [44.99833362998488]
  A key conjecture about the evolution of complex quantum systems towards an ergodic steady state, known as scrambling, is that this process acquires universal features when it is most efficient.<n>We develop a single- parameter scaling theory for the spectral statistics in this scenario, which embodies exact self-similarity of the spectral correlations along the complete scrambling dynamics.<n>We establish that scaling predictions are matched by a privileged process and serve as bounds for other dynamical scrambling scenarios, allowing one to quantify inefficient or incomplete scrambling on all time scales.
  arXiv  Detail & Related papers  (2023-10-17T15:41:50Z)
• On-the-fly Tailoring towards a Rational Ansatz Design for Digital Quantum Simulations [0.0]
  It is imperative to develop low depth quantum circuits that are physically realizable in quantum devices. We develop a disentangled ansatz construction protocol that can dynamically tailor an optimal ansatz. The construction of the ansatz may potentially be performed in parallel quantum architecture through energy sorting and operator commutativity prescreening.
  arXiv  Detail & Related papers  (2023-02-07T11:22:01Z)
• Exploring the role of parameters in variational quantum algorithms [59.20947681019466]
  We introduce a quantum-control-inspired method for the characterization of variational quantum circuits using the rank of the dynamical Lie algebra. A promising connection is found between the Lie rank, the accuracy of calculated energies, and the requisite depth to attain target states via a given circuit architecture.
  arXiv  Detail & Related papers  (2022-09-28T20:24:53Z)
• Scalable neural quantum states architecture for quantum chemistry [5.603379389073144]
  Variational optimization of neural-network representations of quantum states has been successfully applied to solve interacting fermionic problems. We introduce scalable parallelization strategies to improve neural-network-based variational quantum Monte Carlo calculations for ab-initio quantum chemistry applications.
  arXiv  Detail & Related papers  (2022-08-11T04:40:02Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
  We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
  arXiv  Detail & Related papers  (2021-03-05T08:32:43Z)
• Noise-Robust End-to-End Quantum Control using Deep Autoregressive Policy Networks [2.5946789143276447]
  Variational quantum eigensolvers have recently received increased attention, as they enable the use of quantum computing devices. We present a hybrid policy gradient algorithm capable of simultaneously optimizing continuous and discrete degrees of freedom in an uncertainty-resilient way. Our work exhibits the beneficial synergy between reinforcement learning and quantum control.
  arXiv  Detail & Related papers  (2020-12-12T02:13:28Z)
• Autoregressive Transformer Neural Network for Simulating Open Quantum Systems via a Probabilistic Formulation [5.668795025564699]
  We present an approach for tackling open quantum system dynamics. We compactly represent quantum states with autoregressive transformer neural networks. Efficient algorithms have been developed to simulate the dynamics of the Liouvillian superoperator.
  arXiv  Detail & Related papers  (2020-09-11T18:00:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.