Improving Quantum Gate Simulation using a GPU
Due to the increasing computing power of the graphics processing units (GPU), they are becoming more and more popular when solving general purpose algorithms. As the simulation of quantum computers results on a problem with exponential complexity, it is advisable to perform a parallel computation, s...
Saved in:
Published in | International Electronic Conference on Computer Science (AIP Conference Proceedings Volume 1060) Vol. 1060; pp. 293 - 297 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
01.01.2008
|
Online Access | Get full text |
ISBN | 0735405905 9780735405905 |
ISSN | 0094-243X |
DOI | 10.1063/1.3037076 |
Cover
Summary: | Due to the increasing computing power of the graphics processing units (GPU), they are becoming more and more popular when solving general purpose algorithms. As the simulation of quantum computers results on a problem with exponential complexity, it is advisable to perform a parallel computation, such as the one provided by the SIMD multiprocessors present in recent GPUs. In this paper, we focus on an important quantum algorithm, the quantum Fourier transform (QTF), in order to evaluate different parallelization strategies on a novel GPU architecture. Our implementation makes use of the new CUDA software/hardware architecture developed recently by NVIDIA. |
---|---|
Bibliography: | SourceType-Scholarly Journals-2 ObjectType-Feature-2 ObjectType-Conference Paper-1 content type line 23 SourceType-Conference Papers & Proceedings-1 ObjectType-Article-3 |
ISBN: | 0735405905 9780735405905 |
ISSN: | 0094-243X |
DOI: | 10.1063/1.3037076 |