QSearchNet: A Quantum Walk Search Framework for Link Prediction
- URL: http://arxiv.org/abs/2510.00325v1
- Date: Tue, 30 Sep 2025 22:32:34 GMT
- Title: QSearchNet: A Quantum Walk Search Framework for Link Prediction
- Authors: Priyank Dubey,
- Abstract summary: Link prediction is one of the fundamental problems in graph theory.<n>Quantum computing offers a powerful alternative by leveraging superposition for simultaneous multi-path exploration.<n>QSearchNet simulates a topology-aware quantum evolution to propagate amplitudes across multiple nodes simultaneously.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Link prediction is one of the fundamental problems in graph theory, critical for understanding and forecasting the evolution of complex systems like social and biological networks. While classical heuristics capture certain aspects of graph topology, they often struggle to optimally integrate local and global structural information or adapt to complex dependencies. Quantum computing offers a powerful alternative by leveraging superposition for simultaneous multi-path exploration and interference-driven integration of both local and global graph features. In this work, we introduce QSearchNet, a quantum-inspired framework based on Discrete-Time Quantum Walk (DTQW) dynamics and Grover's amplitude amplification. QSearchNet simulates a topology-aware quantum evolution to propagate amplitudes across multiple nodes simultaneously. By aligning interference patterns through quantum reflection and oracle-like phase-flip operation, it adaptively prioritizes multi-hop dependencies and amplifies structurally relevant paths corresponding to potential connections. Experiments on diverse real-world networks demonstrate competitive performance, particularly with hard negative samples under realistic evaluation conditions.
Related papers
- Direct Equivalence between Dynamics of Quantum Walks and Coupled Classical Oscillators [0.0]
Continuous time quantum walks on exponentially large, sparse graphs form a powerful paradigm for quantum computing.<n>In this work, we establish a direct and transparent mapping between these two classes of problems.
arXiv Detail & Related papers (2025-12-03T11:20:52Z) - Network theory classification of quantum matter based on wave function snapshots [0.0025655761752240496]
We develop a theoretical framework to link quantum phases of matter to their snapshots, based on a combination of data complexity and network theory analyses.<n>Our framework is of immediate experimental relevance, and can be further extended both in terms of more advanced network mathematics.
arXiv Detail & Related papers (2025-12-01T19:00:04Z) - InterQnet: A Heterogeneous Full-Stack Approach to Co-designing Scalable Quantum Networks [6.4884341485131545]
InterQnet-Achieve focuses on practical realizations of heterogeneous quantum networks.<n>InterQnet-Scale focuses on a systems study of architectural choices for scalable quantum networks.
arXiv Detail & Related papers (2025-09-23T19:22:45Z) - Quantum Graph Attention Network: A Novel Quantum Multi-Head Attention Mechanism for Graph Learning [0.0]
Quantum Graph Attention Network (QGAT) is a hybrid graph neural network that integrates variational quantum circuits into the attention mechanism.<n>We show QGAT's effectiveness in capturing complex structural dependencies and improved generalization in inductive scenarios.<n>Experiments confirm that quantum embedding enhances robustness against feature and structural noise, suggesting advantages in handling real-world noisy data.
arXiv Detail & Related papers (2025-08-25T03:25:48Z) - Quantum-Accelerated Wireless Communications: Concepts, Connections, and Implications [59.0413662882849]
Quantum computing is poised to redefine the algorithmic foundations of communication systems.<n>This article outlines the fundamentals of quantum computing in a style familiar to the communications society.<n>We highlight a mathematical harmony between quantum and wireless systems, which makes the topic more enticing to wireless researchers.
arXiv Detail & Related papers (2025-06-25T22:25:47Z) - VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
arXiv Detail & Related papers (2025-06-12T01:38:15Z) - Effective Modeling of Open Quantum Systems by Low-rank Discretization of Structured Environments [0.0]
We pioneer a new strategy to create discrete low-rank models of the system-environment interaction.
We demonstrate the effectiveness of our methodology by combining it with tensor-network methodologies.
The new modeling framework sets the basis for a leap in the analysis of open quantum systems.
arXiv Detail & Related papers (2024-07-26T17:27:09Z) - Quantum algorithms: A survey of applications and end-to-end complexities [88.57261102552016]
The anticipated applications of quantum computers span across science and industry.<n>We present a survey of several potential application areas of quantum algorithms.<n>We outline the challenges and opportunities in each area in an "end-to-end" fashion.
arXiv Detail & Related papers (2023-10-04T17:53:55Z) - QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional
Networks [124.7972093110732]
We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations.
To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections.
Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
arXiv Detail & Related papers (2022-11-09T21:43:16Z) - Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks.
Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts.
We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
arXiv Detail & Related papers (2021-06-11T18:00:09Z) - Experimental Quantum Generative Adversarial Networks for Image
Generation [93.06926114985761]
We experimentally achieve the learning and generation of real-world hand-written digit images on a superconducting quantum processor.
Our work provides guidance for developing advanced quantum generative models on near-term quantum devices.
arXiv Detail & Related papers (2020-10-13T06:57:17Z)
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.