Related papers: From Strong Amalgamability to Modularity of Quanti…
We study the problem of learning causal models from observational data through the lens of interpolation and its counterpart -- regularization. A large volume of recent theoretical, as well as empirical work, suggests that, in highly…
In this note, we extend modular techniques for computing Gr\"obner bases from the commutative setting to the vast class of noncommutative $G$-algebras. As in the commutative case, an effective verification test is only known to us in the…
For a homological functor from a triangulated category to an abelian category satisfying some technical assumptions we construct a tower of interpolation categories. These are categories over which the functor factorizes and which capture…
We propose a novel modular debiasing technique applicable to any discrete random source, addressing the fundamental challenge of reliably extracting high-quality randomness from inherently imperfect physical processes. The method involves…
We present a simple method based on the stability and duality of the properties of sampling and interpolation, which allows one to substantially simplify the proofs of some classical results.
Coherent superpositions are one of the hallmarks of quantum mechanics and are vital for any quantum mechanical device to outperform the classically achievable. Generically, superpositions are verified in interference experiments, but…
The general idea of this paper is to start from a classical integrable (partial differential) equation which arises as a compatibility condition for a matrix linear differential problem. For definitiveness' sake, a generalised sinh-Gordon…
We apply random matrix and free probability techniques to the study of linear maps of interest in quantum information theory. Random quantum channels have already been widely investigated with spectacular success. Here, we are interested in…
In this thesis we study convolutions that arise from noncommutative probability theory. We prove several regularity results for free convolutions, and for measures in partially defined one-parameter free convolution semigroups. We discuss…
We study interpolant extraction from local first-order refutations. We present a new theoretical perspective on interpolation based on clearly separating the condition on logical strength of the formula from the requirement on the com- mon…
In this paper we present an efficient algorithm for bivariate interpolation, which is based on the use of the partition of unity method for constructing a global interpolant. It is obtained by combining local radial basis function…
In this paper we examine an inverse problem in the modular theory of von Neumann algebras in the case of finite factors. First we give a characterization of cyclic and separating vectors for finite factors in terms of operators associated…
Maximally supersymmetric (p+1)-dimensional Yang-Mills theory at large N and finite temperature, with possibly compact spatial directions, has a rich phase structure. Strongly coupled phases may have holographic descriptions as black branes…
In quantum field theory, elemental particles are assumed to be point particles. As a result, the loop integrals are divergent in many cases. Regularization and renormalization are necessary in order to get the physical finite results from…
In this paper we show how gauge symmetries in an effective theory can be used to simplify proofs of factorization formulae in highly energetic hadronic processes. We use the soft-collinear effective theory, generalized to deal with…
In this note, we study the relation between Fontaine-Laffaille modules and strongly divisible modules, without assuming the main theorem of Fontaine-Laffaille (but we need to assume the main results concerning strongly divisible modules).…
We propose a framework for synthesizing inductive invariants for incomplete verification engines, which soundly reduce logical problems in undecidable theories to decidable theories. Our framework is based on the counter-example guided…
We outline refined versions of two major quantum algorithms for performing principal component analysis and solving linear equations. Our methods are exponentially faster than their classical counterparts and even previous quantum…
We use strong complementarity to introduce dynamics and symmetries within the framework of CQM, which we also extend to infinite-dimensional separable Hilbert spaces: these were long-missing features, which open the way to a wealth of new…
We are often interested in decomposing complex, structured data into simple components that explain the data. The linear version of this problem is well-studied as dictionary learning and factor analysis. In this work, we propose a…