Related papers: Fine-Grained Complexity via Quantum Natural Proofs
We present a number of results related to quantum algorithms with small error probability and quantum algorithms that are zero-error. First, we give a tight analysis of the trade-offs between the number of queries of quantum search…
The celebrating theorem of A. Fine implies that the CHSH inequality is violated if and only if the joint probability distribution for the quadruples of observables involved the EPR-Bohm-Bell experiment does not exist, i.e., it is impossible…
In this paper, we try to give a new approach to the quantum mechanics(QM) on the framework of quantum field theory(QFT). Firstly, we make a detail study on the (non-relativistic) Schr\"odinger field theory, obtaining the Schr\"odinger…
In this paper, we show an interesting connection between a quantum sampling technique and quantum uncertainty. Namely, we use the quantum sampling technique, introduced by Bouman and Fehr, to derive a novel entropic uncertainty relation…
In 1935 Einstein, Podolsky and Rosen (EPR) pointed out that Quantum Mechanics apparently implied some mysterious, instantaneous action at a distance. This paradox is supposed to be related to the probabilistic nature of the theory, but…
We present a purely wave model (based on classical random field) which reproduces quantum probabilities (given by the fundamental law of quantum mechanics, Born's rule) including probabilities for joint detection of a pair of quantum…
We initiate the systematic study of QMA algorithms in the setting of property testing, to which we refer as QMA proofs of proximity (QMAPs). These are quantum query algorithms that receive explicit access to a sublinear-size untrusted proof…
The Strong Exponential Time Hypothesis (SETH) is a standard assumption in (fine-grained) parameterized complexity and many tight lower bounds are based on it. We consider a number of reasonable weakenings of the SETH, with sources from (i)…
Bayesian inference is a widely used technique for real-time characterization of quantum systems. It excels in experimental characterization in the low data regime, and when the measurements have degrees of freedom. A decisive factor for its…
The local Hamiltonian (LH) problem is the canonical $\mathsf{QMA}$-complete problem introduced by Kitaev. In this paper, we show its hardness in a very strong sense: we show that the 3-local Hamiltonian problem on $n$ qubits cannot be…
Quantum machine learning models based on parametrized quantum circuits, also called quantum neural networks (QNNs), are considered to be among the most promising candidates for applications on near-term quantum devices. Here we explore the…
We argue that the complex numbers are an irreducible object of quantum probability. This can be seen in the measurements of geometric phases that have no classical probabilistic analogue. Having complex phases as primitive ingredient…
This PHD thesis is concerned with uncertainty relations in quantum probability theory, state estimation in quantum stochastics, and natural bundles in differential geometry. After some comments on the nature and necessity of decoherence in…
Gaussian boson sampling (GBS) is a promising protocol for demonstrating quantum computational advantage. One of the key steps for proving classical hardness of GBS is the so-called ``hiding conjecture'', which asserts that one can ``hide''…
In this paper, we continue the line of work initiated by Boneh and Zhandry at CRYPTO 2013 and EUROCRYPT 2013 in which they formally define the notion of unforgeability against quantum adversaries specifically, for classical message…
Mayers, Lo and Chau argued that all quantum bit commitment protocols are insecure, because there is no way to prevent an Einstein-Podolsky-Rosen (EPR) cheating attack. However, Yuen presented some protocols which challenged the previous…
In the near future, there will likely be special-purpose quantum computers with 40-50 high-quality qubits. This paper lays general theoretical foundations for how to use such devices to demonstrate "quantum supremacy": that is, a clear…
We present a new template for building oblivious transfer from quantum information that we call the "fixed basis" framework. Our framework departs from prior work (eg., Crepeau and Kilian, FOCS '88) by fixing the correct choice of…
The analysis of quantum algorithms which query random, invertible permutations has been a long-standing challenge in cryptography. Many techniques which apply to random oracles fail, or are not known to generalize to this setting. As a…
Quantum theory, despite its remarkable success, struggles to represent certain experimental data, particularly those involving integer functions and deterministic relations between quantum jumps. We address this limitation by proposing a…