P. Jorrand

This paper aims at defining a high level language allowing the description of classical and quantum programming, and their cooperation. Expand

We propose a process algebraic notation for quantum programming, which provides a homogeneous style to formal descriptions of concurrent and distributed computations comprising both quantum and classical parts. Expand

We present a way to apply quantum logic to the study of quantum programs. Expand

We introduce a Classically controlled Quantum Turing Machine (CQTM), which is a Turing machine with a quantum tape for acting on quantum data, and a classical transition function for formalised classical control. Expand

The semantic elegance and the mathematical properties of applicative and functional programming languages are now widely recognized as relevant and useful qualities for implementing the large and complex algorithms of the kind encountered in artificial intelligence. Expand

This paper concentrates on a typically “computer science” way to reach a deeper understanding of what it means to compute with quantum resources, namely on the design of programming languages for quantum algorithms and protocols, and on the questions raised by the semantics of such languages. Expand

This paper answers two questions: what conditions should the amplitudes in |ψN> satisfy for this state to be separable (i) into a tensor product of n qubit states, where ℋN is the Hilbert space of dimension N=2n, and (ii), into two subsystems states with P=2p and Q=2q such that p+q=n. Expand