A Meta-Complexity Characterization of Minimal Quantum Cryptography
Abstract
We give a meta-complexity characterization of EFI pairs, which are considered the "minimal" primitive in quantum cryptography (and are equivalent to quantum commitments). More precisely, we show that the existence of EFI pairs is equivalent to the following: there exists a non-uniformly samplable distribution over pure states such that the problem of estimating a certain Kolmogorov-like complexity measure is hard given a single copy. A key technical step in our proof, which may be of independent interest, is to show that the existence of EFI pairs is equivalent to the existence of non-uniform single-copy secure pseudorandom state generators (nu 1-PRS). As a corollary, we get an alternative, arguably simpler, construction of a universal EFI pair.
Cite
@article{arxiv.2510.07859,
title = {A Meta-Complexity Characterization of Minimal Quantum Cryptography},
author = {Bruno Cavalar and Boyang Chen and Andrea Coladangelo and Matthew Gray and Zihan Hu and Zhengfeng Ji and Xingjian Li},
journal= {arXiv preprint arXiv:2510.07859},
year = {2025}
}
Comments
52 pages