Pith. sign in

REVIEW 5 cited by

Benchmarking the performance of quantum computing software

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2409.08844 v2 pith:NSMVIVWE submitted 2024-09-13 quant-ph

Paul D. Nation , Abdullah Ash Saki , Sebastian Brandhofer , Luciano Bello , Shelly Garion , Matthew Treinish , Ali Javadi-Abhari This is my paper
classification quant-ph
keywords quantumperformancesoftwarebenchmarkingbenchpresssuitecomputingframework
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We present Benchpress, a benchmarking suite for evaluating the performance and range of functionality of multiple quantum computing software development kits. This suite consists of a collection of over $1000$ tests measuring key performance metrics for a wide variety of operations on quantum circuits comprised of up to $930$ qubits and $\mathcal{O}(10^{6})$ two-qubit gates, as well as an execution framework for running the tests over multiple quantum software packages in a unified manner. We give a detailed overview of the benchmark suite, its methodology, and generate representative results over seven different quantum software packages. The flexibility of the Benchpress framework allows for benchmarking that not only keeps pace with quantum hardware improvements but can preemptively gauge the quantum circuit processing costs of future device architectures. Being open-source, Benchpress ensures the transparency and verification of performance claims.

Discussion (0). Sign in to comment.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Optimizing QAOA circuit transpilation with parity twine and SWAP network encodings

    quant-ph 2025-05 conditional novelty 6.0 of 10

    A simulated-annealing qubit-ordering step makes parity twine and SWAP network encodings beat Qiskit's transpiler for QAOA circuits above a connectivity threshold, and parity twine runs up to 20 qubits on IBM hardware.

  2. Automatic Qiskit Code Refactoring Using Large Language Models

    cs.SE 2025-06 conditional novelty 5.0 of 10

    A structured taxonomy of Qiskit migration scenarios improves GPT-4's line-level refactoring precision from 0.32 to 0.55 and recall from 0.35 to 0.62 on 25 synthetic snippets.

  3. Taxonomy of migration scenarios for Qiskit refactoring using LLMs

    cs.SE 2025-06 conditional novelty 5.0 of 10

    LLMs can generate a structured taxonomy of Qiskit migration and refactoring scenarios that largely overlaps with an expert-built taxonomy and adds some scenarios.

  4. Stacking the Odds: Full-Stack Quantum System Design Space Exploration

    quant-ph 2025-06 conditional novelty 4.0 of 10

    A large benchmarking study shows that co-optimized mapping, routing, and connectivity settings improve simulated quantum circuit fidelity more than added optimization passes or larger devices.

  5. Quantum Algorithm Software for Condensed Matter Physics

    cond-mat.str-el 2025-06 reject novelty 2.0 of 10

    A review of quantum algorithm software that advertises a benchmark suite, yet the body contains no benchmarks, data, or code.

Pith tools