Classical Hardware Acceleration of Quantum Autoencoders for Real-Time Anomaly Detection in Collider Experiments

• URL: http://arxiv.org/abs/2607.20302v1
• Date: Wed, 22 Jul 2026 15:50:22 GMT
• Title: Classical Hardware Acceleration of Quantum Autoencoders for Real-Time Anomaly Detection in Collider Experiments
• Abstract summary: We present a study of variational quantum autoencoder models for real-time anomaly detection triggers in modern collider experiments.<n>The models achieve performance comparable to state-of-the-art classical approaches and, after FPGA synthesis, satisfy resource usage and timing constraints.
• Score: 0.0044302156879028705
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum machine learning (QML) algorithms in high energy physics (HEP) can efficiently represent and leverage long-range, high-order correlations in high-dimensional collider data, potentially with fewer parameters and favorable scaling relative to classical models. Deployment of QML in real-time collider applications such as trigger systems requires the ability to emulate and compile quantum circuits classically, then synthesize the resulting quantum gates onto low-latency hardware accelerators, namely field-programmable gate arrays (FPGAs). We present a study of variational quantum autoencoder models for real-time anomaly detection triggers in modern collider experiments. The models achieve performance comparable to state-of-the-art classical approaches and, after FPGA synthesis, satisfy resource usage and timing constraints consistent with trigger applications in future colliders. This work provides one of the first FPGA implementations of QML models for HEP triggers, enabling higher-capability models in today's classical data acquisition pipelines while advancing quantum readiness of collider experiment infrastructure.

Related papers

• Quantum Dynamic Time Warping for Multivariate Time Series Classification [41.99844472131922]
  We propose a hybrid Quantum Dynamic Time Warping architecture, replacing the classical distance metric with the parameterized geometry of a quantum Hilbert space.<n>We demonstrate this architecture allows untrained quantum kernels to act as highly expressive baselines, while parameterized training effectively untangles deeply overlapping hyper-dimensional data.
  arXiv  Detail & Related papers  (2026-06-26T07:58:37Z)
• Hardware-Aware Tensor Networks for Real-Time Quantum-Inspired Anomaly Detection at Particle Colliders [0.0044302156879028705]
  This work demonstrates the use of tensor networks for real-time anomaly detection in collider detectors.<n>A spaced matrix product operator (SMPO) is developed that provides sensitivity to a variety beyond the Standard Model benchmarks.<n>Results reveal the benefit and near-term feasibility of deploying quantum-inspired ML in high energy colliders.
  arXiv  Detail & Related papers  (2026-03-27T17:02:33Z)
• Digital Quantum Simulation of the Holstein-Primakoff Transformation on Noisy Qubits [40.8066152850216]
  We study the digital quantum simulation of bosonic modes on a cloud-based superconducting quantum processor.<n>We examine the interplay between algorithmic and hardware-induced errors to identify optimal simulation parameters.
  arXiv  Detail & Related papers  (2026-02-19T20:14:04Z)
• Quantum AI for Cybersecurity: A hybrid Quantum-Classical models for attack path analysis [1.2676356746752895]
  This study investigates the potential of hybrid quantum-classical learning to enhance feature representations for intrusion detection.<n>We show that quantum-enhanced representations demonstrate superior attack recall and improved class separability when data is scarce.<n>Results highlight the potential of quantum embeddings to improve generalization and representation quality in cybersecurity tasks.
  arXiv  Detail & Related papers  (2026-01-05T16:11:39Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Quantum Adaptive Self-Attention for Quantum Transformer Models [0.0]
  We propose Quantum Adaptive Self-Attention (QASA), a novel hybrid architecture that enhances classical Transformer models with a quantum attention mechanism.<n>QASA replaces dot-product attention with a parameterized quantum circuit (PQC) that adaptively captures inter-token relationships in the quantum Hilbert space.<n> Experiments on synthetic time-series tasks demonstrate that QASA achieves faster convergence and superior generalization compared to both standard Transformers and reduced classical variants.
  arXiv  Detail & Related papers  (2025-04-05T02:52:37Z)
• Quantum Data Encoding and Variational Algorithms: A Framework for Hybrid Quantum Classical Machine Learning [0.0]
  Quantum Machine Learning (QML) integrates the calculational framework of quantum mechanics with the adaptive properties of classical machine learning.<n>This article suggests a broad architecture that allows the connection between classical data pipelines and quantum algorithms.
  arXiv  Detail & Related papers  (2025-02-17T16:04:04Z)
• Programming optical-lattice Fermi-Hubbard quantum simulators [39.58317527488534]
  We develop ground-state preparation algorithms for different fermionic models.<n>In particular, we first design variational, pre-compiled quantum circuits to prepare the ground state of the native Fermi-Hubbard model.<n>We discuss how to approximate the imaginary-time evolution using variational fermionic circuits.
  arXiv  Detail & Related papers  (2025-02-07T16:40:58Z)
• Programming Variational Quantum Circuits with Quantum-Train Agent [3.360429911727189]
  The Quantum-Train Quantum Fast Weight Programmer (QT-QFWP) framework is proposed, which facilitates the efficient and scalable programming of variational quantum circuits (VQCs)<n>This approach offers a significant advantage over conventional hybrid quantum-classical models by optimizing both quantum and classical parameter management.<n> QT-QFWP outperforms related models in both efficiency and predictive accuracy, providing a pathway toward more practical and cost-effective quantum machine learning applications.
  arXiv  Detail & Related papers  (2024-12-02T06:26:09Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Pre-training Tensor-Train Networks Facilitates Machine Learning with Variational Quantum Circuits [70.97518416003358]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning on noisy intermediate-scale quantum (NISQ) devices. While tensor-train networks (TTNs) can enhance VQC representation and generalization, the resulting hybrid model, TTN-VQC, faces optimization challenges due to the Polyak-Lojasiewicz (PL) condition. To mitigate this challenge, we introduce Pre+TTN-VQC, a pre-trained TTN model combined with a VQC.
  arXiv  Detail & Related papers  (2023-05-18T03:08:18Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.