Confluence Results for a Quantum Lambda Calculus with Measurements

Authors:
Ugo Dal Lago;Andrea Masini;Margherita Zorzi
Affiliations:
Dipartimento di Scienze dell'Informazione, Universití di Bologna;Dipartimento di Informatica, Universití di Verona;Dipartimento di Informatica, Universití di Verona
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2011

Citing 9
Cited 1

Quantum computation and quantum information

Quantum computation and quantum information
A Syntax for Linear Logic

Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
Probabilistic Rewrite Strategies. Applications to ELAN

RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
A Lambda Calculus for Quantum Computation

SIAM Journal on Computing
Towards a quantum programming language

Mathematical Structures in Computer Science
A lambda calculus for quantum computation with classical control

Mathematical Structures in Computer Science
An Introduction to Quantum Computing

An Introduction to Quantum Computing
Linear-algebraic λ-calculus: higher-order, encodings, and confluence.

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
On a measurement-free quantum lambda calculus with classical control

Mathematical Structures in Computer Science

Applying quantitative semantics to higher-order quantum computing

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

A strong confluence result for Q*, a quantum @l-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.