Related papers: Fine-Grained Complexity via Quantum Natural Proofs

A quasi-representation of a group is a map from the group into a matrix algebra (or similar object) that approximately satisfies the relations needed to be a representation. Work of many people starting with Kazhdan and Voiculescu, and…

Quantum theory has the intriguing feature that is inconsistent with noncontextual hidden variable models, for which the outcome of a measurement does not depend on which other compatible measurements are being performed concurrently. While…

Given a small random sample of $n$-bit strings labeled by an unknown Boolean function, which properties of this function can be tested computationally efficiently? We show an equivalence between properties that are efficiently testable from…

Estimating quantum entropies and divergences is an important problem in quantum physics, information theory, and machine learning. Quantum neural estimators (QNEs), which utilize a hybrid classical-quantum architecture, have recently…

In this paper we show how all the quantum properties of Schroedinger and Pauli particles can be described entirely from within a Clifford algebra taken over the reals. There is no need to appeal to any `wave function'. To describe a quantum…

This paper provides the foundations of a unified cognitive decision-making framework (QulBIT) which is derived from quantum theory. The main advantage of this framework is that it can cater for paradoxical and irrational human decision…

This thesis synthesizes probability and entropic inference with Quantum Mechanics (QM) and quantum measurement [1-6]. It is shown that the standard and quantum relative entropies are tools designed for the purpose of updating probability…

Pusey, Barrett, and Rudolph introduce a new no-go theorem for hidden-variables models of quantum theory. We make precise the class of models targeted and construct equivalent models that evade the theorem. The theorem requires assumptions…

The unremitting pursuit for quantum advantages gives rise to the discovery of a quantum-enhanced randomness processing named quantum Bernoulli factory (QBF). This quantum enhanced process can show its priority over the corresponding…

We introduce a formulation of quantum theory (QT) as a general probabilistic theory but expressed via quasi-expectation operators (QEOs). This formulation provides a direct interpretation of density matrices as quasi-moment matrices. Using…

Quantum algorithm is constructed which verifies the formulas of predicate calculus in time $O(\sqrt N)$ with bounded error probability, where $N$ is the time required for classical algorithms. This algorithm uses the polynomial number of…

We show a relation between quantum learning theory and algorithmic hardness. We use the existence of efficient, local learning algorithms for energy estimation -- such as the classical shadows algorithm -- to prove that finding near-ground…

As a hybrid of artificial intelligence and quantum computing, quantum neural networks (QNNs) have gained significant attention as a promising application on near-term, noisy intermediate-scale quantum (NISQ) devices. Conventional QNNs are…

We introduce a general method for the construction of quasiprobability representations for arbitrary notions of quantum coherence. Our technique yields a nonnegative probability distribution for the decomposition of any classical state.…

Quantum probabilities differ from classical ones in many ways, e.g., by violating the well-known Bell and CHSH inequalities or another simple inequality due to R. Wright. The latter one has recently regained attention because of its…

Quantum Boltzmann machines (QBMs) are machine-learning models for both classical and quantum data. We give an operational definition of QBM learning in terms of the difference in expectation values between the model and target, taking into…

Pseudorandom quantum states (PRSs) and pseudorandom unitaries (PRUs) possess the dual nature of being efficiently constructible while appearing completely random to any efficient quantum algorithm. In this study, we establish fundamental…

It is known that several sub-universal quantum computing models, such as the IQP model, the Boson sampling model, the one-clean qubit model, and the random circuit model, cannot be classically simulated in polynomial time under certain…

Quantum Mechanics (QM) is a very special probabilistic theory, yet we don't know which operational principles make it so. All axiomatization attempts suffer at least one postulate of a mathematical nature. Here I will analyze the…

Selinger gave a superoperator model of a first-order quantum programming language and proved that it is fully definable and hence fully abstract. This paper proposes an extension of the superoperator model to higher-order programs based on…