Near-term quantum computers will soon reach sizes that are challenging to
directly simulate, even when employing the most powerful supercomputers. Yet,
the ability to simulate these early devices using classical computers is
crucial for calibration, validation, and benchmarking. In order to make use of
the full potential of systems featuring multi- and many-core processors, we use
automatic code generation and optimization of compute kernels, which also
enables performance portability. We apply a scheduling algorithm to quantum
supremacy circuits in order to reduce the required communication and simulate a
45-qubit circuit on the Cori II supercomputer using 8,192 nodes and 0.5
petabytes of memory. To our knowledge, this constitutes the largest quantum
circuit simulation to this date. Our highly-tuned kernels in combination with
the reduced communication requirements allow an improvement in time-to-solution
over state-of-the-art simulations by more than an order of magnitude at every
scale.
%0 Generic
%1 haner2017petabyte
%A Häner, Thomas
%A Steiger, Damian S.
%D 2017
%K quantum_computation quantum_information
%T 0.5 Petabyte Simulation of a 45-Qubit Quantum Circuit
%U http://arxiv.org/abs/1704.01127
%X Near-term quantum computers will soon reach sizes that are challenging to
directly simulate, even when employing the most powerful supercomputers. Yet,
the ability to simulate these early devices using classical computers is
crucial for calibration, validation, and benchmarking. In order to make use of
the full potential of systems featuring multi- and many-core processors, we use
automatic code generation and optimization of compute kernels, which also
enables performance portability. We apply a scheduling algorithm to quantum
supremacy circuits in order to reduce the required communication and simulate a
45-qubit circuit on the Cori II supercomputer using 8,192 nodes and 0.5
petabytes of memory. To our knowledge, this constitutes the largest quantum
circuit simulation to this date. Our highly-tuned kernels in combination with
the reduced communication requirements allow an improvement in time-to-solution
over state-of-the-art simulations by more than an order of magnitude at every
scale.
@misc{haner2017petabyte,
abstract = {Near-term quantum computers will soon reach sizes that are challenging to
directly simulate, even when employing the most powerful supercomputers. Yet,
the ability to simulate these early devices using classical computers is
crucial for calibration, validation, and benchmarking. In order to make use of
the full potential of systems featuring multi- and many-core processors, we use
automatic code generation and optimization of compute kernels, which also
enables performance portability. We apply a scheduling algorithm to quantum
supremacy circuits in order to reduce the required communication and simulate a
45-qubit circuit on the Cori II supercomputer using 8,192 nodes and 0.5
petabytes of memory. To our knowledge, this constitutes the largest quantum
circuit simulation to this date. Our highly-tuned kernels in combination with
the reduced communication requirements allow an improvement in time-to-solution
over state-of-the-art simulations by more than an order of magnitude at every
scale.},
added-at = {2017-10-11T11:50:12.000+0200},
author = {Häner, Thomas and Steiger, Damian S.},
biburl = {https://www.bibsonomy.org/bibtex/259b8ed69617b0c535bffc1df0e242bfc/marschu},
interhash = {eed3a56f7dad54e76c56d14b1189a9a7},
intrahash = {59b8ed69617b0c535bffc1df0e242bfc},
keywords = {quantum_computation quantum_information},
note = {cite arxiv:1704.01127},
timestamp = {2017-10-11T11:50:12.000+0200},
title = {0.5 Petabyte Simulation of a 45-Qubit Quantum Circuit},
url = {http://arxiv.org/abs/1704.01127},
year = 2017
}