Quantum principal component analysis without eigenvector recovery

• URL: http://arxiv.org/abs/2605.27942v1
• Date: Wed, 27 May 2026 04:27:47 GMT
• Title: Quantum principal component analysis without eigenvector recovery
• Abstract summary: 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.
• Score: 9.811303336285961
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Principal component analysis (PCA) is traditionally implemented through a covariance or kernel matrix, leading-eigenvector extraction, and hard rank-$k$ projection. These steps can be computationally costly in high-dimensional and quantum-data settings, sensitive to small eigengaps, and unnecessary when downstream tasks only require principal-subspace scores. Such score-based objectives are important in applications such as anomaly detection, spectral-energy profiling, and other postselection tasks. To address these needs, we introduce a measurement-based soft PCA framework replacing the hard top-$k$ projector with an entropy-regularized Fermi--Dirac filter. This filter is the unique optimizer of an entropy-regularized variational formulation of PCA and converges to the classical PCA projector in the zero-temperature limit. This filter has a direct interpretation as a quantum measurement, which naturally suggests a quantum approach. For centered covariance operators represented by quantum feature states, a single fixed circuit, together with threshold calibration, accesses all optimal filters for different rank budgets or retained-variance levels without rank-dependent circuit updates or eigenvector recovery. For new inputs, the same calibrated quantum circuit yields soft principal subspace scores, spectral energy profiles, and postselected filtered states. The required centering of both training and test data is performed coherently inside the quantum protocol, which is particularly important for quantum data where no classical feature vectors or centered Gram matrix are directly available. By reframing PCA as a calibrated measurement task, this framework bypasses the need for iterative eigenvector extraction and achieves a dimension-independent sample complexity $O(η^{-2})$ for normalized fractional-rank or retained variance scoring at additive accuracy $η$.

Related papers

• Eigenstate Preparation Through Near-Optimal Eigenprobability Filtering [3.2651468573861524]
  We introduce the Dominant Eigenstate Filtering via Eigenprobability Amplification and Thresholding (DEFEAT) algorithm.<n>DEFEAT identifies and filters the eigenstate with the largest overlap with the supplied initial state.<n>Our results provide a general eigenvalue-agnostic primitive for dominant eigenstate filtering and preparation, and for estimating properties of dominant eigenstates.
  arXiv  Detail & Related papers  (2026-08-12T17:39:15Z)
• Quantum Decision Theory for Displacement Detection with Finite-Energy GKP States [46.2474896050764]
  We develop a framework for detecting phase-space displacements with finite-energy, $d$-level Gottesman-Kitaev-Preskill (GKP) probes.<n>For single-mode and entanglement-assisted architectures, we derive the Bayesian minimum-error probability.<n>We benchmark the resulting protocols against coherent-state, direction-matched squeezed-vacuum, and twin-beam schemes.
  arXiv  Detail & Related papers  (2026-08-08T10:32:05Z)
• Diagnosing quantum reservoirs at scale based on expressivity and coverage [42.138439537056954]
  Quantum reservoirs offer a hardware-friendly route to quantum machine learning.<n>Because the reservoir is not optimized, performance depends entirely on the choice of reservoir family.<n>We introduce a scalable, hardware-agnostic framework built on two complementary quantities.
  arXiv  Detail & Related papers  (2026-07-10T14:16:13Z)
• Quantum Spectral Anomaly Detection [9.811303336285961]
  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.
  arXiv  Detail & Related papers  (2026-07-06T16:47:21Z)
• PrismQuant: Rate-Distortion-Optimal Vector Quantization for Gaussian-Mixture Sources [32.267305083092594]
  We introduce PrismQuant, which transmits the component label losslessly and encodes the residual using the component-matched KLT.<n>Experiments on real-world channel-state-information (CSI) data demonstrate competitive or superior performance compared with transformer-based learned codecs.
  arXiv  Detail & Related papers  (2026-05-15T01:05:28Z)
• Filtered Spectral Projection for Quantum Principal Component Analysis [1.2318267573115809]
  Filtered Spectral Projection Algorithm (FSPA)<n>For amplitude-encoded centered data, the ensemble density matrix $=sum_i p_i|_iranglelangle_i|$ coincides with the covariance matrix.<n>For uncentered data, $$ corresponds to PCA without centering, and we derive eigenvalue interlacing bounds quantifying the deviation from standard PCA.
  arXiv  Detail & Related papers  (2026-03-13T11:55:39Z)
• High-Rate Quantized Matrix Multiplication: Theory and Practice [29.75700570685703]
  This work investigates the problem of quantized matrix multiplication (MatMul)<n>We consider two settings: 1) Generic MatMul, where both matrices must be quantized (weight+ quantization); and 2) weight-only quantization, where the second matrix is only known through covariance matrix $_X$ of its columns.
  arXiv  Detail & Related papers  (2026-01-23T21:32:44Z)
• Performance Guarantees for Quantum Neural Estimation of Entropies [31.955071410400947]
  Quantum neural estimators (QNEs) combine classical neural networks with parametrized quantum circuits.<n>We study formal guarantees for QNEs of measured relative entropies in the form of non-asymptotic error risk bounds.<n>Our theory aims to facilitate principled implementation of QNEs for measured relative entropies.
  arXiv  Detail & Related papers  (2025-11-24T16:36:06Z)
• Unsupervised Conformal Inference: Bootstrapping and Alignment to Control LLM Uncertainty [49.19257648205146]
  We propose an unsupervised conformal inference framework for generation.<n>Our gates achieve close-to-nominal coverage and provide tighter, more stable thresholds than split UCP.<n>The result is a label-free, API-compatible gate for test-time filtering.
  arXiv  Detail & Related papers  (2025-09-26T23:40:47Z)
• Adaptive Bayesian Single-Shot Quantum Sensing [35.355128149649666]
  In variational quantum sensing, a probe quantum system is generated via a parameterized quantum circuit.<n>This paper introduces an adaptive protocol that uses Bayesian inference to optimize the active information gain.
  arXiv  Detail & Related papers  (2025-07-22T11:35:27Z)
• Randomized semi-quantum matrix processing [0.0]
  We present a hybrid quantum-classical framework for simulating generic matrix functions. The method is based on randomization over the Chebyshev approximation of the target function. We prove advantages on average depths, including quadratic speed-ups on costly parameters.
  arXiv  Detail & Related papers  (2023-07-21T18:00:28Z)
• One-Dimensional Deep Image Prior for Curve Fitting of S-Parameters from Electromagnetic Solvers [57.441926088870325]
  Deep Image Prior (DIP) is a technique that optimized the weights of a randomly-d convolutional neural network to fit a signal from noisy or under-determined measurements. Relative to publicly available implementations of Vector Fitting (VF), our method shows superior performance on nearly all test examples.
  arXiv  Detail & Related papers  (2023-06-06T20:28:37Z)
• BSQ: Exploring Bit-Level Sparsity for Mixed-Precision Neural Network Quantization [32.770842274996774]
  Mixed-precision quantization can potentially achieve the optimal tradeoff between performance and compression rate of deep neural networks. Previous methods either examine only a small manually-designed search space or utilize a cumbersome neural architecture search to explore the vast search space. This work proposes bit-level sparsity quantization (BSQ) to tackle the mixed-precision quantization from a new angle of inducing bit-level sparsity.
  arXiv  Detail & Related papers  (2021-02-20T22:37:41Z)

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.