On Basing One-way Permutations on NP-hard Problems under Quantum Reductions

TL;DR

This paper explores the potential of quantum reductions to base cryptographic primitives on NP-hard problems, showing that certain quantum reductions imply unlikely complexity class containments.

Contribution

It formalizes quantum reductions and demonstrates their power, revealing that specific quantum reductions from NP-complete problems to one-way permutations imply coNP is contained in QIP(2).

Findings

Quantum reductions can demonstrate separations between complexity classes.

Certain quantum reductions from NP-hard problems to cryptographic primitives imply coNP ⊆ QIP(2).

The work initiates the formal study of quantum analogues of classical reductions.

Abstract

A fundamental pursuit in complexity theory concerns reducing worst-case problems to average-case problems. There exist complexity classes such as PSPACE that admit worst-case to average-case reductions. However, for many other classes such as NP, the evidence so far is typically negative, in the sense that the existence of such reductions would cause collapses of the polynomial hierarchy(PH). Basing cryptographic primitives, e.g., the average-case hardness of inverting one-way permutations, on NP-completeness is a particularly intriguing instance. As there is evidence showing that classical reductions from NP-hard problems to breaking these primitives result in PH collapses, it seems unlikely to base cryptographic primitives on NP-hard problems. Nevertheless, these results do not rule out the possibilities of the existence of quantum reductions. In this work, we initiate a study of the quantum analogues of these questions. Aside from formalizing basic notions of quantum reductions and demonstrating powers of quantum reductions by examples of separations, our main result shows that if NP-complete problems reduce to inverting one-way permutations using certain types of quantum reductions, then coNP $\subseteq$ QIP(2).