The research team, led by Christopher P. Fulton of the United States Air Force Test Pilot School alongside Irene Tsapara of National University and Lawrence V. Fulton of Boston College, designed a controlled comparison in which real-valued, quaternion-valued, and quantum classification heads all operated on identical frozen feature representations. By holding the upstream representation fixed across every model family, the study isolates the contribution of the classifier itself, stripping away the confounds that have plagued earlier comparisons between quantum and classical approaches. The benchmarks spanned MNIST, FashionMNIST, and CIFAR-10, with the CIFAR-10 experiments run under two distinct feature regimes — a learned 16-dimensional bottleneck and frozen ImageNet-pretrained ResNet18 features — to separate architectural effects from representation quality.

The core idea behind the comparison is mathematically elegant. Quaternion-valued neural networks and variational quantum circuits both derive their local transformations from SU(2) geometry, the group of two-by-two unitary matrices with determinant one that describes rotations in three-dimensional space and, in quantum mechanics, the evolution of single qubits. A quaternion encodes such a rotation with four real numbers, and layers built from quaternion multiplications can be interpreted as chains of these same local rotations that quantum gates perform. If shallow quantum circuits draw their expressive power from this shared geometry, the reasoning goes, then classical quaternion networks should be able to replicate that power without the overhead of state-vector simulation or real quantum hardware.

That is precisely what the experiments found. On MNIST and FashionMNIST, quaternion networks achieved near-equivalence with real-valued multilayer perceptrons, while product-state variational quantum circuits — circuits whose qubits remain unentangled throughout — exhibited both lower accuracy and substantially higher computational cost. The gap was not marginal. Post-hoc statistical analysis of the five-seed MNIST evaluation using a Friedman test provided strong evidence of a non-random model ordering, with a chi-squared statistic of 12.796 and a p-value of 0.0051. Wilcoxon signed-rank tests comparing QuatNet against every quantum model yielded effect sizes exceeding five, a magnitude that signals an overwhelming practical difference rather than statistical noise.

On the harder CIFAR-10 benchmark, quaternion networks retained 94 to 97 percent of real-valued performance across both feature regimes and remained remarkably stable when the feature dimensionality was increased thirty-two-fold. That stability matters for practitioners: a classifier that degrades gracefully as representations grow is far more deployable than one that requires careful retuning at every scale. The product-state quantum circuits, by contrast, underperformed the quaternion classifiers across every benchmark tested, suggesting that whatever advantage shallow SU(2) rotations confer, they can be captured just as effectively — and far more cheaply — by classical quaternion arithmetic.

Perhaps the most provocative finding concerns entanglement, the resource most often cited as the source of quantum advantage. In this study, entanglement provided only modest gains on the grayscale datasets, MNIST and FashionMNIST, and the effect actually reversed under pretrained CNN features, where the entangling circuit suffered a 9.25 percentage-point degradation relative to the product-state circuit. For a field that has long treated entanglement as a proxy for expressive power, the result is a pointed reminder that more quantum structure does not automatically translate into better learning, particularly when the underlying data carries no intrinsic quantum signature.

The team also examined whether quantum-inspired optimization could rescue the circuits’ performance. Fubini–Study and quantum Fisher information natural-gradient methods — sophisticated techniques that exploit the geometry of quantum state space to steer training — did improve geometric alignment, but they did not materially improve short-horizon loss reduction relative to the standard Adam optimizer. In other words, even when the quantum models were trained the ‘right’ way, according to their own native geometry, they failed to close the accuracy gap with their classical quaternion competitors.

For the FashionMNIST and CIFAR-10 evaluations, where only three random seeds were used, the authors relied on large effect sizes — all exceeding 2.0 — as the primary inferential statistic, a pragmatic choice that acknowledges the expense of quantum circuit simulation while still quantifying the magnitude of the differences observed. The pattern held across all datasets and all feature regimes: quaternion networks matched or approached real-valued baselines, and quantum circuits lagged behind both.

The authors are careful to bound their conclusions. The findings apply specifically to shallow, measurement-limited variational circuits operating on classical image-classification tasks without intrinsic quantum structure. They do not rule out quantum advantage on problems with genuine quantum data, deeper circuits beyond current hardware capabilities, or feature spaces engineered to encode quantum correlations. But within the regime studied, the message is clear: shared local SU(2) geometry and shallow entanglement are not sufficient to confer practical quantum advantage on classical vision tasks.

The implications ripple well beyond the benchmarks. As research groups worldwide invest in hybrid quantum-classical pipelines, this study offers a disciplined template for asking whether the quantum component is pulling its weight — and a warning that classical models exploiting the same mathematical structure may be waiting in the wings. Quaternions, discovered by William Rowan Hamilton in 1843 and long confined to aerospace rotation sequences and computer graphics, may turn out to be the quiet classical workhorses that quantum machine learning must first outrun. On the evidence presented here, that race has not even begun.

