Results 1 
5 of
5
Quantum Programming Languages  Survey and Bibliography
 UNDER CONSIDERATION FOR PUBLICATION IN MATH. STRUCT. IN COMP. SCIENCE
, 2006
"... The field of quantum programming languages is developing rapidly and there is a surprisingly large literature. Research in this area includes the design of programming languages for quantum computing, the application of established semantic and logical techniques to the foundations of quantum mechan ..."
Abstract

Cited by 47 (2 self)
 Add to MetaCart
The field of quantum programming languages is developing rapidly and there is a surprisingly large literature. Research in this area includes the design of programming languages for quantum computing, the application of established semantic and logical techniques to the foundations of quantum mechanics, and the design of compilers for quantum programming languages. This article justifies the study of quantum programming languages, presents the basics of quantum computing, surveys the literature in quantum programming languages, and indicates directions for future research.
Complementarity in categorical quantum mechanics
, 2010
"... We relate notions of complementarity in three layers of quantum mechanics: (i) von Neumann algebras, (ii) Hilbert spaces, and (iii) orthomodular lattices. Taking a more general categorical perspective of which the above are instances, we consider dagger monoidal kernel categories for (ii), so that ( ..."
Abstract

Cited by 23 (7 self)
 Add to MetaCart
We relate notions of complementarity in three layers of quantum mechanics: (i) von Neumann algebras, (ii) Hilbert spaces, and (iii) orthomodular lattices. Taking a more general categorical perspective of which the above are instances, we consider dagger monoidal kernel categories for (ii), so that (i) become (sub)endohomsets and (iii) become subobject lattices. By developing a ‘pointfree’ definition of copyability we link (i) commutative von Neumann subalgebras, (ii) classical structures, and (iii) Boolean subalgebras.
Quantum informationflow, concretely, abstractly
 PROC. QPL 2004
, 2004
"... These ‘lecture notes ’ are based on joint work with Samson Abramsky. I will survey and informally discuss the results of [3, 4, 5, 12, 13] in a pedestrian not too technical way. These include: • ‘The logic of entanglement’, that is, the identification and abstract axiomatization of the ‘quantum info ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
(Show Context)
These ‘lecture notes ’ are based on joint work with Samson Abramsky. I will survey and informally discuss the results of [3, 4, 5, 12, 13] in a pedestrian not too technical way. These include: • ‘The logic of entanglement’, that is, the identification and abstract axiomatization of the ‘quantum informationflow ’ which enables protocols such as quantum teleportation. 1 To this means we defined strongly compact closed categories which abstractly capture the behavioral properties of quantum entanglement. • ‘Postulates for an abstract quantum formalism ’ in which classical informationflow (e.g. token exchange) is part of the formalism. As an example, we provided a purely formal description of quantum teleportation and proved correctness in abstract generality. 2 In this formalism types reflect kinds, contra the essentially typeless von Neumann formalism [25]. Hence even concretely this formalism manifestly improves on the usual one. • ‘A highlevel approach to quantum informatics’. 3 Indeed, the above discussed work can be conceived as aiming to solve: von Neumann quantum formalism � highlevel language lowlevel language. I also provide a brief discussion on how classical and quantum uncertainty can be mixed in the above formalism (cf. density matrices). 4
Programming with Quantum Communication
"... Abstract. We present a formal framework for specifying, implementing, and analysing quantum communication protocols. 1 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We present a formal framework for specifying, implementing, and analysing quantum communication protocols. 1
The inner quantum logic of Bell's states
"... We introduce logical judgements for the internal logic of a quantum computer with two qubits, in the two limit cases of nonentanglement (separable states) and maximal entanglement (Bell's states). To this aim, we consider an internal (reversible) measurement which preserves the probabilities ..."
Abstract
 Add to MetaCart
(Show Context)
We introduce logical judgements for the internal logic of a quantum computer with two qubits, in the two limit cases of nonentanglement (separable states) and maximal entanglement (Bell's states). To this aim, we consider an internal (reversible) measurement which preserves the probabilities by mirroring the states. We then obtain logical rules, obeying the re ection principle of basic logic, which illustrate the dierent computational behaviour of separable and Bell's states. 1