A quantum annealing approach to graph node embedding

• URL: http://arxiv.org/abs/2503.06332v1
• Date: Sat, 08 Mar 2025 20:11:55 GMT
• Title: A quantum annealing approach to graph node embedding
• Authors: Hristo N. Djidjev,
• Abstract summary: Node embedding is a key technique for representing graph nodes as vectors while preserving structural and relational properties.<n> classical methods such as DeepWalk, node2vec, and graph convolutional networks learn node embeddings by capturing structural and relational patterns in graphs.<n>Quantum computing provides a promising alternative for graph-based learning by leveraging quantum effects and introducing novel optimization approaches.
• Score: 1.0878040851638
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Node embedding is a key technique for representing graph nodes as vectors while preserving structural and relational properties, which enables machine learning tasks like feature extraction, clustering, and classification. While classical methods such as DeepWalk, node2vec, and graph convolutional networks learn node embeddings by capturing structural and relational patterns in graphs, they often require significant computational resources and struggle with scalability on large graphs. Quantum computing provides a promising alternative for graph-based learning by leveraging quantum effects and introducing novel optimization approaches. Variational quantum circuits and quantum kernel methods have been explored for embedding tasks, but their scalability remains limited due to the constraints of noisy intermediate-scale quantum (NISQ) hardware. In this paper, we investigate quantum annealing (QA) as an alternative approach that mitigates key challenges associated with quantum gate-based models. We propose several formulations of the node embedding problem as a quadratic unconstrained binary optimization (QUBO) instance, making it compatible with current quantum annealers such as those developed by D-Wave. We implement our algorithms on a D-Wave quantum annealer and evaluate their performance on graphs with up to 100 nodes and embedding dimensions of up to 5. Our findings indicate that QA is a viable approach for graph-based learning, providing a scalable and efficient alternative to previous quantum embedding techniques.

Related papers

• An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
  Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks. We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings. We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
  arXiv  Detail & Related papers  (2025-04-13T11:49:53Z)
• Inductive Graph Representation Learning with Quantum Graph Neural Networks [0.40964539027092917]
  Quantum Graph Neural Networks (QGNNs) present a promising approach for combining quantum computing with graph-structured data processing. We propose a versatile QGNN framework inspired by the classical GraphSAGE approach, utilizing quantum models as aggregators. We show that our quantum approach exhibits robust generalization across molecules with varying numbers of atoms without requiring circuit modifications.
  arXiv  Detail & Related papers  (2025-03-31T14:04:08Z)
• Tensor-Based Binary Graph Encoding for Variational Quantum Classifiers [3.5051814539447474]
  We propose a novel quantum encoding framework for graph classification using Variational Quantums (VQCs)<n>By constructing slightly more complex circuits tailored for graph encoding, we demonstrate that VQCs can effectively classify graphs within the constraints of current quantum hardware.
  arXiv  Detail & Related papers  (2025-01-24T02:26:21Z)
• Quantum Positional Encodings for Graph Neural Networks [1.9791587637442671]
  We propose novel families of positional encodings tailored to graph neural networks obtained with quantum computers. Our inspiration stems from the recent advancements in quantum processing units, which offer computational capabilities beyond the reach of classical hardware.
  arXiv  Detail & Related papers  (2024-05-21T17:56:33Z)
• Quantum Graph Optimization Algorithm [7.788671046805509]
  This study introduces a novel variational quantum graph optimization algorithm that integrates the message-passing mechanism. In terms of scalability on QUBO tasks, our algorithm shows superior performance compared to QAOA.
  arXiv  Detail & Related papers  (2024-04-09T16:25:07Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• 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)
• From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
  We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions. For its practicability and wide-applicability, we give a brief review of typical graph learning techniques. We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
  arXiv  Detail & Related papers  (2022-02-19T02:56:47Z)
• Benchmarking Small-Scale Quantum Devices on Computing Graph Edit Distance [52.77024349608834]
  Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical. In this paper we present a comparative study of two quantum approaches to computing GED.
  arXiv  Detail & Related papers  (2021-11-19T12:35:26Z)
• ORQVIZ: Visualizing High-Dimensional Landscapes in Variational Quantum Algorithms [51.02972483763309]
  Variational Quantum Algorithms (VQAs) are promising candidates for finding practical applications of quantum computers. This work is accompanied by the release of the open-source Python package $textitorqviz$, which provides code to compute and flexibly plot 1D and 2D scans.
  arXiv  Detail & Related papers  (2021-11-08T18:17:59Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)

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.