Rank lower bounds on non-local quantum computation (2024)
Provides a lower bound in terms of the Schmidt-rank of the resource state for perfect attacks. Gives linear lower bounds for some concrete functions.
- from
- Position-Based Quantum Cryptography
- added
- 2026-10-10
- likes
- 0
similar
-
Linear gate bounds against natural functions for position-verification (2024) arxiv.org
Provides a robust linear lower bound on the number of quantum gates/measurements needed to attack the inner product function.
-
Popescu-Rohrlich correlations imply efficient instantaneous nonlocal quantum computation (2016) doi.org
Shows that if attackers share PR boxes, then any unitary can be attacked using only linear entanglement and a linear number of PR box uses.
-
Bounds on instantaneous non-local quantum computation (2020) doi.org
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…
-
A tight lower bound for the BB84-states quantum-position-verification protocol (2015) arxiv.org
Gives essentially tight lower bound for attacks with classical communication.
-
A single-qubit position verification protocol that is secure against multi-qubit attacks (2022) doi.org
Shows a robust linear lower bound on the dimension of the attack resource state.
-
Complexity and entanglement in non-local computation and holography (2022) doi.org
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…
Position-Based Quantum Cryptography › First Protocols > $f$-routing: “Provides a lower bound in terms of the Schmidt-rank of the resource state for perfect attacks. Gives linear lower bounds for some concrete functions.”