Related papers: Almost Euclidean sections of the N-dimensional cro…
Given any $\varepsilon>0$, we construct an orthonormal system of $n_k$ uniformly bounded polynomials of degree at most $k$ on the unit sphere in $\mathbb R^{m+1}$ where $n_k$ is bigger than $1-\varepsilon$ times the dimension of the space…
We prove that random quantum circuits on any geometry, including a 1D line, can form approximate unitary designs over $n$ qubits in $\log n$ depth. In a similar manner, we construct pseudorandom unitaries (PRUs) in 1D circuits in…
This note contains two types of small ball estimates for random vectors in finite dimensional spaces equipped with a quasi-norm. In the first part, we obtain bounds for the small ball probability of random vectors under some smoothness…
We resolve a few questions regarding the uniformity and size of microsets of subsets of Euclidean space. First, we construct a compact set $K\subset\mathbb{R}^d$ with Assouad dimension arbitrarily close to $d$ such that every microset of…
We give a proof of the conjecture of Nelson and Nguyen [FOCS 2013] on the optimal dimension and sparsity of oblivious subspace embeddings, up to sub-polylogarithmic factors: For any $n\geq d$ and $\epsilon\geq d^{-O(1)}$, there is a random…
We show that the space $\text{Lip}_0(\mathbb R^n)$ is the dual space of $L^{1}({\mathbb R}^{n}; {\mathbb R}^{n})/N$ where $N$ is the subspace of $L^{1}({\mathbb R}^{n}; {\mathbb R}^{n})$ consisting of vector fields whose divergence…
A unitary 2-design can be viewed as a quantum analogue of a 2-universal hash function: it is indistinguishable from a truly random unitary by any procedure that queries it twice. We show that exact unitary 2-designs on n qubits can be…
A reproducing kernel can define an embedding of a data point into an infinite dimensional reproducing kernel Hilbert space (RKHS). The norm in this space describes a distance, which we call the kernel distance. The random Fourier features…
The symmetric convex hull of random points that are independent and distributed according to the cone probability measure on the $\ell_p$-unit sphere of $\mathbb R^n$ for some $1\leq p < \infty$ is considered. We prove that these random…
We provide an algorithm for properly learning mixtures of two single-dimensional Gaussians without any separability assumptions. Given $\tilde{O}(1/\varepsilon^2)$ samples from an unknown mixture, our algorithm outputs a mixture that is…
``Quasi-elliptic'' functions can be given a ring structure in two different ways, using either ordinary multiplication, or convolution. The map between the corresponding standard bases is calculated. A related structure has appeared…
Oblivious low-distortion subspace embeddings are a crucial building block for numerical linear algebra problems. We show for any real $p, 1 \leq p < \infty$, given a matrix $M \in \mathbb{R}^{n \times d}$ with $n \gg d$, with constant…
We study different ways of determining the mean distance $ < r_n >$ between a reference point and its $n$-th neighbour among random points distributed with uniform density in a $D$-dimensional Euclidean space. First we present a heuristic…
We give conditions under which a sequence of randomly chosen orthogonal subspaces of a separable Hilbert space generates the whole space.
The Hamiltonian of an atom with $N$ electrons and a fixed nucleus of infinite mass between two parallel planes is considered in the limit when the distance $a$ between the planes tends to zero. We show that this Hamiltonian converges in the…
We derive some estimates for stable minimal hypersurfaces in $R^{n+1}$. The estimates are related to recent proofs of Bernstein theorems for complete stable minimal hypersurfaces in $R^{n+1}$ for $3\le n\le 5$ by Chodosh-Li,…
We determine the probability that a random k-dimensional subspace of Euclidean n-space contains a positive vector.
In this paper we present, using the arithmetic of elliptic curves over finite fields, an algorithm for the efficient generation of a sequence of uniform pseudorandom vectors in high dimensions, that simulates a sample of a sequence of…
Given a universal gate set on two qubits, it is well known that applying random gates from the set to random pairs of qubits will eventually yield an approximately Haar-distributed unitary. However, this requires exponential time. We show…
Given a subset K of the unit Euclidean sphere, we estimate the minimal number m = m(K) of hyperplanes that generate a uniform tessellation of K, in the sense that the fraction of the hyperplanes separating any pair x, y in K is nearly…