The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Towards a quantum programming language
Abstract
We propose the design of a programming language for quantum computing. Traditionally, quantum algorithms are frequently expressed at the hardware level, for instance in terms of the quantum circuit model or quantum Turing machines. These approaches do not encourage structured programming or abstractions such as data types. In this paper, we describe the syntax and semantics of a simple quantum programming language with high-level features such as loops, recursive procedures, and structured data types. The language is functional in nature, statically typed, free of run-time errors, and has an interesting denotational semantics in terms of complete partial orders of superoperators.
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
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
Girard, J.-Y. (1987) · Theoretical Computer Science · doi:10.1016/0304-3975(87)90045-4 · Cited by 4,085
Quantum information and computation
Bennett, C. H., & DiVincenzo, D. P. (2000) · Nature · doi:10.1038/35005001 · Cited by 3,263 · cited 4×
“For a more thorough introduction, see, for example, Cleve (2000), Preskill (1998), Gruska (1999), or Nielsen and Chuang (2000).”
BackgroundMethodInfluential�ber monotone Matrixfunktionen
L�wner, K. (1934) · Mathematische Zeitschrift · doi:10.1007/bf01170633 · Cited by 752
Gruska, J. (1999) · Cited by 463
Sanders, J. W., & Zuliani, P. (2000) · Lecture notes in computer science · doi:10.1007/10722010_6 · Cited by 194
Conventions for quantum pseudocode
Knill, E. (1996) · doi:10.2172/366453 · Cited by 191
Toward an architecture for quantum programming
Bettelli, S., Calarco, T., & Serafini, L. (2003) · The European Physical Journal D · doi:10.1140/epjd/e2003-00242-2 · Cited by 178
An Introduction to Quantum Complexity Theory
Cleve, R. (2001) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789810248185_0004 · Cited by 110
A Procedural Formalism for Quantum Computing
Ömer, B. (2002) · Cited by 87
Models of Sharing Graphs: A Categorical Semantics of let and letrec
Hasegawa, M. (1999) · Cited by 77
Abramsky, S., & Coecke, B. (2003) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(04)80556-5 · Cited by 44
Cited by
Quantum walks: a comprehensive review
Venegas-Andraca, S. E. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0432-5 · Cited by 934
A categorical semantics of quantum protocols
Abramsky, S., & Coecke, B. (2004) · Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004. · doi:10.1109/lics.2004.1319636 · Cited by 541
Quantum computations without definite causal structure
Chiribella, G., D’Ariano, G. M., Perinotti, P., & Valiron, B. (2013) · Physical Review A · doi:10.1103/physreva.88.022318 · Cited by 521
Dagger Compact Closed Categories and Completely Positive Maps
Selinger, P. (2007) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2006.12.018 · Cited by 390
Self-citationDanos, V., Kashefi, E., & Panangaden, P. (2007) · Journal of the ACM · doi:10.1145/1219092.1219096 · Cited by 195
Metadata
- Authors
- SELINGER, P.
- Venue
- Mathematical Structures in Computer Science
- Publisher
- Cambridge University Press (CUP)
- Published
- 2004-08
- Volume
- 14
- Issue
- 4
- Pages
- 527-586
- ISSN
- 0960-1295 (ISSN-L)
- 1469-8072
- OpenAlex
- W1999626800
- Cited by
- 480
- References
- 14
- FWCI
- 23.38
- Type
- journal article
- Language
- en
- Open access
- closed
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.