% IMPORTANT: The following is UTF-8 encoded.  This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.

@ARTICLE{DeRaedt:858015,
      author       = {De Raedt, Hans and Jin, Fengping and Willsch, Dennis and
                      Nocon, Madita and Yoshioka, Naoki and Ito, Nobuyasu and
                      Yuan, Shengjun and Michielsen, Kristel},
      title        = {{M}assively parallel quantum computer simulator, eleven
                      years later},
      journal      = {Computer physics communications},
      volume       = {237},
      issn         = {0010-4655},
      address      = {Amsterdam},
      publisher    = {North Holland Publ. Co.},
      reportid     = {FZJ-2018-06959},
      pages        = {47-61},
      year         = {2019},
      abstract     = {A revised version of the massively parallel simulator of a
                      universal quantum computer, described in this journal eleven
                      years ago, is used to benchmark various gate-based quantum
                      algorithms on some of the most powerful supercomputers that
                      exist today. Adaptive encoding of the wave function reduces
                      the memory requirement by a factor of eight, making it
                      possible to simulate universal quantum computers with up to
                      48 qubits on the Sunway TaihuLight and on the K computer.
                      The simulator exhibits close-to-ideal weak-scaling behavior
                      on the Sunway TaihuLight, on the K computer, on an IBM
                      BlueGene/Q, and on Intel Xeon based clusters, implying that
                      the combination of parallelization and hardware can track
                      the exponential scaling due to the increasing number of
                      qubits. Results of executing simple quantum circuits and
                      Shor’s factorization algorithm on quantum computers
                      containing up to 48 qubits are presented.},
      cin          = {JSC / JARA-HPC},
      ddc          = {530},
      cid          = {I:(DE-Juel1)JSC-20090406 / $I:(DE-82)080012_20140620$},
      pnm          = {511 - Computational Science and Mathematical Methods
                      (POF3-511) / PhD no Grant - Doktorand ohne besondere
                      Förderung (PHD-NO-GRANT-20170405) / Manipulation and
                      dynamics of quantum spin systems $(jjsc09_20180501)$},
      pid          = {G:(DE-HGF)POF3-511 / G:(DE-Juel1)PHD-NO-GRANT-20170405 /
                      $G:(DE-Juel1)jjsc09_20180501$},
      typ          = {PUB:(DE-HGF)16},
      UT           = {WOS:000459366400007},
      doi          = {10.1016/j.cpc.2018.11.005},
      url          = {https://juser.fz-juelich.de/record/858015},
}