Complexity and entanglement in non-local computation and holography (2022)

doi.orgsite

Notes that the necessary attack resource requirements are controlled by the entangled part of the task unitary. Shows that for tasks where one side is classical input information, a doubly-logarithmic (later improved to logarithmic) lower bound and exponential upper bound (in…

from

Position-Based Quantum Cryptography

added

2026-10-10

likes

0

Position-Based Quantum Cryptography › Towards Understanding NLQC: “Notes that the necessary attack resource requirements are controlled by the entangled part of the task unitary. Shows that for tasks where one side is classical input information, a doubly-logarithmic (later improved to logarithmic) lower bound and exponential upper bound (in…”