The stakes are considerable. Theories that extend the Standard Model, such as supersymmetry and the left-right symmetric model, predict the existence of a heavier cousin of the W boson, dubbed the W-prime boson. If such a particle exists, it would be far too short-lived to observe directly, but it would decay promptly into a top quark and a bottom quark. Catching that decay means identifying highly energetic, or boosted, top-quark jets amid an overwhelming background of jets produced by quantum chromodynamics, the theory of the strong interaction. Previous searches, including early work by the D0 Collaboration in 1995 and a 2017 analysis by the CMS Collaboration, have pushed the lower bound on the mass of a right-handed W-prime boson to 2.4 teraelectronvolts at 95 percent confidence, but the hunt continues at the proposed High Luminosity LHC.

The difficulty lies in the geometry of boosted decays. A top quark is unstable and decays into a b-quark and a W-boson, and when the top quark carries enormous transverse momentum, the decay products are squeezed into a narrow angular cone. Physicists visualize this by building a two-dimensional histogram, called a jet image, in which pixel intensities represent the energy fractions of the detected particles. In a boosted top decay, the subjets from the b-quark and the W decay products can overlap so completely that the resulting image looks strikingly similar to a background QCD jet. Classical convolutional neural networks can achieve accuracies between 90 and 94 percent on such tasks, but the benchmark studies show this often comes at the price of trainable parameter counts ranging from one thousand to 1.46 million, as in the state-of-the-art ResNeXt architecture, with the associated computational cost and overfitting risks.

The new work, led by Hala Elhag of the Deutsches Elektronen-Synchrotron and Humboldt-Universität zu Berlin, together with colleagues at institutions including Northeastern University, the Cyprus Institute, the University of Tokyo and the Physikalisch-Technische Bundesanstalt, tackles this bottleneck with a quantum convolutional neural network, or QCNN. First introduced by Cong, Choi and Lukin in 2019, the QCNN replaces the classical filters and pooling operations of a conventional CNN with parametrized quantum circuits. Because it relies on shallow circuits, the architecture is naturally suited to today’s noisy intermediate-scale quantum devices, and theoretical work has shown that its shallow depth also protects it from the barren plateau problem that cripples the trainability of many deeper quantum models.

Before any quantum processing can happen, the classical jet images must be encoded into quantum states, and the choice of encoding turns out to matter enormously. The team tested four schemes: tensor product encoding, also known as angle encoding; one- and two-layer versions of a hardware-efficient encoding; and a classically hard embedding. Each encoded state is then passed through alternating convolutional and pooling layers built from two-qubit unitary gates. The researchers compared two convolutional circuits, the SO(4) circuit, which performs real-valued transformations with six trainable parameters per two-qubit block, and the more general SU(4) circuit, a universal two-qubit gate set with fifteen trainable parameters. The layers repeat until only a single qubit remains, whose Pauli-Z expectation value serves as the network’s prediction.

The dataset came from the JetNet library, a Python package built on PyTorch that provides open Monte Carlo datasets for machine learning in high-energy physics. The researchers used the TopTagging dataset, containing hadronic top jets as signal and QCD jets as background. Each jet’s particles carry four-momentum components, and the team preprocessed the data using a Lorentz boost fixed at a gamma factor of ten, followed by a Gram-Schmidt orthonormalization that constructs the image coordinates from the three highest-momentum constituents. This transformation makes jet images look similar regardless of the original top-quark boost, easing the learning problem. Principal component analysis then compressed the 28-by-28 pixel images down to just four pixels, preserving 50.54 percent of the dataset’s variance, so that each pixel could be loaded onto a single qubit.

Running everything on a noiseless classical simulator using the PennyLane framework, with the classical CNNs built in TensorFlow, the team varied the loss function, encoding and batch size while carefully matching parameter counts between quantum and classical models. The SO(4) QCNN with 30 parameters faced a CNN with 33; the SU(4) QCNN with 48 parameters faced a CNN with 51. Across 50 averaged training runs of 30 epochs each, the quantum model outperformed its classical counterpart in most configurations, particularly with the SO(4) circuit, the simpler one-layer hardware-efficient encoding, and small batch sizes. Accuracy declined as batch size grew from 16 to 128, and the QCNNs also converged faster in the early epochs. The researchers attribute the poor showing of the more complex encodings to dataset-induced barren plateaus, a trainability pathology linked to data encoding complexity.

