Results 1  10
of
72
A functional quantum programming language
 In: Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
, 2005
"... This thesis introduces the language QML, a functional language for quantum computations on finite types. QML exhibits quantum data and control structures, and integrates reversible and irreversible quantum computations. The design of QML is guided by the categorical semantics: QML programs are inte ..."
Abstract

Cited by 70 (12 self)
 Add to MetaCart
(Show Context)
This thesis introduces the language QML, a functional language for quantum computations on finite types. QML exhibits quantum data and control structures, and integrates reversible and irreversible quantum computations. The design of QML is guided by the categorical semantics: QML programs are interpreted by morphisms in the category FQC of finite quantum computations, which provides a constructive operational semantics of irreversible quantum computations, realisable as quantum circuits. The quantum circuit model is also given a formal categorical definition via the category FQC. QML integrates reversible and irreversible quantum computations in one language, using first order strict linear logic to make weakenings, which may lead to the collapse of the quantum wavefunction, explicit. Strict programs are free from measurement, and hence preserve superpositions and entanglement. A denotational semantics of QML programs is presented, which maps QML terms
A lambda calculus for quantum computation with classical control
 IN PROCEEDINGS OF THE 7TH INTERNATIONAL CONFERENCE ON TYPED LAMBDA CALCULI AND APPLICATIONS (TLCA), VOLUME 3461 OF LECTURE NOTES IN COMPUTER SCIENCE
, 2005
"... ..."
(Show Context)
Communicating quantum processes
 In POPL 2005
, 2005
"... We define a language CQP (Communicating Quantum Processes) for modelling systems which combine quantum and classical communication and computation. CQP combines the communication primitives of the picalculus with primitives for measurement and transformation of quantum state; in particular, quantum ..."
Abstract

Cited by 56 (14 self)
 Add to MetaCart
We define a language CQP (Communicating Quantum Processes) for modelling systems which combine quantum and classical communication and computation. CQP combines the communication primitives of the picalculus with primitives for measurement and transformation of quantum state; in particular, quantum bits (qubits) can be transmitted from process to process along communication channels. CQP has a static type system which classifies channels, distinguishes between quantum and classical data, and controls the use of quantum state. We formally define the syntax, operational semantics and type system of CQP, prove that the semantics preserves typing, and prove that typing guarantees that each qubit is owned by a unique process within a system. We illustrate CQP by defining models of several quantum communication systems, and outline our plans for using CQP as the foundation for formal analysis and verification of combined quantum and classical systems. 1
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.
Quantum computation, categorical semantics and linear logic. quantph/0312174
, 2003
"... We develop a type theory and provide a denotational semantics for a simple fragment of the quantum lambda calculus, a formal language for quantum computation based on linear logic. In our semantics, variables inhabit certain Hilbert bundles, and computations are interpreted as the appropriate inner ..."
Abstract

Cited by 34 (1 self)
 Add to MetaCart
(Show Context)
We develop a type theory and provide a denotational semantics for a simple fragment of the quantum lambda calculus, a formal language for quantum computation based on linear logic. In our semantics, variables inhabit certain Hilbert bundles, and computations are interpreted as the appropriate inner product preserving maps between Hilbert bundles. These bundles and maps form a symmetric monoidal
Structuring quantum effects: superoperators as arrows
 Math. Struct. Comput. Sci
, 2006
"... ..."
(Show Context)
Between logic and quantic: a tract
 MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE
, 2003
"... We present a quantum interpretation of the perfect part of linear logic, by means of quantum coherent spaces. In particular this yields a novel interpretation of the reduction of the wave packet as the expression of ηconversion, a.k.a, extensionality. ..."
Abstract

Cited by 23 (1 self)
 Add to MetaCart
(Show Context)
We present a quantum interpretation of the perfect part of linear logic, by means of quantum coherent spaces. In particular this yields a novel interpretation of the reduction of the wave packet as the expression of ηconversion, a.k.a, extensionality.
The Effects of
 Artificial Sources of Water on Rangeland Biodiversity. Environment Australia and CSIRO
, 1997
"... “Turing hoped that his abstractedpapertape model was so simple, so transparent and well defined, that it would not depend on any assumptions about physics that could conceivably be falsified, and therefore that it could become the basis of an abstract theory of computation that was independent of ..."
Abstract

Cited by 14 (5 self)
 Add to MetaCart
(Show Context)
“Turing hoped that his abstractedpapertape model was so simple, so transparent and well defined, that it would not depend on any assumptions about physics that could conceivably be falsified, and therefore that it could become the basis of an abstract theory of computation that was independent of the underlying physics. ‘He thought, ’ as Feynman once put it, ‘that he understood paper. ’ But he was mistaken. Real, quantummechanical paper is wildly different from the abstract stuff that the Turing machine uses. The Turing machine is entirely classical...”
Quipper: A Scalable Quantum Programming Language
, 1304
"... The field of quantum algorithms is vibrant. Still, there is currently a lack of programming languages for describing quantum computation on a practical scale, i.e., not just at the level of toy problems. We address this issue by introducing Quipper, a scalable, expressive, functional, higherorder q ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
(Show Context)
The field of quantum algorithms is vibrant. Still, there is currently a lack of programming languages for describing quantum computation on a practical scale, i.e., not just at the level of toy problems. We address this issue by introducing Quipper, a scalable, expressive, functional, higherorder quantum programming language. Quipper has been used to program a diverse set of nontrivial quantum algorithms, and can generate quantum gate representations using trillions of gates. It is geared towards a model of computation that uses a classical computer to control a quantum device, but is not dependent on any particular model of quantum hardware. Quipper has proven effective and easy to use, and opens the door towards using formal methods to analyze quantum algorithms.
Physics, Topology, Logic and Computation: A Rosetta Stone
, 2009
"... Category theory is a very general formalism, but there is a certain special way that physicists use categories which turns out to have close analogues in topology, logic and computation. A category has objects and morphisms, which represent things and ways to go between things. In physics, the objec ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
Category theory is a very general formalism, but there is a certain special way that physicists use categories which turns out to have close analogues in topology, logic and computation. A category has objects and morphisms, which represent things and ways to go between things. In physics, the objects are often physical systems, and the morphisms are processes turning a state of one physical system into a state of another system — perhaps