Quantum AI Report

The convergence of Quantum with AI

Archived edition

7 September 2026

Lead story

Quantum Graph Neural Networks for Jet Tagging on Quantum Hardware

arXiv quant-ph

A preprint on arXiv reports a study applying quantum graph neural networks to jet classification, motivated by jet measurements at the Large Hadron Collider and the future Electron-Ion Collider. The authors explore quantum machine learning methods for jet tagging and present an implementation intended to run on quantum hardware.

Why it matters

Jet tagging is a core classification task in collider physics, where classical graph neural networks have become the state of the art. Quantum GNNs offer a potential route to encode graph-structured particle data in quantum states and perform message passing through parameterized circuits. This work moves quantum ML for high-energy physics from noise-free simulations toward hardware execution, testing whether current devices can support graph-based classifiers. It also creates a benchmark for comparing quantum and classical approaches on a task with real scientific value, where the classical baseline is strong and well understood.

AI analysis — not reported by the source

What this could make possible

0–2 years

  • Plausible

    This preprint could become a reference benchmark for quantum GNN jet tagging on small datasets, with follow-up papers testing variations in encoding and circuit depth across cloud-accessible quantum processors.

    The HEP-ML community frequently builds on open datasets like JetNet and iterates on arXiv preprints. If the code and data are released, near-term reproductions and incremental improvements are likely as groups compete to show gains on the same task.

2–5 years

  • Plausible

    If efficient graph encoding and error mitigation can be combined, quantum GNNs might reach parity with shallow classical GNNs for specific jet substructure tasks within 2-5 years, though not yet outperform them.

    Classical GNNs are highly optimized and quantum hardware remains constrained by qubit counts, connectivity, and noise. Parity would require overcoming encoding overhead and demonstrating that quantum message passing adds representational capacity beyond classical approximations on real data.

  • Speculative

    Quantum GNNs could be used as a subroutine in hybrid classical-quantum analysis pipelines at LHC experiments, handling a subset of jet graph operations where quantum kernels or pooling provide an edge.

    Trigger and offline analysis already use heterogeneous computing. A quantum coprocessor could be integrated if latency and throughput improve, but this remains gated on hardware speed, reliability, and the existence of a clear quantum advantage for a sub-task.

5+ years

  • Speculative

    With fault-tolerant quantum computing and a large number of logical qubits, quantum GNNs may enable processing of jet graphs with feature dimensions or connectivity that are infeasible for classical GNNs, potentially changing how detector data is represented.

    Any exponential advantage would depend on results in quantum linear algebra for graph operations and on fault-tolerant resource estimates that are not yet demonstrated. Classical algorithmic advances could also close the gap before quantum hardware matures.

What would have to be true

  • An encoding scheme that maps variable-size jet constituent graphs to quantum states without pushing classical preprocessing costs beyond the cost of classical GNN inference.
  • Quantum hardware with sufficiently low error rates, high connectivity, and enough qubits to represent realistic jet graphs, or an effective error mitigation strategy that preserves trainability.
  • Reproducible, hardware-agnostic open-source implementation and datasets so that independent groups can benchmark against strong classical baselines.
  • Evidence that quantum GNN training does not suffer from barren plateaus or exponential concentration in the relevant parameter regimes.

Who’s positioned

  • IBM QuantumProvides cloud-accessible superconducting quantum processors and Qiskit tooling that HEP collaborations already use. This work could drive demand for hardware access and noise-aware compilation.
  • IonQTrapped-ion processors offer high-fidelity gates and all-to-all connectivity that may be well suited to graph-structured circuits, positioning them for QML workloads if encoding overhead is manageable.
  • CERN / LHC experiments (ATLAS, CMS)Could adopt quantum GNN approaches as exploratory algorithms for jet tagging, especially as part of their quantum computing R&D programs. Early work helps build in-house expertise.
  • Brookhaven National Laboratory / Jefferson LabElectron-Ion Collider physics programs need jet classification for nucleon structure studies. This work could inform future EIC software and quantum computing collaborations.

What could change this

  • Whether the quantum GNN implementation actually relies on quantum hardware for the reported results or uses classical simulation with hardware demonstrations only for small instances.
  • The scalability of graph state preparation with respect to the number of jet constituents and the dimensionality of detector features.
  • The possibility that classical GNNs with comparable parameter counts already saturate performance, leaving no room for quantum advantage.
  • Differences in qubit connectivity, gate fidelity, and transpilation across hardware backends could make results non-transferable.
  • Whether error mitigation techniques used in the study hide the true cost of running quantum circuits at scale.
Permalink to this story →699 words · 4 possibilities

Superconducting

The Quantum Insider

NEC Halts Development of Quantum Computer Hardware

NEC has decided to halt development of quantum computer hardware, according to The Quantum Insider. The move shifts NEC away from building its own quantum computer systems.

