Related papers: Counting Martingales for Measure and Dimension in …
This paper deals with the dimension reduction for high-dimensional time series based on common factors. In particular we allow the dimension of time series $p$ to be as large as, or even larger than, the sample size $n$. The estimation for…
Given a positive random variable $X$, $X\ge0$ a.s., a null hypothesis $H_0:E(X)\le\mu$ and a random sample of infinite size of $X$, we construct test supermartingales for $H_0$, i.e. positive processes that are supermartingale if the null…
We establish a connection between continuous-variable quantum computing and high-dimensional integration by showing that the outcome probabilities of continuous-variable instantaneous quantum polynomial (CV-IQP) circuits are given by…
In the first chapter of Shannon's "A Mathematical Theory of Communication," it is shown that the maximum entropy rate of an input process of a constrained system is limited by the combinatorial capacity of the system. Shannon considers…
We introduce two new complexity measures for Boolean functions, or more generally for functions of the form f:S->T. We call these measures sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query…
This expository article explores the vital role of interpolation theory and Lorentz spaces in the rigorous analysis of partial differential equations (PDEs). While classical Lebesgue spaces ($L_{p}$) successfully measure the magnitude of…
We study the weak call-by-value $\lambda$-calculus as a model for computational complexity theory and establish the natural measures for time and space -- the number of beta-reductions and the size of the largest term in a computation -- as…
Given a property $P$ of subspaces of a $T_1$ space $X$, we say that $X$ is {\em $P$-bounded} iff every subspace of $X$ with property $P$ has compact closure in $X$. Here we study $P$-bounded spaces for the properties $P \in \{\omega D,…
Imbalance in classification tasks is commonly quantified by the cardinalities of examples across classes. This, however, disregards the presence of redundant examples and inherent differences in the learning difficulties of classes.…
In continuous time, the laws of martingales tend to be singular to each other. Notably, N. Gantert introduced the concept of specific relative entropy between real-valued continuous martingales, defined as a scaling limit of…
In prior work, we have shown how the basic concepts and terms of quantum mechanics relate to factorizations and marginals of complex-valued quantum mass functions, which are generalizations of joint probability mass functions. In this…
Rectangles are used to approximate objects, or sets of objects, in a plethora of applications, systems and index structures. Many tasks, such as nearest neighbor search and similarity ranking, require to decide if objects in one rectangle A…
We study a problem with three equivalent formulations: describing Gibbs measures for five-vertex model in quadrant; classifying coherent systems on a p-deformation of the Gelfand-Tsetlin graph related to Grothendieck polynomials; finding…
The preparation of long-range entangled states using unitary circuits is limited by Lieb-Robinson bounds, but circuits with projective measurements and feedback (``adaptive circuits'') can evade such restrictions. We introduce three classes…
Properties of a maximal function for vector-valued martingales were studied by the author in an earlier paper. Restricting here to the dyadic setting, we prove the equivalence between (weighted) L^p inequalities and weak type estimates, and…
We provide several characterizations to identify Strong envelop (for bounded measurable process) and Strong super-martingale (for non-negative right upper semi-continuous process of the class $\Dc$). As examples of application, we prove…
The Constraint Satisfaction Problem (CSP) is ubiquitous in various areas of mathematics and computer science. Many of its variations have been studied including the Counting CSP, where the goal is to find the number of solutions to a CSP…
When an experimentalist measures a time series of qubits, the outcomes generate a classical stochastic process. We show that measurement induces high complexity in these processes in two specific senses: they are inherently unpredictable…
We study the conditions under which, given a generic quantum system, complexity metrics provide actual lower bounds to the circuit complexity associated to a set of quantum gates. Inhomogeneous cost functions ---many examples of which have…
There's something really strange about quantum mechanics. It's not just that cats can be dead and alive at the same time, and that entanglement seems to violate the principle of locality; quantum mechanics seems to be what Aaronson calls…