The most striking result came from dimensional expressivity analysis, a technique that identifies redundant parameters in a parametric quantum circuit by checking whether the derivative of the circuit’s output with respect to each parameter can be written as a linear combination of the others. Applying this analysis to the SU(4) circuit revealed that 17 of its 48 parameters were redundant, leaving a minimal, maximally expressive circuit of just 31 parameters. Trained with mean-square-error loss and the one-layer hardware-efficient encoding over 1000 runs, this trimmed quantum circuit achieved higher accuracy than a comparable 33-parameter CNN. When the classical side was beefed up with additional dense layers, pushing the CNN to 73 and then 91 parameters, the 31-parameter quantum circuit still beat the 73-parameter model and matched the performance of the largest classical network.

The authors are careful about what these results do and do not prove. Because everything ran on a noiseless simulator, the effects of hardware noise, finite-shot sampling and circuit depth remain untested, and they explicitly caution that the findings should not be read as a demonstration of practical quantum advantage. They also note that QCNNs processing classical data have been shown to be effectively classically simulable, which paradoxically is an asset: it allows researchers to scale up simulations to many more qubits and work directly with full-resolution jet images, bypassing the lossy PCA step. Accuracy comparisons with other published top-taggers are likewise not straightforward, since results depend heavily on dataset and preprocessing choices, and real experiments must classify single jets rather than composite images.

Even with those caveats, the study points to a concrete path forward. Reducing parameter counts matters enormously for eventual deployment on noisy quantum hardware, where every additional gate invites error, and the expressivity-optimized circuit shows that leaner quantum models need not sacrifice accuracy. The team also highlights equivariant quantum neural networks, which build the rotational symmetries of the data directly into the architecture, as a natural next step. And beyond classical jet images, quantum machine learning may eventually prove most powerful on genuinely quantum data, such as the spin entanglement among final-state particles that the ATLAS Collaboration recently observed with top quarks. For now, the message is that in the demanding arena of particle physics classification, carefully designed quantum circuits are already competitive, and the design principles that get them there may matter more than raw qubit counts.

Subject of Research: Quantum convolutional neural networks for top-quark jet image classification in high-energy physics

Article Title: Quantum convolutional neural networks for jet images classification

Article References: Elhag, H., Hartung, T., Jansen, K., Nagano, L., Pirina, G., & Di Tucci, A. (2026). Quantum convolutional neural networks for jet images classification. Quantum Machine Intelligence, 8(2), Article 109. https://doi.org/10.1007/s42484-026-00457-7

Image Credits: AI Generated

DOI: 10.1007/s42484-026-00457-7

Keywords: quantum machine learning, quantum convolutional neural networks, top-quark tagging, jet images, high-energy physics, Large Hadron Collider, dimensional expressivity analysis, principal component analysis, data encoding, barren plateaus, beyond the Standard Model, classical simulation

The work, published in the journal Quantum Machine Intelligence by Bodo Rosenhahn, Tobias J. Osborne, and Christoph Hirche, draws on a surprisingly old idea. The perceptron, introduced by Frank Rosenblatt in 1958 and rooted in the 1943 McCulloch-Pitts model of neural computation, sums weighted inputs and produces a binary output. In the new formulation, the neuron becomes probabilistic: rather than firing deterministically, it activates with a probability derived from a weighted score. This stochasticity is not a limitation but a perfect match for quantum mechanics, where measurement outcomes are inherently probabilistic.

