Metraipolis › archive › dc_c97cffb03ca3

Quantum-Stable Robust Principal Component Analysis: Theory and Evidence from NISQ Regimes — arXiv:2609.22193

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.22193
License (as archived)
CC0-1.0
Archived
2026-10-09T22:41:56.392Z
SHA-256 of the archived text
4272ef061f35dbd8def6517aec428582e884f05590b2725ae28ac3b99f96b180
Stable URL of this page
https://metraipolis.com/documento/dc_c97cffb03ca3

How to cite

Quantum-Stable Robust Principal Component Analysis: Theory and Evidence from NISQ Regimes — arXiv:2609.22193 — arXiv (en), https://arxiv.org/abs/2609.22193 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c97cffb03ca3 (Metraipolis archive dc_c97cffb03ca3, sha256 4272ef061f35dbd8def6517aec428582e884f05590b2725ae28ac3b99f96b180)
BibTeX
@misc{dcc97cffb03ca3,
  title = {Quantum-Stable Robust Principal Component Analysis: Theory and Evidence from NISQ Regimes — arXiv:2609.22193},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.22193},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c97cffb03ca3; sha256 4272ef061f35dbd8def6517aec428582e884f05590b2725ae28ac3b99f96b180},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.22193. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Robust Principal Component Analysis (RPCA) is a fundamental technique for extracting low-rank structures from data corrupted by sparse anomalies and noise. While classical RPCA and its stable variants have been widely studied, their computational cost grows prohibitively with data dimensionality. Motivated by emerging trends in quantum machine learning, this paper introduces Quantum-Stable RPCA, the first quantum algorithm for robust low-rank and sparse decomposition under noisy intermediate-scale quantum (NISQ) constraints. Our approach integrates Quantum Singular Value Thresholding (QSVT) for low-rank recovery with Quantum Sparse Approximation (QSA) for anomaly detection, while explicitly modeling gate, decoherence, and measurement errors inherent in quantum hardware. We establish six theoretical results covering recovery guarantees, identifiability, robustness to approximate structure, quantum noise resilience, convergence of alternating minimization, and generalization bounds, thereby extending classical RPCA theory to the quantum regime. Extensive Qiskit-based simulations confirm that Quantum-Stable RPCA delivers significant runtime improvements over classical solvers while maintaining competitive reconstruction accuracy, even under realistic NISQ noise levels. This work provides a blueprint for quantum-enhanced robust learning, bridging machine learning and signal processing paradigms.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-22 in cs.ET).
Categorie arXiv: Signal Processing (eess.SP) ; Emerging Technologies (cs.ET).
Pagina del lavoro: https://arxiv.org/abs/2609.22193 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T22:25:18.776Z dalla pagina https://arxiv.org/catchup/cs.ET/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).