Related papers: A Quantum Lovasz Local Lemma

Through a reformulation of the local limit theorem and law of small numbers, which is obtained by working in the spaces naturally associated to the limiting distributions, we discover a general and abstract framework for the investigation…

We present polynomial-time algorithms for approximate counting and sampling solutions to constraint satisfaction problems (CSPs) with atomic constraints within the local lemma regime: $$ pD^{2+o_q(1)}\lesssim 1. $$ When the domain size $q$…

Recall the classical hypothesis testing setting with two convex sets of probability distributions P and Q. One receives either n i.i.d. samples from a distribution p in P or from a distribution q in Q and wants to decide from which set the…

We consider several examples of probabilistic existence proofs using compressibility arguments, including some results that involve Lov\'asz local lemma.

Quadratic form reduction and lattice reduction are fundamental tools in computational number theory and in computer science, especially in cryptography. The celebrated Lenstra-Lenstra-Lov\'asz reduction algorithm (so-called LLL) has been…

We extend Gleason's theorem to the two-dimensional Hilbert space of a qubit by invoking the standard axiom that describes composite quantum systems. The tensor-product structure allows us to derive density matrices and Born's rule for $d=2$…

We present a poly $\log \log n$ time randomized CONGEST algorithm for a natural class of Lovasz Local Lemma (LLL) instances on constant degree graphs. This implies, among other things, that there are no LCL problems with randomized…

We study the relation between qubit entanglement and Lorentzian geometry. In an earlier paper, we had given a recipe for detecting two qubit entanglement. The entanglement criterion is based on Partial Lorentz Transformations (PLT) on…

Reconstructing the full quantum state of a many-body system requires the estimation of a number of parameters that grows exponentially with system size. Nevertheless, there are situations in which one is only interested in a subset of these…

The are substantial studies on distinguishabilities, especially local distinguishability, of quantum states. It is shown that a necessary condition of a local distinguishable state set is the total Schmidt rank not larger than the system…

We reveal a connection between the incompressibility method and the Lovasz local lemma in the context of Ramsey theory. We obtain bounds by repeatedly encoding objects of interest and thereby compressing strings. The method is demonstrated…

The $k$-QSAT problem is a quantum analog of the famous $k$-SAT constraint satisfaction problem. We must determine the zero energy ground states of a Hamiltonian of $N$ qubits consisting of a sum of $M$ random $k$-local rank-one projectors.…

In an important recent development, Anshu, Breuckmann, and Nirkhe [ABN22] resolved positively the so-called No Low-Energy Trivial State (NLTS) conjecture by Freedman and Hastings. The conjecture postulated the existence of linear-size local…

We introduce a variant of the $k$-nearest neighbor classifier in which $k$ is chosen adaptively for each query, rather than supplied as a parameter. The choice of $k$ depends on properties of each neighborhood, and therefore may…

We elucidate the close connection between the repulsive lattice gas in equilibrium statistical mechanics and the Lovasz local lemma in probabilistic combinatorics. We show that the conclusion of the Lovasz local lemma holds for dependency…

In the paper, we investigate the following fundamental question. For a set $\mathcal{K}$ in $\mathbb{L}^0(\mathbb{P})$, when does there exist an equivalent probability measure $\mathbb{Q}$ such that $\mathcal{K}$ is uniformly integrable in…

A new probabilistic technique for establishing the existence of certain regular combinatorial structures has been recentlyintroduced by Kuperberg, Lovett, and Peled (STOC 2012). Using this technique, it can be shown that under certain…

We establish the satisfiability threshold for random $k$-SAT for all $k\ge k_0$, with $k_0$ an absolute constant. That is, there exists a limiting density $\alpha_*(k)$ such that a random $k$-SAT formula of clause density $\alpha$ is with…

We study the Kullback--Leibler (KL) divergence approximation theory of Gaussian mixture models (GMMs) by isolating an abstract mechanism behind several necessary-and-sufficient statements. The necessity direction is universal: if a density…

We derive Born's rule and the density-operator formalism for quantum systems with Hilbert spaces of dimension two or larger. Our extension of Gleason's theorem only relies upon the consistent assignment of probabilities to the outcomes of…