Related papers: Exponential-Size Circuit Complexity is Comeager in…
I survey, for a general scientific audience, three decades of research into which sorts of problems admit exponential speedups via quantum computers -- from the classics (like the algorithms of Simon and Shor), to the breakthrough of…
We consider realizable contextual bandits with general function approximation, investigating how small reward variance can lead to better-than-minimax regret bounds. Unlike in minimax bounds, we show that the eluder dimension…
Quantum complexity is a measure of the minimal number of elementary operations required to approximately prepare a given state or unitary channel. Recently, this concept has found applications beyond quantum computing -- in studying the…
Large language models improve with scale, yet feedback-based alignment still exhibits systematic deviations from intended behavior. Motivated by bounded rationality in economics and cognitive science, we view judgment as resource-limited…
We consider a particle moving on a cone and bound to its tip by $1/r$ or harmonic oscillator potentials. When the deficit angle of the cone divided by $2 \pi$ is a rational number, all bound classical orbits are closed. Correspondingly, the…
Qualitative reasoning is an important subfield of artificial intelligence where one describes relationships with qualitative, rather than numerical, relations. Many such reasoning tasks, e.g., Allen's interval algebra, can be solved in…
Expectation thresholds arise from a class of integer linear programs (LPs) that are fundamental to the study of thresholds in large random systems. An avenue towards estimating expectation thresholds comes from the fractional relaxation of…
We generalize the existing finite-size criteria for spectral gaps of frustration-free spin systems to $D>2$ dimensions. We obtain a local gap threshold of $\frac{3}{n}$, independent of $D$, for nearest-neighbor interactions. The…
Exponential time differencing methods is a power tool for high-performance numerical simulation of computationally challenging problems in condensed matter physics, fluid dynamics, chemical and biological physics, where mathematical models…
It is shown that an elliptic scattering operator $A$ on a compact manifold with boundary with coefficients in the bounded operators of a bundle of Banach spaces of class (HT) and Pisier's property $(\alpha)$ has maximal regularity (up to a…
The random assignment (or bipartite matching) problem studies the random total cost A_n of the optimal assignment of each of n jobs to each of n machines, where the costs of the n^2 possible job-machine matches has exponential (mean 1)…
Scrambling of information in a quantum many-body system, quantified by the out-of-time-ordered correlator (OTOC), is a key manifestation of quantum chaos. A regime of exponential growth in the OTOC, characterized by a Lyapunov exponent, has…
On bounded domains $\Omega \subset \mathbb{R}^d , d \geq 2$, reaching far beyond the scope of Lipschitz domains, we consider an elliptic system of order $2 m$ in divergence form with complex $\mathrm{L}^{\infty}$-coefficients complemented…
Ehrenfeucht-Fra\"iss\'e (EF) games are a basic tool in finite model theory for proving definability lower bounds, with many applications in complexity theory and related areas. They have been applied to study various logics, giving insights…
In this paper we investigate a class of variational reaction-diffusion systems with strong competition driven by beyond-pairwise interactions. The model involves $d$ nonnegative components interacting through $k$-wise terms, with $3 \leq k…
We use rigorous numerical techniques to compute a lower bound for the exponent of expansivity outside a neighborhood of the critical point for thousands of intervals of parameter values in the quadratic family. We compute a possibly small…
In the 1980s, category theorists introduced the Lawvere-Tierney $(\leq_{\mathrm{LT}})$ order in the Effective Topos, known to effectively embed the Turing degrees. Understanding its structure is a longstanding open problem in the area. In…
We develop a new approach for approximating large independent sets when the input graph is a one-sided spectral expander - that is, the uniform random walk matrix of the graph has its second eigenvalue bounded away from 1. Consequently, we…
We give the first super-polynomial separation in the power of bounded-depth boolean formulas vs. circuits. Specifically, we consider the problem Distance $k(n)$ Connectivity, which asks whether two specified nodes in a graph of size $n$ are…
We show that coarse graining arguments invented for the analysis of multi-spin systems on a randomly triangulated surface apply also to the O(n) model on a random lattice. These arguments imply that if the model has a critical point with…