Related papers: LST Numbers for $Q^{\text{e.c.}}$ and $I$ style qu…
In this paper we introduce a new method to produce lower bounds for the Waring rank of symmetric tensors. We also introduce the notion of $e$-computability and we use it to prove that Strassen's Conjecture holds in infinitely many new…
We introduce techniques for turning estimates on the infinitesimal behavior of solutions to nonlinear equations (statements concerning tangent cones and blow ups) into more effective control. In the present paper, we focus on proving…
We develop an approximate second quantization method for describing the many-particle systems in the presence of bound states of particles at low energies (the kinetic energy of particles is small in comparison to the binding energy of…
We investigate quasi-universal relations in neutron stars linking standard observables, such as tidal deformability ($\Lambda$) and normalized moment of inertia ($\bar{I}$), with normalized curvature scalars in general relativity. These…
We establish two conditions equivalent to coamenability for type I locally compact quantum groups. The first condition is concerned with the spectra of certain convolution operators on the space…
The approximate stabilizer rank of a quantum state is the minimum number of terms in any approximate decomposition of that state into stabilizer states. Bravyi and Gosset showed that the approximate stabilizer rank of a so-called "magic"…
We use entropy numbers in combination with the polynomial method to derive a new general lower bound for the n-th minimal error in the quantum setting of information-based complexity. As an application, we improve some lower bounds on…
In this paper we introduce several quantitative methods for the lambda-calculus based on partial metrics, a well-studied variant of standard metric spaces that have been used to metrize non-Hausdorff topologies, like those arising from…
We present a method to reduce the variance of stochastic trace estimators used in quantum typicality (QT) methods via a randomized low-rank approximation of the finite-temperature density matrix $e^{-\beta H}$. The trace can be evaluated…
We make use of some observations on the core model, for example assuming $V=L [ E ]$, and that there is no inner model with a Woodin cardinal, and $M$ is an inner model with the same cardinals as $V$, then $V=M$. We conclude in this latter…
It is well known that the set of algebraic numbers (let us call it $A$) is countable. In this paper, instead of the usage of the classical terminology of cardinals proposed by Cantor, a recently introduced methodology using \G1-based…
New measures for the quantization of systems with constraints are discussed and applied to several examples, in particular, examples of alternative but equivalent formulations of given first-class constraints, as well as a comparison of…
We initiate the study of quantum Locally Testable Codes (qLTCs). We provide a definition together with a simplification, denoted sLTCs, for the special case of stabilizer codes, together with some basic results using those definitions. The…
A covariant quantization scheme employing reducible representations of canonical commutation relations with positive-definite metric and Hermitian four-potentials is tested on the example of quantum electrodynamic fields produced by a…
A set $Q$ in $\mathbb{Z}_+^d$ is a lower set if $(k_1,\dots,k_d)\in Q$ implies $(l_1,\dots,l_d)\in Q$ whenever $0\le l_i\le k_i$ for all $i$. We derive new and refine known results regarding the cardinality of the lower sets of size $n$ in…
We use microlocal and paradifferential techniques to obtain $L^8$ norm bounds for spectral clusters associated to elliptic second order operators on two-dimensional manifolds with boundary. The result leads to optimal $L^q$ bounds, in the…
Classical satisfiability (SAT) and quantum satisfiability (QSAT) are complete problems for the complexity classes NP and QMA which are believed to be intractable for classical and quantum computers, respectively. Statistical ensembles of…
We introduce sequential and parallel decoders for quantum Tanner codes. When the Tanner code construction is applied to a sufficiently expanding square complex with robust local codes, we obtain a family of asymptotically good quantum…
In this paper, we present a method to certify the approximation quality of a low rank tensor to a given third order symmetric tensor. Under mild assumptions, best low rank approximation is attained if a control parameter is zero or…
The distortion-rate performance of certain randomly-designed scalar quantizers is determined. The central results are the mean-squared error distortion and output entropy for quantizing a uniform random variable with thresholds drawn…