Results 1  10
of
12
A Categorical Semantics of Quantum Protocols
 In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LiCS‘04), IEEE Computer Science
"... Quantum information and computation is concerned with the use of quantummechanical systems to carry out computational and informationprocessing tasks [16]. In the few short years that this approach has been studied, a ..."
Abstract

Cited by 149 (29 self)
 Add to MetaCart
Quantum information and computation is concerned with the use of quantummechanical systems to carry out computational and informationprocessing tasks [16]. In the few short years that this approach has been studied, a
Towards a quantum programming language
 Mathematical Structures in Computer Science
, 2004
"... The field of quantum computation suffers from a lack of syntax. In the absence of a convenient programming language, algorithms are frequently expressed in terms of hardware circuits or Turing machines. Neither approach particularly encourages structured programming or abstractions such as data type ..."
Abstract

Cited by 110 (13 self)
 Add to MetaCart
The field of quantum computation suffers from a lack of syntax. In the absence of a convenient programming language, algorithms are frequently expressed in terms of hardware circuits or Turing machines. Neither approach particularly encourages structured programming or abstractions such as data types. In this paper, we describe the syntax and semantics of a simple quantum programming language. This language provides highlevel features such as loops, recursive procedures, and structured data types. It is statically typed, and it has an interesting denotational semantics in terms of complete partial orders of superoperators. 1
A lambda calculus for quantum computation
 SIAM Journal of Computing
"... The classical lambda calculus may be regarded both as a programming language and as a formal algebraic system for reasoning about computation. It provides a computational model equivalent to the Turing machine, and continues to be of enormous benefit in the classical theory of computation. We propos ..."
Abstract

Cited by 49 (1 self)
 Add to MetaCart
The classical lambda calculus may be regarded both as a programming language and as a formal algebraic system for reasoning about computation. It provides a computational model equivalent to the Turing machine, and continues to be of enormous benefit in the classical theory of computation. We propose that quantum computation, like its classical counterpart, may benefit from a version of the lambda calculus suitable for expressing and reasoning about quantum algorithms. In this paper we develop a quantum lambda calculus as an alternative model of quantum computation, which combines some of the benefits of both the quantum Turing machine and the quantum circuit models. The calculus turns out to be closely related to the linear lambda calculi used in the study of Linear Logic. We set up a computational model and an equational proof system for this calculus, and we argue that it is equivalent to the quantum Turing machine.
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 27 (1 self)
 Add to MetaCart
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
A brief survey of quantum programming languages
 In Proceedings of the 7th International Symposium on Functional and Logic Programming
, 2004
"... Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its beginnings in 1982, when Paul Benioff and Richard Feynman independently pointed out that a quantum mechanical system can ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its beginnings in 1982, when Paul Benioff and Richard Feynman independently pointed out that a quantum mechanical system can be used to perform computations [11, p.12]. Feynman’s interest in quantum computation was motivated by the fact that it is computationally very expensive to simulate quantum physical systems on classical computers. This is due to the fact that such simulation involves the manipulation is extremely large matrices (whose dimension is exponential in the size of the quantum system being simulated). Feynman conceived of quantum computers as a means of simulating nature much more efficiently. The evidence to this day is that quantum computers can indeed perform certain tasks more efficiently than classical computers. Perhaps the bestknown example is Shor’s factoring algorithm, by which a quantum computer can find
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 10 (4 self)
 Add to MetaCart
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
Kindergarten quantum mechanics — lecture notes
 In: Quantum Theory: Reconsiderations of the Foundations III
, 2005
"... Abstract. These lecture notes survey some joint work with Samson Abramsky as it was presented by me at several conferences in the summer of 2005. It concerns ‘doing quantum mechanics using only pictures of lines, squares, triangles and diamonds’. This picture calculus can be seen as a very substanti ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
Abstract. These lecture notes survey some joint work with Samson Abramsky as it was presented by me at several conferences in the summer of 2005. It concerns ‘doing quantum mechanics using only pictures of lines, squares, triangles and diamonds’. This picture calculus can be seen as a very substantial extension of Dirac’s notation, and has a purely algebraic counterpart in terms of socalled Strongly Compact Closed Categories (introduced by Abramsky and I in [3, 4]) which subsumes my Logic of Entanglement [11]. For a survey on the ‘what’, the ‘why ’ and the ‘hows ’ I refer to a previous set of lecture notes [12, 13]. In a last section we provide some pointers to the body of technical literature on the subject.
Abstract physical traces
 THEORY AND APPLICATIONS OF CATEGORIES
, 2005
"... ... in the light of the results in [Abramsky and Coecke LiCS‘04]. The key fact is that the notion of a strongly compact closed category allows abstract notions of adjoint, bipartite projector and inner product to be defined, and their key properties to be proved. In this paper we improve on the defi ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
... in the light of the results in [Abramsky and Coecke LiCS‘04]. The key fact is that the notion of a strongly compact closed category allows abstract notions of adjoint, bipartite projector and inner product to be defined, and their key properties to be proved. In this paper we improve on the definition of strong compact closure as compared to the one presented in [Abramsky and Coecke LiCS‘04]. This modification enables an elegant characterization of strong compact closure in terms of adjoints and a Yanking axiom, and a better treatment of bipartite projectors.
Theories for Ubiquitous Processes and Data: Platform for 15year
 Grand Challenge.” Workshop on Grand Challenges for Computing Research
, 2002
"... Overview This paper is written as background for a proposed Grand ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Overview This paper is written as background for a proposed Grand
Programming with a Quantum Stack
, 2007
"... This thesis presents the semantics of quantum stacks and a functional quantum programming language, LQPL. An operational semantics for LQPL based on quantum stacks in the form of a term logic is developed and used as an interpretation of quantum circuits. The operational semantics is then extend ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This thesis presents the semantics of quantum stacks and a functional quantum programming language, LQPL. An operational semantics for LQPL based on quantum stacks in the form of a term logic is developed and used as an interpretation of quantum circuits. The operational semantics is then extended to handle recursion and algebraic datatypes. Recursion and datatypes are not concepts found in quantum circuits, but both are generally required for modern programming languages. The language LQPL is introduced in a discussion and example format. Various example programs using both classical and quantum algorithms are used to illustrate features of the language. Details of the language, including handling of qubits, general data types and classical data are covered. The quantum stack machine is then presented. Supporting data for operation of the machine are introduced and the transitions induced by the machine’s instructions are given.