QGHNN: A quantum graph Hamiltonian neural network
Wenxuan Wang

TL;DR
This paper introduces QGHNN, a quantum graph Hamiltonian neural network that leverages quantum Hamiltonian learning to improve graph representation and learning on noisy quantum computers, outperforming existing methods.
Contribution
It proposes a novel quantum graph Hamiltonian neural network (QGHNN) with a quantum graph Hamiltonian learning method (QGHL) for enhanced graph learning on noisy quantum devices.
Findings
QGHNN achieves the lowest mean squared error of 0.004
QGHNN attains 99.8% maximum cosine similarity
QGHNN demonstrates high robustness and potential for quantum graph applications
Abstract
Representing and learning from graphs is essential for developing effective machine learning models tailored to non-Euclidean data. While Graph Neural Networks (GNNs) strive to address the challenges posed by complex, high-dimensional graph data, Quantum Neural Networks (QNNs) present a compelling alternative due to their potential for quantum parallelism. However, much of the current QNN research tends to overlook the vital connection between quantum state encoding and graph structures, which limits the full exploitation of quantum computational advantages. To address these challenges, this paper introduces a quantum graph Hamiltonian neural network (QGHNN) to enhance graph representation and learning on noisy intermediate-scale quantum computers. Concretely, a quantum graph Hamiltonian learning method (QGHL) is first created by mapping graphs to the Hamiltonian of the topological…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Advanced Thermodynamics and Statistical Mechanics · Quantum and electron transport phenomena