Technically, the quantum perceptron is realized with rotation gates. A bias term is encoded in an RX gate, and each binary input qubit increments the activation probability of the neuron through a controlled RX gate, whose rotation angle is set via an arcsine function that maps probability scores linearly onto angles. Remarkably, the model requires no ancilla qubits and no repeat-until-success circuits, tricks that earlier quantum neuron proposals needed to emulate deterministic activation. And because the sine function is already nonlinear, the architecture shares an expressive kinship with radial basis function networks.

One particularly striking property emerges when rotation angles accumulate. If cumulative scores exceed one, the activation probability actually decreases, allowing a single quantum perceptron to implement the XOR function, something impossible for a classical perceptron with sigmoid, ReLU, or similar monotonic activation functions. Intriguingly, this mirrors biology: neuroscientists have discovered pyramidal neurons in the human cerebral cortex that can learn XOR, a feat once thought beyond individual nerve cells.

Training such quantum networks presents its own challenge, since gradients must be estimated stochastically. The authors turn to the Kiefer-Wolfowitz algorithm from 1952, a stochastic approximation method that estimates gradients using finite differences, embedded within a simulated annealing scheme borrowed from metallurgy. The acceptance probability for uphill moves decays over time according to a Boltzmann-like schedule, allowing the optimizer to escape local minima. Crucially, this stochastic search naturally accommodates architectural constraints such as weight sharing and connection cutting, requirements that gradient-based methods struggle to enforce.

The generality of the approach is demonstrated across a remarkable range of classical architectures, all rebuilt as quantum circuits. Shallow fully connected networks trained on the classic iris, wine, zoo, and MNIST datasets achieve reliable classification, with the annealing-based optimizer outperforming vanilla gradient descent, which frequently gets trapped in local minima. Quantum Hopfield networks store and retrieve binary patterns, converging after just three to five recurrent iterations. Restricted Boltzmann Machines, whose stochastic binary units are a natural fit for the probabilistic activation, compress twelve-dimensional iris data into a latent space of only two qubits with reasonable reconstruction quality, and autoencoders with separated encoder and decoder weights improve upon it further.

The researchers also probe the practical limits of their model. Analyzing amplitude damping noise on a three-qubit XOR perceptron, they show that trace distances between noisy and ideal circuits remain small for inputs near zero but grow when both input qubits approach the excited state. Because the gate count scales linearly with feature dimension, noise will compound in larger systems, making error correction essential on today’s hardware. The authors are candid that models rivaling modern billion-parameter networks will only become feasible on future fault-tolerant, large-scale quantum devices.

The most tantalizing result may be the fusion of these trained networks with Grover’s celebrated quantum search algorithm to create a quantum generative AI model. A trained, frozen quantum neural network acting as a classifier is converted into an oracle. By preparing input qubits in superposition, applying the oracle, and following with a diffusion circuit, the combined system samples patterns that satisfy the learned classification property with dramatically amplified likelihood. Unlike generative adversarial networks, which suffer from unstable training and mode collapse, this quantum generative scheme requires no adversarial game and no iterative denoising: generation happens through a single circuit execution.

Beyond generative AI, the framework promises practical advantages wherever data is already quantum. Quantum sensors, for instance, encode information directly in qubit states, and conventional pipelines waste resources converting that information to the digital domain before analysis. A stochastic quantum neural network can process sensed quantum signals on-board, classifying them without cumbersome digitization or tomography. As quantum hardware matures, this bridge between the oldest ideas in machine learning and the newest ideas in quantum computing may prove to be exactly the connector the field has been waiting for.

Subject of Research: Formulating and training stochastic artificial neural networks as quantum circuits for gate-based quantum computing, including their use as oracles in Grover's algorithm for quantum generative AI.

Article Title: Stochastic neural networks for quantum devices

Article References: Rosenhahn, B., Osborne, T. J., & Hirche, C. (2026). Stochastic neural networks for quantum devices. Quantum Machine Intelligence, 8(2), Article 98. https://doi.org/10.1007/s42484-026-00438-w

Image Credits: AI Generated

DOI: 10.1007/s42484-026-00438-w

