Quantum programming with inductive datatypes: causality and affine type theory
From MaRDI portal
Publication:2200848
DOI10.1007/978-3-030-45231-5_29zbMath1442.68034arXiv1910.09633OpenAlexW3104517613MaRDI QIDQ2200848
Simon Perdrix, Mathys Rennela, Romain Péchoux, Vladimir Zamdzhiev
Publication date: 23 September 2020
Full work available at URL: https://arxiv.org/abs/1910.09633
Quantum computation (81P68) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Semantics of quantum programming languages: Classical control, quantum control, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, A computer scientist’s reconstruction of quantum theory*
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Towards a quantum domain theory: order-enrichment and fixpoints in \(W^*\)-algebras
- Semantics of higher-order quantum computation via geometry of interaction
- Semantics for a quantum programming language by operator algebras
- Quantum Entanglement Analysis Based on Abstract Interpretation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum collections
- Towards a quantum programming language
- Quantum Programs as Kleisli Maps
- Enriching a Linear/Non-linear Lambda Calculus
- Concurrent Quantum Strategies
- A single quantum cannot be cloned
- The geometry of parallelism: classical, probabilistic, and quantum effects
- Applying quantitative semantics to higher-order quantum computing
- Quantum programming languages: survey and bibliography
- Theory of operator algebras I.
