REVIEW 15 cited by
QASMBench: A Low-level QASM Benchmark Suite for NISQ Evaluation and Simulation
Not yet reviewed by Pith; the record is open.
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
read the original abstract
The rapid development of quantum computing (QC) in the NISQ era urgently demands a low-level benchmark suite and insightful evaluation metrics for characterizing the properties of prototype NISQ devices, the efficiency of QC programming compilers, schedulers and assemblers, and the capability of quantum system simulators in a classical computer. In this work, we fill this gap by proposing a low-level, easy-to-use benchmark suite called QASMBench based on the OpenQASM assembly representation. It consolidates commonly used quantum routines and kernels from a variety of domains including chemistry, simulation, linear algebra, searching, optimization, arithmetic, machine learning, fault tolerance, cryptography, etc., trading-off between generality and usability. To analyze these kernels in terms of NISQ device execution, in addition to circuit width and depth, we propose four circuit metrics including gate density, retention lifespan, measurement density, and entanglement variance, to extract more insights about the execution efficiency, the susceptibility to NISQ error, and the potential gain from machine-specific optimizations. Applications in QASMBench can be launched and verified on several NISQ platforms, including IBM-Q, Rigetti, IonQ and Quantinuum. For evaluation, we measure the execution fidelity of a subset of QASMBench applications on 12 IBM-Q machines through density matrix state tomography, which comprises 25K circuit evaluations. We also compare the fidelity of executions among the IBM-Q machines, the IonQ QPU and the Rigetti Aspen M-1 system. QASMBench is released at: http://github.com/pnnl/QASMBench.
Forward citations
Cited by 15 Pith papers
-
Post-Cut Metadata Inference Attacks on Quantum Circuit Cutting Pipelines
Post-cut metadata from quantum circuit fragments enables high-accuracy inference of algorithm family, cut mechanism, and Hamiltonian structure via machine learning on fragment width, depth, and gate counts.
-
Logical Compilation for Multi-Qubit Iceberg Patches
A new heuristic compiler for multi-qubit iceberg patches reduces circuit depth by 34 percent, cuts gate counts, and improves fidelity metrics on 71 benchmarks compared with naive mapping.
-
Post-Cut Metadata Inference Attacks on Quantum Circuit Cutting Pipelines
Circuit-cutting metadata leaks algorithm family and Hamiltonian k-locality with near-perfect accuracy via topological transpilation penalties on production QPUs.
-
Finding trail covers: near-optimal decompositions of graph states as linear fusion networks
The fusion-minimization problem for photonic graph states is formalized as minimum trail cover; most bounded variants are NP-hard, but heuristics plus a TSP reduction give near-optimal fusion counts in benchmarks.
-
Harvest: Resource-Aware Quantum Compilation for Magic State Protocols
Harvest co-optimizes placement, routing, scheduling, and magic-state supply for lattice-surgery quantum programs, reporting up to 17.8x speedup over sequential execution and reclaiming up to 72% of unused magic-state patches.
-
InferQ: A Database-Oriented Benchmark for Quantum Circuits Simulation
InferQ generates 202,975 compositional quantum circuits as SQL workloads and shows RDBMS engines beat Qiskit Aer on peak memory for ~51% of them, with ML selectors predicting the best backend at up to 95-97% accuracy.
-
General circuit mapping algorithm for neutral atom quantum computers
A graph-theoretic nonlinear integer program solved via genetic algorithm reduces qubit transfers in neutral atom quantum circuit compilation compared to prior zoned-architecture compilers.
-
Price and Payoff: Non-Determinism in Fault Tolerant Quantum Computation
Stochastic magic-state production in fault-tolerant quantum computing inflates execution time but reduces peak resource demand, allowing stochastic-aware factory allocation to cut space-time volume by up to 27% and fa...
-
INJEQT: Improved Magic-State Injection Protocol for Fault-Tolerant Quantum Extractor Architectures
INJEQT reduces synthillation error by up to 22x, wall-clock time by 13x, and space-time cost by 7.2x in extractor FTQC architectures via auxiliary Rz synthesis and pre-fetching.
-
Magnetohydrodynamic drag on an oscillating sphere in a rotating spherical cavity
A unified asymptotic theory for oscillatory magnetohydrodynamic drag on a sphere in a rotating spherical cavity, covering confinement, viscosity, rotation and magnetic coupling, with DNS checks.
-
Magnetohydrodynamic drag on an oscillating sphere in a rotating spherical cavity
A boundary-layer model unifies viscous, Alfvén-wave, and Ohmic contributions to the drag on an oscillating sphere in a rotating MHD cavity, extended to equatorial modes and validated by simulations for planetary applications.
-
Quantum Fidelity-per-Cost: A Metric for Evaluation of Quantum Computing Systems
Cost-aware ranking of cloud QPUs via QFC disagrees with fidelity-only ranking; billing model, not hardware, fixes how the score scales with shot count.
-
Stalls and Spequlation: Pipelined Execution for Fault Tolerant Quantum Computation
A pipelined framework with speculation for logical operations in fault-tolerant quantum computation reduces total pipeline steps by 20-40% on benchmarks by overlapping control, execution, and decoding stages.
-
Optimizing Parallel Execution of Commuting Pauli Product Rotations
Two new heuristics reduce hardware-limited depth of commuting PPR groups by 10-20% on average (up to 50%) in QASMBench circuits compiled to PPRs.
-
A Multi-Level Integrity Evaluation Framework for Quantum Circuits under Controlled Anomaly Injection
A three-metric framework (SIS, OIS, IGS) detects anomalies in quantum circuits more reliably than structural checks alone, as shown by controlled injections where high structural similarity still misses most behaviora...
Discussion (0). Sign in to comment.