DC Field | Value | Language |
---|---|---|
dc.contributor.author | Nagata, Koji | ko |
dc.contributor.author | Nakamura, Tadao | ko |
dc.date.accessioned | 2019-02-20T04:51:18Z | - |
dc.date.available | 2019-02-20T04:51:18Z | - |
dc.date.created | 2019-01-28 | - |
dc.date.issued | 2019-01 | - |
dc.identifier.citation | INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, v.58, no.1, pp.247 - 254 | - |
dc.identifier.issn | 0020-7748 | - |
dc.identifier.uri | http://hdl.handle.net/10203/250205 | - |
dc.description.abstract | Let us consider the following game; Bob has a N x M matrix (N rows and M columns) but Alice does not know what matrix he has. The goal is of knowing the unknown matrix. How many queries does she need? In the classical case, she needs N x M queries. In the quantum case, she needs just a query. We propose an algorithm for determining the N x M matrix (N rows and M columns). First, we discuss an algorithm for determining an integer string. The algorithm presented here has the following structure. Given the set of real values {a(1), a(2), a(3),..., a(N)} and a special function g, we determine N values of the function g(a(1)), g(a(2)), g(a(3)),..., g(a(N)) simultaneously. The speed of determining the string is shown to outperform the best classical case by a factor of N. Next, we consider it as a column of the matrix; C-1 = (g(a(1)), g(a(2)), g(a(3)),..., g(a(N))) = (a(11), a(21),..., a(n1)). By using M parallel quantum systems, we have M columns simultaneously, C-1, C-2,..., C-M. The speed of obtaining the M columns (the matrix) is shown to outperform the classical case by a factor of N x M. This implies she needs just a query. | - |
dc.language | English | - |
dc.publisher | SPRINGER/PLENUM PUBLISHERS | - |
dc.title | Quantum Communication Based on an Algorithm of Determining a Matrix | - |
dc.type | Article | - |
dc.identifier.wosid | 000455401000022 | - |
dc.identifier.scopusid | 2-s2.0-85055482758 | - |
dc.type.rims | ART | - |
dc.citation.volume | 58 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 247 | - |
dc.citation.endingpage | 254 | - |
dc.citation.publicationname | INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS | - |
dc.identifier.doi | 10.1007/s10773-018-3926-9 | - |
dc.contributor.nonIdAuthor | Nakamura, Tadao | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.