English
Related papers

Related papers: The Lambda Calculus is Quantifiable

200 papers

We describe a type system for the linear-algebraic lambda-calculus. The type system accounts for the part of the language emulating linear operators and vectors, i.e. it is able to statically describe the linear combinations of terms…

Logic in Computer Science · Computer Science 2012-08-01 Pablo Arrighi , Alejandro Díaz-Caro , Benoît Valiron

We investigate quantum metrology using a Lie algebraic approach for a class of Hamiltonians, including local and nearest-neighbor interaction Hamiltonians. Using this Lie algebraic formulation, we identify and construct highly symmetric…

Quantum Physics · Physics 2015-08-26 Michalis Skotiniotis , Florian Fröwis , Wolfgang Dür , Barbara Kraus

Characterisations of metrizable topological spaces or metrizable uniform spaces are well known. A natural counterpart to being metrizable for topological spaces can be expressed in terms of probabilistic metrizability for approach spaces.…

General Topology · Mathematics 2026-01-13 Eva Colebunders , Robert Lowen

We prove the Stability Property for the call-by-value $\lambda$-calculus (CbV in the following). This result states necessary conditions under which the contexts of the CbV $\lambda$-calculus commute with intersections of approximants. This…

Logic in Computer Science · Computer Science 2024-09-19 Davide Barbarossa

We advocate the use of de Bruijn's universal abstraction $\lambda^\infty$ for the quantification of schematic variables in the predicative setting and we present a typed $\lambda$-calculus featuring the quantifier $\lambda^\infty$…

Logic in Computer Science · Computer Science 2021-05-11 Ferruccio Guidi

In our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (with Laurent Regnier), we studied a translation of lambda-terms as infinite linear combinations of resource lambda-terms, from a calculus similar to Boudol's…

Logic in Computer Science · Computer Science 2010-01-20 Thomas Ehrhard

These lecture notes focus on the application of ideas of locality, in particular Lieb-Robinson bounds, to quantum many-body systems. We consider applications including correlation decay, topological order, a higher dimensional…

Mathematical Physics · Physics 2010-08-31 M. B. Hastings

Canonical BRST quantization of the topological particle defined by a Morse function h is described. Stochastic calculus, using Brownian paths which implement the WKB method in a new way providing rigorous tunnelling results even in curved…

High Energy Physics - Theory · Physics 2009-10-31 Alice Rogers

In typical non-idempotent intersection type systems, proof normalization is not confluent. In this paper we introduce a confluent non-idempotent intersection type system for the lambda-calculus. Typing derivations are presented using proof…

Logic in Computer Science · Computer Science 2019-07-23 Pablo Barenbaum , Gonzalo Ciruelos

With the wide spread of deep learning and gradient descent inspired optimization algorithms, differentiable programming has gained traction. Nowadays it has found applications in many different areas as well, such as scientific computing,…

Programming Languages · Computer Science 2022-07-14 Pedro H. Azevedo de Amorim , Christopher Lam

Quantum computation can be achieved by preparing an appropriate initial product state of qudits and then letting it evolve under a fixed Hamiltonian. The readout is made by measurement on individual qudits at some later time. This approach…

Quantum Physics · Physics 2015-12-22 Tzu-Chieh Wei , John C. Liang

Recent work argued that the scaling of a dimensionless quantity $Q_D$ with path length is a better proxy for quantifying the scaling of the computational cost of maintaining adiabaticity than the timescale. It also conjectured that…

Quantum Physics · Physics 2026-01-27 Thomas D. Cohen , Hyunwoo Oh , Veronica Wang

This report introduces and investigates a family of metrics on sets of pointed Kripke models. The metrics are generalizations of the Hamming distance applicable to countably infinite binary strings and, by extension, logical theories or…

Logic · Mathematics 2017-08-28 Dominik Klein , Rasmus K. Rendsvig

We consider ontological models of a quantum system, assuming that not all probability distributions over the space $\Lambda$ of ontic states are preparable, only those belonging to a certain set C. We assume further that every POVM with a…

Quantum Physics · Physics 2022-05-10 Roderich Tumulka

In this paper we present a semantics for a linear algebraic lambda-calculus based on realizability. This semantics characterizes a notion of unitarity in the system, answering a long standing issue. We derive from the semantics a set of…

Logic in Computer Science · Computer Science 2019-12-06 Alejandro Díaz-Caro , Mauricio Guillermo , Alexandre Miquel , Benoît Valiron

Particle-style token machines are a way to interpret proofs and programs, when the latter are defined according to the principles of linear logic. In this paper, we show that token machines also make sense when the programs at hand are…

Logic in Computer Science · Computer Science 2013-11-14 Ugo Dal Lago , Margherita Zorzi

This paper demonstrates how to add a measurement operator to quantum lambda-calculi. A proof of the consistency of the semantics is given through a proof of confluence presented in a sufficiently general way to allow this technique to be…

Quantum Physics · Physics 2011-02-08 Alejandro Díaz-Caro , Pablo Arrighi , Manuel Gadella , Jonathan Grattage

We establish a systematic framework of unbiased quantum sampling and estimation protocols for the classical Gibbs expectation. This framework generalizes existing approaches to the partition function estimation and has broader applications…

Quantum Physics · Physics 2026-04-02 Xinmiao Li , Jin-Peng Liu

Stochastic nonequilibrium exclusion models are treated using a real space scaling approach. The method exploits the mapping between nonequilibrium and quantum systems, and it is developed to accommodate conservation laws and duality…

Statistical Mechanics · Physics 2009-11-11 T. Hanney , R. B. Stinchcombe

We propose a way to unify two approaches of non-cloning in quantum lambda-calculi: logical and algebraic linearities. The first approach is to forbid duplicating variables, while the second is to consider all lambda-terms as…

Logic in Computer Science · Computer Science 2019-12-06 Alejandro Díaz-Caro , Gilles Dowek , Juan Pablo Rinaldi