Related papers: A Quantum Lovasz Local Lemma

Let $A$ be a random $m\times n$ matrix over the finite field $F_q$ with precisely $k$ non-zero entries per row and let $y\in F_q^m$ be a random vector chosen independently of $A$. We identify the threshold $m/n$ up to which the linear…

Quantum Local Search (QLS) is a promising approach that employs small-scale quantum computers to tackle large combinatorial optimization problems through local search on quantum hardware, starting from an initial point. However, the random…

In a seminal paper (Moser and Tardos, JACM'10), Moser and Tardos developed a simple and powerful algorithm to find solutions to combinatorial problems in the variable Lov{\'a}sz Local Lemma (LLL) setting. Kolipaka and Szegedy (STOC'11)…

Let $Q$ be an ideal (downward-closed set) in the lattice of linear subspaces of $(\mathbb F_q)^n$, ordered by inclusion. For $0 \le k \le n$, let $\mu_k(Q)$ denote the fraction of $k$-dimensional subspaces that belong to $Q$. We show that…

The Local Computation Algorithm (LCA) model is a popular model in the field of sublinear-time algorithms that measures the complexity of an algorithm by the number of probes the algorithm makes in the neighborhood of one node to determine…

We investigate whether commutativity is necessary to represent relativistic locality for localization observables of relativistic quantum systems in Minkowski spacetime. A well known no-go theorem by Halvorson and Clifton shows that…

This paper proves that a wide class of local search algorithms extend as is to the fully dynamic setting with an adaptive adversary, achieving an amortized $\tilde{O}(1)$ number of local-search steps per update. A breakthrough by Moser…

Let $\Lambda \subset \mathbb R^n$ be an algebraic lattice, coming from a projective module over the ring of integers of a number field $K$. Let $\mathcal Z \subset \mathbb R^n$ be the zero locus of a finite collection of polynomials such…

The Johnson-Lindenstrauss Lemma states that there exist linear maps that project a set of points of a vector space into a space of much lower dimension such that the Euclidean distance between these points is approximately preserved. This…

We extend quantum state tomography with minimal cumulative disturbance, first investigated in [arXiv:2406.18370], to arbitrary finite-dimensional pure states. A learner sequentially receives fresh copies of an unknown pure state, chooses a…

We propose a new algorithmic framework, called "partial rejection sampling", to draw samples exactly from a product distribution, conditioned on none of a number of bad events occurring. Our framework builds (perhaps surprising) new…

In the framework of the probabilistic method in combinatorics, we revisit the entropy compression method clarifying the setting in which it can be applied and providing a theorem yielding a general constructive criterion. We finally…

Electromagnetism is the paradigm case of a theory that satisfies relativistic locality. This can be proven by demonstrating that, once the theory's laws are imposed, what is happening within a region fixes what will happen in the…

The basic random $k$-SAT problem is: Given a set of $n$ Boolean variables, and $m$ clauses of size $k$ picked uniformly at random from the set of all such clauses on our variables, is the conjunction of these clauses satisfiable? Here we…

We investigate geometrical properties of the random K-satisfiability problem using the notion of x-satisfiability: a formula is x-satisfiable if there exist two SAT assignments differing in Nx variables. We show the existence of a sharp…

This paper completes a previous work by constructing a class of positive-energy relativistic spatial localization observables in Minkowski spacetime within quantum field theory, using the stress-energy-momentum tensor smeared with suitable…

In this paper we present a modified version of the proof given Jing-Yang-Zhao's paper titled "Local Unitary Equivalence of Quantum States and Simultaneous Orthogonal Equivalence," which established the correspondance between local unitary…

The celebrated Smith-Minkowski-Siegel mass formula expresses the mass of a quadratic lattice (L, Q) as a product of local factors, called the local densities of (L,Q). This mass formula is an essential tool for the classification of…

Consider the Hales-Jewett theorem. The $k$-dimensional version of it tells us that the combinatorial space $\mathcal{U}_{M, \Lambda} = \{ \eta \mid \eta: M \to \Lambda \}$ has, under suitable assumptions, monochromatic $k$-dimensional…

This paper introduces the notion of Constrained Locating Arrays (CLAs), mathematical objects which can be used for fault localization in software testing. CLAs extend ordinary locating arrays to make them applicable to testing of systems…