QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation
Open accessThe DOI matches its Crossref record; 134 of the 134 references it cites were found in a registry or an index; 11 of the 51 sources its claims cite were checked for support.
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, and so on, 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, comprising 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 .
Overview
CoChat Summary
## TL;DR
QASMBench is an OpenQASM-based benchmark suite for evaluating and simulating NISQ quantum devices, compilers, and simulators using real quantum workloads from many domains. The paper also introduces four circuit metrics and reports fidelity experiments on 12 IBM-Q machines plus cross-vendor comparisons on IonQ and Rigetti systems.
## Key findings
- QASMBench contains benchmark circuits organized into small (2–5 qubits), medium (6–15 qubits), and large (>15 qubits) categories; the largest circuit is `adder_n127` with 3991 gates and 127 qubits.
- The authors propose four circuit metrics: gate density, retention lifespan, measurement density, and entanglement variance, in addition to width and depth, to characterize execution efficiency and NISQ sensitivity.
- In their IBM-Q evaluation, they ran 24 circuits from the small category on 12 IBM-Q machines, using density matrix state tomography, for 25,000 circuit evaluations total and 8192 shots per evaluation.
- They report that fidelity is generally higher for shallower circuits, and that larger machines do not necessarily give higher fidelity; for example, the paper says shallow circuits generally have higher fidelity than deep ones, and the 127-qubit IBM-Q Washington showed reduced fidelity compared with smaller machines.
- In cross-vendor tests on 4 circuits (Deutsch, DNN, Grover, iSWAP), IonQ’s trapped-ion QPU generally had higher fidelity for relatively shallow circuits, but performance dropped for deeper circuits; the paper attributes this to IonQ’s 99.35% single-gate fidelity versus 99.90% for IBM-Q Washington.
## Methods
- The paper presents a benchmark suite built around OpenQASM circuits, drawing routines from multiple domains including chemistry, simulation, linear algebra, search, optimization, arithmetic, machine learning, fault tolerance, cryptography, and quantum communication.
- It categorizes benchmarks by qubit count into small, medium, and large groups and reports circuit properties such as qubits, gate counts, and CX counts for each benchmark.
- For evaluation, it uses fidelity defined via the distance between the ideal state from a noiseless classical simulation and the reconstructed noisy state from density matrix tomography; it also compares results across IBM-Q, IonQ, and Rigetti devices.
## Limitations
- The paper states that density matrix tomography is extremely computationally expensive and requires 3^n circuit evaluations for an n-qubit circuit, making it feasible only for small circuits.
- It also states that tomography must be performed within a short calibration window; otherwise, the reconstructed state is no longer consistent.
- Evident from the text: the hardware evaluation is limited to a small subset of benchmarks for real devices (24 small circuits on IBM-Q; 4 circuits across vendors), so the empirical results do not cover the full suite.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
11 Valid · 2 Not valid · 26 Not checked · 68 Own results and interpretations
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“The qec_dist3 benchmark performing a 3-distance 5-qubit surface code which is developed based on [90].”
What the sources say
- Partly supportedcites [90] Kristel Michielsen, Madita Nocon, Dennis Willsch, Fengping Jin, Thomas Lippert, and Hans De Raedt. 2017. Benchmarking gate-based quantum computers. Computer Physics Communications 220 (2017), 44ś55. sourceExperimental — accuracy not yet measured
Section 6.2 ('Distance-three 5-qubit code') confirms that the paper implements a 3-distance, 5-qubit code ([[5,1,3]]) with an encoding circuit run on the IBM-QE (~33 µs), so a benchmark built on this work does perform a distance-three 5-qubit code. However, our copy does not call that code a surface code: Section 6 ('Error correction') explicitly contrasts the two five-qubit codes studied — 'The first is a particular distance-two surface code already analyzed by Devitt' and 'The second is an instance of the perfect [[5, 1, 3]] code' — and Section 6.1 labels the distance-two [[5,1,2]] code as the surface code, while Section 6.2 describes the [[5,1,3]] code as a perfect quantum error-correcting code. The 'surface code' descriptor in the citing sentence is therefore not supported by this source. (LLM, conf=0.78)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“it actually leverages the noise presented in the NISQ devices [30]”
What the sources say
- Supportedcites [30] Andrew W Cross, Graeme Smith, and John A Smolin. 2015. Quantum learning robust against noise. Physical Review A 92, 1 (2015), 012327. source
The abstract (p. 1) states that noise 'can be an unlikely ally' and that 'the presence of noise is essential for creating this quantum-classical separation', and the Introduction (p. 1) says the quantum advantage 'occurs because of the noise' for the parity/LPN setting. The Conclusion (p. 4) ties this to noisy near-term hardware: quantum supremacy for learning 'should be possible ... using several hundred noisy qubits, i.e. without the use of quantum error-correction', and the Introduction notes 'the physical implementation of any oracle on bare qubits will inevitably be noisy'. Our copy never uses the acronym 'NISQ' — the paper frames the leverage as belonging to the quantum parity learner (classical LPN being the intractable side) — but the substance of the paraphrase is stated. (LLM, conf=0.82)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“it is computationally intractable for classical approaches [101]”
What the sources say
- Partly supportedcites [101] Daniel K Park, June-Koo K Rhee, and Soonchil Lee. 2018. Noise-tolerant parity learning with one quantum bit. Physical Review A 97, 3 (2018), 032327. sourceExperimental — accuracy not yet measured
The Introduction (p. 1) states that 'The LPN problem is thought to be computationally intractable classically [5-8]', and Sec. II.A (p. 2) adds that 'The best-known classical algorithms for LPN has superpolynomial complexity in n [5-8]' — so the source clearly supports the classical-hardness point. However, the paper hedges the intractability as a widely held belief and, as fact, only asserts superpolynomial complexity of the best *known* classical algorithms (no proven lower bound), whereas the citing sentence prints it flatly as 'it is computationally intractable for classical approaches'. The dropped hedge is the part not supported as stated. (LLM, conf=0.70)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We observe that shallow circuits in general exhibit higher idelity than deep circuits, likely due to less decay impact from a shorter execution time”
hedgedstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
In the paper
“Applications in QASMBench can be launched and veriied on several NISQ platforms, including IBM-Q, Rigetti, IonQ and Quantinuum.”
- Also stated in: § Introduction · plain
“Circuits from QASMBench can be directly uploaded and evaluated in IBM-Q machines as well as other platforms (e.g., Rigetti through the Qiskit interface, IonQ and Quantinuum through Microsoft Azure Quantum [92]).”
What the sources say
- Not matchedcites [92] Microsoft. [n.d.]. Azure Quantum. URL: https://azure.microsoft.com/en-us/services/quantum/.
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Also stated in: § Introduction · plain
29 more claims
Create a free account to see all 107 claims and to verify the 18 references still open.
- Probably not a substantial claim. 64
- It may state two separate claims as one. 24
Citations
Cites
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
On the Einstein Podolsky Rosen paradox
Bell, J. S. (1964) · Physics Physique Fizika · doi:10.1103/physicsphysiquefizika.1.195 · Cited by 12,252
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Gisin, N., Ribordy, G., Tittel, W., & Zbinden, H. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.145 · Cited by 8,515
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2014) · Theoretical Computer Science · doi:10.1016/j.tcs.2014.05.025 · Cited by 8,299 · cited 4×
“Since QKD is a critical component for quantum communication and quantum networks, we include BB84 as a sample benchmark in QASMBench.”
BackgroundInfluentialQuantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2020) · arXiv · doi:10.48550/arxiv.2003.06557 · Cited by 8,299
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Research works printed but not linked: 1
- Juexiao Su, Tianheng Tu, and Lei He. 2016. A quantum annealing approach for Boolean satisfiability problem. In 2016 53rd ACM/EDAC/IEEE Design Automation Conference (DAC). IEEE, 1–6.
Cited by
MQT Bench: Benchmarking Software and Design Automation Tools for Quantum Computing
Quetschlich, N., Burgholzer, L., & Wille, R. (2023) · Quantum · doi:10.22331/q-2023-07-20-1062 · Cited by 202
SupermarQ: A Scalable Quantum Benchmark Suite
Tomesh, T., Gokhale, P., Omole, V., Ravi, G. S., Smith, K. N., Viszlai, J., Wu, X.-C., Hardavellas, N., Martonosi, M. R., & Chong, F. T. (2022) · arXiv · doi:10.48550/arxiv.2202.11045 · Cited by 143
“QASMBench is a collection of benchmark circuits that range in size from two to a thousand qubits [30].”
BackgroundA Hardware-Aware Heuristic for the Qubit Mapping Problem in the NISQ Era
Niu, S., Suau, A., Staffelbach, G., & Todri-Sanial, A. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3026544 · Cited by 103
Quantum Software Components and Platforms: Overview and Quality Assessment
Serrano, M., Cruz-Lemus, J. A., Pérez‐Castillo, R., & Piattini, M. G. (2022) · ACM Computing Surveys · doi:10.1145/3548679 · Cited by 129
Optimization Applications as Quantum Performance Benchmarks
Lubinski, T., Coffrin, C., McGeoch, C., Sathe, P., Apanavicius, J., & Neira, D. E. B. (2023) · arXiv · doi:10.48550/arxiv.2302.02278 · Cited by 62
Simultaneous Execution of Quantum Circuits on Current and Near-Future NISQ Systems
Ohkura, Y., Satoh, T., & Meter, R. V. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3164716 · Cited by 82
Integrating quantum computing resources into scientific HPC ecosystems
Beck, T. L., Baroni, A., Bennink, R. S., Buchs, G., Pérez, E. A. C., Eisenbach, M., da Silva, R. F., Meena, M. G., Gottiparthi, K., Groszkowski, P., et al. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.06.058 · Cited by 109
Singh, H., Majumder, S., & Mishra, S. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0161057 · Cited by 51
ARQUIN: Architectures for Multinode Superconducting Quantum Computers
Ang, J., Carini, G. A., Chen, Y., Chuang, I. L., Demarco, M., Economou, S. E., Eickbusch, A., Faraon, A., Fu, K. C., Girvin, S. M., et al. (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3674151 · Cited by 124
Self-citationCompiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors
Tan, D. B., Bluvstein, D., Lukin, M. D., & Cong, J. (2024) · Quantum · doi:10.22331/q-2024-03-14-1281 · Cited by 91
Patel, T., Potharaju, A., Li, B., Roy, R. B., & Tiwari, D. (2020) · SC20: International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1109/sc41405.2020.00050 · Cited by 37
Benchmarking Quantum Processor Performance at Scale
McKay, D. C., Hincks, I., Pritchett, E. J., Carroll, M., Govia, L. C. G., & Merkel, S. T. (2023) · arXiv · doi:10.48550/arxiv.2311.05933 · Cited by 29
Atomique: A Quantum Compiler for Reconfigurable Neutral Atom Arrays
Wang, H., Liu, P., Tan, D. B., Liu, Y., Gu, J., Pan, D. Z., Cong, J., Acar, U. A., & Han, S. (2024) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca59077.2024.00030 · Cited by 79
Analyzing Quantum Programs with LintQ: A Static Analysis Framework for Qiskit
Paltenghi, M., & Pradel, M. (2024) · Proceedings of the ACM on software engineering. · doi:10.1145/3660802 · Cited by 61
Practical Introduction to Benchmarking and Characterization of Quantum Computers
Hashim, A., Nguyen, L. B., Goss, N., Marinelli, B., Naik, R., Chistolini, T., Hines, J., Marceaux, J. P., Kim, Y., Gokhale, P., et al. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.030202 · Cited by 129
Noise-Aware Quantum Circuit Simulation With Decision Diagrams
Grurl, T., Fus, J., & Wille, R. (2022) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2022.3182628 · Cited by 34
qTask: Task-parallel Quantum Circuit Simulation with Incrementality
Huang, T. (2023) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps54959.2023.00080 · Cited by 22
Effects of Imperfections on Quantum Algorithms: A Software Engineering Perspective
Greiwe, F., Krüger, T., & Mauerer, W. (2023) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw59989.2023.00014 · Cited by 36
Quantum Circuit Reconstruction from Power Side-Channel Attacks on Quantum Computer Controllers
Erata, F., Xu, C., Piskač, R., & Szefer, J. M. (2024) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2024.i2.735-768 · Cited by 50
Robust Qubit Mapping Algorithm via Double-Source Optimal Routing on Large Quantum Circuits
Cheng, C.-Y., Yang, C.-Y., Kuo, Y.-H., Wang, R.-C., Cheng, H.-C., & Huang, C.-Y. (. (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3680291 · Cited by 19
Quantum algorithms for scientific computing
Au-Yeung, R., Camino, B., Rathore, O., & Kendon, V. M. (2024) · Reports on Progress in Physics · doi:10.1088/1361-6633/ad85f0 · Cited by 44
FlatDD: A High-Performance Quantum Circuit Simulator using Decision Diagram and Flat Array
Jiang, S., Fu, R., Burgholzer, L., Wille, R., Ho, T.-Y., & Huang, T. (2024) · Proceedings of the International Conference on Parallel Processing · doi:10.1145/3673038.3673073 · Cited by 17
The Imitation Game: Leveraging CopyCats for Robust Native Gate Selection in NISQ Programs
Das, P., Kessler, E., & Shi, Y. (2023) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca56546.2023.10071025 · Cited by 24
Dynamic Pulse Switching for Protection of Quantum Computation on Untrusted Clouds
Trochatos, T., Deshpande, S. R., Xu, C., Lu, Y., Ding, Y., & Szefer, J. M. (2024) · IEEE International Symposium on Hardware Oriented Security and Trust (HOST) · doi:10.1109/host55342.2024.10545385 · Cited by 13
Defining Best Practices for Quantum Benchmarks
Amico, M., Zhang, H., Jurcevic, P., Bishop, L. S., Nation, P., Wack, A., & McKay, D. C. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00084 · Cited by 20
Pietikäinen, I., Černotík, O., Eickbusch, A., Maiti, A., Garmon, J. W. O., Filip, R., & Girvin, S. M. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.040307 · Cited by 28
HamLib: A Library of Hamiltonians for Benchmarking Quantum Algorithms and Hardware
Sawaya, N. P. D., Marti-Dafcik, D., Ho, Y., Tabor, D. P., Bernal, D. E., Magann, A. B., Premaratne, S., Dubey, P. K., Matsuura, A. Y., Bishop, N. C., et al. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.10296 · Cited by 24
Agent-Q: Fine-Tuning Large Language Models for Quantum Circuit Generation and Optimization
Jern, L., Uotila, V., Yu, C., & Zhao, B. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00179 · Cited by 40
KetGPT – Dataset Augmentation of Quantum Circuits Using Transformers
Apak, B., Bandić, M., Sarkar, A., & Feld, S. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-63778-0_17 · Cited by 18
Position Papers for the ASCR Workshop on Basic Research Needs in Quantum Computing and Networking
Lougovski, P., Parekh, O., Broz, J., Byrd, M., Chembo, Y. K., de Jong, W. A., Figueroa, E. V., Humble, T. S., Larson, J. M., Quiroz, G., et al. (2023) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/2283320 · Cited by 11
QuantumEyes: Towards Better Interpretability of Quantum Circuits
Ruan, S., Guan, Q., Griffin, P., Mao, Y., & Wang, Y. (2023) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2023.3332999 · Cited by 29
SHARE: Secure Hardware Allocation and Resource Efficiency in Quantum Systems
Upadhyay, S., & Ghosh, S. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00130 · Cited by 12
Online Detection of Golden Circuit Cutting Points
Chen, D. T., Hansen, E. H., Li, X., Orenstein, A., Kulkarni, V. R., Chaudhary, V., Guan, Q., Liu, J., Zhang, Y., & Xu, S. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00012 · Cited by 12
Quantum Computing in The Cloud - A Systematic Literature Review
Zhahir, A. A., Mohd, S. M., Shuhud, M. I. M., Idrus, B., Zainuddin, H., Jan, N. M., & Wahiddin, M. R. (2024) · International journal of electrical and computer engineering systems · doi:10.32985/ijeces.15.2.7 · Cited by 17
Quantum circuit mutants: Empirical analysis and recommendations
Usandizaga, E. M., Ali, S., Yue, T., & Arcaini, P. (2025) · Empirical Software Engineering · doi:10.1007/s10664-025-10643-z · Cited by 31
Yang, T., Wang, W., Wang, L., Zhao, B., Liang, C., & Shan, Z. (2023) · Results in Physics · doi:10.1016/j.rinp.2023.106944 · Cited by 9
Reuse-Aware Compilation for Zoned Quantum Architectures Based on Neutral Atoms
Lin, W.-H., Tan, D. B., & Cong, J. (2025) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca61900.2025.00021 · Cited by 42
Chatterjee, A., Rappaport, S., Giri, A., Johri, S., Proctor, T. J., Neira, D. E. B., Sathe, P., & Lubinski, T. (2025) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2025.3558090 · Cited by 21
OPAQUE: Obfuscating Phase in Quantum Circuit Compilation for Efficient IP Protection
Rehman, A., Langford, V., John, J., & Liu, Y. (2025) · International Symposium on Quality Electronic Design (ISQED) · doi:10.1109/isqed65160.2025.11014313 · Cited by 7
Full State Quantum Circuit Simulation Beyond Memory Limit
Zhao, Y., Chen, Y., Li, H., Wang, Y., Chang, K., Wang, B., Li, B., & Han, Y. (2023) · doi:10.1109/iccad57390.2023.10323666 · Cited by 8
PARALLAX: A Compiler for Neutral Atom Quantum Computers under Hardware Constraints
Ludmir, J., & Patel, T. (2024) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc41406.2024.00079 · Cited by 25
Ecmas: Efficient Circuit Mapping and Scheduling for Surface Code
Zhu, M., Fu, H., Wu, J., Zhang, C., Xie, W., & Li, X. (2024) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1109/cgo57630.2024.10444874 · Cited by 14
Buchs, G., Beck, T. L., Bennink, R. S., Claudino, D., Delgado, A., Fadel, N. A., Groszkowski, P., Hamilton, K. E., Humble, T. S., Kumar, N., et al. (2026) · Future Generation Computer Systems · doi:10.1016/j.future.2026.108487 · Cited by 16
Self-citationOptimized quantum circuit partitioning across multiple quantum processors
Kaur, E., Shapourian, H., Zhao, J., Kilzer, M., Kompella, R. R., & Nejabati, R. (2025) · Quantum Computing, Communication, and Simulation · doi:10.1117/12.3042502 · Cited by 15
Understanding Logical-Shift Error Propagation in Quanvolutional Neural Networks
Vallero, M., Dri, E., Giusto, E., Montrucchio, B., & Rech, P. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3372880 · Cited by 8
A Multilevel Framework for Partitioning Quantum Circuits
Burt, F., Chen, K.-C., & Leung, K. K. (2026) · Quantum · doi:10.22331/q-2026-01-22-1984 · Cited by 9
UPBEAT: Test Input Checks of Q# Quantum Libraries
Hu, T., Ye, G., Tang, Z., Tan, S. H., Wang, H., Li, M., & Wang, Z. (2024) · ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA) · doi:10.1145/3650212.3652120 · Cited by 12
Silva, A. C. D. N., Galvão, L. Q., & Cruz, C. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad6ec3 · Cited by 7
Machine Learning for Quantum Hardware Performance Assessment
Saravanan, V., & Saeed, S. M. (2022) · IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD) · doi:10.1109/iccd56317.2022.00030 · Cited by 6
Quantum Federated Learning: A Comprehensive Survey
Uddin, M. R., Shaon, S., Rahman, R., Nguyen, D. C., Dobre, O. A., & Niyato, D. (2025) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2025.3644750 · Cited by 48
GeQuPI: Quantum Program Improvement with Multi-Objective Genetic Programming
Gemeinhardt, F., Klikovits, S., & Wimmer, M. (2024) · Journal of Systems and Software · doi:10.1016/j.jss.2024.112223 · Cited by 7
Defining Standard Strategies for Quantum Benchmarks
Amico, M., Zhang, H., Jurcevic, P., Bishop, L. S., Nation, P., Wack, A., & McKay, D. C. (2023) · arXiv · doi:10.48550/arxiv.2303.02108 · Cited by 5
Development of a multi-technology, template-based quantum circuits compilation toolchain
Avitabile, M., Cirillo, G. A., Simoni, M., Turvani, G., & Graziano, M. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03649-9 · Cited by 5
LSQCA: Resource-Efficient Load/Store Architecture for Limited-Scale Fault-Tolerant Quantum Computing
Kobori, T., Suzuki, Y., Ueno, Y., Tanimoto, T., Todo, S., & Tokunaga, Y. (2025) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca61900.2025.00033 · Cited by 27
Seo, H., & Kim, Y. (2024) · Proceedings - International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems · doi:10.1109/mascots64422.2024.10786505 · Cited by 4
Quantum Circuit Compilation for Trapped-Ion Processors With the Drive-Through Architecture
Chang, C.-M., Jiang, J.-H. R., Chiou, D.-W., Hsu, T., & Lin, G.-D. (2025) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2025.3548423 · Cited by 10
Automatic architecture design for distributed quantum computing
Luo, T.-Y., Zheng, Y.-Z., Fu, X., & Deng, Y. (2024) · Chinese Physics B · doi:10.1088/1674-1056/ad7c2c · Cited by 5
On the optimality of quantum circuit initial mapping using reinforcement learning
Amer, N. E., Gomaa, W. E., Kimura, K. R., Ueda, K., & El-Mahdy, A. (2024) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-024-00225-1 · Cited by 5
Ranjan, A., Patel, T., Gandhi, H., Silver, D., Cutler, W., & Tiwari, D. (2023) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3581784.3607058 · Cited by 4
Shaking Up Quantum Simulators with Fuzzing and Rigour
Klimis, V., Bensoussan, A., Chachkarova, E., Even-Mendoza, K., Fortz, S., & Lenihan, C. (2025) · Proceedings of the ACM on Programming Languages · doi:10.1145/3763100 · Cited by 12
Benchmarking Quantum Circuit Transformation With QKNOB Circuits
Li, S., Zhou, X., & Feng, Y. (2025) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2025.3527399 · Cited by 12
MLQM: Machine learning approach for accelerating optimal qubit mapping
Sun, W., Li, X., Yu, L., Wang, Z., Chen, G., & Yang, G. (2025) · Future Generation Computer Systems · doi:10.1016/j.future.2025.107906 · Cited by 5
Harnessing CUDA-Q’s MPS for Tensor Network Simulations of Large-Scale Quantum Circuits
Schieffer, G., Markidis, S., & Peng, I. B. (2025) · Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP) · doi:10.1109/pdp66500.2025.00022 · Cited by 13
CloudQC: A Network-aware Framework for Multi-tenant Distributed Quantum Computing
Zhou, R., Gan, Y., Liu, Y., & Qian, C. (2025) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs63083.2025.00024 · Cited by 8
Efficient Random Quantum Circuit Generator: A Benchmarking Approach for Quantum Simulators
Hai, V. T., Le, V. T. D., Luan, P. H., & Nakashima, Y. (2024) · RIVF International Conference on Computing and Communication Technologies (RIVF) · doi:10.1109/rivf64335.2024.11009047 · Cited by 3
QVM: Quantum Gate Virtualization Machine
Tornow, N., Giortamis, E., & Bhatotia, P. (2025) · Proceedings of the ACM on Programming Languages · doi:10.1145/3729290 · Cited by 11
Hybrid Quantum-Classical Algorithm for an Integrated Feature Selection and Logistic Regression Model
Ye, L., Wen, M., Zhang, F., Xu, Y., Zhang, Y., Ma, Y., & Wen, K. (2026) · IEEE Transactions on Engineering Management · doi:10.1109/tem.2026.3657976 · Cited by 3
Decision Diagram vs. State Vector: A Comparative Study on Quantum Computing Simulation Efficiency
Kimura, Y., Li, S., Sato, H., & Fujita, M. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00095 · Cited by 3
Lee, S., Hour, L., Kim, Y., & Han, Y. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad2752 · Cited by 3
Xu, H.-Z., Chai, X., Hu, M., Wang, Z., Feng, Y.-L., Chen, Y., Zhang, X., Wang, J., Zhuang, W.-F., Jin, Y., et al. (2025) · Research · doi:10.34133/research.0947 · Cited by 6
Quixote: Improving Fidelity of Quantum Program by Independent Execution of Controlled Gates
Jang, E., Choi, S., & Ro, W. W. (2023) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac56929.2023.10247757 · Cited by 11
Hybrid Quantum-Classical Computing - A Fusion of Classical And Quantum Computational SubstratesPreprint
Ramouthar, R., & Şeker, H. (2023) · AfricArXiv (OSF Preprints) · doi:10.31730/osf.io/rj7cv · Cited by 8
Counting collisions in random circuit sampling for benchmarking quantum computers
Mari, A. (2024) · APL Quantum · doi:10.1063/5.0219266 · Cited by 2
Simulating work extraction in a dinuclear quantum battery using a variational quantum algorithm
Galvão, L. Q., das Neves, A. C., Anka, M. F., & Cruz, C. (2025) · Physical review. E · doi:10.1103/6bm4-8ckl · Cited by 5
Yousuf, M. M., & Sofi, S. A. (2026) · Neurocomputing · doi:10.1016/j.neucom.2026.132809 · Cited by 10
Towards Effective Local Search for Qubit Mapping
Luo, C. W., Cao, S., Guo, S., & Hu, C. (2025) · IEEE Transactions on Computers · doi:10.1109/tc.2025.3544869 · Cited by 3
Distribution-adaptive dynamic shot optimization for variational quantum algorithms
Kim, Y., Jang, E., Kim, H. J., Choi, S., Lee, C., Kim, D., Kyoung, W., Shin, K., & Ro, W. W. (2025) · Physical Review Research · doi:10.1103/vwhk-22b8 · Cited by 10
Transpiling Quantum Circuits on Graph Databases
Uotila, V. (2025) · Workshop on Quantum Computing and Quantum-Inspired Technology for Data-Intensive Systems and Applications (Q-Data) · doi:10.1145/3736393.3736694 · Cited by 5
Characterizing the Inter-Core Qubit Traffic in Large-Scale Quantum Modular Architectures
Rached, S. B., Agudo, I. L., Rodrigo, S., Bandić, M., García-Sáez, A., Feld, S., van Someren, H., Alarcón, E., Almudéver, C. G., & Abadal, S. (2025) · IEEE Access · doi:10.1109/access.2025.3583218 · Cited by 11
Exact Inference for Quantum Circuits: A Testing Oracle for Quantum Software Stacks
Lee, K., Hong, J., & Ryu, S. (2025) · IEEE/ACM International Conference on Automated Software Engineering (ASE) · doi:10.1109/ase63991.2025.00203 · Cited by 3
PIMutation: Exploring the Potential of Real PIM Architecture for Quantum Circuit Simulation
Lee, D. T., Jang, E., Choi, S., An, J., Kim, C., & Ro, W. W. (2025) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1145/3658617.3697583 · Cited by 2
Distributed-HISQ: A Distributed Quantum Control Architecture
Zhao, Y., Zhao, K., Zhou, P., Liu, D., Luo, T., Zheng, Y., Luo, P., Hu, S., Lin, J., Guo, C., et al. (2025) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/3725843.3756048 · Cited by 9
Physically-Aware Qubit Reuse for Optimized Quantum Circuit Compilation Using Machine Learning
Kizhuvettil, G., Ioannou, G., Niu, S., & Saeed, S. M. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00083 · Cited by 2
SWIPER: Minimizing Fault-Tolerant Quantum Program Latency via Speculative Window Decoding
Viszlai, J., Chadwick, J. D., Joshi, S., Ravi, G. S., Li, Y., & Chong, F. T. (2025) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/3695053.3731022 · Cited by 15
Kim, J., Cho, J., Jeong, H., Min, D., Choi, J., Hong, J., & Kim, J. (2025) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/3725843.3756026 · Cited by 1
Revisiting Noise-adaptive Transpilation in Quantum Computing: How Much Impact Does it Have?
Huo, Y., Wei, J., Kverne, C., Akewar, M., Bhimani, J., & Patel, T. (2025) · doi:10.1109/iccad66269.2025.11240918 · Cited by 9
A Dynamic Test Oracle for Quantum Programs With Separable Output States
Li, Y., Cai, K.-Y., & Yin, B. (2026) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2026.3670211 · Cited by 7
A Practical Framework for Assessing the Performance of Observable Estimation in Quantum Simulation
Niu, S., Kökcü, E., Johri, S., Ramesh, A., Chatterjee, A., Neira, D. E. B., Camps, D., & Lubinski, T. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00050 · Cited by 6
Multi-target quantum compilation algorithm
Hai, V. T., Viet, N. T., Urbaneja, J., Linh, N. V., Tran, L. N., & Ho, L. B. (2024) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ad9705 · Cited by 11
Accelerating Scientific Applications with the Quantum Edge: A Drug Design Use Case
Maio, V. D., & Brandić, I. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-40843-4_11 · Cited by 3
Ramouthar, R., & Şeker, H. (2023) · doi:10.14293/pr2199.000251.v1 · Cited by 2
ARTERY: Fast Quantum Feedback using Branch Prediction
Tian, W., Lu, L., Tan, S., Liang, Y. E., Li, T., Zhou, K., Jia, X., & Yin, J. (2025) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/3695053.3731086 · Cited by 5
Optimized Compilation for Distributed Quantum Computing
(2026) · doi:10.1109/access.2026.3706203 · Cited by 1
Qracle: A Graph-Neural-Network-Based Parameter Initializer for Variational Quantum Eigensolvers
Zhang, C., Jiang, L., & Chen, F. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00031 · Cited by 8
Automated Synthesis of Quantum Algorithms via Classical Numerical Techniques
Huang, Y., Grossman‐Ponemon, B. E., & Hyde, D. (2025) · ACM Transactions on Quantum Computing · doi:10.1145/3757068 · Cited by 2
Grurl, T., Fuß, J., & Wille, R. (2023) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl57333.2023.00036 · Cited by 2
Descriptor: A Simulated Multitenant Quantum Execution Environment Attack Dataset (QAD)
Udugahapattuwa, P., de Alwis, C., Wijewardhana, U., & Liyanage, M. (2026) · IEEE data descriptions. · doi:10.1109/ieeedata.2026.3699581 · Cited by 1
Exact Routing Algorithm for Quantum Circuit Compilation for Star Architectures
Gnatowski, A., Rudy, J., Niżyński, T., & Święcicki, K. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-37936-8_15 · Cited by 3
Seo, H., Lee, S., & Kim, Y. (2025) · doi:10.1109/iccad66269.2025.11240726 · Cited by 1
Metadata
- Authors
- Li, A., Stein, S., Krishnamoorthy, S., & Ang, J.
- Affiliations
- Pacific Northwest National Laboratory (US)
- Venue
- ACM Transactions on Quantum Computing
- Published
- 2023-02-24
- Volume
- 4
- Issue
- 2
- Pages
- 1-26
- ISSN
- 2643-6809 (ISSN-L)
- 2643-6817
- OpenAlex
- W4288758398
- Cited by
- 183
- References
- 132
- Citations by year
- 2026: 52 · 2025: 74 · 2024: 32 · 2023: 20
- FWCI
- 10.77
- Type
- journal article
- Language
- en
- Open access
- green
- www.osti.gov
- Locations
- ACM Transactions on Quantum Computing (publishedVersion)
- OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
- Funders
- U.S. Department of Energy, Office of Science, National Quantum Information Science Research Centers, Co-design Center for Quantum Advantage (DE-SC0012704)
- DOE Office of Science User Facility (DE-AC05-00OR22725)
- Pacific Northwest National Laboratory is operated by Battelle for the U.S. Department of Energy (DE-AC05-76RL01830)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
- Keywords
- NISQ devices, OpenQASM, gate density, measurement density, quantum simulation, IBM Quantum, IonQ, quantum machine learning, quantum chemistry
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (qwen3.8-omni-flash).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.