Subject of Research: A controlled comparison of quaternion-valued neural networks and shallow variational quantum circuits on classical image classification benchmarks

Article Title: Classical (\textrm{SU}(2)) models match or exceed shallow variational quantum circuits on vision benchmarks

Article References: Fulton, C. P., Tsapara, I., & Fulton, L. V. (2026). Classical $$\textrm{SU}(2)$$ models match or exceed shallow variational quantum circuits on vision benchmarks. Quantum Machine Intelligence, 8(2), Article 93. https://doi.org/10.1007/s42484-026-00430-4

Image Credits: AI Generated

DOI: 10.1007/s42484-026-00430-4

Keywords: quaternion neural networks, variational quantum circuits, SU(2) geometry, quantum machine learning, CIFAR-10, MNIST, FashionMNIST, entanglement, natural gradient, barren plateaus, hybrid quantum-classical computing, image classification

The review, titled From graphs to qubits: a critical review of quantum graph neural networks, surveys the emerging field of Quantum Graph Neural Networks, or QGNNs, architectures that fuse the relational power of graph neural networks with the principles of quantum computation. Quantum computers manipulate qubits, which unlike classical bits can exist in superpositions of zero and one, and can become entangled so that the state of one qubit cannot be described independently of another. An n-qubit register lives in a Hilbert space spanned by all 2-to-the-n possible bit strings, an exponentially large arena that quantum algorithms can, in principle, exploit. The authors argue that this richness could offer graph learning a fundamentally different feature map, one capable of encoding complex topological relationships in ways that are hard for classical methods to reach.

But the quantum path is constrained by reality. Today’s machines are Noisy Intermediate-Scale Quantum devices, a term coined by John Preskill to describe processors with limited qubit counts, shallow circuit depths and pervasive noise. The dominant pragmatic approach on such hardware is the variational quantum circuit, in which a parameterized quantum circuit encodes data, evolves it under trainable rotations and entangling gates, and is measured repeatedly, with a classical optimizer updating the parameters in an iterative loop. The choice of data encoding matters enormously: angle encoding maps each feature to a rotation angle and is hardware-friendly but requires operations proportional to the number of features, while amplitude encoding compresses a d-dimensional vector into only log d qubits, yet preparing an arbitrary amplitude-encoded state can still cost O(d) operations. The review stresses that qubit efficiency does not automatically translate into end-to-end speedup, because state preparation, measurement shots and classical optimization all consume the budget.

To bring order to a fragmented literature, the authors propose a three-way taxonomy. Fully Quantum GNNs perform every processing stage in the quantum domain, encoding graph structure directly into Hamiltonian dynamics; they are conceptually elegant but severely limited by noise and qubit scarcity. Hybrid Quantum-GNNs embed quantum operations inside the core learning mechanism itself, implementing message passing, aggregation or graph convolution through parameterized circuits, while classical layers handle the rest. Quantum-Assisted GNNs keep the graph network entirely classical and use quantum modules only externally, for preprocessing, feature transformation or downstream classification. The distinction, the authors emphasize, is functional rather than merely architectural: the key question is not whether a quantum circuit is present, but whether it participates in the graph-learning operation or merely assists it.

The field’s founding idea came in 2019, when Verdon and colleagues introduced QGNNs inspired by the Quantum Approximate Optimization Algorithm. Their general ansatz applies a sequence of parameterized Hamiltonian evolutions whose interaction topology mirrors the problem graph, with each node of the graph associated with a quantum subsystem. From this seed, the review traces several branches: quantum recurrent GNNs that tie parameters across time steps to model temporal dependencies, quantum convolutional GNNs that enforce permutation invariance and globally shared Hamiltonian parameters, quantum time-series convolutional models that use the Schrödinger equation to capture periodic temporal dynamics, and equivariant quantum graph circuits that preserve symmetry under node permutation. One notable construction, the Equivariantly Diagonalizable Unitary circuit, can approximate any real-valued function on bounded graphs and passes the 1-Weisfeiler-Lehman test, outperforming classical message-passing networks in expressive power, at least in theory.

The applications surveyed span strikingly diverse territory. In high-energy physics, hybrid quantum-classical networks have been applied to jet tagging and particle track reconstruction at the Large Hadron Collider, where the upcoming High-Luminosity upgrade demands faster processing of sparse, high-rate collision data. One quantum jet-discrimination architecture achieves a complexity of O(N) in the number of particles, a polynomial speedup over the O(N squared) scaling of classical models, alongside more stable multiclass training, though its raw accuracy remains comparable to classical baselines. In molecular chemistry and biology, QGNNs have predicted molecular energies, HOMO-LUMO gaps and perovskite formation energies; a nine-qubit model for water molecules exploits the geometry of the problem, while an ego-graph decomposition strategy achieved competitive graph classification results using only 1.68 percent of the parameters of its classical counterparts.

