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
Kimble, H. J. (2008) · Nature · doi:10.1038/nature07127 · Cited by 6,023
Biamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
Quantum Computations with Cold Trapped Ions
Cirac, J. I., & Zoller, P. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.4091 · Cited by 3,733 · cited 1×
“The qubits are currently built using a variety of different technologies, including superconducting qubits [23, 97], trapped-ions qubits [21, 69], spin qubits [75, 91], photonic qubits [6, 87], etc.”
BackgroundThree qubits can be entangled in two inequivalent ways
Dür, W., Vidal, G., & Cirac, J. I. (2000) · Physical Review A · doi:10.1103/physreva.62.062314 · Cited by 3,384 · cited 1×
“The w_state [37] is a special type of entangled quantum state generalized by: |W ⟩ = 1 √ n ( |10 .”
BackgroundQuantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325 · cited 2×
“LinearSolver: This benchmark realizes the HHL solver [52] for solving a linear equation of 1-qubit.”
BackgroundMethodLloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 2×
“It is designed to implement the Trotter [12, 77] steps for an actual molecule LiH at equilibrium geometry, so as to simulate basis molecular Hamiltonians taking the following form The circuit uses 4 qubits but is quite deep, challenging the T1 and T2 decay of a NISQ device.”
MethodSurface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059 · cited 1×
“The surface code is often considered to be among the most promising QEC approaches as it can cope with error rates around 10−2 [43].”
BackgroundHardware-efficient variational quantum eigensolver for small molecules and quantum magnets
Kandala, A., Mezzacapo, A., Temme, K., Takita, M., Brink, M., Chow, J. M., & Gambetta, J. M. (2017) · Nature · doi:10.1038/nature23879 · Cited by 2,982
Georgescu, I. M., Ashhab, S., & Nori, F. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.153 · Cited by 2,932
Quantum dynamics of single trapped ions
Leibfried, D., Blatt, R., Monroe, C., & Wineland, D. (2003) · Reviews of Modern Physics · doi:10.1103/revmodphys.75.281 · Cited by 2,739 · cited 1×
“The qubits are currently built using a variety of different technologies, including superconducting qubits [23, 97], trapped-ions qubits [21, 69], spin qubits [75, 91], photonic qubits [6, 87], etc.”
BackgroundRapid solution of problems by quantum computation
Deutsch, D., & Jozsa, R. (1992) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1992.0167 · Cited by 2,700
LLVM: A compilation framework for lifelong program analysis & transformation
Lattner, C., & Adve, V. (2004) · International Symposium on Code Generation and Optimization, 2004. CGO 2004. · doi:10.1109/cgo.2004.1281665 · Cited by 2,681
O'Brien, J. L., Furusawa, A., & Vučković, J. (2009) · Nature Photonics · doi:10.1038/nphoton.2009.229 · Cited by 2,388
The theory of variational hybrid quantum-classical algorithms
McClean, J. R., Romero, J., Babbush, R., & Aspuru-Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/2/023023 · Cited by 2,227
Clarke, J., & Wilhelm, F. K. (2008) · Nature · doi:10.1038/nature07128 · Cited by 2,076
A Quantum Approximate Optimization Algorithm
Farhi, E., Goldstone, J., & Gutmann, S. (2014) · arXiv · doi:10.48550/arxiv.1411.4028 · Cited by 1,789
Toffoli, T. (1980) · Lecture Notes in Computer Science · doi:10.1007/3-540-10003-2_104 · Cited by 1,523 · cited 1×
“Toffoli: Similar to the Fredkin gate, the Toffoli gate [111] or CCX) gate is another universal gate.”
Greenberger, D. M., Horne, M. A., & Zeilinger, A. (1989) · Bell’s Theorem, Quantum Theory and Conceptions of the Universe · doi:10.1007/978-94-017-0849-4_10 · Cited by 1,513
Bernstein, E., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300921 · Cited by 1,503
An introduction to quantum machine learning
Schuld, M., Sinayskiy, I., & Petruccione, F. (2015) · Contemporary Physics · doi:10.1080/00107514.2014.964942 · Cited by 1,381 · cited 1×
“Quantum computing (QC) [11, 98] has been envisioned as one of the most promising computing paradigms beyond Moore’s Law for tackling difficult computing challenges that are classically intractable arising from various domains like chemistry [48, 68], machine learning [15, 113], cryptography [49, 116], linear algebra […”
MethodOn the Power of Quantum Computation
Simon, D. R. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796298637 · Cited by 1,295
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244 · cited 1×
“nnnnnnn Quantum computing (QC) [9, 86] has been envisioned as one of the most promising computing paradigms beyond Moore’s Law for tackling difficult computing challenges that are classically intractable arising from various domains like chemistry [46, 62], machine learning [13, 99], cryptography [47, 102], linear alg…”
BackgroundQuantum computation and decision trees
Farhi, E., & Gutmann, S. (1998) · Physical Review A · doi:10.1103/physreva.58.915 · Cited by 1,215
Quantum algorithms: an overview
Montanaro, A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2015.23 · Cited by 1,071 · cited 1×
“It is built based on [81] by augmenting the categories of quantum arithmetic, quantum machine learning and quantum communication.”
MethodAspuru-Guzik, A., & Walther, P. (2012) · Nature Physics · doi:10.1038/nphys2253 · Cited by 952 · cited 1×
“The qubits are currently built using a variety of different technologies, including superconducting qubits [23, 97], trapped-ions qubits [21, 69], spin qubits [75, 91], photonic qubits [6, 87], etc.”
BackgroundQuantum walks: a comprehensive review
Venegas-Andraca, S. E. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0432-5 · Cited by 934
Zhou, L., Wang, S.-T., Choi, S., Pichler, H., & Lukin, M. D. (2020) · Physical Review X · doi:10.1103/physrevx.10.021067 · Cited by 913 · cited 5×
“The quantum approximate optimization algorithm (QAOA) [37, 131] is another variational quantum algorithm that is particularly interesting to NISQ devices, given its ability to tolerant certain degree of noise through the unique quantum-classic hybrid algorithm design.”
MethodInfluentialA single-atom electron spin qubit in silicon
Pla, J. J., Tan, K. Y., Dehollain, J. P., Lim, W. H., Morton, J. J. L., Jamieson, D. N., Dzurak, A. S., & Morello, A. (2012) · Nature · doi:10.1038/nature11449 · Cited by 808
Quantum networks for elementary arithmetic operations
Vedral, V., Barenco, A., & Ekert, A. (1996) · Physical Review A · doi:10.1103/physreva.54.147 · Cited by 806
Creation of a six-atom ‘Schrödinger cat’ state
Leibfried, D., Knill, E., Seidelin, S., Britton, J., Blakestad, R. B., Chiaverini, J., Hume, D. B., Itano, W. M., Jost, J. D., Langer, C., et al. (2005) · Nature · doi:10.1038/nature04251 · Cited by 805
Quantum memory for photons: Dark-state polaritons
Fleischhauer, M., & Lukin, M. D. (2002) · Physical Review A · doi:10.1103/physreva.65.022314 · Cited by 784
Tunable two-dimensional arrays of single Rydberg atoms for realizing quantum Ising models
Labuhn, H., Barredo, D., Ravets, S., de Léséleuc, S., Macrì, T., Lahaye, T., & Browaeys, A. (2016) · Nature · doi:10.1038/nature18274 · Cited by 778
Simulating Physics with Computers
Feynman, R. P. (2018) · Feynman and Computation · doi:10.1201/9780429500459-11 · Cited by 731
Scalable and Robust Randomized Benchmarking of Quantum Processes
Magesan, E., Gambetta, J. M., & Emerson, J. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.180504 · Cited by 724
Validating quantum computers using randomized model circuits
Cross, A. W., Bishop, L. S., Sheldon, S., Nation, P. D., & Gambetta, J. M. (2019) · Physical Review A · doi:10.1103/physreva.100.032328 · Cited by 704
Efficient Quantum Algorithms for Simulating Sparse Hamiltonians
Berry, D. W., Ahokas, G., Cleve, R., & Sanders, B. C. (2007) · Communications in Mathematical Physics · doi:10.1007/s00220-006-0150-x · Cited by 692
Aharonov, D., Ambainis, A., Kempe, J., & Vazirani, U. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380758 · Cited by 654 · cited 2×
“QuantumWalks: Quantum walks [4, 130] is the quantum analogue of the classical random-walk algorithm, which has been adopted for many problems including graph isomorphism [47] and ranking nodes in a network [100].”
BackgroundQuantum Computers Can Search Rapidly by Using Almost Any Transformation
Grover, L. K. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.4329 · Cited by 616
Maurand, R., Jehl, X., Kotekar-Patil, D., Corna, A., Bohuslavskyi, H., Laviéville, R., Hutin, L., Barraud, S., Vinet, M., Sanquer, M., et al. (2016) · Nature Communications · doi:10.1038/ncomms13575 · Cited by 604
Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices
Li, G., Ding, Y., & Xie, Y. (2019) · Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3297858.3304023 · Cited by 594
Superconducting qubit in a waveguide cavity with a coherence time approaching 0.1 ms
Rigetti, C., Gambetta, J. M., Poletto, S., Plourde, B. L. T., Chow, J. M., Córcoles, A. D., Smolin, J. A., Merkel, S. T., Rozen, J. R., Keefe, G. A., et al. (2012) · Physical Review B · doi:10.1103/physrevb.86.100506 · Cited by 584
Simulation of electronic structure Hamiltonians using quantum computers
Whitfield, J. D., Biamonte, J., & Aspuru-Guzik, A. (2011) · Molecular Physics · doi:10.1080/00268976.2011.552441 · Cited by 472 · cited 1×
“We also include two Unitary Coupled Cluster Single-Double VQE ansatz [132] for estimating the ground energy of molecules due to their ultra deep circuits.”
MethodCharacterizing quantum gates via randomized benchmarking
Magesan, E., Gambetta, J. M., & Emerson, J. (2012) · Physical Review A · doi:10.1103/physreva.85.042311 · Cited by 464 · cited 1×
“Existing works have already proposed to adopt randomly generated benchmarks for evaluating the error rates of different gate operations regarding a particular NISQ device [73, 74, 93].”
MethodOpenFermion: the electronic structure package for quantum computers
McClean, J. R., Rubin, N. C., Sung, K. J., Kivlichan, I. D., Bonet-Monroig, X., Cao, Y., Dai, C., Fried, E. S., Gidney, C., Gimby, B., et al. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8ebc · Cited by 464
ProjectQ: An open source software framework for quantum computing
Steiger, D. S., Häner, T., & Troyer, M. (2018) · Quantum · doi:10.22331/q-2018-01-31-49 · Cited by 428
Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
Murali, P., Baker, J. M., Javadi-Abhari, A., Chong, F. T., & Martonosi, M. (2019) · Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3297858.3304075 · Cited by 411
Swift: A language for distributed parallel scripting
Wilde, M., Hategan, M., Wozniak, J. M., Clifford, B., Katz, D. S., & Foster, I. (2011) · Parallel Computing · doi:10.1016/j.parco.2011.05.005 · Cited by 402
Cloud Quantum Computing of an Atomic Nucleus
Dumitrescu, E. F., McCaskey, A. J., Hagen, G., Jansen, G. R., Morris, T. D., Papenbrock, T., Pooser, R. C., Dean, D. J., & Lougovski, P. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.210501 · Cited by 393
A generative modeling approach for benchmarking and training shallow quantum circuits
Benedetti, M., Garcia-Pintos, D., Perdomo, O., Leyton-Ortega, V., Nam, Y., & Perdomo-Ortiz, A. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0157-8 · Cited by 379
A new quantum ripple-carry addition circuit
Cuccaro, S. A., Draper, T. G., Kutin, S. A., & Moulton, D. P. (2004) · arXiv · doi:10.48550/arxiv.quant-ph/0410184 · Cited by 344
An approximate Fourier transform useful in quantum factoring
Coppersmith, D. (2002) · arXiv · doi:10.48550/arxiv.quant-ph/0201067 · Cited by 343
Application-Oriented Performance Benchmarks for Quantum Computing
Lubinski, T., Johri, S., Varosy, P., Coleman, J., Zhao, L., Necaise, J., Baldwin, C. H., Mayer, K., & Proctor, T. J. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3253761 · Cited by 326
Open Quantum Assembly Language
Cross, A. W., Bishop, L. S., Smolin, J. A., & Gambetta, J. M. (2017) · arXiv · doi:10.48550/arxiv.1707.03429 · Cited by 310
TensorFlow Quantum: A Software Framework for Quantum Machine Learning
Broughton, M., Verdon, G., McCourt, T., Martinez, A. J., Yoo, J. H., Isakov, S. V., Massey, P., Halavati, R., Niu, M. Y., Zlokapa, A., et al. (2020) · arXiv · doi:10.48550/arxiv.2003.02989 · Cited by 308
Tannu, S. S., & Qureshi, M. K. (2019) · Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3297858.3304007 · Cited by 306
Preconditioned Quantum Linear System Algorithm
Clader, B. D., Jacobs, B. C., & Sprouse, C. R. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.250504 · Cited by 288
Woerner, S., & Egger, D. J. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0130-6 · Cited by 286
Learning the quantum algorithm for state overlap
Cincio, L., Subaşı, Y., Sornborger, A. T., & Coles, P. J. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aae94a · Cited by 282
Quantum Ising Phases and Transitions in Transverse Ising Models
Chakrabarti, B. K., Dutta, A., & Sen, P. (1996) · Lecture Notes in Physics Monographs · doi:10.1007/978-3-540-49865-0 · Cited by 274
Quantum Recommendation Systems
Kerenidis, I., & Prakash, A. (2016) · arXiv · doi:10.48550/arxiv.1603.08675 · Cited by 270
Quantum computational finance: Monte Carlo pricing of financial derivatives
Rebentrost, P., Gupt, B., & Bromley, T. R. (2018) · Physical Review A · doi:10.1103/physreva.98.022321 · Cited by 265
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., & Chong, F. T. (2022) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca53966.2022.00050 · Cited by 262
Variational quantum algorithms for discovering Hamiltonian spectra
Jones, T., Endo, S., McArdle, S., Yuan, X., & Benjamin, S. C. (2019) · Physical Review A · doi:10.1103/physreva.99.062304 · Cited by 256
Software Mitigation of Crosstalk on Noisy Intermediate-Scale Quantum Computers
Murali, P., Mckay, D. C., Martonosi, M., & Javadi-Abhari, A. (2020) · Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3373376.3378477 · Cited by 253
Quantum Recommendation Systems
Kerenidis, I., & Prakash, A. (2016) · DR-NTU (Nanyang Technological University) · doi:10.4230/lipics.itcs.2017.49 · Cited by 250
Quantum Algorithm Implementations for Beginners
J., A., Adedoyin, A., Ambrosiano, J., Anisimov, P., Casper, W., Chennupati, G., Coffrin, C., Djidjev, H., Gunter, D., Karra, S., et al. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3517340 · Cited by 245
A Functional Quantum Programming Language
Altenkirch, T., & Grattage, J. (2006) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.2005.1 · Cited by 230
Experimental Bell-State Analysis
Weinfurter, H. (1994) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/25/8/001 · Cited by 221
From quantum multiplexing to high-performance quantum networking
Munro, W. J., Harrison, K. A., Stephens, A. M., Devitt, S. J., & Nemoto, K. (2010) · Nature Photonics · doi:10.1038/nphoton.2010.213 · Cited by 215
Dobšíček, M., Johansson, G., Shumeiko, V., & Wendin, G. (2007) · Physical Review A · doi:10.1103/physreva.76.030306 · Cited by 208
Challenges and Opportunities of Near-Term Quantum Computing Systems
Corcoles, A. D., Kandala, A., Javadi-Abhari, A., McClure, D. T., Cross, A. W., Temme, K., Nation, P. D., Steffen, M., & Gambetta, J. M. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2954005 · Cited by 203 · cited 2×
“These NISQ devices, being accessible through IBM-Q cloud or IBM-Q network [57], have been explored by many existing works [25, 56, 71, 91–93 , Table 2 lists the types of gate that are defined in OpenQASM specification (i.e. the " qelib1.inc " header file) [27].”
MethodIs the Trotterized UCCSD Ansatz Chemically Well-Defined?
Grimsley, H. R., Claudino, D., Economou, S. E., Barnes, E., & Mayhall, N. J. (2019) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.9b01083 · Cited by 201
Overview and Comparison of Gate Level Quantum Software Platforms
LaRose, R. (2019) · Quantum · doi:10.22331/q-2019-03-25-130 · Cited by 179
Patel, R. B., Ho, J., Ferreyrol, F., Ralph, T. C., & Pryde, G. J. (2016) · Science Advances · doi:10.1126/sciadv.1501531 · Cited by 176
Application-Oriented Performance Benchmarks for Quantum Computing
Lubinski, T., Johri, S., Varosy, P., Coleman, J., Zhao, L., Necaise, J., Baldwin, C. H., Mayer, K., & Proctor, T. (2021) · arXiv · doi:10.48550/arxiv.2110.03137 · Cited by 159
Toward a MILP Modeling Framework for Distribution System Restoration
Chen, B., Ye, Z., Chen, C., & Wang, J. (2018) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2018.2885322 · Cited by 153
(2014) · doi:10.1145/2597917.2597939 · Cited by 152
Adaptive quantum state tomography with neural networks
Quek, Y., Fort, S., & Ng, H. K. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00436-9 · Cited by 150
Security of two quantum cryptography protocols using the same four qubit states
Branciard, C., Gisin, N., Kraus, B., & Scarani, V. (2005) · Physical Review A · doi:10.1103/physreva.72.032301 · Cited by 146
Two-particle quantum walks applied to the graph isomorphism problem
Gamble, J. K., Friesen, M., Zhou, D., Joynt, R., & Coppersmith, S. N. (2010) · Physical Review A · doi:10.1103/physreva.81.052313 · Cited by 145 · cited 1×
“QuantumWalks: Quantum walks [2, 113] is the quantum analogue of the classical random-walk algorithm, which has been adopted for many problems including graph isomorphism [45] and ranking nodes in a network [88].”
BackgroundSupermarQ: 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 · cited 1×
“SupermarQ [123] comprises a set of circuits in attempts to benchmark the current term quantum processors.”
BackgroundPaparo, G. D., & Martin-Delgado, M. A. (2012) · Scientific Reports · doi:10.1038/srep00444 · Cited by 136
Full-stack, real-system quantum computer studies: architectural comparisons and design insights
Murali, P., Linke, N. M., Martonosi, M., Abhari, A. J., Nguyen, N. H., & Alderete, C. H. (2019) · Proceedings of the 46th International Symposium on Computer Architecture · doi:10.1145/3307650.3322273 · Cited by 128 · cited 1×
“To close the gap between practical quantum applications and real quantum machines, contributions from the computer system and architecture community are undoubtedly critical in tacking several key challenges [19], including software and hardware verification [109], defining and perforating abstraction boundaries [84],…”
BackgroundMitigating Measurement Errors in Quantum Computers by Exploiting State-Dependent Bias
Tannu, S. S., & Qureshi, M. K. (2019) · Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1145/3352460.3358265 · Cited by 118
Direct Randomized Benchmarking for Multiqubit Devices
Proctor, T. J., Carignan-Dugas, A., Rudinger, K., Nielsen, E., Blume-Kohout, R., & Young, K. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.030503 · Cited by 118
(2019) · doi:10.1145/3297858.3304018 · Cited by 118 · cited 1×
“To close the gap between practical quantum applications and real quantum machines, contributions from the computer system and architecture community are undoubtedly critical in tacking several key challenges [21], including software and hardware verification [125], defining and perforating abstraction boundaries [96],…”
BackgroundLarus, J., Switzerland, A. '. A. S. F. P. L. A. O. S. 2. L., Association for Computing Machinery-Digital Library, ACM Special Interest Group on Computer Architecture, ACM Special Interest Group on Embedded Systems, ACM Special Interest Group on Operating Systems, ACM Special Interest Group on Programming Languages, & SIGs, A. (2020) · doi:10.1145/3373376 · Cited by 107
Tannu, S. S., & Qureshi, M. (2019) · Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1145/3352460.3358257 · Cited by 100
Benchmarking gate-based quantum computers
Michielsen, K., Nocon, M., Willsch, D., Jin, F., Lippert, T., & De Raedt, H. (2017) · Computer Physics Communications · doi:10.1016/j.cpc.2017.06.011 · Cited by 82
Quantum learning robust against noise
Cross, A. W., Smith, G., & Smolin, J. A. (2015) · Physical Review A · doi:10.1103/physreva.92.012327 · Cited by 80
EQC: ensembled quantum computing for variational quantum algorithms
Stein, S., Wiebe, N., Ding, Y., Peng, B., Kowalski, K., Baker, N., Ang, J., & Li, A. (2022) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/3470496.3527434 · Cited by 63
Self-citationCloud based QC with Amazon Braket
Gonzalez, C. (2021) · Digitale Welt · doi:10.1007/s42354-021-0330-z · Cited by 56
Zhou, L., Wang, S.-T., Choi, S., Pichler, H., & Lukin, M. D. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1812.01041 · Cited by 54
(2021) · doi:10.1145/3458817.3476172 · Cited by 49
A language and hardware independent approach to quantum–classical computing
McCaskey, A. J., Dumitrescu, E. F., Liakh, D., Chen, M., Feng, W., & Humble, T. S. (2018) · SoftwareX · doi:10.1016/j.softx.2018.07.007 · Cited by 46
A quantum computational compiler and design tool for technology-specific targets
Smith, K. N., & Thornton, M. A. (2019) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/3307650.3322262 · Cited by 44
QuClassi: A Hybrid Deep Neural Network Architecture based on Quantum State Fidelity
Stein, S. A., Baheri, B., Chen, D., Mao, Y., Guan, Q., Li, A., Xu, S., & Ding, C. (2021) · arXiv · doi:10.48550/arxiv.2103.11307 · Cited by 41
Self-citationKang, M.-S., Heo, J., Choi, S. G., Moon, S., & Han, S.-W. (2019) · Scientific Reports · doi:10.1038/s41598-019-42662-4 · Cited by 38
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
Random circuit block-encoded matrix and a proposal of quantum LINPACK benchmark
Dong, Y., & Lin, L. (2021) · Physical Review A · doi:10.1103/physreva.103.062412 · Cited by 34 · cited 3×
“Quantum Linpack, proposed by Dong and Lin [35] recently, attempted to develop a random circuit block-encoded matrix (RACBEM) for measuring the QC capability in resolving a random system of linear equations.”
Proceedings of the 11th ACM Conference on Computing Frontiers
(2014) · doi:10.1145/2597917 · Cited by 29
A quantum teleportation experiment for undergraduate studentsPreprint
Fedortchenko, S. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1607.02398 · Cited by 26
Identification of networking quantum teleportation on 14-qubit IBM universal quantum computer
Huang, N.-N., Huang, W.-H., & Li, C. (2020) · Scientific Reports · doi:10.1038/s41598-020-60061-y · Cited by 26
QuGAN: A Generative Adversarial Network Through Quantum StatesPreprint
Stein, S. A., Baheri, B., Chen, D., Mao, Y., Guan, Q., Li, A., Fang, B., & Xu, S. (2020) · arXiv (Cornell University) · Cited by 26
Self-citationA Bayesian Approach for Characterizing and Mitigating Gate and Measurement Errors
Zheng, M., Li, A., Terlaky, T., & Yang, X. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3563397 · Cited by 25
Self-citationQuantum counterfeit coin problems
Iwama, K., Nishimura, H., Raymond, R., & Teruyama, J. (2012) · Theoretical Computer Science · doi:10.1016/j.tcs.2012.05.039 · Cited by 17 · cited 1×
“up, with a time complexity of O (k 1 4 ) [64].”
BackgroundNoise-tolerant parity learning with one quantum bit
Park, D. K., Rhee, J.-K. K., & Lee, S. (2018) · Physical Review A · doi:10.1103/physreva.97.032327 · Cited by 12 · cited 1×
“This application is very promising for NISQ devices because (i) it is computationally intractable for classical approaches [101]; and (ii) it actually leverages the noise presented in the NISQ devices [30], which is usually seen as a hurdle in other applications.”
MethodPatel, R. B., Ho, J., Ferreyrol, F., Ralph, T. C., & Pryde, G. J. (2016) · Frontiers in Optics · doi:10.1364/fio.2016.ff1c.3 · Cited by 8
Quantum Counterfeit Coin Problems
Iwama, K., Nishimura, H., Raymond, R., & Teruyama, J. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17517-6_10 · Cited by 4
Classical and Quantum Algorithms for the Boolean Satisfiability ProblemPreprint
Barrón-Romero, C. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1510.02682 · Cited by 3
Quantum Computing is Getting Real
(2018) · doi:10.1145/3173162.3177152 · Cited by 3
The Physical Implementation of Quantum Computation
DiVincenzo, D. P. (2000) · Fortschritte der Physik · doi:10.1002/1521-3978(200009)48:9/11<771::aid-prop771>3.0.co;2-e
A Bayesian Approach for Characterizing and Mitigating Gate and Measurement Errors
Zheng, M., Li, A., Terlaky, T., et al. (2020) · arXiv · doi:10.48550/arxiv.2010.09188
Self-citationChallenges and Opportunities of Near-Term Quantum Computing Systems
Corcoles, A. D., Kandala, A., Javadi-Abhari, A., et al. (2019) · arXiv · doi:10.48550/arxiv.1910.02894
Random circuit block-encoded matrix and a proposal of quantum LINPACK benchmark
Dong, Y., & Lin, L. (2020) · arXiv · doi:10.48550/arxiv.2006.04010
Software Mitigation of Crosstalk on Noisy Intermediate-Scale Quantum Computers
Murali, P., McKay, D. C., Martonosi, M., et al. (2020) · arXiv · doi:10.48550/arxiv.2001.02826
QuGAN: A Quantum State Fidelity based Generative Adversarial Network
Stein, S. A., Baheri, B., Chen, D., et al. (2020) · arXiv · doi:10.48550/arxiv.2010.09036
Self-citationQuantum Computing is Getting Real
Chong, F. T. (2018) · ACM SIGPLAN Notices · doi:10.1145/3296957.3177152
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
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.