Related papers: Beyond Stabilizer Codes I: Nice Error Bases
We propose new a posteriori error estimators for non-conforming finite element discretizations of second-order elliptic PDE problems. These estimators are based on novel reformulations of the standard Prager-Synge identity, and enable to…
For any finitely generated abelian group $Q$, we reduce the problem of classification of $Q$-graded simple Lie algebras over an algebraically closed field of "good" characteristic to the problem of classification of gradings on simple Lie…
In NIP theories, generically stable Keisler measures can be characterized in several ways. We analyze these various forms of "generic stability" in arbitrary theories. Among other things, we show that the standard definition of generic…
Probabilistic solvers provide a flexible and efficient framework for simulation, uncertainty quantification, and inference in dynamical systems. However, like standard solvers, they suffer performance penalties for certain stiff systems,…
Let $\ell$ be a prime, $k$ a finitely generated field of characteristic different from $\ell$, and $X$ a smooth geometrically connected curve over $k$. Say a semisimple representation of $\pi_1^{\mathrm{et}}(X_{\bar k})$ is arithmetic if it…
This is a survey on the finite basis problem for varieties of algebraic systems. Our exposition is in two directions: (i) We give numerous examples of varieties which are not finitely based. (ii) We give examples of important varieties with…
The relationship between overparameterization, stability, and generalization remains incompletely understood in the setting of discontinuous classifiers. We address this gap by establishing a generalization bound for finite function classes…
We study definably amenable NIP groups. We develop a theory of generics, showing that various definitions considered previously coincide, and study invariant measures. Applications include: characterization of regular ergodic measures, a…
The ubiquity of stabilizer circuits in the design and operation of quantum computers makes techniques to verify their correctness essential. The simulation of stabilizer circuits, which aims to replicate their behavior using a classical…
We point out that some of the proposed generalized/modified uncertainty principles originate from solvable, or nilpotent at appropriate limits, "deformations" of Lie algebras. We briefly comment on formal aspects related to the…
Approximate vanishing ideal is a concept from computer algebra that studies the algebraic varieties behind perturbed data points. To capture the nonlinear structure of perturbed points, the introduction of approximation to exact vanishing…
It has been shown that good structured codes over non-Abelian groups do exist. Specifically, we construct codes over the smallest non-Abelian group $\mathds{D}_6$ and show that the performance of these codes is superior to the performance…
We introduce a new notion of the stability of computations, which holds under post-processing and adaptive composition. We show that the notion is both necessary and sufficient to ensure generalization in the face of adaptivity, for any…
We derive normal approximation results for a class of stabilizing functionals of binomial or Poisson point process, that are not necessarily expressible as sums of certain score functions. Our approach is based on a flexible notion of the…
We show that a $k$-stable set in a finite group can be approximated, up to given error $\epsilon>0$, by left cosets of a subgroup of index $\epsilon^{\text{-}O_k(1)}$. This improves the bound in a similar result of Terry and Wolf on stable…
It is known that the set of irreducible components of nilpotent varieties provides a geometric realization of the crystal basis for quantum groups. For each reduced expression of a Weyl group element, Gei{\ss}, Leclerc and Schr\"{o}er has…
Building on previous work by Lambert, Plagne and the third author, we study various aspects of the behavior of additive bases in infinite abelian groups and semigroups. We show that, for every infinite abelian group $T$, the number of…
Let $\mathbb{N}$ denote the set of all nonnegative integers and $A$ be a subset of $\mathbb{N}$. Let $h\geq2$ and let $r_h(A,n)=\sharp \{ (a_1,\ldots,a_h)\in A^{h}: a_1+\cdots+a_h=n\}.$ The set $A$ is called an asymptotic basis of order $h$…
We show that perturbing ill-posed differential equations with (potentially very) smooth random processes can restore well-posedness -- even if the perturbation is (potentially much) more regular than the drift component of the solution. The…
Bell inequalities constitute a key tool in quantum information theory: they not only allow one to reveal nonlocality in composite quantum systems, but, more importantly, they can be used to certify relevant properties thereof. We provide a…