Towards a quantum programming language
By Peter Selinger. Mathematical Structures in Computer Science, 2004
515 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/9ac9423df2be670e9210472c11b408bc4cae0594
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Bob Coecke
- Samson Abramsky
- Peter Selinger
- Miriam Backens
- Ross Duncan
- Edward Grefenstette
- Dusko Pavlovic
In Computational Theory and Mathematics
- Bob Coecke
- Samson Abramsky
- Peter Selinger
- Edward Grefenstette
- Ross Duncan
- Kathleen Ponto
- Michael Shulman
- Dusko Pavlovic
Citations in the corpus
- Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract) (2007, background): “The respective axiomatics of [9] and [1] are at the outset quite different: the former attempts to capture von Neumann’s formulation of quantum mechanics in terms of mixed states, density matrices, and completely positive maps, while the latter formalizes the Hilbert space point of view centered on ”
- A categorical semantics of quantum protocols (2004, background): “A state of a quantum system corresponds to a one-dimensional subspace A of H , and is standardly represented by a vector ψ ∈ A of unit norm.”
- Quantum walks: a comprehensive review (2012, unknown): “Ömer [348], Bettelli et al. [76], Viamontes et al. [448], Selinger [405], and Bañuls et al. [60], among others, have introduced mathematical frameworks for implementing quantum algorithms simulators using classical computer languages.”