OutlookPlausible

NEC could pivot to quantum software, integration, and managed services, using third-party quantum hardware to serve its existing enterprise customers.

Neutral Atom

arXiv quant-ph

Efficient Quantum Error Correction from Three Dimensional Qubit Control

A preprint studies the [[144,12,12]] bivariate bicycle qLDPC code on a neutral-atom architecture with native three-dimensional qubit control. It examines how the platform's 3D geometry could handle the code's nonlocal syndrome extraction, which is the main barrier to realizing its lower qubit overhead relative to surface codes. The work compares this approach to existing methods.

OutlookPlausible

If the study identifies a viable 3D syndrome extraction schedule, neutral-atom platforms could attempt a 12-logical-qubit qLDPC demonstration within two years.

Spin Qubit / Silicon

arXiv quant-ph

Learning Hamiltonians for solid-state quantum simulators

A preprint introduces an unsupervised autoencoder method for extracting effective Hamiltonians directly from experimental data taken on solid-state quantum simulators. The decoder is constrained by scattering-matrix physics, so the inferred model parameters are meant to represent physically meaningful Hamiltonian terms rather than arbitrary features. The authors present the approach as a generalizable framework for Hamiltonian identification in these systems.

OutlookPlausible

If the physics-constrained autoencoder performs well on noisy transport or spectroscopy data, spin-qubit groups could replace manual Hamiltonian characterization with a single learned calibration pass within two years.

Error Correction

arXiv quant-ph

A Sim-to-Real Study of Surface-Code Decoder Benchmarking

A new benchmarking study tests whether surface-code decoder rankings derived from simulated noise models hold on real quantum hardware. It uses Google's Willow processor, a device that has operated below the surface-code error-correction threshold, as the hardware testbed.

OutlookPlausible

If decoder rankings transfer from simulation to Willow-class hardware, error-correction teams could select and optimise surface-code decoders largely in simulation, reducing the need for repeated on-device benchmarking during early logical qubit experiments.

arXiv quant-ph

Learning unknown stabilizer codes using product measurements

Researchers have introduced an algorithm for learning the stabilizer generators of an unknown stabilizer code using random single-qubit measurements. The method is aimed at improving the characterization of quantum error-correcting codes, which is needed for fault-tolerant quantum computation.

OutlookPlausible

If the algorithm performs as claimed, it could enable experimental groups to verify and debug stabilizer codes using only product measurements, simplifying the characterization of logical qubits on current hardware.

Algorithms & Software

arXiv quant-ph

Shapley Valuation of Finite-Copy Quantum Data Depends on Physical Access

A preprint on arXiv introduces a Shapley-based framework for valuing finite-copy quantum data used in learning tasks. It contrasts quantum data with classical records, noting that quantum states are consumable physical systems and their readout is not a fixed reusable resource. The paper argues that the same supplied quantum states can have different learning value depending on the physical access protocol.

OutlookPlausible

This valuation framework could let early quantum data marketplaces price finite-copy quantum states in a way that reflects the physical access protocol, not just the state's abstract information content.

arXiv quant-ph

Quantum Kolmogorov--Arnold representation theorem for continuous unitary-valued maps

A preprint on arXiv introduces a quantum analogue of the Kolmogorov–Arnold representation theorem, extending the classical decomposition of continuous multivariate functions to maps whose outputs are unitary operators. The work is framed as a theoretical foundation for quantum versions of Kolmogorov–Arnold Networks in machine learning.

OutlookSpeculative

A quantum KAN layer could be constructed for variational quantum circuits using simple univariate operations, potentially reducing parameter counts and optimization difficulty for near-term quantum machine learning models.

arXiv quant-ph

Impact of Data Loss in Postprocessing on Training and Inference of Quantum Neural Networks

An arXiv paper examines how classical postprocessing routines developed for quantum simulators can fail on utility-scale hardware, causing information from measurements to be lost. It argues that assumptions encoded in those routines may no longer hold at larger device sizes, and that the resulting data loss is difficult to detect from high-level model outputs. The focus is on how this affects training and inference for quantum neural networks.

OutlookPlausible

Postprocessing diagnostics could become a standard pre-check in near-term quantum neural network pipelines, flagging measurement data loss before it distorts training and inference results.

arXiv quant-ph

SAR and InSAR Change Detection with Quantum Generative Models

A new arXiv preprint proposes using quantum generative models to improve background estimation for change detection in SAR and InSAR imagery. The authors contend that conventional estimators based on conditional expectations of pixel statistics degrade in difficult conditions. The abstract does not report experimental results, only the approach.

OutlookSpeculative

Within two years, this work could produce benchmark comparisons showing whether quantum generative models outperform classical background estimators on small SAR/InSAR change-detection datasets.