A Note on Fine-Grained Quantum Reductions for Linear Algebraic Problems
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914053613420544 |
|---|---|
| author | Doney, Kyle Musco, Cameron |
| author_facet | Doney, Kyle Musco, Cameron |
| contents | We observe that any $T(n)$ time algorithm (quantum or classical) for several central linear algebraic problems, such as computing $\det(A)$, $tr(A^3)$, or $tr(A^{-1})$ for an $n \times n$ integer matrix $A$, yields a $O(T(n)) + \tilde O(n^2)$ time \textit{quantum algorithm} for $n \times n$ matrix-matrix multiplication. That is, on quantum computers, the complexity of these problems is essentially equivalent to that of matrix multiplication. Our results follow by first observing that the Bernstein-Vazirani algorithm gives a direct quantum reduction from matrix multiplication to computing $tr(ABC)$ for $n \times n$ inputs $A,B,C$. We can then reduce $tr(ABC)$ to each of our problems of interest.
For the above problems, and many others in linear algebra, their fastest known algorithms require $Θ(n^ω)$ time, where $ω\approx 2.37$ is the current exponent of fast matrix multiplication. Our finding shows that any improvements beyond this barrier would lead to faster quantum algorithms for matrix multiplication. Our results complement existing reductions from matrix multiplication in algebraic circuits [BCS13], and reductions that work for standard classical algorithms, but are not tight -- i.e., which roughly show that an $O(n^{3-δ})$ time algorithm for the problem yields an $O(n^{3-δ/3})$ matrix multiplication algorithm [WW10]. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_19528 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Note on Fine-Grained Quantum Reductions for Linear Algebraic Problems Doney, Kyle Musco, Cameron Data Structures and Algorithms Computational Complexity Numerical Analysis We observe that any $T(n)$ time algorithm (quantum or classical) for several central linear algebraic problems, such as computing $\det(A)$, $tr(A^3)$, or $tr(A^{-1})$ for an $n \times n$ integer matrix $A$, yields a $O(T(n)) + \tilde O(n^2)$ time \textit{quantum algorithm} for $n \times n$ matrix-matrix multiplication. That is, on quantum computers, the complexity of these problems is essentially equivalent to that of matrix multiplication. Our results follow by first observing that the Bernstein-Vazirani algorithm gives a direct quantum reduction from matrix multiplication to computing $tr(ABC)$ for $n \times n$ inputs $A,B,C$. We can then reduce $tr(ABC)$ to each of our problems of interest. For the above problems, and many others in linear algebra, their fastest known algorithms require $Θ(n^ω)$ time, where $ω\approx 2.37$ is the current exponent of fast matrix multiplication. Our finding shows that any improvements beyond this barrier would lead to faster quantum algorithms for matrix multiplication. Our results complement existing reductions from matrix multiplication in algebraic circuits [BCS13], and reductions that work for standard classical algorithms, but are not tight -- i.e., which roughly show that an $O(n^{3-δ})$ time algorithm for the problem yields an $O(n^{3-δ/3})$ matrix multiplication algorithm [WW10]. |
| title | A Note on Fine-Grained Quantum Reductions for Linear Algebraic Problems |
| topic | Data Structures and Algorithms Computational Complexity Numerical Analysis |
| url | https://arxiv.org/abs/2509.19528 |