Related papers: Another Quantum Lov\'{a}sz Local Lemma
For input $x$, let $F(x)$ denote the set of outputs that are the "legal" answers for a computational problem $F$. Suppose $x$ and members of $F(x)$ are so large that there is not time to read them in their entirety. We propose a model of…
A new approach to the model-independent description of quantum field theories will be introduced in the present work. The main feature of this new approach is to incorporate in a local sense the principle of general covariance of general…
We study the localization properties of bipartite channels, whose action on a subsystem yields a unitary channel. In particular we show that, under such channel, the subsystem must evolve independent of its environment. This point of view…
It is argued that while quantum mechanics contains nonlocal or entangled states, the instantaneous or nonlocal influences sometimes thought to be present due to violations of Bell inequalities in fact arise from mistaken attempts to apply…
A natural scheme is established for the approximation of quantum Levy processes on locally compact quantum groups by quantum random walks. We work in the somewhat broader context of discrete approximations of completely positive quantum…
Here it is shown that the simplest description of Bell's experiment according to the canon of von Neumann's theory of measurement explicitly assumes the (Quantum Mechanics-language equivalent of the classical) condition of Locality. This…
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…
The notions of events and their localisation fundamentally differ between quantum theory and general relativity, reconciling them becomes even more important and challenging in the context of quantum gravity where a classical spacetime…
Is quantum mechanics (QM) local or nonlocal? Different formulations/interpretations (FI) of QM, with or without hidden variables, suggest different answers. Different FI's can be viewed as different algorithms, which leads us to propose an…
We consider how to define a natural probability distribution over worlds within a simple class of deterministic many-worlds theories. This can help us understand the typical properties of worlds within such states, and hence explain the…
The framework of generalized probabilistic theories is a powerful tool for studying the foundations of quantum physics. It provides the basis for a variety of recent findings that significantly improve our understanding of the rich physical…
Building on the concept of local lexing the concept of parameterized local lexing is introduced.
The Generalized Quantum Stein's Lemma is a theorem in quantum hypothesis testing that provides an operational meaning to the relative entropy within the context of quantum resource theories. Its original proof was found to have a gap, which…
Quantum mechanics predicts correlation between spacelike separated events which is widely argued to violate the principle of Local Causality. By contrast, here we shall show that the Schr\"odinger equation with Born's statistical…
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,…
Driven by the interest of reasoning about probabilistic programming languages, we set out to study a notion of unicity of normal forms for them. To provide a tractable proof method for it, we define a property of distribution confluence…
Several aspects of the manifestation of the causality principle in LQP (local quantum physics) are reviewed or presented. Particular emphasis is given to those properties which are typical for LQP in the sense that they do go beyond the…
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…
Recently, Brandt, Maus and Uitto [PODC'19] showed that, in a restricted setting, the dependency of the complexity of the distributed Lov\'asz Local Lemma (LLL) on the chosen LLL criterion exhibits a sharp threshold phenomenon: They proved…
The Lovasz Local Lemma due to Erdos and Lovasz is a powerful tool in proving the existence of rare events. We present an extension of this lemma, which works well when the event to be shown to exist is a conjunction of individual events,…