Software stack benchmarks
Benchmark the classical software around the QPU (compilers, transpilers, SDKs, and verification tools) on circuit corpora with known baselines or optima.
-
Automated head-to-head comparison of quantum compilers (Qiskit, Tket, Cirq, Quilc, PyZX) on gate counts, depth, circuit cost, and runtime, with auto-generated LaTeX reports
-
IBM's open-source suite of 1,000+ timed tests comparing how fast quantum SDKs construct, manipulate, and transpile circuits, plus the quality of the compiled output.
-
Library of 70,000+ benchmark circuits, each served at four abstraction levels, so quantum compilers, simulators, and verifiers can be compared on common workloads.
-
Compiler-stress circuits with provably near-optimal SWAP and depth overheads built in, generalizing QUEKO to benchmark qubit mapping on instances that genuinely need routing
-
Benchmark circuits whose minimal SWAP count on a given device is provably known, scoring layout-synthesis tools by the factor of extra SWAPs they insert over the optimum
-
Synthetic circuits built backward from a device's coupling graph so the optimal mapped depth is known exactly, exposing how far layout-synthesis tools sit from optimal
-
The 2008 online database of reversible functions and verified circuit realizations that served as the de facto workload set for quantum compilation benchmarking through the 2010s
-
OpenQASM circuit suite spanning combinational, dynamic, sequential, and variational circuits, built as standard inputs for quantum software tools from equivalence checkers to debuggers