相关论文: A quantum lower bound for the collision problem

We prove tight lower bounds for the following variant of the counting problem considered by Aaronson, Kothari, Kretschmer, and Thaler (2020). The task is to distinguish whether an input set $x\subseteq [n]$ has size either $k$ or…

We consider the quantum query complexity of local search as a function of graph geometry. Given a graph $G = (V,E)$ with $n$ vertices and black box access to a function $f : V \to \mathbb{R}$, the goal is find a vertex $v$ that is a local…

A quantum correction to the Brans-Dicke theory due to interactions among matter fields is calculated, resulting in violation of WEP, hence giving a constraint on the parameter $\omega$ far more stringent than accepted so far. The tentative…

Given an array of distinct integers $A[1\ldots n]$, the Range Minimum Query (RMQ) problem requires us to construct a data structure from $A$, supporting the RMQ query: given an interval $[a,b]\subseteq[1,n]$, return the index of the minimum…

According to a conjecture of Pach, there are $O(n)$ tangent pairs among any family of $n$ Jordan arcs in which every pair of arcs has precisely one common point and no three arcs share a common point. This conjecture was proved for two…

The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hypercube {0,1}^n, we show a lower bound of Omega(2^{n/4}/n) on…

Consider a one dimensional quantum mechanical particle described by the Schroedinger equation on a closed curve of length $2\pi$. Assume that the potential is given by the square of the curve's curvature. We show that in this case the…

We prove the following asymptotically tight lower bound for $k$-color discrepancy: For any $k \geq 2$, there exists a hypergraph with $n$ hyperedges such that its $k$-color discrepancy is at least $\Omega(\sqrt{n})$. This improves on the…

We strengthen the connections between electrical transformations and homotopy from the planar setting---observed and studied since Steinitz---to arbitrary surfaces with punctures. As a result, we improve our earlier lower bound on the…

We prove new bounds on the quantum communication complexity of the disjointness and equality problems. For the case of exact and non-deterministic protocols we show that these complexities are all equal to n+1, the previous best lower bound…

The integral of the Wigner function over a subregion of the phase-space of a quantum system may be less than zero or greater than one. It is shown that for systems with one degree of freedom, the problem of determining the best possible…

Simon in his FOCS'94 paper was the first to show an exponential gap between classical and quantum computation. The problem he dealt with is now part of a well-studied class of problems, the hidden subgroup problems. We study Simon's problem…

It has long been known that any Boolean function that depends on n input variables has both degree and exact quantum query complexity of Omega(log n), and that this bound is achieved for some functions. In this paper we study the case of…

Using a recent verification of the Riemann hypothesis up to height $3\cdot 10^{12}$, we provide strong estimates on $\pi(x)$ and other prime counting functions for finite ranges of $x$. In particular, we get that…

Cosmic acceleration is one of the most remarkable cosmological findings of recent years. Although a dark energy component has usually been invoked as the mechanism for the acceleration, A modification of Friedmann equation from various…

In his seminal 1961 paper, Wirsing studied how well a given transcendental real number $\xi$ can be approximated by algebraic numbers $\alpha$ of degree at most $n$ for a given positive integer $n$, in terms of the so-called naive height…

Bound q\bar q -systems are considered in the framework of three different versions of the 3-dimensional reduction of the Bethe-Salpeter equation, all having the correct one-body limit when one of the constituent quark masses tends to…

One of the major open problems in complexity theory is to demonstrate an explicit function which requires super logarithmic depth, a.k.a, the $\mathbf{P}$ versus $\mathbf{NC^1}$ problem. The current best depth lower bound is $(3-o(1))\cdot…

In this paper, we first introduce a lower bound technique for the state complexity of transformations of automata. Namely we suggest first considering the class of full automata in lower bound analysis, and later reducing the size of the…

We develop a general method for lower bounding the variance of sequences in arithmetic progressions mod $q$, summed over all $q \leq Q$, building on previous work of Liu, Perelli, Hooley, and others. The proofs lower bound the variance by…