Keywords: quantum computing, quantum neural networks, stochastic neurons, perceptron, Kiefer-Wolfowitz algorithm, simulated annealing, Hopfield networks, Restricted Boltzmann Machines, autoencoders, Grover algorithm, quantum generative AI, machine learning

Neural operators have quietly become one of the most consequential tools in computational science. Instead of learning a mapping between finite vectors, they learn mappings between functions, which makes them natural solvers for partial differential equations. Given a family of PDEs describing, say, fluid flow through porous rock or heat diffusing through a material, a trained neural operator can predict the full solution field for a new set of parameters almost instantly, bypassing the expensive numerical solvers that would otherwise be required. Classical architectures such as DeepONet and the Fourier neural operator have transformed this landscape, but their quantum counterparts have lagged behind, hampered by processing overheads and theoretical gaps about what quantum circuits can actually represent.

The central obstacle has been scaling. Many quantum machine-learning paradigms demand qubit counts or circuit depths that grow so quickly with problem size that they collapse into impracticality on near-term hardware. The Shanghai team, led by Ruocheng Wang, Xiaoqiu Zhong, Zhuo Xia and Junchi Yan, attacked the problem from two directions at once: they built a leaner architecture and, crucially, they proved something rigorous about its power.

The theoretical centerpiece is an extension of the universal approximation theorem to the quantum domain for continuous nonlinear operators. Universal approximation, first established for classical neural networks in the 1990s, guarantees that sufficiently wide networks can represent a broad class of functions; the operator version underpins DeepONet. Proving an analogous guarantee for quantum circuits closes a foundational gap, but the team went further. Departing from the conventional view that quantum advantage must flow from the exponential size of Hilbert space, they showed that the architecture’s density matrix implicitly constructs a quadratic feature frame.

That quadratic frame yields a striking expressivity bound. For operators, the implicit feature space scales as O(p²) in the number of parameters p, circumventing the O(p) linear capacity limits of matched classical models. In plain terms, each additional parameter in the quantum model buys roughly a square’s worth of representational capacity compared with a classical model of the same size. This is a subtle but meaningful advantage: it does not rely on exotic claims about exponentially large state spaces, but on a concrete, provable property of how the quantum circuit encodes features.

The second innovation addresses a practical bottleneck known as spectrum alignment. Quantum models encode input data through frequency modulation, and capturing high-frequency components of a solution, the sharp gradients and fine oscillations that matter in real PDEs, typically requires either deep circuits or many parameters. The researchers introduced a trainable-frequency strategy, dubbed TF-QuanONet, in which the base frequencies of the encoding adaptively space themselves during training. The network effectively learns which frequencies to emphasize, capturing relatively high-frequency structure without inflating the parameter count or the circuit depth.

The benchmarks are where the claims meet reality. Across extensive experiments, TF-QuanONet notably outperformed competing quantum baselines and achieved accuracy competitive with classical frameworks under strictly matched-parameter conditions, a fairness constraint that quantum machine-learning comparisons often fail to honor. More intriguing still is what happened as the problems grew. In high-dimensional scaling regimes, with latent dimensions p approaching 256, the quantum architecture exhibited superior optimization robustness, consistently converging to its intrinsic error floor while classical baselines suffered from high variance. The quantum model was not just accurate; it was reliably trainable where its classical competitors became erratic.

The team also tested the architecture on real IBM quantum processors, including the ibm_fez device, as a qualitative proof of concept. Comparisons between noise-free simulations and physical hardware demonstrated that QuanONet retains functional resilience on near-term machines, a nontrivial achievement given that real qubits decohere, gates misfire, and measurement noise corrupts outputs. The experiments spanned a range of canonical problems, including dynamical systems, advection equations and Darcy flow, with visualizations confirming that predictions track ground-truth solutions across varying input frequencies.

The work arrives amid a broader reckoning in quantum machine learning, where researchers have grown wary of claims that evaporate under fair comparison or realistic hardware assumptions. By grounding its architecture in a proven expressivity theorem, keeping resource requirements modest, and validating on commercial hardware, the study offers a template for what credible quantum advantage in scientific machine learning might look like. The code has been released publicly on GitHub and archived on Zenodo, and all datasets were generated directly from it, inviting the community to scrutinize and extend the results.

