Bounds on instantaneous non-local quantum computation (2020)

doi.orgsite

Shows that any 2-qubit unitary can be attacked up to error $\varepsilon$ using $\log(1/\varepsilon)$ EPR pairs and that any hermitian bipartite binary controlled unitary can be attacked with 1 EPR pair. Shows logarithmic lower bound on entanglement entropy for general bipartite…

from

Position-Based Quantum Cryptography

added

2026-10-10

likes

0

Position-Based Quantum Cryptography › Universal Attacks on QPV > Attacks on classes of unitaries: “Shows that any 2-qubit unitary can be attacked up to error $\varepsilon$ using $\log(1/\varepsilon)$ EPR pairs and that any hermitian bipartite binary controlled unitary can be attacked with 1 EPR pair. Shows logarithmic lower bound on entanglement entropy for general bipartite…”