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 条

[41] POLYNOMIAL ROOT-FINDING ALGORITHMS AND BRANCHED COVERS
KIM, MH
SUTHERLAND, S
SIAM JOURNAL ON COMPUTING, 1994, 23 (02) : 415 - 436
[42] Quantum Algorithm for Polynomial Root Finding Problem
Sun, Guodong
Su, Shenghui
Xu, Maozhi
2014 TENTH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS), 2014, : 469 - 473
[43] Design and use of a learning object for finding complex polynomial roots
Benitez, Julio
Gimenez, Marcos H.
Hueso, Jose L.
Martinez, Eulalia
Riera, Jaime
INTERNATIONAL JOURNAL OF MATHEMATICAL EDUCATION IN SCIENCE AND TECHNOLOGY, 2013, 44 (03) : 365 - 376
[44] Efficient isolation of polynomial's real roots
Rouillier, F
Zimmermann, P
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2004, 162 (01) : 33 - 50
[45] HYBRID METHODS FOR FINDING ROOTS OF A POLYNOMIAL - WITH APPLICATION TO BCH DECODING
CHIEN, RT
CUNNINGHAM, BD
IEEE TRANSACTIONS ON INFORMATION THEORY, 1969, 15 (02) : 329 - +
[46] Implementation of the FGLM Algorithm and Finding Roots of Polynomial Involutive Systems
V. P. Gerdt
D. A. Yanovich
Programming and Computer Software, 2003, 29 : 72 - 74
[47] Finding the Maximum Module of the Roots of a Polynomial by Particle Swarm Optimization
Qu, Liangdong
He, Dengxu
ADVANCES IN SWARM INTELLIGENCE, PT 1, PROCEEDINGS, 2010, 6145 : 214 - 221
[48] On an efficient simultaneous method for finding polynomial zeros
Petkovic, M. S.
Petkovic, L. D.
Dzunic, J.
APPLIED MATHEMATICS LETTERS, 2014, 28 : 60 - 65
[49] Implementation of the FGLM algorithm and finding roots of polynomial involutive systems
Gerdt, VP
Yanovich, DA
PROGRAMMING AND COMPUTER SOFTWARE, 2003, 29 (02) : 72 - 74
[50] On an efficient inclusion method for finding polynomial zeros
Milosevic, Dusan M.
Milosevic, Mimica R.
Dzunic, Jovana
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2015, 290 : 298 - 309

← 1 2 3 4 5 →