Related papers: A composition theorem for randomized query complex…
By a theorem of Gordon and Hedenmalm, $\varphi$ generates a bounded composition operator on the Hilbert space $\mathscr{H}^2$ of Dirichlet series $\sum_n b_n n^{-s}$ with square-summable coefficients $b_n$ if and only if $\varphi(s)=c_0…
We study the problem of reaching agreement in a synchronous distributed system by $n$ autonomous parties, when the communication links from/to faulty parties can omit messages. The faulty parties are selected and controlled by an adaptive,…
We consider the allocation of $m$ balls into $n$ bins with incomplete information. In the classical Two-Choice process a ball first queries the load of two randomly chosen bins and is then placed in the least loaded bin. In our setting,…
We describe new lower bounds for randomized communication complexity and query complexity which we call the partition bounds. They are expressed as the optimum value of linear programs. For communication complexity we show that the…
Fix a positive integer $N$. Select an additive composition $\xi$ of $N$ uniformly out of $2^{N-1}$ possibilities. The interplay between the number of parts in $\xi$ and the maximum part in $\xi$ is our focus. It is not surprising that…
While exponential separations are known between quantum and randomized communication complexity for partial functions (Raz, STOC 1999), the best known separation between these measures for a total function is quadratic, witnessed by the…
The current paper presents a new quantum algorithm for finding multicollisions, often denoted by $\ell$-collisions, where an $\ell$-collision for a function is a set of $\ell$ distinct inputs that are mapped by the function to the same…
We prove tight $\Omega(n^{1/3})$ lower bounds on the quantum query complexity of the Collision and the Set Equality problems, provided that the size of the alphabet is large enough. We do this using the negative-weight adversary method.…
We revisit the problem of computing with noisy information considered in Feige et al. 1994, which includes computing the OR function from noisy queries, and computing the MAX, SEARCH and SORT functions from noisy pairwise comparisons. For…
In this paper, we prove a strong XOR lemma for bounded-round two-player randomized communication. For a function $f:\mathcal{X}\times \mathcal{Y}\rightarrow\{0,1\}$, the $n$-fold XOR function $f^{\oplus n}:\mathcal{X}^n\times…
We show that for any odd $k$ and any instance of the Max-kXOR constraint satisfaction problem, there is an efficient algorithm that finds an assignment satisfying at least a $\frac{1}{2} + \Omega(1/\sqrt{D})$ fraction of constraints, where…
We prove Euler-Lagrange and natural boundary necessary optimality conditions for fractional problems of the calculus of variations which are given by a composition of functionals. Our approach uses the recent notions of Riemann-Liouville…
Quantum theory is in principle compatible with processes that violate causal inequalities, an analogue of Bell inequalities that constrain the correlations observed by sets of parties operating in a definite causal order. Since the…
The quantum adversary method is a versatile method for proving lower bounds on quantum algorithms. It yields tight bounds for many computational problems, is robust in having many equivalent formulations, and has natural connections to…
We study the relative-error property testing model for Boolean functions that was recently introduced in the work of Chen et al. (SODA 2025). In relative-error testing, the testing algorithm gets uniform random satisfying assignments as…
We consider flavor breaking in the the octet and decuplet baryon masses at second order in large-$N$ chiral perturbation theory, where $N$ is the number of QCD colors. We assume that $1/N \sim 1/N_F \sim m_s / \Lambda \gg m_{u,d}/\Lambda,…
Gaussian Multiplicative Chaos (GMC) is informally defined as a random measure $e^{\gamma X} \mathrm{d} x$ where $X$ is Gaussian field on $\mathbb R^d$ (or an open subset of it) whose correlation function is of the form $ K(x,y)= \log…
We construct a new quantum algorithm for the graph collision problem; that is, the problem of deciding whether the set of marked vertices contains a pair of adjacent vertices in a known graph G. The query complexity of our algorithm is…
For any function $f: X \times Y \to Z$, we prove that $Q^{*\text{cc}}(f) \cdot Q^{\text{OIP}}(f) \cdot (\log Q^{\text{OIP}}(f) + \log |Z|) \geq \Omega(\log |X|)$. Here, $Q^{*\text{cc}}(f)$ denotes the bounded-error communication complexity…
Partial set cover problem and set multi-cover problem are two generalizations of set cover problem. In this paper, we consider the partial set multi-cover problem which is a combination of them: given an element set $E$, a collection of…