English
Related papers

Related papers: A Quantum Lovasz Local Lemma

200 papers

Recently, several claims have been made that certain fundamental problems of distributed computing, including Leader Election and Distributed Consensus, begin to admit feasible and efficient solutions when the model of distributed…

Quantum Physics · Physics 2009-03-09 Cyril Gavoille , Adrian Kosowski , Marcin Markiewicz

We prove the following surprising result: given any quantum state rho on n qubits, there exists a local Hamiltonian H on poly(n) qubits (e.g., a sum of two-qubit interactions), such that any ground state of H can be used to simulate rho on…

Quantum Physics · Physics 2013-10-24 Scott Aaronson , Andrew Drucker

Every quantum state can be represented as a probability distribution over the outcomes of an informationally complete measurement. But not all probability distributions correspond to quantum states. Quantum state space may thus be thought…

Quantum Physics · Physics 2011-02-14 D. M. Appleby , Asa Ericsson , Christopher A. Fuchs

Localized states in relativistic quantum field theories are usually considered as problematic, because of their seemingly strange (non covariant) behavior under Lorentz transformations, and because they can spread faster than light. We…

High Energy Physics - Theory · Physics 2018-01-26 Matej Pavšič

We establish that for q>=1, the class of convex combinations of q translates of a smooth probability density has local doubling dimension proportional to q. The key difficulty in the proof is to control the local geometric structure of…

Statistics Theory · Mathematics 2015-02-04 Elisabeth Gassiat , Ramon Van Handel

We show the existence of regular combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, t-designs, and t-wise…

Combinatorics · Mathematics 2019-09-16 Greg Kuperberg , Shachar Lovett , Ron Peled

The Johnson-Lindenstrauss Lemma allows for the projection of $n$ points in $p-$dimensional Euclidean space onto a $k-$dimensional Euclidean space, with $k \ge \frac{24\ln \emph{n}}{3\epsilon^2-2\epsilon^3}$, so that the pairwise distances…

Machine Learning · Statistics 2010-05-11 Javier Rojo , Tuan Nguyen

The random $k$-XORSAT problem is a random constraint satisfaction problem of $n$ Boolean variables and $m=rn$ clauses, which a random instance can be expressed as a $G\mathbb{F}(2)$ linear system of the form $Ax=b$, where $A$ is a random $m…

Computational Complexity · Computer Science 2024-09-10 Kingsley Yung

We give a generalisation of the Lenstra-Lenstra-Lov\'asz (LLL) lattice-reduction algorithm that is valid for an arbitrary (split, semisimple) reductive group $G$. This can be regarded as `lattice reduction with symmetries'. We make this…

Number Theory · Mathematics 2025-02-03 Beth Romano , Jack A. Thorne

Quantum measurement plays a crucial role in quantum metrology. Due to the limitations of experimental capabilities, collectively measuring multiple copies of probing systems can present significant challenges. Therefore, the concept of…

Quantum Physics · Physics 2025-02-24 Jia-Xuan Liu , Jing Yang , Hai-Long Shi , Sixia Yu

We consider random systems of equations x_1 + ... + x_k = a; 0 <= a <= 2 which are interpreted as equations modulo 3: We show for k >= 15 that the satisfiability threshold of such systems occurs where the 2-core has density 1: We show a…

Discrete Mathematics · Computer Science 2011-12-12 Andreas Goerdt , Lutz Falke

For a multivariate linear model, Wilk's likelihood ratio test (LRT) constitutes one of the cornerstone tools. However, the computation of its quantiles under the null or the alternative requires complex analytic approximations and more…

Methodology · Statistics 2018-01-23 Z. Bai , D. Jiang , J. Yao , S. Zheng

We study the local Lipschitz one subsets of a finite dimensional space, that is, sets for which there exists a continuous function whose local Lipschitz derivative is the characteristic function of said set. We give a characterization of a…

Functional Analysis · Mathematics 2026-04-22 Ziemowit M. Wójcicki

We consider the popular and classical method of alternating projections for finding a point in the intersection of two closed sets. By situating the algorithm in a metric space, equipped only with well-behaved geodesics and angles (in the…

Optimization and Control · Mathematics 2022-06-10 Adrian S. Lewis , Genaro López-Acedo , Adriana Nicolae

State representations summarize our knowledge about a system. When unobservable quantities are introduced the state representation is typically no longer unique. However, this non-uniqueness does not affect subsequent inferences based on…

Quantum Physics · Physics 2009-11-10 Kae Nemoto , Samuel L. Braunstein

Recent works have proposed various explanations for the ability of modern large language models (LLMs) to perform in-context prediction. We propose an alternative conceptual viewpoint from an information-geometric and statistical…

Information Theory · Computer Science 2026-02-23 Sreejith Sreekumar , Nir Weinberger

As it is known, Gleason's theorem is not applicable for a two-dimensional Hilbert space since in this situation Gleason's axioms are not strong enough to imply Born's rule thus leaving room for a dispersion-free probability measure i.e.,…

Quantum Physics · Physics 2018-12-06 Arkady Bolotin

We show that all $n$-qubit entangled states, with the exception of tensor products of single-qubit and bipartite maximally-entangled states, admit Hardy-type proofs of non-locality without inequalities or probabilities. More precisely, we…

Quantum Physics · Physics 2017-02-22 Samson Abramsky , Carmen M. Constantin , Shenggang Ying

In [8] probabilistic methods, in particular a variant of the Weak Law of Large Numbers related to the Bernoulli distribution, have been used to show that for every infinite compact spaces K and L there exists a sequence $(\mu_n)$ of…

Functional Analysis · Mathematics 2025-12-02 Jerzy Kakol , Wiesław Śliwa

In this paper we introduce a new approach for approximately counting in bounded degree systems with higher-order constraints. Our main result is an algorithm to approximately count the number of solutions to a CNF formula $\Phi$ when the…

Data Structures and Algorithms · Computer Science 2017-03-17 Ankur Moitra