Related papers: A quantum lower bound for the collision problem

Consider the finite regular language L_n = {w0 : w \in {0,1}^*, |w| \le n}. It was shown by Ambainis, Nayak, Ta-Shma and Vazirani that while this language is accepted by a deterministic finite automaton of size O(n), any one-way quantum…

The approximate degree of a Boolean function f is the least degree of a real polynomial that approximates f pointwise to error at most 1/3. Approximate degree is known to be a lower bound on quantum query complexity. We resolve or nearly…

Reversible circuits have been studied extensively and intensively, and have plenty of applications in various areas, such as digital signal processing, cryptography, and especially quantum computing. In 2003, the lower bound $\Omega(2^n…

The Cheeger problem for a bounded domain $\Omega\subset\mathbb{R}^{N}$, $N>1$ consists in minimizing the quotients $|\partial E|/|E|$ among all smooth subdomains $E\subset\Omega$ and the Cheeger constant $h(\Omega)$ is the minimum of these…

We improve the lower bound for the classical exponent of approximation $w_{n}^{\ast}(\xi)$ connected to Wirsing's famous problem of approximation to real numbers by algebraic numbers of degree at most $n$. Our bound exceeds…

This note gives a lower bound of $\Omega(n^{\lceil 2d/3\rceil})$ on the maximal complexity of the Euclidean Voronoi diagram of $n$ non-intersecting lines in $\mathbb{R}^d$ for $d>2$.

We consider a bounded domain $\Omega\subset\mathbb R^3$ and a rigid body $\mathcal{S}(t)\subset\Omega$ moving inside a viscous compressible Newtonian fluid. We exploit the roughness of the body to show that the solid collides its container…

We propose an alternative measure of quantum uncertainty for pairs of arbitrary observables in the 2-dimensional case, in terms of collision entropies. We derive the optimal lower bound for this entropic uncertainty relation, which results…

We approximate intersection numbers $\big\langle \psi_1^{d_1}\cdots \psi_n^{d_n}\big\rangle_{g,n}$ on Deligne-Mumford's moduli space $\overline{\mathcal M}_{g,n}$ of genus $g$ stable complex curves with $n$ marked points by certain…

We study a 3D ternary system derived as a sharp-interface limit of the Nakazawa-Ohta density functional theory of triblock copolymers, which combines an interface energy with a long range interaction term. Although both the binary case in…

Expansions are provided for the moments of the number of collisions $X_n$ in the $\beta(2,b)$-coalescent restricted to the set $\{1,...,n\}$. We verify that $X_n/\mathbb{E}X_n$ converges almost surely to one and that $X_n$, properly…

We prove a new lower bound for the unitary synthesis problem in the so-called 1.5-query setting. Our analysis establishes that any attempt to implement arbitrary n-qubit unitaries via limited oracle access requires resources that exceed the…

Let $\Omega$ be an open set in Euclidean space $\R^m,\, m=2,3,...$, and let $v_{\Omega}$ denote the torsion function for $\Omega$. It is known that $v_{\Omega}$ is bounded if and only if the bottom of the spectrum of the Dirichlet Laplacian…

We prove that any exact quantum algorithm searching an ordered list of N elements requires more than \frac{1}{\pi}(\ln(N)-1) queries to the list. This improves upon the previously best known lower bound of {1/12}\log_2(N) - O(1). Our proof…

We report the first improvement in the space-time trade-off of lower bounds for the orthogonal range searching problem in the semigroup model, since Chazelle's result from 1990. This is one of the very fundamental problems in range…

Given a non-negative $n \times n$ matrix viewed as a set of distances between $n$ points, we consider the property testing problem of deciding if it is a metric. We also consider the same problem for two special classes of metrics, tree…

We give a simplified and improved lower bound for the simplex range reporting problem. We show that given a set $P$ of $n$ points in $\mathbb{R}^d$, any data structure that uses $S(n)$ space to answer such queries must have…

We prove the first nontrivial worst-case lower bounds for two closely related problems. First, $\Omega(n^{3/2})$ degree-1 reductions, series-parallel reductions, and $\Delta$Y transformations are required in the worst case to reduce an…

Let $\Omega$ be an open convex set in ${\mathbb R}^m$ with finite width, and let $v_{\Omega}$ be the torsion function for $\Omega$, i.e. the solution of $-\Delta v=1, v\in H_0^1(\Omega)$. An upper bound is obtained for the product of $\Vert…

The claw problem is central in the fields of theoretical computer science as well as cryptography. The optimal quantum query complexity of the problem is known to be $\Omega\left(\sqrt{G}+(FG)^{1/3} \right)$ for input functions $f\colon…