Revocable encryption, programs, and more: The case of multi-copy security

P Ananth, S Mutreja, A Poremba - arxiv preprint arxiv:2410.13163, 2024 - arxiv.org
Fundamental principles of quantum mechanics have inspired many new research directions,
particularly in quantum cryptography. One such principle is quantum no-cloning which has …

Pseudorandomness in the (inverseless) haar random oracle model

P Ananth, J Bostanci, A Gulati, YT Lin - arxiv preprint arxiv:2410.19320, 2024 - arxiv.org
We study the (in) feasibility of quantum pseudorandom notions in a quantum analog of the
random oracle model, where all the parties, including the adversary, have oracle access to …

Random Circuits in the Black Hole Interior

JM Magan, M Sasieta, B Swingle - arxiv preprint arxiv:2412.08693, 2024 - arxiv.org
In this paper, we present a quantitative holographic relation between a microscopic measure
of randomness and the geometric length of the wormhole in the black hole interior. To this …

Random regular graph states are complex at almost any depth

S Ghosh, D Hangleiter, J Helsen - arxiv preprint arxiv:2412.07058, 2024 - arxiv.org
Graph states are fundamental objects in the theory of quantum information due to their
simple classical description and rich entanglement structure. They are also intimately related …

Pseudorandom quantum authentication

T Haug, N Bansal, WK Mok, DE Koh… - arxiv preprint arxiv …, 2025 - arxiv.org
We introduce the pseudorandom quantum authentication scheme (PQAS), an efficient
method for encrypting quantum states that relies solely on the existence of pseudorandom …

Pseudorandom Function-like States from Common Haar Unitary

M Hhan, S Yamada - arxiv preprint arxiv:2411.03201, 2024 - arxiv.org
Recent active studies have demonstrated that cryptography without one-way functions
(OWFs) could be possible in the quantum world. Many fundamental primitives that are …

[PDF][PDF] 1 The unitary synthesis problem

G Rosenthal - 2024 - cs.toronto.edu
Aaronson and Kuperberg [AK07] asked whether questions about the complexity of quantum
state transformations reduce to (generally better understood) questions about the complexity …

The Learning Stabilizers with Noise problem

A Poremba, Y Quek, P Shor - arxiv preprint arxiv:2410.18953, 2024 - arxiv.org
Random classical codes have good error correcting properties, and yet they are notoriously
hard to decode in practice. Despite many decades of extensive study, the fastest known …