Pacific Northwest National Laboratory (PNNL), Washington State University, United States of America
The rapid development of quantum computing in the NISQ era urgently demands a low-level benchmark suite for conveniently evaluating and verifying the properties of selective prototype hardware, the efficiency of different assemblers, optimizers and schedulers, the robustness of distinct error correction technologies, and the performance of various quantum simulators on classical computers. In this work, we fill this gap by proposing a low-level, light-weighted, and easy-to-use benchmark suite called QASMBench based on the OpenQASM assembly representation. It collects commonly seen quantum algorithms and routines from a variety of domains including chemistry, simulation, linear algebra, searching, optimization, quantum arithmetic, machine learning, fault tolerance, cryptography, etc. QASMBench trades-off between generality and usability. It covers the number of qubits ranging from 2 to 60K, and the circuit depth from 4 to 12M, while keeping most of the benchmarks with qubits less than 16 so they can be directly uploaded and verified on contemporary public available cloud quantum machines. QASMBench is available at https://github.com/uuudown/QASMBench .