| Item type |
SIG Technical Reports(1) |
| 公開日 |
2022-03-17 |
| タイトル |
|
|
タイトル |
Distributed Qubit Allocation that Minimizes the Total Execution Time for Heterogeneous Quantum Computing |
| タイトル |
|
|
言語 |
en |
|
タイトル |
Distributed Qubit Allocation that Minimizes the Total Execution Time for Heterogeneous Quantum Computing |
| 言語 |
|
|
言語 |
eng |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_18gh |
|
資源タイプ |
technical report |
| 著者所属 |
|
|
|
Faculty of Environment and Information Studies, Keio University SFC/Keio University Quantum Computing Center |
| 著者所属 |
|
|
|
Faculty of Environment and Information Studies, Keio University SFC/Keio University Quantum Computing Center |
| 著者所属(英) |
|
|
|
en |
|
|
Faculty of Environment and Information Studies, Keio University SFC / Keio University Quantum Computing Center |
| 著者所属(英) |
|
|
|
en |
|
|
Faculty of Environment and Information Studies, Keio University SFC / Keio University Quantum Computing Center |
| 著者名 |
Makoto, Nakai
Rodney, Van Meter
|
| 著者名(英) |
Makoto, Nakai
Rodney, Van Meter
|
| 論文抄録 |
|
|
内容記述タイプ |
Other |
|
内容記述 |
Task allocation is one of the essential procedures in distributed computing and this will be also true for distributed quantum computing, which is a promising approach to achieve large-scale quantum computing. Total execution time and the stability in the entire system are the two main optimization criteria for this problem, but existing works for distributed qubit allocation only deal with the latter. This work proposes the heuristic algorithm to decide how each qubit on the given quantum circuit should be allocated on quantum processors with different execution time in order to minimize the total execution time. The performance of the proposed scheme is also evaluated by a simple numerical simulation. |
| 論文抄録(英) |
|
|
内容記述タイプ |
Other |
|
内容記述 |
Task allocation is one of the essential procedures in distributed computing and this will be also true for distributed quantum computing, which is a promising approach to achieve large-scale quantum computing. Total execution time and the stability in the entire system are the two main optimization criteria for this problem, but existing works for distributed qubit allocation only deal with the latter. This work proposes the heuristic algorithm to decide how each qubit on the given quantum circuit should be allocated on quantum processors with different execution time in order to minimize the total execution time. The performance of the proposed scheme is also evaluated by a simple numerical simulation. |
| 書誌レコードID |
|
|
収録物識別子タイプ |
NCID |
|
収録物識別子 |
AA12894105 |
| 書誌情報 |
量子ソフトウェア(QS)
巻 2022-QS-5,
号 20,
p. 1-6,
発行日 2022-03-17
|
| ISSN |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
2435-6492 |
| Notice |
|
|
|
SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. |
| 出版者 |
|
|
言語 |
ja |
|
出版者 |
情報処理学会 |