Related papers: Fine-Grained Complexity via Quantum Natural Proofs
Coarse-grained descriptions can be used to account for physical processes in which information is lost or not entirely accessible. In this paper, we start by proposing a connection between effective, coarse-grained descriptions of quantum…
We introduce an experimental test for ruling out classical explanations for the statistics obtained when measuring arbitrary observables at arbitrary times using individual detectors. This test requires some trust in the measurements,…
Overcoming the influence of noise and imperfections in quantum devices is one of the main challenges for viable quantum applications. In this article, we present different protocols, which we denote as "superposed quantum error mitigation",…
In this work, we present a general theoretical framework for the study of autonomously corrected quantum devices. First, we identify a necessary and sufficient revised version of the Knill-Laflamme conditions for the existence of an…
Noise is the defining feature of the NISQ era, but it remains unclear if noisy quantum devices are capable of quantum speedups. Quantum supremacy experiments have been a major step forward, but gaps remain between the theory behind these…
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify the quantum advantage of an untrusted prover. That is, a quantum prover can correctly answer the verifier's challenges and…
Quantum machine learning promises great speedups over classical algorithms, but it often requires repeated computations to achieve a desired level of accuracy for its point estimates. Bayesian learning focuses more on sampling from…
We present models in which the indeterministic feature of Quantum Mechanics is represented in the form of definite physical mechanisms. Our way is completely different from so-called hidden parameter models, namely, we start from a certain…
General relativity is a deterministic theory with non-fixed causal structure. Quantum theory is a probabilistic theory with fixed causal structure. In this paper we build a framework for probabilistic theories with non-fixed causal…
Many quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given by a black box. As in the classical version of decision trees, different kinds of quantum query algorithms are possible: exact,…
In this work, we show how to construct indistinguishability obfuscation from subexponential hardness of four well-founded assumptions. We prove: Let $\tau \in (0,\infty), \delta \in (0,1), \epsilon \in (0,1)$ be arbitrary constants. Assume…
Complementarity is a phenomenon explaining several core features of quantum theory, such as the well-known uncertainty principle. Roughly speaking, two objects are said to be complementary if being certain about one of them necessarily…
Standard quantum mechanics is an idealisation based on infinite-precision objects: point states, exact probabilities, and sharp measurements. Yet every real experiment has finite resolution, and for macroscopic systems we never have access…
Modern precision experiments often probe unknown classical fields with bosonic sensors in quantum-noise-limited regimes where vacuum fluctuations limit conventional readout. We introduce Quantum Signal Learning (QSL), a sensing framework…
Quantum query complexity has several nice properties with respect to composition. First, bounded-error quantum query algorithms can be composed without incurring log factors through error reduction (exactness). Second, through careful…
We describe an explicitly non-contextual statistical model of hidden variables for the qutrit, which fully reproduces the predictions of quantum mechanics and, thus, bypasses the constraints imposed by the Kochen-Specker theorem and its…
Quantum key distribution, first proposed by Bennett and Brassard, provides a possible key distribution scheme whose security depends only on the quantum laws of physics. So far the protocol has been proved secure even under channel noise…
Quantum mechanics emerged as the result of a successful resolution of stringent empirical and profound conceptual conflicts within the development of atomic physics at the beginning of the last century. At first glance, it seems to be…
Bayesian learning is ubiquitous for implementing classification and regression tasks, however, it is accompanied by computationally intractable limitations when the feature spaces become extremely large. Aiming to solve this problem, we…
Building on ideas of Gurevich and Shelah for the G\"odel Class, we present a new probabilistic proof of the finite model property for the Guarded Fragment of First-Order Logic. Our proof is conceptually simple and yields the optimal…