Quantum algorithm for the root-finding problem
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Nagata, Koji | ko |
| dc.contributor.author | Nakamura, Tadao | ko |
| dc.date.accessioned | 2022-11-10T07:00:57Z | - |
| dc.date.available | 2022-11-10T07:00:57Z | - |
| dc.date.created | 2022-11-10 | - |
| dc.date.created | 2022-11-10 | - |
| dc.date.issued | 2019-03 | - |
| dc.identifier.citation | QUANTUM STUDIES-MATHEMATICS AND FOUNDATIONS, v.6, no.1, pp.135 - 139 | - |
| dc.identifier.issn | 2196-5609 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/299488 | - |
| dc.description.abstract | A quantum algorithm of finding the roots of a polynomial function f(x)=xm+am-1xm-1++a1x+a0 is discussed by using the generalized Bernstein-Vazirani algorithm. Our algorithm is presented in the modulo 2. 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. | - |
| dc.language | English | - |
| dc.publisher | SPRINGER | - |
| dc.title | Quantum algorithm for the root-finding problem | - |
| dc.type | Article | - |
| dc.identifier.scopusid | 2-s2.0-85059873934 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 6 | - |
| dc.citation.issue | 1 | - |
| dc.citation.beginningpage | 135 | - |
| dc.citation.endingpage | 139 | - |
| dc.citation.publicationname | QUANTUM STUDIES-MATHEMATICS AND FOUNDATIONS | - |
| dc.identifier.doi | 10.1007/s40509-018-0171-0 | - |
| dc.contributor.nonIdAuthor | Nakamura, Tadao | - |
| dc.description.isOpenAccess | N | - |
| dc.type.journalArticle | Article | - |
| dc.subject.keywordAuthor | Quantum computation | - |
| dc.subject.keywordAuthor | Quantum algorithms | - |
| dc.subject.keywordPlus | IMPLEMENTATION | - |
| dc.subject.keywordPlus | COMPUTATION | - |
- Appears in Collection
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.