English
Related papers

Related papers: A Constructive Quantum Lov\'asz Local Lemma for Co…

200 papers

While quantum mechanics allows spooky action at a distance at the level of the wave-function, it also respects locality since there is no instantaneous propagation of real physical effects. We show that this feature can be proved in the…

General Physics · Physics 2022-01-28 Ali Kaya

Looking for a quantum-mechanical implementation of duality, we formulate a relation between coherent states and complex-differentiable structures on classical phase space ${\cal C}$. A necessary and sufficient condition for the existence of…

High Energy Physics - Theory · Physics 2007-05-23 J. M. Isidro

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…

Mathematical Physics · Physics 2026-04-08 Valter Moretti

Quantum processes cannot be reduced, in a nontrivial way, to classical processes without specifying the context in the description of a measurement procedure. This requirement is implied by the Kochen-Specker theorem in the…

Quantum Physics · Physics 2023-02-08 A. Montina , S. Wolf

In this work, we study the Lov\'asz local lemma (LLL) problem in the area of distributed quantum computing, which has been the focus of attention of recent advances in quantum computing [STOC'24, STOC'25, STOC'25]. We prove a lower bound of…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-10-20 Sebastian Brandt , Tim Göttlicher

The Lov\'{a}sz Local Lemma is a central tool in probabilistic combinatorics, providing a sufficient condition under which a finite collection of undesirable events with limited dependencies can be simultaneously avoided with positive…

Combinatorics · Mathematics 2026-04-30 Igal Sason

We consider the task of designing Local Computation Algorithms (LCA) for applications of the Lov\'{a}sz Local Lemma (LLL). LCA is a class of sublinear algorithms proposed by Rubinfeld et al.~\cite{Ronitt} that have received a lot of…

Data Structures and Algorithms · Computer Science 2020-07-08 Dimitris Achlioptas , Themis Gouleakis , Fotis Iliopoulos

We develop a framework for the rigorous analysis of focused stochastic local search algorithms. These are algorithms that search a state space by repeatedly selecting some constraint that is violated in the current state and moving to a…

Discrete Mathematics · Computer Science 2018-09-06 Dimitris Achlioptas , Fotis Iliopoulos , Vladimir Kolmogorov

This paper presents a complete algorithmic study of the decision Boolean Satisfiability Problem under the classical computation and quantum computation theories. The paper depicts deterministic and probabilistic algorithms, propositions of…

Computational Complexity · Computer Science 2016-02-22 Carlos Barrón-Romero

The quantum analogue of a constraint satisfaction problem is a sum of local Hamiltonians - each local Hamiltonian specifies a local constraint whose violation contributes to the energy of the given quantum state. Formalizing the intuitive…

Quantum Physics · Physics 2008-11-25 Dorit Aharonov , Itai Arad , Zeph Landau , Umesh Vazirani

Independent studies by different authors have proposed that classicality may be induced in quantum objects by cosmological constraints presented by an expanding universe of finite extent in space-time. Cosmological effects on a quantum…

General Physics · Physics 2010-11-25 C. L. Herzenberg

We investigate what can be concluded about a quantum system when sequential quantum measurements of its observable -- a prominent example of the so-called quantum stochastic process -- fulfill the Kolmogorov consistency condition and thus…

Quantum Physics · Physics 2024-07-02 Piotr Szańkowski , Łukasz Cywiński

Several arguments demonstrate the incompatibility between Quantum Mechanics and classical Physics. Bell's inequalities and Greenberger-Horne-Zeilinger (GHZ) arguments apply to specific non-classical states. The Kochen-Specker (KS) one,…

Quantum Physics · Physics 2024-11-28 Alejandro Hnilo

This work identifies a necessary condition for any variational quantum approach to reach the exact ground state. Briefly, the norms of the projections of the input and the ground state onto each group module must match, implying that module…

Quantum Physics · Physics 2026-04-16 Yun-Tak Oh , Dongsoo Lee , Jungyoul Park , Kyung Chul Jeong , Panjin Kim

Discrimination of quantum states under local operations and classical communication (LOCC) is an intriguing question in the context of local retrieval of classical information, encoded in the multipartite quantum systems. All the local…

Quantum-mechanical observables for spatial and spacetime localization are considered from a lattice-theoretic perspective. It is shown that when replacing the lattice of all complex orthogonal projections underlying the Born rule by the…

Mathematical Physics · Physics 2026-02-13 Gandalf Lechner , Ivan Romualdo de Oliveira

Quantum steering can be detected via the violation of steering inequalities, which provide sufficient conditions for the steerability of quantum states. Here we discuss the converse problem, namely ensuring that a state is unsteerable, and…

Quantum Physics · Physics 2016-03-21 Joseph Bowles , Flavien Hirsch , Marco Túlio Quintino , Nicolas Brunner

In this article, we revisit the century-old question of the minimal set of observables needed to identify a quantum state: here, we replace the natural coincidences in their spectra by effective ones, induced by an imperfect measurement. We…

Quantum Physics · Physics 2016-07-04 Mark Olchanyi , Eugene Moskovets

A genuine feature of projective quantum measurements is that they inevitably alter the mean energy of the observed system if the measured quantity does not commute with the Hamiltonian. Compared to the classical case, Jacobs proved that…

Statistical Mechanics · Physics 2015-06-10 Kay Brandner , Michael Bauer , Michael T. Schmid , Udo Seifert

We give a fast algorithm for sampling uniform solutions of general constraint satisfaction problems (CSPs) in a local lemma regime. Suppose that the CSP has $n$ variables with domain size at most q, each constraint contains at most k…

Data Structures and Algorithms · Computer Science 2023-03-10 Kun He , Chunyang Wang , Yitong Yin