.png){kind=icon}
.png){kind=icon}
Return
Quantum algorithm for polynomial multiplication and its applications
.png){kind=icon}
OA
AI
DOI：10.1140/epjqt/s40507-025-00423-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Polynomial multiplication is a fundamental operation in various fields of science and engineering. This paper proposes a quantum algorithm for polynomial multiplication that achieves improved efficiency over classical approaches. The core innovation is the use of a quantum Fourier transform with digital encoding. The practical utility and versatility of this algorithm are highlighted through its application to several related computational problems, including string matching, Toeplitz matrix-vector multiplication, and matrix decomposition algorithm. Furthermore, an enhanced version of the quantum polynomial multiplication algorithm is introduced, offering improvements in both execution process and time complexity.
Keywords:
Quantum computation
Quantum algorithm
Polynomial multiplication
String matching
Toeplitz matrix-vector multiplication
Matrix decomposition algorithm
Journal
IF:
5.6
Papers:
526
Citations:
1.1K
View more organizations