Related papers: A Quantum Lovasz Local Lemma
We introduce a notion of Lorentzian metric space which drops the boundedness condition from our previous work and argue that the properties defining our spaces are minimal. In fact, they are defined by three conditions given by (a) the…
This work, for the first time, introduces two constant factor approximation algorithms with linear query complexity for non-monotone submodular maximization over a ground set of size $n$ subject to a knapsack constraint, $\mathsf{DLA}$ and…
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…
We show that a quantum state may be represented as the sum of a joint probability and a complex quantum modification term. The joint probability and the modification term can both be observed in successive projective measurements. The…
Complex bases, along with direct-sums defined by rings of imaginary quadratic integers, induce algebraic lattices. In this work, we study such lattices and their reduction algorithms. Firstly, when the lattice is spanned over a two…
We study the power of local test for bipartite quantum states. Our central result is that, for properties of bipartite pure states, unitary invariance on one part implies an optimal (over all global testers) local tester acting only on the…
In this paper, we study the probabilistic local well-posedness of the cubic Schr\"odinger equation (cubic NLS): \[ (i\partial_{t} + \Delta) u = \pm |u|^{2} u \text{ on } [0,T) \times \mathbb{R}^{d}, \] with initial data being a Wiener…
Quantum Mechanics (QM) predicts the correlation between measurements performed in remote regions of a spatially spread entangled state to be higher than allowed by the intuitive concepts of Locality and Realism (LR). This high correlation…
Sampling a random permutation with restricted positions, or equivalently approximating the permanent of a 0-1 matrix, is a fundamental problem in computer science, with several notable results achieved over the years. However, existing…
We perform numerical tests on quantum nonlocality of two-level quantum systems (qubits) observed by a uniformly moving observer. Under a suitable momentum setting, the quantum nonlocality of two-qubit nonmaximally entangled states could be…
Lattice reduction is a NP-hard problem well known in computer science and cryptography. The Lenstra-Lenstra-Lovasz (LLL) algorithm based on the calculation of orthogonal Gram-Schmidt (GS) bases is efficient and gives a good solution in…
Promotion of quantum theory from a theory of measurement to a theory of reality requires an unambiguous specification of the ensemble of realizable states (and each state's probability of realization). Although not yet achieved within the…
We give a general Lagrange multiplier rule for mathematical programming problems in a Hausdorff locally convex space. We consider infinitely many inequality and equality constraints. Our results gives in particular a generalisation of the…
The existence of local thermal equilibrium (LTE) states for quantum field theory in the sense of Buchholz, Ojima and Roos is discussed in a model-independent setting. It is shown that for spaces of finitely many independent thermal…
The conventional view, that Einstein was wrong to believe that quantum physics is local and deterministic, is challenged. A parametrised model, Q, for the state vector evolution of spin 1/2 particles during measurement is developed. Q draws…
The quantum reality problem is that of finding a mathematically precise definition of a sample space of configurations of beables, events, histories, paths, or other mathematical objects, and a corresponding probability distribution, for…
We give new combinatorial proofs of known almost-periodicity results for sumsets of sets with small doubling in the spirit of Croot and Sisask, whose almost-periodicity lemma has had far-reaching implications in additive combinatorics. We…
Gleason-type theorems for quantum theory allow one to recover the quantum state space by assuming that (i) states consistently assign probabilities to measurement outcomes and that (ii) there is a unique state for every such assignment. We…
Instead of formulating the states of a Quantum Field Theory (QFT) as density matrices over a single large Hilbert space, it has been proposed by Kijowski [Kijowski, 1977] to construct them as consistent families of partial density matrices,…
We prove tight lower bounds for the following variant of the counting problem considered by Aaronson, Kothari, Kretschmer, and Thaler (2020). The task is to distinguish whether an input set $x\subseteq [n]$ has size either $k$ or…