The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
OpenQASM 3: A Broader and Deeper Quantum Assembly Language
Open accessAbstract
Quantum assembly languages are machine-independent languages that traditionally describe quantum computation in the circuit model. Open quantum assembly language (OpenQASM 2) was proposed as an imperative programming language for quantum circuits based on earlier QASM dialects. In principle, any quantum computation could be described using OpenQASM 2, but there is a need to describe a broader set of circuits beyond the language of qubits and gates. By examining interactive use cases, we recognize two different timescales of quantum-classical interactions: real-time classical computations that must be performed within the coherence times of the qubits, and near-time computations with less stringent timing. Since the near-time domain is adequately described by existing programming frameworks, we choose in OpenQASM 3 to focus on the real-time domain, which must be more tightly coupled to the execution of quantum operations. We add support for arbitrary control flow as well as calling external classical functions. In addition, we recognize the need to describe circuits at multiple levels of specificity, and therefore we extend the language to include timing, pulse control, and gate modifiers. These new language features create a multi-level intermediate representation for circuit development and optimization, as well as control sequence implementation for calibration, characterization, and error mitigation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
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
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703 · cited 1×
“For practical purposes, we need to go beyond the circuit model, incorporating primitives such as teleportation [18] and the measurement-model of quantum computing [19, 20], and extend the definition of a circuit.”
MethodAlgorithms 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
A variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552 · cited 3×
“For example, the variational quantum eigensolver depends on classical computation to calculate an energy or cost function and uses classical optimization to tune circuit parameters [66].”
MethodInfluentialElementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
Self-citationDynamical Decoupling of Open Quantum Systems
Viola, L., Knill, E., & Lloyd, S. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.2417 · Cited by 1,808 · cited 1×
“For instance, dynamical decoupling [32] or characterizations of decoherence and crosstalk [33] are all sensitive to timing, and can be programmed using the new timing features.”
BackgroundArchitecture for a large-scale ion-trap quantum computer
Kielpinski, D., Monroe, C., & Wineland, D. J. (2002) · Nature · doi:10.1038/nature00784 · Cited by 1,589
Universal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525 · cited 7×
“For instance, defcal rx(angle[20] θ) $q defines the implementation of a rx gate of any angle on any physical qubit $q, whereas defcal rx(π) $0 specifically targets an X rotation of π radians on physical qubit $0.”
BackgroundInfluentialQuantum computational networks
Deutsch, D. E. (1989) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1989.0099 · Cited by 1,270 · cited 1×
“One common feature of most of these machine-independent languages is that they describe quantum computation in the quantum circuit model [16, 33, 64], which includes non-unitary primitives such as teleportation [17] and the measurement-model of quantum computing [45, 68].”
BackgroundKeeping a Quantum Bit Alive by Optimized π -Pulse Sequences
Uhrig, G. S. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.100504 · Cited by 716 · cited 1×
“Examples include characterization of decoherence and crosstalk [40], dynamical decoupling [42, 62, 78], dynamically corrected gates [29, 50], and gate parallelism or scheduling [63].”
Background
Cited by
The future of quantum computing with superconducting qubits
Bravyi, S., Dial, O., Gambetta, J. M., Gil, D., & Nazario, Z. (2022) · Journal of Applied Physics · doi:10.1063/5.0082975 · Cited by 334
Self-citationDistributed quantum computing: A survey
Caleffi, M., Amoretti, M., Ferrari, D., Illiano, J., Manzalini, A., & Cacciapuoti, A. S. (2024) · Computer Networks · doi:10.1016/j.comnet.2024.110672 · Cited by 256
Encoding a magic state with beyond break-even fidelity
Gupta, R. S., Sundaresan, N., Alexander, T., Wood, C. J., Merkel, S. T., Healy, M. B., Hillenbrand, M., Jochym-O’Connor, T., Wootton, J. R., Yoder, T. J., et al. (2024) · Nature · doi:10.1038/s41586-023-06846-3 · Cited by 115
Self-citationMQT QMAP: Efficient Quantum Circuit Mapping
Wille, R., & Burgholzer, L. (2023) · Proceedings of the 2023 International Symposium on Physical Design · doi:10.1145/3569052.3578928 · Cited by 41
On the Co-Design of Quantum Software and Hardware
Li, G., Wu, A., Shi, Y., Javadi-Abhari, A., Ding, Y., & Xie, Y. (2021) · Proceedings of the Eight Annual ACM International Conference on Nanoscale Computing and Communication · doi:10.1145/3477206.3477464 · Cited by 37
Self-citationA 98-qubit trapped-ion quantum computer with all-to-all connectivity
Ransford, A., Allman, M. S., Arkinstall, J., Campora, J. P., Cooper, S. F., Delaney, R. D., Dreiling, J. M., Estey, B., Figgatt, C., Hall, A., et al. (2026) · Nature · doi:10.1038/s41586-026-10676-4 · Cited by 16
“88,89), Cirq 90 and CUDA-Q 91 , can use QIR adaptive profile features to implement these control flow constructs for programs executing on Helios.”
Brown, N. C., Campora, J. P., Granade, C., Heim, B., Wernli, S., Ryan-Anderson, C., Lucchetti, D., Paetznick, A., Roetteler, M., Svore, K., et al. (2023) · arXiv · doi:10.48550/arxiv.2310.12106 · Cited by 4
Introduction to quantum error correction with stabilizer codes
Bradshaw, Z. P., Dale, J. J., & Evans, E. N. (2026) · Annals of Physics · doi:10.1016/j.aop.2026.170353 · Cited by 4
Metadata
- Authors
- Cross, A., Javadi-Abhari, A., Alexander, T., De Beaudrap, N., Bishop, L. S., Heidel, S., Ryan, C. A., Sivarajah, P., Smolin, J., Gambetta, J. M., & Johnson, B. R.
- Venue
- ACM Transactions on Quantum Computing
- Published
- 2022-09-06
- Volume
- 3
- Issue
- 3
- Pages
- 1-50
- ISSN
- 2643-6809 (ISSN-L)
- 2643-6817
- OpenAlex
- W3158260911
- Cited by
- 248
- References
- 16
- FWCI
- 14.70
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.
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.