Zobrazeno 1 - 10
of 269
pro vyhledávání: '"Valiron, P."'
Quantum lambda calculus has been studied mainly as an idealized programming language -- the evaluation essentially corresponds to a deterministic abstract machine. Very little work has been done to develop a rewriting theory for quantum lambda calcul
Externí odkaz:
http://arxiv.org/abs/2411.14856
Autor:
Valiron, Benoît
This thesis (Habilitation \`a diriger des recherches) presents some of my research contributions since my Ph.D defense in 2008. I have had the chance to participate in the development of quantum programming languages since their early developments: t
Externí odkaz:
http://arxiv.org/abs/2410.13337
In this paper, we consider event structures and their probabilistic and quantum extensions as originally defined by Winskel. If these structures have already been part of sophisticated computational models, they have rarely been directly studied as a
Externí odkaz:
http://arxiv.org/abs/2408.14563
This paper is concerned with the expressivity and denotational semantics of a functional higher-order reversible programming language based on Theseus. In this language, pattern-matching is used to ensure the reversibility of functions. We show how o
Externí odkaz:
http://arxiv.org/abs/2309.12151
Publikováno v:
EPTCS 384, 2023
This volume contains the proceedings of the 20th International Conference on Quantum Physics and Logic (QPL 2023). The aim of the QPL conference series is to bring together academic and industry researchers working on mathematical foundations of quan
Externí odkaz:
http://arxiv.org/abs/2308.15489
Publikováno v:
31st EACSL Annual Conference on Computer Science Logic (CSL 2023)
In this paper, we present a linear and reversible programming language with inductives types and recursion. The semantics of the languages is based on pattern-matching; we show how ensuring syntactical exhaustivity and non-overlapping of clauses is e
Externí odkaz:
http://arxiv.org/abs/2302.11887
Publikováno v:
46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)
ZX-Calculus is a versatile graphical language for quantum computation equipped with an equational theory. Getting inspiration from Geometry of Interaction, in this paper we propose a token-machine-based asynchronous model of both pure ZX-Calculus and
Externí odkaz:
http://arxiv.org/abs/2206.10916
Publikováno v:
Proceedings of the 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2023)
We introduce the first complete equational theory for quantum circuits. More precisely, we introduce a set of circuit equations that we prove to be sound and complete: two circuits represent the same unitary map if and only if they can be transformed
Externí odkaz:
http://arxiv.org/abs/2206.10577
Publikováno v:
Computer Physics Communications, Volume 291 (2023), 108848
In this paper, we provide an algorithm and general framework for the simulation of photons passing through linear optical interferometers. Given $n$ photons at the input of an $m$-mode interferometer, our algorithm computes the probabilities of all p
Externí odkaz:
http://arxiv.org/abs/2206.10549
In this paper, we explore the interaction between two monoidal structures: a multiplicative one, for the encoding of pairing, and an additive one, for the encoding of choice. We propose a colored PROP to model computation in this framework, where the
Externí odkaz:
http://arxiv.org/abs/2206.10234