Whether the quadratic expressivity edge translates into decisive practical wins as quantum hardware improves remains an open question, but the study reframes the debate. Rather than waiting for fault-tolerant machines or betting everything on exponential Hilbert spaces, it demonstrates that carefully designed quantum architectures, with theory and engineering aligned, can already hold their own against strong classical baselines on the noisy processors available today.

Subject of Research: A quantum neural operator architecture with a proven quadratic expressivity bound for solving partial differential equations on near-term quantum hardware.

Article Title: Quantum neural operators with implicit quadratic frame and expressivity advantages

Article References: Wang, R., Zhong, X., Xia, Z., & Yan, J. (2026). Quantum neural operators with implicit quadratic frame and expressivity advantages. Nature Machine Intelligence. https://doi.org/10.1038/s42256-026-01289-7

Image Credits: AI Generated

DOI: 10.1038/s42256-026-01289-7

Keywords: quantum machine learning, neural operators, partial differential equations, QuanONet, NISQ era, universal approximation, expressivity, trainable frequencies, IBM quantum processors, DeepONet, quantum computing, scientific machine learning

The challenge arises because quantum computers do not directly reveal a complete quantum state. Instead, researchers prepare a state, run a circuit and measure the result, repeating the process over many “shots” to estimate quantities such as the expectation value of an observable. If a machine-learning model contains many adjustable parameters and processes a large training set over numerous optimization steps, the number of required measurements can quickly become enormous. A conventional QCNN typically reduces the number of active qubits through successive pooling layers, much as a classical convolutional neural network compresses an image while retaining important features. However, the circuit may still require a measurement effort that scales linearly with the original number of qubits. For a model with n qubits, the total training cost can scale approximately as the product of the number of parameters, training examples, optimization epochs and shots per circuit. On hardware where measurements are slow or noisy, that cost can dominate the entire computation.

QCNNs are attractive partly because their hierarchical architecture is relatively shallow. Convolutional layers apply local unitary operations to extract nearby correlations, while pooling layers coarse-grain the information by reducing the number of qubits involved in later stages. Because the active system shrinks rapidly, the circuit depth can scale as order log n rather than growing directly with the number of input qubits. This structure also helps address a notorious problem in variational quantum algorithms known as the barren plateau. In a barren plateau, the optimization landscape becomes exponentially flat as the system grows, causing gradients to become so small that a classical optimizer cannot identify a useful direction for improving the circuit. Local operations, local observables and logarithmic depth allow QCNNs to avoid this failure mode under established conditions. Yet shallow circuits alone do not solve the measurement problem, and adding symmetry creates another architectural complication: pooling can destroy the very spatial relationships the model is meant to respect.

Equivariance provides a way to build those relationships into the model from the beginning. In a symmetry-aware learning problem, the desired output is unchanged when the input is transformed by an allowed operation. A molecular structure, for example, may represent the same physical object after a rotation or inversion, while a lattice system may preserve its label under a translation or reflection. Mathematically, if a density matrix describing the input is represented by ρ and a symmetry operation by a unitary (U_g), the target function obeys (f(rho)=f(U_grho U_g^dagger)) for every symmetry element g. An equivariant circuit imposes a corresponding constraint, requiring its parameterized unitary to commute with the symmetry operation: ([U(theta),U_g]=0). When the final observable is also symmetric, the circuit automatically produces the same prediction for symmetry-related inputs. This reduces the effective space of models the optimizer must explore, potentially improving trainability and generalization by preventing the network from learning irrelevant distinctions.

