A Number Theoretic Interpolation Between Quantum and Classical Complexity Classes
نویسنده
چکیده
We reveal a natural algebraic problem whose complexity appears to interpolate between the well-known complexity classes BQP and NP: ⋆ Decide whether a univariate polynomial with exactly m monomial terms has a p-adic rational root. In particular, we show that while (⋆) is doable in quantum randomized polynomial time when m=2 (and no classical randomized polynomial time algorithm is known), (⋆) is nearly NP-hard for general m: Under a plausible hypothesis involving primes in arithmetic progression (implied by the Generalized Riemann Hypothesis for certain cyclotomic fields), a randomized polynomial time algorithm for (⋆) would imply the widely disbelieved inclusion NP⊆BPP. This type of quantum/classical interpolation phenomenon appears to new.
منابع مشابه
Interpolating Between Quantum and Classical Complexity Classes
We reveal a natural algebraic problem whose complexity appears to interpolate between the well-known complexity classes BQP and NP: ⋆ Decide whether a univariate polynomial with exactly m monomial terms has a p-adic rational root. In particular, we show that while (⋆) is doable in quantum randomized polynomial time when m=2 (and no classical randomized polynomial time algorithm is known), (⋆) i...
متن کاملSome Remarks about Semiclassical Trace Invariants and Quantum Normal Forms
In this paper we explore the connection between semi-classical and quantum Birkhoff canonical forms (BCF) for Schrödinger operators. In particular we give a ”non-symbolic” operator theoretic derivation of the quantum Birkhoff canonical form and provide an explicit recipe for expressing the quantum BCF in terms of the semi-classical BCF.
متن کاملEntropy, Convex Optimization, and Competitive Quantum Interactions
A refereed game can be modelled as an exchange of messages between two competing players and a referee, after which the referee chooses a winner. In a quantum refereed game the players and referee may perform quantum computations and exchange quantum messages. In this paper we examine the problem of deciding, given a fixed referee, which of the two players has a winning strategy. We give a dete...
متن کاملOn the implausibility of classical client blind quantum computing
Suppose a large scale quantum computer becomes available over the Internet. Could we delegate universal quantum computations to this server, using only classical communication between client and server, in a way that is information-theoretically blind (i.e., the server learns nothing about the input apart from its size, with no cryptographic assumptions required)? In this paper we give strong i...
متن کاملBit-oriented quantum public-key encryption
We propose a bit-oriented quantum public-key scheme which uses Boolean function as private-key and randomly changed pairs of quantum state and classical string as public-keys. Contrast to the typical classical public-key scheme, one private-key in our scheme corresponds to an exponential number of public-keys. The goal of our scheme is to achieve information-theoretic security, and the security...
متن کامل