Refined Quantum Algorithms for Principal Component Analysis and Solving Linear System
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915222246129664 |
|---|---|
| author | Nghiem, Nhat A. |
| author_facet | Nghiem, Nhat A. |
| contents | We outline refined versions of two major quantum algorithms for performing principal component analysis and solving linear equations. Our methods are exponentially faster than their classical counterparts and even previous quantum algorithms/dequantization algorithms. Oracle/black-box access to classical data is not required, thus implying great capacity for near-term realization. Several applications and implications of these results are discussed. First, we show that a Hamiltonian $H$ with classically known rows/columns can be efficiently simulated, adding another model in addition to the well-known sparse access and linear combination of unitaries models. Second, we provide a simpler proof of the known result that quantum matrix inversion cannot achieve sublinear complexity $κ^{1-γ}$ where $κ$ is the conditional number of the inverted matrix. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_00833 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Refined Quantum Algorithms for Principal Component Analysis and Solving Linear System Nghiem, Nhat A. Quantum Physics We outline refined versions of two major quantum algorithms for performing principal component analysis and solving linear equations. Our methods are exponentially faster than their classical counterparts and even previous quantum algorithms/dequantization algorithms. Oracle/black-box access to classical data is not required, thus implying great capacity for near-term realization. Several applications and implications of these results are discussed. First, we show that a Hamiltonian $H$ with classically known rows/columns can be efficiently simulated, adding another model in addition to the well-known sparse access and linear combination of unitaries models. Second, we provide a simpler proof of the known result that quantum matrix inversion cannot achieve sublinear complexity $κ^{1-γ}$ where $κ$ is the conditional number of the inverted matrix. |
| title | Refined Quantum Algorithms for Principal Component Analysis and Solving Linear System |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2504.00833 |