Computational Cryptography from Pseudoentanglement
Researchers show efficient pseudoentanglement implies EFI pairs, tying it to minimal quantum-crypto assumptions.
An arXiv cs.CR paper relates pseudoentanglement to computational cryptography through EFI pairs. The authors show that pseudoentanglement under two operational definitions, with efficient state generation, is sufficient for EFI pairs, and with a prior converse they establish equivalence under the second definition. Supporting lemmas connect computational entanglement measures to distances between states and to distinguishability of mixtures. They also give the first continuity relation for a computational entanglement measure.
- Efficient pseudoentanglement is shown to imply EFI pairs
- Equivalence holds under one operational definition
- Authors prove a continuity result for a computational entanglement measure
- Work links quantum information theory with minimal crypto assumptions
From the original article
1 min read at arxiv.orgThe advent of pseudoentanglement and computational entanglement theory bootstrapped a wave of research at the intersection of computer science and information theory.
By Ilia Ryzov · arxiv.org
A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.