Related papers: A quantum lower bound for the collision problem

By considering infinite matter constraints only, we suggest in this paper that the Gogny interaction should benefit from a third Gaussian in its central part. A statistical analysis is given to select the possible ranges which are…

For any large prime $q$, $1 \leq x \leq q$ and any real $0 \leq k \leq 1$, we prove an upper bound for the following $2k$-th moment $$\displaystyle \sum_{\substack{\chi \bmod q}} \Big| \sum_{n\leq x} \chi(n)\lambda(n)\Big|^{2k},$$ where…

We improve both upper and lower bounds for the distribution-free testing of monotone conjunctions. Given oracle access to an unknown Boolean function $f:\{0,1\}^n \rightarrow \{0,1\}$ and sampling oracle access to an unknown distribution…

We obtain observational upper bounds on a class of quantum gravity related birefringence effects, by analyzing the presence of linear polarization in the optical and ultraviolet spectrum of some distant sources. In the notation of Gambini…

We study symmetry and quantitative approximate symmetry for an overdetermined problem involving the fractional torsion problem in a bounded domain $\Omega \subset \mathbb R^n$. More precisely, we prove that if the fractional torsion…

As techniques for fault-tolerant quantum computation keep improving, it is natural to ask: what is the fundamental lower bound on redundancy? In this paper, we obtain a lower bound on the redundancy required for $\epsilon$-accurate…

The set equality problem is to tell whether two sets $A$ and $B$ are equal or disjoint under the promise that one of these is the case. This problem is related to the Graph Isomorphism problem. It was an open problem to find any $\omega(1)$…

The ratio of the shear viscosity ($\eta$) to entropy density ($s$) for the intermediate energy heavy-ion collisions has been calculated by using the Green-Kubo method in the framework of the quantum molecular dynamics model. The theoretical…

We consider Schr\"odinger operators of the form $H_R = - d^2/ d x^2 + q + i \gamma \chi_{[0,R]}$ for large $R>0$, where $q \in L^1(0,\infty)$ and $\gamma > 0$. Bounds for the maximum magnitude of an eigenvalue and for the number of…

We give new quantum algorithms for evaluating composed functions whose inputs may be shared between bottom-level gates. Let $f$ be an $m$-bit Boolean function and consider an $n$-bit function $F$ obtained by applying $f$ to conjunctions of…

In Part I we construct the upper bound, in the spirit of $\Gamma$- $\limsup$, achieved by multidimensional profiles, for some general classes of singular perturbation problems, with or without the prescribed differential constraint, taking…

Using ideas from the geometry of compression, we improve on the current upper and lower bounds of the Heilbronn triangle problem. In particular, let $\Delta(s)$ denote the minimal area of the triangle induced by $s$ points on a unit disk.…

This paper is a contribution to the investigation of closed partition relations for pairs of countable ordinals. As our main result, we prove that \[\omega^4 \cdot (n-2)+1 < R^{cl}(\omega \cdot n+1,3)<\omega^5\] for every integer $n \geq…

The laws of quantum mechanics place fundamental limits on the accuracy of measurements and therefore on the estimation of unknown parameters of a quantum system. In this work, we prove lower bounds on the size of confidence regions reported…

In this work, we establish the first separation between computation with bounded and unbounded space, for problems with short outputs (i.e., working memory can be exponentially larger than output size), both in the classical and the quantum…

We present an approach to quantum dynamical lower bounds for discrete one-dimensional Schr\"odinger operators which is based on power-law bounds on transfer matrices. It suffices to have such bounds for a nonempty set of energies. We apply…

Finite automata on infinite words ($\omega$-automata) proved to be a powerful weapon for modeling and reasoning infinite behaviors of reactive systems. Complementation of $\omega$-automata is crucial in many of these applications. But the…

We use a coin flipping model for the random partition and Chebyshev's inequality to prove the lower bound $\lim \frac{\log p(n)}{\sqrt{n}} \ge C$ for the number of partitions $p(n)$ of $n$, where $C$ is an explicit constant.

Let $\Omega\subset\mathbb R^n$ be a bounded domain of class $C^{2+\alpha}$, $0<\alpha<1$. We show that if $n\geq 3$ and $u_\Omega$ is the maximal solution of equation $\Delta u = n(n-2)u^{(n+2)/(n-2)}$ in $\Omega$, then the hyperbolic…

Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problems in mathematical logic, model-checking, program analysis and…