Continuous-variable photonic quantum extreme learning machines for fast collider-data selection

• URL: http://arxiv.org/abs/2510.13994v1
• Date: Wed, 15 Oct 2025 18:21:32 GMT
• Title: Continuous-variable photonic quantum extreme learning machines for fast collider-data selection
• Authors: Benedikt Maier, Michael Spannowsky, Simon Williams,
• Abstract summary: We study continuous-variable photonic quantum extreme learning machines as fast, low-overhead front-ends for collider data processing.<n>Data is encoded in photonic modes through quadrature displacements and propagated through a fixed-time Gaussian quantum substrate.<n>Only a linear classifier is trained, using a single linear solve, so retraining is fast and the optical path and detector response set the analytical and inference latency.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study continuous-variable photonic quantum extreme learning machines as fast, low-overhead front-ends for collider data processing. Data is encoded in photonic modes through quadrature displacements and propagated through a fixed-time Gaussian quantum substrate. The final readout occurs through Gaussian-compatible measurements to produce a high-dimensional random feature map. Only a linear classifier is trained, using a single linear solve, so retraining is fast, and the optical path and detector response set the analytical and inference latency. We evaluate this architecture on two representative classification tasks, top-jet tagging and Higgs-boson identification, with parameter-matched multi-layer perceptron (MLP) baselines. Using standard public datasets and identical train, validation, and test splits, the photonic Quantum Extreme Learning Machine (QELM) outperforms an MLP with two hidden units for all considered training sizes, and matches or exceeds an MLP with ten hidden units at large sample sizes, while training only the linear readout. These results indicate that Gaussian photonic extreme-learning machines can provide compact and expressive random features at fixed latency. The combination of deterministic timing, rapid retraining, low optical power, and room temperature operation makes photonic QELMs a credible building block for online data selection and even first-stage trigger integration at future collider experiments.

Related papers

• Quantum Machine Learning via Contrastive Training [12.83661402071417]
  We introduce self-supervised pretraining of quantum representations that reduces reliance on labeled data.<n>We implement this paradigm on a programmable trapped-ion quantum computer, encoding images as quantum states.<n>Performance improvement is especially significant in regimes with limited labeled training data.
  arXiv  Detail & Related papers  (2025-11-17T15:36:23Z)
• Behind the scenes of the Quantum Extreme Learning Machines [0.0]
  We investigate Quantum Extreme Learning Machines (QELM), a quantum variant of Extreme Learning Machines where training is restricted to the output layer.<n>The proposed architecture combines dimensionality reduction (via PCA or Autoencoders), quantum state encoding, evolution under an XX Hamiltonian, and measurement.<n>By analyzing the performance of QELMs as a function of the evolution time, we identify a relatively sharp transition from a low-accuracy to a high-accuracy regime, after which the accuracy saturates.
  arXiv  Detail & Related papers  (2025-09-08T16:43:37Z)
• Physical-Layer Machine Learning with Multimode Interferometric Photon Counting [0.40964539027092906]
  We propose a unified protocol that combines machine learning with interferometric photon counting to reduce noise and reveal correlations.<n>Our results show that multimode interferometric photon counting outperforms conventional homodyne detection proposed in prior works.
  arXiv  Detail & Related papers  (2025-06-14T02:10:19Z)
• Discrete Randomized Smoothing Meets Quantum Computing [40.54768963869454]
  We show how to encode all the perturbations of the input binary data in superposition and use Quantum Amplitude Estimation (QAE) to obtain a quadratic reduction in the number of calls to the model. In addition, we propose a new binary threat model to allow for an extensive evaluation of our approach on images, graphs, and text.
  arXiv  Detail & Related papers  (2024-08-01T20:21:52Z)
• Supervised binary classification of small-scale digit images and weighted graphs with a trapped-ion quantum processor [56.089799129458875]
  We present the results of benchmarking a quantum processor based on trapped $171$Yb$+$ ions.<n>We perform a supervised binary classification on two types of datasets: small binary digit images and weighted graphs with a ring topology.
  arXiv  Detail & Related papers  (2024-06-17T18:20:51Z)
• A linear photonic swap test circuit for quantum kernel estimation [0.0]
  photonic swap test circuit successfully encodes two qubits and estimates their scalar product with a measured root mean square error smaller than 0.05. This result paves the way for the development of integrated photonic architectures capable of performing Quantum Machine Learning tasks with robust devices operating at room temperature.
  arXiv  Detail & Related papers  (2024-02-27T22:34:14Z)
• Simulation of Entanglement Generation between Absorptive Quantum Memories [56.24769206561207]
  We use the open-source Simulator of QUantum Network Communication (SeQUeNCe), developed by our team, to simulate entanglement generation between two atomic frequency comb (AFC) absorptive quantum memories. We realize the representation of photonic quantum states within truncated Fock spaces in SeQUeNCe. We observe varying fidelity with SPDC source mean photon number, and varying entanglement generation rate with both mean photon number and memory mode number.
  arXiv  Detail & Related papers  (2022-12-17T05:51:17Z)
• Photonic Quantum Computing For Polymer Classification [62.997667081978825]
  Two polymer classes visual (VIS) and near-infrared (NIR) are defined based on the size of the polymer gaps. We present a hybrid classical-quantum approach to the binary classification of polymer structures.
  arXiv  Detail & Related papers  (2022-11-22T11:59:52Z)
• Sample-efficient Quantum Born Machine through Coding Rate Reduction [0.0]
  The quantum circuit Born machine (QCBM) is a quantum physics inspired implicit generative model naturally suitable for learning binary images. We show that matching up to the second moment alone is not sufficient for training the quantum generator, but when combined with the class probability estimation loss, MCR$2$ is able to resist mode collapse.
  arXiv  Detail & Related papers  (2022-11-14T06:21:26Z)
• Towards Quantum Graph Neural Networks: An Ego-Graph Learning Approach [47.19265172105025]
  We propose a novel hybrid quantum-classical algorithm for graph-structured data, which we refer to as the Ego-graph based Quantum Graph Neural Network (egoQGNN) egoQGNN implements the GNN theoretical framework using the tensor product and unity matrix representation, which greatly reduces the number of model parameters required. The architecture is based on a novel mapping from real-world data to Hilbert space.
  arXiv  Detail & Related papers  (2022-01-13T16:35:45Z)
• Adaptive Machine Learning for Time-Varying Systems: Low Dimensional Latent Space Tuning [91.3755431537592]
  We present a recently developed method of adaptive machine learning for time-varying systems. Our approach is to map very high (N>100k) dimensional inputs into the low dimensional (N2) latent space at the output of the encoder section of an encoder-decoder CNN. This method allows us to learn correlations within and to track their evolution in real time based on feedback without interrupts.
  arXiv  Detail & Related papers  (2021-07-13T16:05:28Z)
• Scalable, End-to-End, Deep-Learning-Based Data Reconstruction Chain for Particle Imaging Detectors [0.0]
  This paper introduces an end-to-end, ML-based data reconstruction chain for Liquid Time Projection Chambers (LArTPCs) It is the first implementation to handle the unprecedented pile-up of dozens of high energy neutrino interactions.
  arXiv  Detail & Related papers  (2021-02-01T18:10:00Z)

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.