QuIC: A Training-Free Quantum Graph Embedding from Ideal Analysis to Practical Hardware Evaluation
Luke Miller, Yugyung Lee

TL;DR
QuIC introduces a training-free quantum graph embedding method that maps graphs to distributions, demonstrating theoretical completeness and practical effectiveness on hardware with noise and resource constraints.
Contribution
The paper presents a novel fixed-parameter quantum embedding technique with proven permutation-invariance and injectivity, and evaluates its performance on real quantum hardware.
Findings
The embedding is permutation-invariant and injective under ideal conditions.
Fixed-length truncation retains discriminative power in practical regimes.
Empirical separation achieved up to 66 qubits on IBM hardware.
Abstract
We introduce QuIC, a training-free quantum graph embedding that maps graphs to sorted output distributions via a fixed parameterized circuit. In the ideal one-repetition setting, we prove that the resulting sorted distribution is permutation-invariant and injective on labeled graphs under an irrational-angle condition, yielding completeness on isomorphism classes for the ideal one-repetition exact-arithmetic embedding. We then use those ideal structural properties to motivate a practical embedding pipeline and study how much of that behavior survives under finite-shot estimation, truncation, realistic noise, transpilation, and hardware execution. The sorted distribution concentrates discriminative signal in a compact head, making fixed-length head truncation an effective practical operating point in the tested regimes. Under noise-model simulation, all tested graph pairs satisfied the…
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.
