26 citations · 51 across the 14 of their papers we have counts for
Showing 2026 · quant-phShow all
3 papers · 2 filters
quant-ph2026
The complexity of entangled graph colouring via polymorphisms
Eric Culf
Constraint satisfaction problems (CSPs) with operator assignments to the variables provide a well-structured setting to study the decision complexity of the entangled value of clas…
quant-ph2026
Statistically secure uncloneable encryption of arbitrary messages
Archishna Bhattacharyya, Anne Broadbent, Eric Culf
Unconditional uncloneable encryption of a single bit with efficient encryption and decryption is now possible. However, whether the extension to messages of arbitrary length achiev…
quant-ph2026
The uncloneable bit exists
Archishna Bhattacharyya, Anne Broadbent, Eric Culf
We establish quantum uncloneable encryption with unconditional security, preventing two non-communicating adversaries from simultaneously decrypting a single ciphertext even wh…