The geometry of parallelism: classical, probabilistic, and quantum effects

DOI10.1145/3009837.3009859zbMATH Open1380.68120arXiv1610.09629OpenAlexW2546724314WikidataQ130922088 ScholiaQ130922088MaRDI QIDQ5370917FDOQ5370917

Authors: Ugo Dal Lago, Claudia Faggian, Benoît Valiron, Akira Yoshimizu 

Publication date: 20 October 2017

Published in: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages (Search for Journal in Brave)

Abstract: We introduce a Geometry of Interaction model for higher-order quantum computation, and prove its adequacy for a full quantum programming language in which entanglement, duplication, and recursion are all available. Our model comes with a multi-token machine, a proof net system, and a PCF-style language. The approach we develop is not specific to quantum computation, and our model is an instance of a new framework whose main feature is the ability to model commutative effects in a parallel setting. Being based on a multi-token machine equipped with a memory, it has a concrete nature which makes it well suited for building low-level operational descriptions of higher-order languages.

Full work available at URL: https://arxiv.org/abs/1610.09629

Recommendations

• Semantics of higher-order quantum computation via geometry of interaction
• Measurements in proof nets as higher-order quantum circuits
• scientific article; zbMATH DE number 1722666
• Memoryful geometry of interaction: from coalgebraic components to algebraic effects
• On quantum and probabilistic linear lambda-calculi (extended abstract)

zbMATH Keywords

quantum computationgeometry of interactionlambda calculusprobabilistic computationmemory structure

Mathematics Subject Classification ID

Theory of programming languages (68N15) Quantum computation (81P68) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70)

Cited In (13)

• Towards logical foundations for probabilistic computation
• On higher-order probabilistic subrecursion
• The dynamic geometry of interaction machine: a token-guided graph rewriter
• A Fresh Look at the λ-Calculus
• Confluence in probabilistic rewriting
• Quantum programming with inductive datatypes: causality and affine type theory
• Semantics of higher-order quantum computation via geometry of interaction
• Curry and Howard meet Borel
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Concurrent quantum strategies
• The geometry of Bayesian programming

This page was built for publication: The geometry of parallelism: classical, probabilistic, and quantum effects

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5370917)