mlsanityData to 7 Oct 2026

Covariance matrix preparation for quantum principal component analysis

arXiv 2204.03495 ↗First posted 7 Apr 2022quant-ph cs.LG stat.MLcited by 2

Not on the map. Why?

Abstract (arXiv)

Principal component analysis (PCA) is a dimensionality reduction method in data analysis that involves diagonalizing the covariance matrix of the dataset. Recently, quantum algorithms have been formulated for PCA based on diagonalizing a density matrix. These algorithms assume that the covariance matrix can be encoded in a density matrix, but a concrete protocol for this encoding has been lacking. Our work aims to address this gap. Assuming amplitude encoding of the data, with the data given by the ensemble pi,| psii rangle, then one can easily prepare the ensemble average density matrix overlineρ = sumi pi |psiirangle langle psii |. We first show that overlineρ is precisely the covariance matrix whenever the dataset is centered. For quantum datasets, we exploit global phase symmetry to argue that there always exists a centered dataset consistent with overlineρ, and hence overlineρ can always be interpreted as a covariance matrix. This provides a simple means for preparing the covariance matrix for arbitrary quantum datasets or centered classical datasets. For uncentered classical datasets, our method is so-called "PCA without centering", which we interpret as PCA on a symmetrized dataset. We argue that this closely corresponds to standard PCA, and we derive equations and inequalities that bound the deviation of the spectrum obtained with our method from that of standard PCA. We numerically illustrate our method for the MNIST handwritten digit dataset. We also argue that PCA on quantum datasets is natural and meaningful, and we numerically implement our method for molecular ground-state datasets.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 7 of its 32 references that are in the map. First posted on arXiv 7 Apr 2022.

Builds on

7 of 32 references.

References · 7

  1. 2020Variational Quantum Algorithmscited by 687
  2. 2021Quantum advantage in learning from experimentscited by 186
  3. 2018Quantum principal component analysis only achieves an exponential speedup because of its state preparation assumptionscited by 34
  4. 2019Quantum Hamiltonian-Based Models and the Variational Quantum Thermalizer Algorithmcited by 27
  5. 2019Quantum-inspired algorithms in practicecited by 18
  6. 2021Revisiting dequantization and quantum advantage in learning taskscited by 11
  7. 2022The quantum low-rank approximation problemcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.