Pith. sign in

REVIEW 1 cited by

Towards Quantum Graph Neural Networks: An Ego-Graph Learning Approach

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

arxiv 2201.05158 v3 pith:LILC3ZKG submitted 2022-01-13 quant-ph cs.LG

classification quant-phcs.LG
keywords quantumdataegoqgnngraphlearningspaceego-graphhilbert
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Quantum machine learning is a fast-emerging field that aims to tackle machine learning using quantum algorithms and quantum computing. Due to the lack of physical qubits and an effective means to map real-world data from Euclidean space to Hilbert space, most of these methods focus on quantum analogies or process simulations rather than devising concrete architectures based on qubits. In this paper, we propose a novel hybrid quantum-classical algorithm for graph-structured data, which we refer to as the Ego-graph based Quantum Graph Neural Network (egoQGNN). egoQGNN implements the GNN theoretical framework using the tensor product and unity matrix representation, which greatly reduces the number of model parameters required. When controlled by a classical computer, egoQGNN can accommodate arbitrarily sized graphs by processing ego-graphs from the input graph using a modestly-sized quantum device. The architecture is based on a novel mapping from real-world data to Hilbert space. This mapping maintains the distance relations present in the data and reduces information loss. Experimental results show that the proposed method outperforms competitive state-of-the-art models with only 1.68\% parameters compared to those models.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Edge-Local and Qubit-Efficient Quantum Graph Learning for the NISQ Era

    quant-ph 2026-02 reject novelty 4.0 of 10

    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.

Pith tools