DC Field | Value | Language |
---|---|---|
dc.contributor.author | Nagata, Koji | ko |
dc.contributor.author | Geurdes, Han | ko |
dc.contributor.author | Patro, Santanu Kumar | ko |
dc.contributor.author | Heidari, Shahrokh | ko |
dc.contributor.author | Farouk, Ahmed | ko |
dc.contributor.author | Nakamura, Tadao | ko |
dc.date.accessioned | 2019-12-13T01:25:22Z | - |
dc.date.available | 2019-12-13T01:25:22Z | - |
dc.date.created | 2019-12-09 | - |
dc.date.created | 2019-12-09 | - |
dc.date.issued | 2019-11 | - |
dc.identifier.citation | INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, v.58, no.11, pp.3694 - 3701 | - |
dc.identifier.issn | 0020-7748 | - |
dc.identifier.uri | http://hdl.handle.net/10203/268814 | - |
dc.description.abstract | Here, we discuss the generalized Bernstein-Vazirani algorithm for determining a complex number string. The generalized algorithm presented here has the following structure. Given the set of complex values {a(1), a(2), a(3), horizontal ellipsis , a(N)} and a special function g:C, we determine N real parts of values of the function l(a(1)), l(a(2)), l(a(3)), horizontal ellipsis , l(a(N)) and N imaginary parts of values of the function h(a(1)), h(a(2)), h(a(3)), horizontal ellipsis , h(a(N)) simultaneously. That is, we determine the N complex values g(a(j)) = l(a(j)) + ih(a(j)) simultaneously. We mention the two computing can be done in parallel computation method simultaneously. The speed of determining the string of complex values is shown to outperform the best classical case by a factor of N. Additionally, we propose a method for calculating many different matrices A, B, C,... into g(A), g(B), g(C),... simultaneously. The speed of solving the problem is shown to outperform the classical case by a factor of the number of the elements of them. We hope our discussions will give a first step to the quantum simulation problem. | - |
dc.language | English | - |
dc.publisher | SPRINGER/PLENUM PUBLISHERS | - |
dc.title | Quantum Algorithm for Determining a Complex Number String | - |
dc.type | Article | - |
dc.identifier.wosid | 000496661600010 | - |
dc.identifier.scopusid | 2-s2.0-85070921786 | - |
dc.type.rims | ART | - |
dc.citation.volume | 58 | - |
dc.citation.issue | 11 | - |
dc.citation.beginningpage | 3694 | - |
dc.citation.endingpage | 3701 | - |
dc.citation.publicationname | INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS | - |
dc.identifier.doi | 10.1007/s10773-019-04239-9 | - |
dc.contributor.nonIdAuthor | Geurdes, Han | - |
dc.contributor.nonIdAuthor | Patro, Santanu Kumar | - |
dc.contributor.nonIdAuthor | Heidari, Shahrokh | - |
dc.contributor.nonIdAuthor | Farouk, Ahmed | - |
dc.contributor.nonIdAuthor | Nakamura, Tadao | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Quantum algorithms | - |
dc.subject.keywordAuthor | Quantum computation | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.