Related papers: A Quantum Lovasz Local Lemma
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…
The resampling algorithm of Moser \& Tardos is a powerful approach to develop constructive versions of the Lov\'{a}sz Local Lemma (LLL). We generalize this to partial resampling: when a bad event holds, we resample an appropriately-random…
We provide conditions ensuring that the KKT-type conditions characterizes the global optimality for quadratically constrained (possibly nonconvex) quadratic programming QCQP problems in Hilbert spaces. The key property is the convexity of a…
The framework of generalized probabilistic theories (GPT) is a widely-used approach for studying the physical foundations of quantum theory. The standard GPT framework assumes the no-restriction hypothesis, in which the state space of a…
A point process is R-dependent, if it behaves independently beyond the minimum distance R. This work investigates uniform positive lower bounds on the avoidance functions of R-dependent simple point processes with a common intensity.…
We present efficient counting and sampling algorithms for random $k$-SAT when the clause density satisfies $\alpha \le \frac{2^k}{\mathrm{poly}(k)}.$ In particular, the exponential term $2^k$ matches the satisfiability threshold…
We generalize the concept of local states (LS) for the prediction of high-dimensional, potentially mixed chaotic systems. The construction of generalized local states (GLS) relies on defining distances between time series on the basis of…
The multivariate covering lemma states that given a collection of $k$ codebooks, each of sufficiently large cardinality and independently generated according to one of the marginals of a joint distribution, one can always choose one…
Reinforcement learning with neural networks (RLNN) has recently demonstrated great promise for many problems, including some problems in quantum information theory. In this work, we apply RLNN to quantum hypothesis testing and determine the…
The solution space of many classical optimization problems breaks up into clusters which are extensively distant from one another in the Hamming metric. Here, we show that an analogous quantum clustering phenomenon takes place in the ground…
The current burst in research activities on disordered semiconductors calls for the development of appropriate theoretical tools that reveal the features of electron states in random potentials while avoiding the time-consuming numerical…
We formulate and prove the local twist version of the Yamanaka-Oshikawa-Affleck theorem, an extension of the Lieb-Schultz-Mattis theorem, for one-dimensional systems of quantum particles or spins. We can treat almost any translationally…
We prove a local central limit theorem (LCLT) for the number of points $N(J)$ in a region $J$ in $\mathbb R^d$ specified by a determinantal point process with an Hermitian kernel. The only assumption is that the variance of $N(J)$ tends to…
This thesis is divided in two parts. The first presents an overview of known results in statistical mechanics of disordered systems and its approach to random combinatorial optimization problems. The second part is a discussion of two…
The Schwartz-Zippel Lemma states that if a low-degree multivariate polynomial with coefficients in a field is not zero everywhere in the field, then it has few roots on every finite subcube of the field. This fundamental fact about…
Propositional satisfiability (SAT) is one of the most fundamental problems in computer science. The worst-case hardness of SAT lies at the core of computational complexity theory. The average-case analysis of SAT has triggered the…
A quasi-complementary sequence set (QCSS) refers to a set of two-dimensional matrices with low non-trivial aperiodic auto- and cross- correlation sums. For multicarrier code-division multiple-access applications, the availability of large…
Kurdyka-Lojasiewicz (KL) exponent plays an important role in estimating the convergence rate of many contemporary first-order methods. In particular, a KL exponent of $\frac12$ for a suitable potential function is related to local linear…
A century after the advent of Quantum Mechanics and General Relativity, both theories enjoy incredible empirical success, constituting the cornerstones of modern physics. Yet, paradoxically, they suffer from deep-rooted, so-far intractable,…
We present an adequacy theorem for a concurrent extension of probabilistic GCL. The underlying denotational semantics is based on the so-called mixed powerdomains, which combine non-determinism with probabilistic behaviour. The theorem…