REVIEW 9 cited by
Quantum Graph Neural Networks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We introduce Quantum Graph Neural Networks (QGNN), a new class of quantum neural network ansatze which are tailored to represent quantum processes which have a graph structure, and are particularly suitable to be executed on distributed quantum systems over a quantum network. Along with this general class of ansatze, we introduce further specialized architectures, namely, Quantum Graph Recurrent Neural Networks (QGRNN) and Quantum Graph Convolutional Neural Networks (QGCNN). We provide four example applications of QGNNs: learning Hamiltonian dynamics of quantum systems, learning how to create multipartite entanglement in a quantum network, unsupervised learning for spectral clustering, and supervised learning for graph isomorphism classification.
Forward citations
Cited by 9 Pith papers
-
Pattern Formation in Quantum Hierarchical Cellular Neural Networks
Wick rotation of p-adic hierarchical CNNs produces nonlinear p-adic Schrödinger QNNs with graph discretizations, local solutions, and simulations of open-system pulse response and habituation.
-
Spectral Geometry and Bosonic-Bloch Probes: Explorations in Quantum Learning
Training reorganizes output similarity graphs in quantum networks, increasing spectral dimension by 0.23, with bosonic interference correlations and Bloch drift enabling high-ROC-AUC anomaly detection via a proposed s...
-
Feature Encoding in Quantum Machine Learning: A Survey and Practical Guidelines
Survey of quantum feature encoding families with a cost-expressivity-robustness taxonomy, closed-form NISQ bounds, and a five-regime decision framework that recommends shallow angle encodings when gate error rate p is...
-
Adaptive Bayesian Single-Shot Quantum Sensing
An adaptive Bayesian variational quantum sensing protocol selects probe and measurement settings by maximizing active information gain, demonstrated on a simulated sawtooth phase-tracking task.
-
Learnable quantum spectral filters for hybrid graph neural networks
A parameterized quantum Fourier circuit with graph-derived gate connections acts as a convolution plus pooling layer in a hybrid quantum-classical graph neural network, achieving benchmark accuracies comparable to som...
-
Feature Prediction in Quantum Graph Recurrent Neural Networks with Applications in Information Hiding
QGRNN can recover Hamiltonian node parameters that encode classical features, giving high reconstruction accuracy on a small set of Iris and MNIST samples, but the evaluation is per-sample fitting rather than true prediction.
-
Edge-Local and Qubit-Efficient Quantum Graph Learning for the NISQ Era
A qubit-efficient quantum graph architecture applies QAOA-style edge-local ZZ/XX operations one edge at a time, but its message-passing readout is unspecified and its main genomic result is evaluated against its own clusters.
-
Entanglement in Quantum Systems Based on Directed Graphs
For a class of graph states with commuting controlled-rotation gates, the Fubini-Study entanglement distance depends only on the vertex degree sequence, and this paper works out explicit formulas for four example grap...
-
Clique detection using symmetry-restricted quantum circuits
Permutation-invariant quantum circuits label cliques in small random graphs more accurately than cyclic-invariant or standard ansatze in simulation.
Discussion (0). Sign in to comment.