| Autor: |
Avila, Anderson, Reiser, Renata Hax Sander, Pilla, Maurício Lima, Yamin, Adenauer Correa, Mencagli, Gabriele, França, Felipe MG, Bentes, Cristiana Barbosa, Justen Marzulo, Leandro Augusto, Lima Pilla, Mauricio, Wyrzykowski, Roman, Deelman, Ewa |
| Předmět: |
|
| Zdroj: |
International Journal of High Performance Computing Applications; May2019, Vol. 33 Issue 3, p462-472, 11p |
| Abstrakt: |
Exponential increase and global access to read/write memory states in quantum computing (QC) simulation limit both the number of qubits and quantum transformations which can be currently simulated. Although QC simulation is parallel by nature, spatial and temporal complexity are major performance hazards, making this a nontrivial application for high performance computing. A new methodology employing reduction and decomposition optimizations has shown relevant results, but its GPU implementation could be further improved. In this work, we develop a new kernel for in situ GPU simulation that better explores its resources without requiring further hardware. Shor's and Grover's algorithms are simulated up to 25 and 21 qubits respectively and compared to our previous version, to LIQUi | 〉 's simulator and to ProjectQ framework, showing better results with relative speedups up to 4.38×, 3357.76× and 333× respectively. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
