量子PCA不需算特征向量,用测量替代投影,效率更高。
Quantum principal component analysis without eigenvector recovery
- 用熵正则化的费米-狄拉克滤波器替代传统硬投影,实现软主成分分析。
- 单个量子电路配合阈值校准,可处理不同秩预算或方差保留水平。
- 适用于异常检测等后选择任务,特别适合无经典数据的量子场景。
主成分分析(PCA)传统上依赖协方差或核矩阵、特征向量提取与硬秩-k 投影,这些步骤在高维和量子数据场景下计算开销大、对小特征值间隔敏感,且当下游任务仅需主子空间得分时并不必要。针对此类基于得分的目标(如异常检测、谱能分析等),我们提出一种基于测量的软PCA框架,将硬顶-k 投影替换为熵正则化的费米-狄拉克滤波器。该滤波器是熵正则变分形式下PCA的唯一最优解,并在零温极限下收敛至经典PCA投影。其具有直接的量子测量解释,自然导向量子实现。对于由量子特征态表示的中心化协方差算子,单一固定量子电路结合阈值校准,即可访问不同秩预算或保留方差水平下的最优滤波器,无需依赖秩的电路更新或特征向量恢复。新输入下,同一校准电路可输出软主子空间得分、谱能分布及后选择滤波态。训练与测试数据的中心化通过协议内相干方式完成,这对无法获得经典特征向量或中心化格拉姆矩阵的量子数据尤为重要。通过将PCA重构成校准测量任务,该框架避免迭代特征向量提取,实现了维度无关的样本复杂度 $O(η^{-2})$,在加性精度 $η$ 下完成归一化分数秩或保留方差评分。
原文摘要 · Abstract (English)
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 $η$.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。