Attributed-graphs kernel implementation using local detuning of neutral-atoms Rydberg Hamiltonian
read the original abstract
We extend the quantum-feature kernel framework, which relies on measurements of graph-dependent observables, along three directions. First, leveraging neutral-atom quantum processing units (QPUs), we introduce a scheme that incorporates attributed graphs by embedding edge features into atomic positions and node features into local detuning fields of a Rydberg Hamiltonian. We demonstrate both theoretically and empirically that local detuning enhances kernel expressiveness. Second, in addition to the existing quantum evolution kernel (QEK), which uses global observables, we propose the generalized-distance quantum-correlation (GDQC) kernel, based on local observables. While the two kernels show comparable performance, we show that GDQC can achieve higher expressiveness. Third, instead of restricting to observables at single time steps, we combine information from multiple stages of the quantum evolution via pooling operations. Using extensive simulations on two molecular benchmark datasets, MUTAG and PTC\_FM, we find: (a) QEK and GDQC perform competitively with leading classical algorithms; and (b) pooling further improves performance, enabling quantum-feature kernels to surpass classical baselines. These results show that node-feature embedding and kernel designs based on local observables advance quantum-enhanced graph machine learning on neutral-atom devices.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
QuIC: A Training-Free Quantum Graph Embedding from Ideal Analysis to Practical Hardware Evaluation
QuIC provides a training-free quantum graph embedding proven permutation-invariant and injective for labeled graphs under an irrational-angle condition in the ideal case, with empirical separation shown on noisy hardw...
-
Noise-enhanced quantum kernels on analog quantum computers
Analog quantum kernels with operational noise outperform noiseless versions in benchmarking and non-Markovianity estimation due to increased expressivity and model complexity.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.