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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.