Paper 2024/1639
Efficient Quantum Pseudorandomness from Hamiltonian Phase States
Abstract
Quantum pseudorandomness has found applications in many areas of quantum information, ranging from entanglement theory, to models of scrambling phenomena in chaotic quantum systems, and, more recently, in the foundations of quantum cryptography. Kretschmer (TQC '21) showed that both pseudorandom states and pseudorandom unitaries exist even in a world without classical one-way functions. To this day, however, all known constructions require classical cryptographic building blocks which are themselves synonymous with the existence of one-way functions, and which are also challenging to realize on realistic quantum hardware.
In this work, we seek to make progress on both of these fronts simultaneously---by decoupling quantum pseudorandomness from classical cryptography altogether.
We introduce a quantum hardness assumption called the \emph{Hamiltonian Phase State} (
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint.
- Keywords
- Quantum computingpsuedorandom states
- Contact author(s)
- johnb @ cs columbia edu
- History
- 2024-10-14: approved
- 2024-10-11: received
- See all versions
- Short URL
- https://ia.cr/2024/1639
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1639, author = {John Bostanci and Jonas Haferkamp and Dominik Hangleiter and Alexander Poremba}, title = {Efficient Quantum Pseudorandomness from Hamiltonian Phase States}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/1639}, year = {2024}, url = {https://eprint.iacr.org/2024/1639} }