Related papers: Oracle computability of conditional expectations o…
We consider quantum information tasks in an operator algebraic setting, where we consider normal states on von Neumann algebras. In particular, we consider subfactors $\mathfrak{N} \subset \mathfrak{M}$, that is, unital inclusions of von…
In this paper, we introduce a novel method to generate interpretable regression function estimators. The idea is based on called data-dependent coverings. The aim is to extract from the data a covering of the feature space instead of a…
By the example of the proof of Minkowski's conjecture on critical determinant we give a category theory framework for interval computation.
We study the existence of global implicit functions for equations defined on open subsets of Banach spaces. The partial derivative with respect to the second variable is only required to have a left inverse instead of being invertible.…
We address the problem of causal effect estimation where hidden confounders are present, with a focus on two settings: instrumental variable regression with additional observed confounders, and proxy causal learning. Our approach uses a…
We present an explicit formula for the expected value of a product of several independent symplectically invariant matrices in which the trace and real part function may be applied, possibly to different subexpressions. This takes the form…
A standard quantum oracle $S_f$ for a general function $f: Z_N \to Z_N $ is defined to act on two input states and return two outputs, with inputs $\ket{i}$ and $\ket{j}$ ($i,j \in Z_N $) returning outputs $\ket{i}$ and $\ket{j \oplus…
Two point correlation functions of the off-critical primary fields \phi_{1, 1+s} are considered in the perturbed minimal models M_{2, 2N+3} + \phi_{1,3}. They are given as infinite series of form factor contributions. The form factors of…
In this article, we review selective inference, a set of techniques for inference when the statistical question asked is a function of the data. This setting often arises in contemporary scientific workflows, where hypotheses and parameters…
A quantum expectation is a positive linear functional of norm one on a non-commutative probability space (i.e., a C*-algebra). For a given pair of quantum expectations $\mu$ and $\lambda$ on a non-commutative probability space $A$, we…
We investigate how set-theoretic forcing can be seen as a computational process on the models of set theory. Given an oracle for information about a model of set theory $\langle M,\in^M\rangle$, we explain senses in which one may compute…
A characterization of the split property for an inclusion $N\subset M$ of $W^*$-factors with separable predual is established in terms of the canonical non-commutative $L^2$ embedding considered in \cite{B1,B2} $$ \F_2:a\in N\to…
If $N \subset P,Q \subset M$ are type II_1 factors with $N' \cap M = C id$ and $[M:N]$ finite we show that restrictions on the standard invariants of the elementary inclusions $N \subset P$, $N \subset Q$, $P \subset M$ and $Q \subset M$…
We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. The resulting computability theory leads to a notion of…
Given an imprecise probabilistic model over a continuous space, computing lower/upper expectations is often computationally hard to achieve, even in simple cases. Because expectations are essential in decision making and risk analysis,…
Quantum computers can solve many number theory problems efficiently. Using the efficient quantum algorithm for order finding as an oracle, this paper presents an algorithm that computes the Carmichael function for any integer $N$ with a…
We propose a construction of quantum hypergroups using conditional expectations on compact quantum groups. Using this construction, we describe several series of non-trivial finite-dimensional quantum hypergroups via conditional…
We consider the fractional posterior distribution that is obtained by updating a prior distribution via Bayes theorem with a fractional likelihood function, a usual likelihood function raised to a fractional power. First, we analyze the…
computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…
We determine when there is a unique conditional expectation from a semifinite von Neumann algebra onto a singly-generated maximal abelian *-subalgebra. Our work extends the results of Kadison and Singer via new methods, notably the…