aiqbench analysis
This paper establishes the first uniform meta-complexity characterization of EFI pairs by proving their equivalence to expanding single-copy pseudorandom state generators without non-uniformity assumptions. The result solidifies a fundamental quantum cryptographic primitive, drawing a direct parallel to classical equivalences between one-way functions and pseudorandom generators. This advancement is critical for refining the minimal theoretical foundations required for secure quantum cryptography protocols.
$\mathsf{EFI}\Leftrightarrow\mathsf{1PRS}$
arXiv:2610.18799v1 Announce Type: new Abstract: A series of recent works has established EFI pairs as the "minimal" assumption for quantum cryptography. Recently, Cavalar et al. [CCC+26] showed that EFI pairs are equivalent to non-uniform expanding single-copy pseudorandom state generators (1PRS), and obtained a non-uniform meta-complexity characterization of EFI pairs. We remove the non-uniformity in their construction and prove that EFI pairs are equivalent to expanding 1PRS. As a corollary, we obtain the first uniform meta-complexity characterization of EFI pairs. Together with the equivalence of statistically verifiable one-way state generators and commitments proved by Batra and Jain [BJ24], this gives a quantum analogue of the classical equivalence between one-way functions, commitments, and pseudorandom generators.
Abstract:A series of recent works has established EFI pairs as the "minimal" assumption for quantum cryptography. Recently, Cavalar et al. [CCC+26] showed that EFI pairs are equivalent to non-uniform expanding single-copy pseudorandom state generators (1PRS), and obtained a non-uniform meta-complexity characterization of EFI pairs. We remove the non-uniformity in their construction and prove that EFI pairs are equivalent to expanding 1PRS. As a corollary, we obtain the first uniform meta-complexity characterization of EFI pairs. Together with the equivalence of statistically verifiable one-way state generators and commitments proved by Batra and Jain [BJ24], this gives a quantum analogue of the classical equivalence between one-way functions, commitments, and pseudorandom generators.
Quantum Physics (quant-ph); Cryptography and Security (cs.CR)
arXiv:2610.18799 [quant-ph]
(or arXiv:2610.18799v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2610.18799 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 206 words
Related coverage
Promises should be taken seriously: On relativization with promise problems
arXiv · Sep 9, 2026
Computational complexity of Berry phase estimation in topological phases of matter
arXiv · Aug 5, 2026
On the Computational Power of Geometrically Local QAC circuits
arXiv · Oct 1, 2026
The Commuting Local Hamiltonian Problem: Relativized Evidence Against BQP-Hardness
arXiv · Oct 1, 2026