Cryptographic power of fully-computational pseudoentanglement

Determine whether more powerful cryptographic primitives can be constructed from fully-computational pseudoentanglement, thereby characterizing the cryptographic power of fully-computational pseudoentanglement beyond the EFI-pair construction established in the paper.

Background

The paper establishes that fully-computational pseudoentanglement, under the assumption that both underlying state families are uniformly efficiently preparable, suffices to construct EFI pairs. Since EFI pairs support several standard quantum cryptographic primitives, this provides a concrete cryptographic consequence of fully-computational pseudoentanglement.

The authors explicitly state that their result does not determine how powerful fully-computational pseudoentanglement is more generally. The unresolved problem is therefore to identify whether this resource can yield cryptographic primitives stronger than those obtained through EFI pairs, or otherwise to characterize the extent of its cryptographic power.