The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
A lambda calculus for quantum computation with classical control
Abstract
In this paper we develop a functional programming language for quantum computers by extending the simply-typed lambda calculus with quantum types and operations. The design of this language adheres to the ‘quantum data, classical control’ paradigm, following the first author's work on quantum flow-charts. We define a call-by-value operational semantics, and give a type system using affine intuitionistic linear logic. The main results of this paper are the safety properties of the language and the development of a type inference algorithm.
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
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Girard, J.-Y. (1987) · Theoretical Computer Science · doi:10.1016/0304-3975(87)90045-4 · Cited by 4,085
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244 · cited 2×
“Examples of such models include the quantum Turing machine (Benioff 1980; Deutsch 1985), where the entire machine state, including the tape, the finite control and the position of the head, is assumed to be a quantum state.”
Background
Cited by
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
Self-citationQuipper: a scalable quantum programming language
Green, A. S., Lumsdaine, P. L., Ross, N. J., Selinger, P., & Valiron, B. (2013) · Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/2491956.2462177 · Cited by 334
Self-citationPhysics, Topology, Logic and Computation: A Rosetta Stone
Baez, J., & Stay, M. (2010) · Lecture Notes in Physics · doi:10.1007/978-3-642-12821-9_2 · Cited by 254
Danos, V., Kashefi, E., & Panangaden, P. (2007) · Journal of the ACM · doi:10.1145/1219092.1219096 · Cited by 195
Scherer, A., Valiron, B., Mau, S.-C., Alexander, S., van den Berg, E., & Chapuran, T. E. (2017) · Quantum Information Processing · doi:10.1007/s11128-016-1495-5 · Cited by 73
Self-citation
Metadata
- Authors
- SELINGER, P., & VALIRON, B.
- Venue
- Mathematical Structures in Computer Science
- Publisher
- Cambridge University Press (CUP)
- Published
- 2006-06
- Volume
- 16
- Issue
- 3
- Pages
- 527-552
- ISSN
- 0960-1295 (ISSN-L)
- 1469-8072
- OpenAlex
- W2145862486
- Cited by
- 177
- References
- 4
- FWCI
- 13.78
- 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.