Related papers: Beyond Quantifier-Free Interpolation in Extensions…
Entanglement purification and distillation protocols are essential for harnessing the full potential of quantum communication technologies. Multiple strategies have been proposed to approach and optimize such protocols, most however…
In the present work, the notion of Super Fractal Interpolation Function (SFIF) is introduced for finer simulation of the objects of the nature or outcomes of scientific experiments that reveal one or more structures embedded in to another.…
In this paper, we study functional approximations where we choose the so-called radial basis function method and more specifically, quasi-interpolation. From the various available approaches to the latter, we form new quasi-Lagrange…
The widely held belief that BQP strictly contains BPP raises fundamental questions: if we cannot efficiently compute predictions for the behavior of quantum systems, how can we test their behavior? In other words, is quantum mechanics…
In ESOP 2008, Gulwani and Musuvathi introduced a notion of cover and exploited it to handle infinite-state model checking problems. Motivated by applications to the verification of data-aware processes, we proved in a previous paper that…
Programmable linear optical interferometers are important for classical and quantum information technologies, as well as for building hardware-accelerated artificial neural networks. Recent results showed the possibility of constructing…
Kalton and Mitrea characterized complex interpolation spaces of quasi-Banach function spaces as Calder\'on products if both interpolants are separable. We show that one separability assumption may be omitted and establish a…
Free categorical constructions characterise quantum computing as the combination of two copies of a reversible classical model, glued by the complementarity equations of classical structures. This recipe effectively constructs a…
This paper presents a novel set-based computing method, called interval superposition arithmetic, for enclosing the image set of multivariate factorable functions on a given domain. In order to construct such enclosures, the proposed…
First-order logic fragments mixing quantifiers, arithmetic, and uninterpreted predicates are often undecidable, as is, for instance, Presburger arithmetic extended with a single uninterpreted unary predicate. In the SMT world, difference…
We consider the problem of interpolating an unknown multivariate polynomial with coefficients taken from a finite field or as numerical approximations of complex numbers. Building on the recent work of Garg and Schost, we improve on the…
Uniform interpolation is a strengthening of interpolation that holds for certain propositional logics. The starting point of this chapter is a theorem of A. Pitts, which shows that uniform interpolation holds for intuitionistic…
Gaussian processes are typically used for smoothing and interpolation on small datasets. We introduce a new Bayesian nonparametric framework -- GPatt -- enabling automatic pattern extrapolation with Gaussian processes on large…
Nontrivial combinatory algebras with S and K must be infinite. Associativity is incompatible with combining a classifier and a retraction pair in a finite extensional magma. These obstructions exclude several standard settings from the…
The Schur-Agler class consists of functions over a domain satisfying an appropriate von Neumann inequality. Originally defined over the polydisk, the idea has been extended to general domains in multivariable complex Euclidean space with…
In this contribution we introduce a mixed interpolation-regression operator for functions defined in some domains of the plane. We focus the attention on the ellipse, an annulus and a polygon. An upper bound for such an operator is…
We obtain sampling and interpolation theorems in radial weighted spaces of analytic functions for weights of arbitrary (more rapid than polynomial) growth. We give an application to invariant subspaces of arbitrary index in large weighted…
Quantum signal processing is a framework for implementing polynomial functions on quantum computers. To implement a given polynomial $P$, one must first construct a corresponding complementary polynomial $Q$. Existing approaches to this…
Quantum technologies are developing powerful tools to generate and manipulate coherent superpositions of different energy levels. Envisaging a new generation of energy-efficient quantum devices, here we explore how coherence can be…
The present work stemmed from the study of the problem of harmonic analysis on the infinite-dimensional unitary group U(\infty). That problem consisted in the decomposition of a certain 4-parameter family of unitary representations, which…