Researchers have demonstrated that EFI pairs (efficiently preparable quantum states, statistically far yet computationally indistinguishable) do not necessarily imply the existence of one-way puzzles (classical problems easy to sample but hard to solve). Both concepts are leading candidates for establishing the minimal assumption in quantum cryptography. While it was known that one-way puzzles imply EFI pairs, the converse relationship remained an open question until now.