Efficient Unclonable Encryption from Pauli Eigenstates
Summary
arXiv:2607.21811v1 Announce Type: new Abstract: We give, to our knowledge, the first plain-model, one-time information-theoretically secure, efficient unclonable encryption scheme for one classical bit. Previous work by Bhattacharyya and Culf (Nature Physics, 2026) and Bhattacharyya, Broadbent, and Culf either only showed $1/\mathsf{poly}(\lambda)$ security loss or required inefficient encryption/decryption operations. We avoid both of these caveats; in doing so, we obtain (to our knowledge) the first plain-model construction of many-time secure $1 \to 2$ unclonable encryption for arbitrary polynomial-length messages, assuming the existence of pseudorandom function-like states (Bartusek and Goldin).
Why It Matters
This Quantum development moves quantum capability closer to commercial and national-security relevance. For Asia, it is a signal worth tracking: it shapes who supplies, who scales, and who sets the standard over the next five years.
Key Facts
- SectorQuantum
- Market—
- ImpactMedium (58/100)
- SignalResearch