The difficulty is that ordinary QCNN pooling usually discards selected qubits, and the selection itself can favor one position over another. Earlier symmetry-preserving approaches addressed this problem by randomly choosing which qubits to retain for each measurement shot. For translational symmetry, one shot might retain even-numbered qubits and another odd-numbered qubits, creating a classical mixture of related circuits. The new method takes a different route. Rather than randomly selecting one branch, it splits the circuit into non-overlapping branches and executes them coherently. At each layer, the set of qubits is partitioned into disjoint subsets, with later branches allowed to split from an earlier branch but not merge with another. Each branch receives its own unitary operation, and because the operations act on separate qubits within a layer, they commute. This design makes it possible to impose more general symmetry groups through a group-theoretical construction while preserving the parallel structure needed for efficient measurements.

The measurement advantage follows from the locality of the final observable. Suppose the output is an average of single-qubit observables, (O=(O_1+O_2+cdots+O_n)/n). In a randomized QCNN, each shot effectively samples one subcircuit associated with a particular output qubit, so the expectation value is assembled by averaging results from many separate circuit executions. In the split-parallelizing version, the corresponding subcircuits coexist within the same coherent circuit. In the absence of statistical error, the two procedures produce the same expectation value because each local observable interacts only with the backward light cone—the part of the circuit that could have influenced it. The split architecture can therefore generate as many as n useful measurement outcomes per circuit execution in favorable cases, suggesting an order-n improvement in measurement efficiency. The researchers stress that this is not a universal guarantee. Quantum correlations can make outcomes statistically redundant: in a highly entangled GHZ state, for example, many measurements may carry essentially one bit of independent information rather than n.

The same architecture can accelerate the estimation of gradients, which are required to train a variational circuit. A common technique, the parameter-shift rule, estimates the derivative associated with a parameter by evaluating the circuit at shifted parameter values, typically (theta_mu+pi/4) and (theta_mu-pi/4) in the formulation used by the researchers. In a conventional randomized design, separate branch circuits may be needed for each relevant output, requiring as many as twice the number of branch-associated circuit types for one derivative. In the equivariant sp-QCNN, all terms connected to a parameter can be measured using only the two shifted circuit configurations because the relevant branches run in parallel. Moreover, derivatives associated with parameters in distinct, non-overlapping branches can be measured simultaneously: their corresponding observables act on separate qubit regions and commute. Combining these effects produces an ideal scaling advantage of order n for gradient measurements under the model’s assumptions. That could be particularly important during early training, when repeated gradient evaluations are needed and statistical noise can otherwise slow or destabilize optimization.

The researchers tested the framework on a noisy classification problem involving ground states of the Heisenberg model on a square lattice, a system whose symmetry is relevant to quantum many-body physics. Their numerical experiments found that the equivariant sp-QCNN suppressed statistical error in expectation-value estimates and accelerated training compared with a conventional equivariant QCNN when measurement resources were limited. The symmetry-aware split model also achieved high classification accuracy with fewer training examples than a non-equivariant alternative, consistent with the idea that encoding known structure can improve generalization. The study does not claim that symmetry or efficient measurement automatically delivers a quantum speedup. A circuit that avoids barren plateaus may still be simulable by a classical computer for certain locally simple datasets, and the authors emphasize that classical simulability remains a fundamental issue for many variational quantum models. Instead, the result identifies a practical route toward polynomial improvements in measurement and training efficiency, while extending split-parallelizing QCNNs beyond the translationally symmetric cases considered previously.

The proposal’s significance therefore lies less in a single benchmark than in the combination of three design principles: hierarchical quantum convolution, explicit symmetry and coherent reuse of qubits. Its measurement savings arise primarily from the splitting structure, while symmetry supplies the inductive bias expected to improve trainability and generalization. The absence of barren plateaus is established under a modest but important assumption: each branch, whose structure resembles a conventional QCNN, must itself remain free of the phenomenon, meaning that its local cost-function variance does not vanish exponentially. Likewise, the strongest measurement improvements depend on correlations in the output state; extreme entanglement can reduce the amount of independent information obtained per shot. Future applications could involve quantum materials, lattice models, molecular data and other problems with nontrivial geometric structure, but practical validation on real noisy processors will be essential. For now, the equivariant sp-QCNN offers a technically grounded way to turn symmetry and parallelism into a resource-saving strategy for quantum machine learning at a time when every reliable measurement remains costly.