Quantum-Computable One-Way Functions without One-Way Functions

Abstract

We construct a classical oracle relative to which $\mathsf{P}=\mathsf{NP}$ but quantum-computable quantum-secure trapdoor one-way functions exist. This is a substantial strengthening of the result of Kretschmer, Qian, Sinha, and Tal (STOC 2023), which only achieved single-copy pseudorandom quantum states relative to an oracle that collapses $\mathsf{NP}$ to $\mathsf{P}$. For example, our result implies multi-copy pseudorandom states and pseudorandom unitaries, but also classical-communication public-key encryption, signatures, and oblivious transfer schemes relative to an oracle on which $\mathsf{P}=\mathsf{NP}$. Hence, in our new relativized world, classical computers live in "Algorithmica" whereas quantum computers live in "Cryptomania," using the language of Impagliazzo's worlds. Our proof relies on a new distributional block-insensitivity lemma for $\mathsf{A}{\mathsf{C}}^0$ circuits, wherein a single block is resampled from an arbitrary distribution.

33 pages, 1 figure

References in corpus (14)

• Pseudorandom States, Non-Cloning Theorems and Quantum Money
• Quantum commitments and signatures without one-way functions
• Limitations of Quantum Advice and One-Way Communication
• Quantum Cryptography in Algorithmica
• Separations in query complexity using cheat sheets
• Quantum Pseudorandomness and Classical Complexity
• Efficient unitary designs and pseudorandom unitaries from permutations
• Efficient Unitary T-designs from Random Sums
• Quantum-Computable One-Way Functions without One-Way Functions
• Quantum trapdoor functions from classical one-way functions
• Simple constructions of linear-depth t-designs and pseudorandom unitaries
• How to Construct Random Unitaries
• Signatures From Pseudorandom States via $\perp$-PRFs
• Founding Quantum Cryptography on Quantum Advantage, or, Towards Cryptography from $\#P$-Hardness

Cited by in corpus (1)

• Quantum-Computable One-Way Functions without One-Way Functions