Related papers: A Constructive Quantum Lov\'asz Local Lemma for Co…
We formulate the conditions under which the dynamics of a continuously measured quantum system becomes indistinguishable from that of the corresponding classical system. In particular, we demonstrate that even in a classically chaotic…
A system of linear constraints can be unsatisfiable and yet admit a solution in the form of quantum observables whose correlated outcomes satisfy the constraints. Recently, it has been claimed that such a satisfiability gap can be…
We define a general formulation of quantum PCPs, which captures adaptivity and multiple unentangled provers, and give a detailed construction of the quantum reduction to a local Hamiltonian with a constant promise gap. The reduction turns…
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…
The Local Hamiltonian problem (finding the ground state energy of a quantum system) is known to be QMA-complete. The Local Consistency problem (deciding whether descriptions of small pieces of a quantum system are consistent) is also known…
We identify a formal connection between physical problems related to the detection of separable (unentangled) quantum states and complexity classes in theoretical computer science. In particular, we show that to nearly every quantum…
Although the quantization of relativistic systems in a proper-time framework gives new insights concerning the understanding of the so-called localization problem, classical observers cannot be treated as quantum comoving frames and real…
The Lov\'asz Local Lemma is a seminal result in probabilistic combinatorics. It gives a sufficient condition on a probability space and a collection of events for the existence of an outcome that simultaneously avoids all of those events.…
An experimental success criterion for continuous-variable quantum teleportation and memories is to surpass a limit of the average fidelity achieved by the classical measure-and-prepare schemes with respect to a Gaussian distributed set of…
Quantum cognition often explains order effects, contextuality, and violations of the law of total probability by replacing classical probability with quantum probability on a fixed event structure. This paper proposes a different…
The Lov\'{a}sz Local Lemma is a very powerful tool in probabilistic combinatorics, that is often used to prove existence of combinatorial objects satisfying certain constraints. Moser and Tardos have shown that the LLL gives more than just…
We give a conceptually simple necessary condition such that a separable quantum operation can be implemented by local operations on subsystems and classical communication between parties (LOCC), a condition which follows from a novel…
A central challenge in quantum metrology is identifying optimal measurements that saturate the quantum Cramer-Rao bound under realistic constraints, e.g., local measurements. We show that symmetries of the probe state provide a general…
Quantum algorithms for solving the Quantum Linear System (QLS) problem are among the most investigated quantum algorithms of recent times, with potential applications including the solution of computationally intractable differential…
We discuss the locality problem in relativistic and nonrelativistic quantum theory. We show that there exists a formulation of quantum theory that, on one hand, preserves the mathematical apparatus of the standard quantum mechanics and, on…
Recent advances in our understanding of foundations of quantum mechanics have shown that information can be made objective through quantum states. Such objectification processes, predicted e.g. in a variety of quantum open systems, must…
The utility of satisfiability (SAT) as an application focused hard computational problem is well established. We explore the potential of quantum annealing to enhance classical SAT solving, especially where sampling from the space of all…
We give a Markov chain based perfect sampler for uniform sampling solutions of constraint satisfaction problems (CSP). Under some mild Lov\'asz local lemma conditions where each constraint of the CSP has a small number of forbidden local…
The status of locality in quantum mechanics is analyzed from a nonstandard point of view. It is assumed that quantum states are relative, they depend on and are defined with respect to some bigger physical system which contains the former…
To solve the quantum-mechanical problem the procedure of mapping onto linear space $W$ of generators of the (sub)group violated by given classical trajectory is formulated. The formalism is illustrated by the plane H-atom model. The problem…