Proposes a QFT-based quantum matrix multiplication framework claiming O(n) adder and O(n²) multiplier gate complexity plus a quantum Strassen variant for potential ML acceleration.
Quantum Verification of Matrix Products
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We present a quantum algorithm that verifies a product of two n*n matrices over any field with bounded error in worst-case time n^{5/3} and expected time n^{5/3} / min(w,sqrt(n))^{1/3}, where w is the number of wrong entries. This improves the previous best algorithm that runs in time n^{7/4}. We also present a quantum matrix multiplication algorithm that is efficient when the result has few nonzero entries.
fields
quant-ph 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Universal Matrix Multiplication on Quantum Computer
Proposes a QFT-based quantum matrix multiplication framework claiming O(n) adder and O(n²) multiplier gate complexity plus a quantum Strassen variant for potential ML acceleration.