Quantum Advantage has Few Complexity Implications

We consider the complexity implications of proofs of quantumness and (quantum verifier) oblivious state preparation. We show that both of these objects can coexist with the easiness of nondeterministic computation. That is, we give evidence that proofs of quantumness can exist when P = NP and that (quantum verifier) oblivious state preparation can exist when BQP = QCMA. In particular, we give a classical oracle relative to which (1) PO = NPO (2) BQPO = PSPACEO (3) Proofs of quantumness exist. In particular, there exists a language in IPO ⊆ BQPO which is hard on average against PO/poly. We give a unitary oracle such that (1) BQPO = QCMAO (2) Quantum verifier oblivious state preparation exists. These oracle separations directly imply a number of related consequences. For example, our first result implies that proofs of quantumness cannot be used to construct classical or quantum cryptography with a relativizing proof. Our second result implies that quantum computation/classical communication oblivious transfer cannot be used to construct post-quantum one-way functions with a relativizing proof.