In complex systems, the picture is similarly mixed. A temporal-spatial quantum graph convolutional network for traffic congestion prediction, built on a Schrödinger-based temporal model, proved robust but did not beat classical predictors. In finance, a compact QGNN with six qubits and roughly 200 parameters reached 94.5 percent accuracy on credit card fraud detection against 92.4 percent for a classical GraphSAGE baseline, a modest but real gain. Perhaps the most striking result comes from Earth science: a quantum-assisted model for predicting the Oceanic Niño Index, which tracks El Niño, improved accuracy over state-of-the-art classical forecasts while cutting training time by an order of magnitude, converging in five epochs instead of fifty. The review also highlights quantum-native tasks, such as learning Ising Hamiltonian dynamics, preparing GHZ entangled states for quantum sensing, spectral clustering and graph isomorphism testing, where the correspondence between graph structure and quantum interactions is direct and the fit is most natural.

Crucially, the authors introduce a disciplined vocabulary that the field has often lacked. They reserve quantum advantage for cases where a quantum model demonstrably outperforms the best classical counterpart under a clearly specified computational model, accounting for the full pipeline including encoding, state preparation, circuit evaluations, measurement shots and classical preprocessing. Quantum utility describes practically relevant benefits, such as improved accuracy, reduced parameter counts or better trainability, that fall short of formal advantage. Quantum-inspired improvement covers classical methods that borrow quantum concepts without using quantum hardware. Judged by this standard, most current QGNN results demonstrate task-dependent quantum utility rather than definitive quantum advantage, and the review says so plainly.

The obstacles are formidable. Noise and decoherence degrade fragile quantum states, and correlated errors such as crosstalk and non-Markovian noise complicate optimization, introducing systematic bias into objective evaluations. Barren plateaus, regions of the cost-function landscape where gradient variance decays exponentially with qubit count, can stall training entirely, and the problem worsens with noise and with global cost functions. Scalability is perhaps the deepest concern: direct node-to-qubit encodings require at least O(|V|) qubits, edge-dependent interactions may demand O(|E|) entangling gates per layer, and dense graphs can push this to O(|V| squared), before hardware routing adds SWAP gates on connectivity-limited devices. The review also notes that the vast majority of published QGNN studies rely exclusively on classical simulation of quantum circuits, which cannot reproduce real hardware noise, and that initialization strategies for quantum parameters remain underexplored despite their demonstrated impact on convergence.

The authors’ conclusion is neither dismissive nor triumphant. QGNNs, they find, are viable and sometimes competitive alternatives to classical graph networks, particularly in parameter efficiency, training behavior and problem-specific complexity reduction, and they are most naturally suited to graph-structured quantum problems rather than generic large-scale classical graph learning. They call for hardware-aware ansatz design, efficient graph-to-circuit mappings, standardized benchmarks that report qubit counts, compiled circuit depth, shot counts and optimization costs, and greater use of noise-aware simulation and real-device experiments. They also point to QAOA-inspired designs, which encode graph structure directly into the circuit, and to extensions toward hypergraphs and simplicial complexes as promising directions. Until fault-tolerant quantum hardware arrives, the honest verdict is that quantum graph neural networks offer genuine, measurable utility today, while the decisive quantum advantage that would transform graph learning at scale remains an open and rigorously framed research question.

Subject of Research: A critical review of quantum graph neural networks, their architectures, applications, and the gap between quantum utility and proven quantum advantage.

Article Title: From graphs to qubits: a critical review of quantum graph neural networks

Article References: From graphs to qubits: a critical review of quantum graph neural networks. (n.d.). https://doi.org/10.1007/s00521-026-12428-x

Image Credits: AI Generated

DOI: 10.1007/s00521-026-12428-x

Keywords: quantum computing, graph neural networks, quantum graph neural networks, variational quantum circuits, NISQ devices, barren plateaus, quantum machine learning, high-energy physics, molecular chemistry, fraud detection, El Nino prediction, quantum advantage

Researchers Ernesto Acosta and Carlos Cano of the University of Granada, together with Guillermo Botella of Complutense University of Madrid, have reformulated the parameter-optimization problem of variational quantum algorithms as a Quadratic Unconstrained Binary Optimization problem, the native language of quantum annealers. Their work, published as volume 8, article 101 of the journal, demonstrates that the same machines designed to find low-energy configurations of combinatorial optimization problems can also serve as scalable optimizers for gate-based quantum models, opening a hybrid pathway that combines gate-model quantum computing, quantum annealing, and classical control in a single training loop.

