Efficient Quantum Algorithms of Finding the Roots of a Polynomial Function

被引：0
|
作者：
Koji Nagata
Tadao Nakamura
Han Geurdes
Josep Batle
Ahmed Farouk
Do Ngoc Diep
Santanu Kumar Patro
机构：
[1] Korea Advanced Institute of Science and Technology,Department of Physics
[2] Keio University,Department of Information and Computer Science
[3] Geurdes Datascience,Departament de Física
[4] Universitat de les Illes Balears,Department of Physics and Computer Science, Faculty of Science
[5] Wilfrid Laurier University,TIMAS
[6] Thang Long University,Institute of Mathematics
[7] VAST,Department of Mathematics
[8] Berhampur University,undefined
来源：
International Journal of Theoretical Physics | 2018年 / 57卷
关键词：
Quantum computation; Quantum algorithms;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Two quantum algorithms of finding the roots of a polynomial function f(x) = xm + am− 1xm− 1 + ... + a1x + a0 are discussed by using the Bernstein-Vazirani algorithm. One algorithm is presented in the modulo 2. The other algorithm is presented in the modulo d. Here all the roots are in the integers Z. The speed of solving the problem is shown to outperform the best classical case by a factor of m in both cases.
引用
收藏
页码：2546 / 2555
页数：9
相关论文
共 50 条
12345