Results

**1 - 4**of**4**### Confluence Results for a Quantum Lambda Calculus with Measurements

, 905

"... A strong confluence result for Q ∗ , a quantum λ-calculus with measurements, is proved. More precisely, confluence is shown to hold both for finite and infinite computations. The technique used in the confluence proof is syntactical but innovative. This makes Q ∗ different from similar quantum lambd ..."

Abstract
- Add to MetaCart

(Show Context)
A strong confluence result for Q ∗ , a quantum λ-calculus with measurements, is proved. More precisely, confluence is shown to hold both for finite and infinite computations. The technique used in the confluence proof is syntactical but innovative. This makes Q ∗ different from similar quantum lambda calculi, which are either measurement-free or provided with a reduction strategy. 1

### Wave-Style Token Machines and Quantum Lambda Calculi

"... Particle-style token machines are a way to interpret proofs and programs, when the latter are written following the principles of linear logic. In this paper, we show that token machines also make sense when the programs at hand are those of a simple quantum λ-calculus. This, however, requires gener ..."

Abstract
- Add to MetaCart

(Show Context)
Particle-style token machines are a way to interpret proofs and programs, when the latter are written following the principles of linear logic. In this paper, we show that token machines also make sense when the programs at hand are those of a simple quantum λ-calculus. This, however, requires generalizing the concept of a token machine to one in which more than one particle travel around the term at the same time. The presence of multiple tokens is intimately related to entanglement and allows to give a simple operational semantics to the calculus, coherently with the principles of quantum computation. 1

### Universality of quantum Turing machines with deterministic control

, 2014

"... A simple notion of quantum Turing machine with deterministic, classical control is proposed and shown to be powerful enough to com-pute any unitary transformation which is computable by a finitely gen-erated quantum circuit. An efficient universal machine with the s-m-n property is presented. The BQ ..."

Abstract
- Add to MetaCart

(Show Context)
A simple notion of quantum Turing machine with deterministic, classical control is proposed and shown to be powerful enough to com-pute any unitary transformation which is computable by a finitely gen-erated quantum circuit. An efficient universal machine with the s-m-n property is presented. The BQP class is recovered. A robust notion of plain Kolmogorov complexity of quantum states is proposed and com-pared with those previously reported in the literature.