Related papers: Consequences of APSP, triangle detection, and 3SUM…
We study the design of voting rules in the metric distortion framework. It is known that any deterministic rule suffers distortion of at least $3$, and that randomized rules can achieve distortion strictly less than $3$, often at the cost…
Bennett et al. \cite{BDF+99} identified a set of orthogonal {\em product} states in the $3\otimes 3$ Hilbert space such that reliably distinguishing those states requires non-local quantum operations. While more examples have been found for…
We consider two classes of computations which admit taking linear combinations of execution runs: probabilistic sampling and generalized animation. We argue that the task of program learning should be more tractable for these architectures…
We introduce a contextual quantum system comprising mutually complementary observables organized into two or more collections of pseudocontexts with the same probability sums of outcomes. These pseudocontexts constitute non-orthogonal bases…
We propose a polynomially bounded, in time and space, method to decide whether a given 3-SAT formula is satisfiable or not. The tools we use here are, in fact, very simple. We first decide satisfiability for a particular 3-SAT formula,…
The relationship between the complexity classes P and NP is an unsolved question in the field of theoretical computer science. In this paper, we investigate a descriptor approach based on lattice properties. This paper proposes a new way to…
Recently many simple principles have been proposed that can explain quantum limitations on possible sets of experimental probabilities in nonlocality and contextuality experiments. However, few implications between these principles are…
We introduce the NP-complete problem 3SAT_N and extend Tovey's results to a classification theorem for this problem. This theorem leads us to generalize the concept of truth assignments for SAT to aggressive truth assignments for 3SAT_N. We…
Decision theories offer principled methods for making choices under various types of uncertainty. Algorithms that implement these theories have been successfully applied to a wide range of real-world problems, including materials and drug…
Many seemingly paradoxical effects are known in the predictions for outcomes of measurements made on pre- and post-selected quantum systems. A class of such effects, which we call ``logical pre- and post-selection paradoxes'', bear a…
This paper presents and philosophically assesses three types of results on the observational equivalence of continuous-time measure-theoretic deterministic and indeterministic descriptions. The first results establish observational…
This paper extends prior work on the connections between logics from finite model theory and propositional/algebraic proof systems. We show that if all non-isomorphic graphs in a given graph class can be distinguished in the logic…
An operational definition of contextuality is introduced which generalizes the standard notion in three ways: (1) it applies to arbitrary operational theories rather than just quantum theory, (2) it applies to arbitrary experimental…
The proofs of quantum nonlocality due to GHZ and Hardy are quantitatively different from that of Bell insofar as they rely only on a consideration of whether events are possible or impossible, rather than relying on specific experimental…
We prove 3SUM-hardness (no strongly subquadratic-time algorithm, assuming the 3SUM conjecture) of several problems related to finding Abelian square and additive square factors in a string. In particular, we conclude conditional optimality…
Discontinuous time derivatives are used to model threshold-dependent switching in such diverse applications as dry friction, electronic control, and biological growth. In a continuous flow, a discon- tinuous derivative can generate multiple…
We show that, assuming the (deterministic) Exponential Time Hypothesis, distinguishing between a graph with an induced $k$-clique and a graph in which all k-subgraphs have density at most $1-\epsilon$, requires $n^{\tilde \Omega(log n)}$…
We study the precise computational complexity of deciding satisfiability of first-order quantified formulas over the theory of fixed-size bit-vectors with binary-encoded bit-widths and constants. This problem is known to be in EXPSPACE and…
We investigate the effect of a time-reversal breaking impurity term on both the equilibrium and non-equilibrium critical properties of entanglement entropy (EE) in a three-spin interacting transverse Ising model which can be mapped to a…
The CAP theorem states that a distributed system cannot simultaneously guarantee consistency, availability, and partition tolerance under network partition. Inspired by this result, this paper formulates a CAP-like conjecture for Large…