The core insight behind the method is elegant. Variational quantum algorithms depend on a Hamiltonian expressed in terms of trainable rotation angles, and the exponential structure of the circuit’s unitary operator can be transformed, through a heuristic substitution that replaces imaginary phases with real-valued angles, into sums of real exponential terms. Those terms map naturally onto the quadratic binary cost functions that quantum annealers minimize. In other words, the mathematical structure of the ansatz itself provides the bridge: instead of estimating gradients with hundreds of circuit shots, the team encodes candidate parameter regions directly into QUBO form and asks the annealer to find the configuration with the lowest energy.

Because continuous rotation angles must be represented with discrete binary variables, the researchers developed a recursive refinement strategy that progressively narrows the search space. The parameter range is partitioned into segments, validation points are sampled within each partition, and the QUBO problem is solved to identify the most promising regions. The angle range is then rescaled — in their worked example, halved at each level — and centered on the best solution found so far, and the process repeats. This coarse-to-fine scheme approximates high-quality continuous solutions with a small number of discrete QUBO solves, trading resolution for tractability in a controlled way.

A key strength of the framework is its adaptability. The method exposes a rich set of configurable metaheuristic parameters, including the number of training levels, the number of partitions per angle, and the number of validation points per partition. These knobs allow practitioners to tune the balance between solution quality and computational cost according to the problem at hand and the computational resources available. The authors also integrate an adaptive metaheuristic optimization scheme rather than a fixed search rule, making the training procedure generalizable to arbitrary Hamiltonians rather than being tied to a specific circuit family or ansatz design.

To test the approach, the team benchmarked their adiabatic training scheme on publicly available classification datasets, including the Iris, Heart Disease, and Diabetes datasets from the UCI machine learning repository. The experimental evaluations show that the method achieves accuracy comparable to, and in some configurations better than, established classical and evolutionary optimizers, while significantly reducing computational overhead. The authors’ hyperparameter exploration reveals that the highest performance efficiency — accuracy gained per unit of training time — tends to occur at lower numbers of levels and partitions, meaning that modest configurations already capture most of the benefit before costs escalate.

The implications extend beyond raw benchmark numbers. Gradient-based training on near-term quantum hardware is plagued by noisy gradient estimates, since every partial derivative must be inferred from finite numbers of noisy circuit measurements. Meanwhile, barren plateaus, whose origins have been linked both to deep random circuits and to noise accumulation, can render gradients exponentially vanishing and classical optimizers effectively blind. A gradient-free, annealer-driven optimizer sidesteps both pathologies: it never estimates a derivative, and its search is driven by the energy landscape of the QUBO encoding rather than by local slope information that may not exist in any meaningful sense.

The study builds on a growing body of work connecting annealing-style hardware to machine learning. Previous research has shown that QUBO formulations can be used to train classical machine learning models, that Ising machines can serve as training engines for standard neural networks, and that universal adiabatic quantum computers can be harnessed for neural network training. An earlier preprint by the same team had already explored adiabatic training for variational quantum algorithms; the new journal publication consolidates that line of inquiry into a general, configurable framework with systematic experimental validation, code released through a public repository, and full experimental detail across multiple datasets and hyperparameter regimes.

What emerges is a compelling vision of near-term quantum computing as a genuinely hybrid enterprise. In the architecture the Granada and Madrid researchers describe, a gate-based quantum processor executes the variational circuit, a quantum annealer solves the training problem at each iteration, and a classical system orchestrates the recursive refinement and manages the workflow. Each platform contributes what it does best, and none has to shoulder the full burden alone. As annealing hardware scales and QUBO encodings grow more expressive, this division of labor could become a practical route to training quantum models that classical optimizers struggle to handle.

Challenges certainly remain. The heuristic substitution that enables real-valued QUBO encoding sacrifices strict unitarity, and the discretization of continuous parameters means solution precision depends on the depth of the refinement schedule. The authors’ own data show that pushing training levels and partitions higher does not always pay off, underscoring the need for careful configuration. Still, the demonstration that quantum annealers can train variational quantum algorithms with competitive quality and lower overhead marks a meaningful step. For a field hunting for any advantage in the noisy intermediate-scale era, recruiting one quantum machine to train another may prove to be one of the more inventive entries in the playbook.

Subject of Research: A QUBO-based method that uses quantum annealers to train variational quantum algorithms without gradients.

Article Title: QUBO-based training for VQAs on quantum annealers

Article References: Acosta, E., Botella, G., & Cano, C. (2026). QUBO-based training for VQAs on quantum annealers. Quantum Machine Intelligence, 8(2), Article 101. https://doi.org/10.1007/s42484-026-00441-1

Image Credits: AI Generated

DOI: 10.1007/s42484-026-00441-1

Keywords: quantum computing, variational quantum algorithms, quantum annealing, QUBO, optimization, barren plateaus, quantum machine learning, hybrid quantum computing, metaheuristics, NISQ era, gradient-free training, Hamiltonians