Pseudorandom states, introduced by Ji, Liu and Song (Crypto'18), are efficiently-computable
quantum states that are computationally indistinguishable from Haar-random states. One …

In the classical world, the existence of commitments is equivalent to the existence of one-
way functions. In the quantum setting, on the other hand, commitments are not known to …

We construct a classical oracle relative to which P= NP yet single-copy secure
pseudorandom quantum states exist. In the language of Impagliazzo's five worlds, this is a …

In the classical model of computation, it is well established that one-way functions (OWF) are
minimal for computational cryptography: They are essential for almost any cryptographic …

Quantum cryptography is the field of cryptography that explores the quantum properties of
matter. Generally, it aims to develop primitives beyond the reach of classical cryptography …

One-way functions are central to classical cryptography. They are necessary for the
existence of non-trivial classical cryptosystems, and also sufficient to realize meaningful …

The Unitary Synthesis Problem (Aaronson-Kuperberg 2007) asks whether any n-qubit
unitary U can be implemented by an efficient quantum algorithm A augmented with an …

We study the complexity of learning quantum states in various models with respect to the
stabilizer formalism and obtain the following results: We prove that Ω (n) T-gates are …

We prove that quantum-hard one-way functions imply simulation-secure quantum oblivious
transfer (QOT), which is known to suffice for secure computation of arbitrary quantum …

We propose a unifying framework that yields an array of cryptographic primitives with
certified deletion. These primitives enable a party in possession of a quantum ciphertext to …