Related papers: A Quantum Lovasz Local Lemma
We produce a series of Central Limit Theorems (CLTs) associated to compact metric measure spaces $(K,d,\eta)$, with $\eta$ a reasonable probability measure. For the first CLT, we can ignore $\eta$ by isometrically embedding $K$ into…
This note is purely expository and is in Russian. We show how to prove interesting combinatorial results using the local Lovasz lemma. The note is accessible for students having basic knowledge of combinatorics; the notion of independence…
Quantum theory is known to be nonlocal in the sense that separated parties can perform measurements on a shared quantum state to obtain correlated probability distributions, which cannot be achieved if the parties share only classical…
Relative entropy serves as a fundamental measure of state distinguishability in both quantum information theory and relativistic quantum field theory. Despite its conceptual importance, however, explicit computations of relative entropy…
The fundamental Filippov-Wazwski Relaxation Theorem states that the solution set of an initial value problem for a locally Lipschitz inclusion is dense in the solution set of the same initial value problem for the corresponding relaxation…
The Johnson--Lindenstrauss (JL) lemma is a powerful tool for dimensionality reduction in modern algorithm design. The lemma states that any set of high-dimensional points in a Euclidean space can be flattened to lower dimensions while…
In this paper, we establish a local limit theorem for linear fields of random variables constructed from independent and identically distributed innovations each with finite second moment. When the coefficients are absolutely summable we do…
We consider a composite optimization problem where the sum of a continuously differentiable and a merely lower semicontinuous function has to be minimized. The proximal gradient algorithm is the classical method for solving such a problem…
We study theoretically how local measurements perfomed on critical quantum ground states affect long-distance correlations. These states are highly entangled and feature algebraic correlations between local observables. As a consequence,…
We aim at investigating the solvability/insolvability of nondeterministic logarithmic-space (NL) decision, search, and optimization problems parameterized by natural size parameters using simultaneously polynomial time and sub-linear space.…
Several recent studies show that bright, intermediate and high redshift optically and radio selected QSOs are positively correlated with nearby galaxies on a range of angular scales up to a degree. Obscuration by unevenly distributed…
We use and adapt the Borsuk-Ulam Theorem from topology to derive limitations on list-replicable and globally stable learning algorithms. We further demonstrate the applicability of our methods in combinatorics and topology. We show that,…
The conflict between Quantum Mechanics (QM) and the intuitive concepts of Locality and Realism (LR) is manifest in the correlation between measurements performed in remote regions of a spatially spread entangled state. In this paper, it is…
Suppose we have an n-qubit system, and we are given a collection of local density matrices rho_1,...,rho_m, where each rho_i describes a subset C_i of the qubits. We say that the rho_i are ``consistent'' if there exists some global state…
The famous Johnson-Lindenstrauss lemma states that for any set of n vectors, there is a linear transformation into a space of dimension O(log n) that approximately preserves all their lengths. In fact, a Haar random unitary transformation…
We examine quantum field theory in spacetimes that are time nonorientable but have no other causal pathology. These are Lorentzian universes-from-nothing, spacetimes with a single spacelike boundary that nevertheless have a smooth…
We extend Polyak's theorem on the convexity of joint numerical range from three to any number of quadratic forms on condition that they can be generated by three quadratic forms with a positive definite linear combination. Our new result…
Local search algorithms use the neighborhood relations among search states and often perform well for a variety of NP-hard combinatorial search problems. This paper shows how quantum computers can also use these neighborhood relations. An…
A new geometric representation of qubit and qutrit states based on probability simplexes is used to describe the separability and entanglement properties of density matrices of two qubits. The Peres--Horodecki positive partial transpose…
A $t$-covering array with entries from the alphabet ${\cal Q}=\{0,1,\ldots,q-1\}$ is a $k\times n$ stack, so that for any choice of $t$ (typically non-consecutive) columns, each of the $q^{t}$ possible $t$-letter words over ${\cal Q}$…