Quantum Spectral Anomaly Detection

• URL: http://arxiv.org/abs/2607.05307v1
• Date: Mon, 06 Jul 2026 16:47:21 GMT
• Title: Quantum Spectral Anomaly Detection
• Abstract summary: A core task in quantum anomaly detection is to compute an anomaly score that quantifies how strongly a test quantum state deviates from a given quantum dataset assumed to be normal.<n>We propose Quantum Spectral Anomaly Detection (QSPADE), which computes PCA-like anomaly scores directly from the spectrum of the average state of the normal dataset.
• Score: 9.811303336285961
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A core task in quantum anomaly detection is to compute an anomaly score that quantifies how strongly a test quantum state deviates from a given quantum dataset assumed to be normal. Classically, principal component analysis (PCA) for centered data computes the anomaly score by evaluating the test sample relative to the subspace spanned by the selected leading eigenvectors. However, for quantum data that lack a standard centering, explicitly recovering principal eigenvectors, constructing full Gram matrices, or loading quantum-random-access-memory-style data can be more costly than estimating the anomaly score itself. To avoid these costs, we propose Quantum Spectral Anomaly Detection (QSPADE), which computes PCA-like anomaly scores directly from the spectrum of the average state of the normal dataset. By replacing hard PCA rank selection with a smooth, temperature-controlled spectral threshold, QSPADE makes near-threshold spectral components contribute partially to the anomaly score. This makes the score vary continuously rather than jump when a borderline component is included or excluded, and makes it less sensitive to noise or arbitrary hard cutoffs near the threshold. In the zero-temperature limit, QSPADE recovers the hard-projector PCA score. The proposed measurement-based quantum detector can be calibrated with a sample complexity independent of the data dimension. Numerical simulations show that QSPADE behaves like kernel-PCA on encoded classical data and detects changes across a transverse-field Ising transition without predefined order parameters. Consequently, QSPADE gives an efficient framework for both quantum-kernel anomaly detection on encoded classical data and the monitoring of quantum-native systems where diagnostic observables are unknown.

Related papers

• Quantum principal component analysis without eigenvector recovery [9.811303336285961]
  We introduce a measurement-based soft PCA framework replacing the hard top-$k$ projector with an entropy-regularized Fermi--Dirac filter.<n>This filter has a direct interpretation as a quantum measurement, which naturally suggests a quantum approach.<n>For new inputs, the same quantum circuit yields soft principal subspace scores, spectral energy profiles, and postselected filtered states.
  arXiv  Detail & Related papers  (2026-05-27T04:27:47Z)
• Universal Sequential Changepoint Detection of Quantum Observables via Classical Shadows [62.751483592497806]
  We study sequential quantum changepoint detection in settings where the pre- and post-change regimes are specified.<n>We introduce shadow-based sequential changepoint e-detection (eSCD)<n>eSCD combines a universal measurement strategy based on classical shadows with a non-parametric sequential test built on e-detectors.
  arXiv  Detail & Related papers  (2026-02-12T11:38:40Z)
• Quantum Gated Recurrent GAN with Gaussian Uncertainty for Network Anomaly Detection [10.435718832887988]
  Anomaly detection in time-series data is a critical challenge with significant implications for network security.<n>Recent quantum machine learning approaches have shown promise in capturing complex data distributions for anomaly detection but remain constrained by limited qubit counts.<n>We introduce in this work a novel Quantum Gated Recurrent Unit (QGRU)-based Generative Adversarial Network (GAN) for robust network anomaly detection.
  arXiv  Detail & Related papers  (2025-10-30T13:39:44Z)
• From VQE To SQD: Modern Quantum Algorithms For The Electronic Structure Problem [0.0]
  This thesis investigates sampling-based quantum algorithms for electronic ground state energy estimation.<n>It focuses on Quantum-Selected Configuration Interaction (QSCI) and Sample-Based Quantum Diagonalization (SQD) as near-term alternatives to the Variational Quantum Eigensolver (VQE)<n>The analysis is validated through simulations, hardware-calibrated noisy studies, and execution on IBM's 127-qubit IBM Brisbane processor.
  arXiv  Detail & Related papers  (2025-09-25T20:39:14Z)
• Calibration of Quantum Devices via Robust Statistical Methods [45.464983015777314]
  We numerically analyze advanced statistical methods for Bayesian inference against the state-of-the-art in quantum parameter learning.<n>We show advantages of these approaches over existing ones, namely under multi-modality and high dimensionality.<n>Our findings have applications in challenging quantumcharacterization tasks namely learning the dynamics of open quantum systems.
  arXiv  Detail & Related papers  (2025-07-09T15:22:17Z)
• Quantum-assisted anomaly detection with multivariate Gaussian distribution [1.752215225501591]
  Gassian anomaly detection (GAD) is a prominent task in data mining and machine learning.<n>We propose a quantum algorithm for GAD biult on arithmetic-free black-box quantum state preparation (AFQSP)<n>Our algorithm achieves exponential speedup over the classical GAD when handling low-dimensional datasets.
  arXiv  Detail & Related papers  (2025-05-05T02:21:11Z)
• Quantum Patch-Based Autoencoder for Anomaly Segmentation [44.99833362998488]
  We introduce a patch-based quantum autoencoder (QPB-AE) for image anomaly segmentation. QPB-AE reconstructs the quantum state of the embedded input patches, computing an anomaly map directly from measurement. We evaluate its performance across multiple datasets and parameter configurations.
  arXiv  Detail & Related papers  (2024-04-26T08:42:58Z)
• Probabilistic Sampling of Balanced K-Means using Adiabatic Quantum Computing [93.83016310295804]
  AQCs allow to implement problems of research interest, which has sparked the development of quantum representations for computer vision tasks. In this work, we explore the potential of using this information for probabilistic balanced k-means clustering. Instead of discarding non-optimal solutions, we propose to use them to compute calibrated posterior probabilities with little additional compute cost. This allows us to identify ambiguous solutions and data points, which we demonstrate on a D-Wave AQC on synthetic tasks and real visual data.
  arXiv  Detail & Related papers  (2023-10-18T17:59:45Z)
• Quantum Conformal Prediction for Reliable Uncertainty Quantification in Quantum Machine Learning [47.991114317813555]
  Quantum models implement implicit probabilistic predictors that produce multiple random decisions for each input through measurement shots. This paper proposes to leverage such randomness to define prediction sets for both classification and regression that provably capture the uncertainty of the model.
  arXiv  Detail & Related papers  (2023-04-06T22:05:21Z)
• Quantum Approximate Optimization Algorithm Based Maximum Likelihood Detection [80.28858481461418]
  Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices. Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices.
  arXiv  Detail & Related papers  (2021-07-11T10:56:24Z)
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems [69.33243249411113]
  We show that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels. We conceive a scheme amalgamating QEM with quantum channel coding, and analyse its sampling overhead reduction compared to pure QEM.
  arXiv  Detail & Related papers  (2020-12-15T15:51:27Z)

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.