Welcome to the Munich Quantum Toolkit Benchmark Library (MQT Bench)!

Quantum software tools for a wide variety of design tasks on and across different levels of abstraction are crucial for eventually realizing useful quantum applications. This requires practical and relevant benchmarks in order for new software tools or design automation methods to be empirically evaluated and compared to the current state of the art. Since these tools and methods operate on and across different levels of abstraction, it is beneficial having benchmarks consistently available across those levels. The MQT Benchmark Library (MQT Bench) provides a single benchmark suite which offers the same benchmark algorithms on different levels of abstractions. At the moment, MQT Bench comprises more than 30.000 benchmark circuits ranging from 2 up to 130 qubits on four abstraction levels.

In order to create a benchmark set according to your needs, simply use to form below to choose

Afterwards, push the "Download Benchmarks"-button to download all benchmark instances based on the selection as a .zip file.

For a brief description of the benchmarks, we are referring to this page.

For a brief description of the file format of the resulting instances, we are referring to this page.

For a more detailed description of MQT Bench, we are referring to the corresponding paper "MQT Bench: Benchmarking Software and Design Automation Tools for Quantum Computing". Our implementation is available on Github.

In case you are using MQT Bench in your work, we would be thankful if you referred to it by citing the following publication:

@misc{quetschlich2022mqtbench,
  title={{{MQT Bench}}: Benchmarking Software and Design Automation Tools for Quantum Computing},
  shorttitle = {{{MQT Bench}}},
  author={Quetschlich, Nils and Burgholzer, Lukas and Wille, Robert},
  year={2022},
  eprint = {2204.13719},
  eprinttype = {arxiv},
  publisher = {arXiv},
  note={{{MQT Bench}} is available at \url{https://www.cda.cit.tum.de/mqtbench/}},
}

In case you have any problems or questions feel free to contact us via quantum.cda@xcit.tum.de. More on our work on quantum computation is summarized on this page.

Benchmarks
Qubit Range
Abstraction Level
Native Gate-Set
Architecture
Optimization Level
Min (>1)
Max (≤130)
Alg.
Indep.
Gates
Map.
IBM
Rigetti
Smallest
Biggest
0
1
2
3
All Benchmarks
Amplitude Estimation (AE)
Deutsch-Jozsa
Graph State
GHZ State
Grover's (no ancilla)
Grover's (v-chain)
Portfolio Optimization with QAOA
Portfolio Optimization with VQE
Quantum Approximation Optimization Algorithm (QAOA)
Quantum Fourier Transformation (QFT)
QFT Entangled
Quantum Generative Adversarial Network
Quantum Phase Estimation (QPE) exact
Quantum Phase Estimation (QPE) inexact
Quantum Walk (no ancilla)
Quantum Walk (v-chain)
Variational Quantum Eigensolver (VQE)
Efficient SU2 ansatz with Random Parameters
Real Amplitudes ansatz with Random Parameters
Two Local ansatz with Random Parameters
W-State
Excited State
Fixed Number of Benchmark Circuits
Ground State
Fixed Number of Benchmark Circuits
HHL
Fixed Number of Benchmark Circuits
Pricing Call Option
Fixed Number of Benchmark Circuits
Pricing Put Option
Fixed Number of Benchmark Circuits
Routing
Fixed Number of Benchmark Circuits
Shor's
Fixed Number of Benchmark Circuits
Travelling Salesman
Fixed Number of Benchmark Circuits
# of selected benchmarks:
0

You can download a pre-generated .zip file with all available benchmarks here: