Related papers: Upper bounds for Grothendieck constants, quantum c…

We propose the generalized uncertainty principle (GUP) with an additional term of quadratic momentum motivated by string theory and black hole physics as a quantum mechanical framework for the minimal length uncertainty at the Planck scale.…

We obtain an asymptotic formula for the fourth moment of central values of a family of quadratic Hecke $L$-functions in the Gaussian field under the generalized Riemann hypothesis (GRH). We also establish lower bounds unconditionally and…

Let $g(k)$ be the maximum size of a planar set that determines at most $k$ distances. We prove $$\frac{\pi}{3\,C(\Lambda_{hex})}\ k\sqrt{\log k} (1+o(1)) \le g(k) \le C k\log k,$$ so $g(k) \asymp k\sqrt{\log k}$ with an explicit constant…

We derive a computable closed-form upper bound on the Hausdorff distance between a truncated minimal robust positively invariant (mRPI) set and its infinite-horizon limit. The bound depends only on a disturbance-set size measure and an…

We consider the localization $\mathcal{Q}_{\mathbf{V},\mathbf{W}}/\mathcal{N}_{\mathbf{V}}$ of Lusztig's sheaves for framed quivers, and define functors $E^{(n)}_{i},F^{(n)}_{i},K^{\pm}_{i},n\in \mathbb{N},i \in I$ between the…

We study the computation of Gaussian orthant probabilities, i.e. the probability that a Gaussian falls inside a quadrant. The Geweke-Hajivassiliou-Keane (GHK) algorithm [Genz, 1992; Geweke, 1991; Hajivassiliou et al., 1996; Keane, 1993], is…

One of the best lower bound methods for the quantum communication complexity of a function H (with or without shared entanglement) is the logarithm of the approximate rank of the communication matrix of H. This measure is essentially…

One of the few methods for generating efficient function spaces for multi-D Schrodinger eigenproblems is given by Garashchuk and Light in J.Chem.Phys. 114 (2001) 3929. Their Gaussian basis functions are wider and sparser in high potential…

A method to compute guaranteed lower bounds to the eigenvalues of the Maxwell system in two or three space dimensions is proposed as a generalization of the method of Liu and Oishi [SIAM J. Numer. Anal., 51, 2013] for the Laplace operator.…

We describe a quantum algorithm based on an interior point method for solving a linear program with $n$ inequality constraints on $d$ variables. The algorithm explicitly returns a feasible solution that is $\varepsilon$-close to optimal,…

In the accompanying paper of arXiv:2505.00697, we have presented a generalized scheme of adaptive quantum gradient estimation (QGE) algorithm, and further proposed two practical variants which not only achieve doubly quantum enhancement in…

We give a simple proof of a well-known theorem of G\'al and of the recent related results of Aistleitner, Berkes and Seip [1] regarding the size of GCD sums. In fact, our method obtains the asymptotically sharp constant in G\'al's theorem,…

The cage problem concerns finding $(k,g)$-graphs, which are $k$-regular graphs with girth $g$, of the smallest possible number of vertices. The central goal is to determine $n(k,g)$, the minimum order of such a graph, and to identify…

A new method to represent and approximate rotation matrices is introduced. The method represents approximations of a rotation matrix $Q$ with linearithmic complexity, i.e. with $\frac{1}{2}n\lg(n)$ rotations over pairs of coordinates,…

We prove several numerical radius inequalities involving positive semidefinite matrices via the Hadamard product and Kwong functions. Among other inequalities, it is shown that if $X$ is an arbitrary $n\times n$ matrix and $A,B$ are…

Many theories that attempt to formulate a quantum description of gravity suggest the existence of a fundamental minimum length scale. A popular method for incorporating this minimum length is through a modification of the Heisenberg…

Quantum phase estimation (QPE) is a cornerstone of quantum algorithms designed to estimate the eigenvalues of a unitary operator. QPE is typically implemented through two paradigms with distinct circuit structures: quantum Fourier…

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…

A $k$-collision for a compressing hash function $H$ is a set of $k$ distinct inputs that all map to the same output. In this work, we show that for any constant $k$, $\Theta\left(N^{\frac{1}{2}(1-\frac{1}{2^k-1})}\right)$ quantum queries…

A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the…