Linear gate bounds against natural functions for position-verification (2024)
Provides a robust linear lower bound on the number of quantum gates/measurements needed to attack the inner product function.
- from
- Position-Based Quantum Cryptography
- added
- 2026-10-10
- likes
- 0
similar
-
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.
-
Rank lower bounds on non-local quantum computation (2024) arxiv.org
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.
-
Breaking simple quantum position verification protocols with little entanglement (2020) arxiv.org
Considers the case when the input bases are related by different angles and shows dimension-dependent attacks depending on the angle. Notably, they show the angle $\pi/6$ (outside the Clifford hierarchy) can be attacked with a 6-dimensional resource state.
-
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.
-
Continuous-variable quantum position verification secure against entangled attackers (2024) arxiv.org
Generalises $f$-BB84 QPV to continuous-variable inputs and shows analogous security statements as for finite-dimensional inputs.
-
On the role of quantum communication and loss in attacks on quantum position verification (2022) arxiv.org
Proves a 3/4 upper bound on the success probability of unentangled attacks.
Position-Based Quantum Cryptography › First Protocols > $f$-routing: “Provides a robust linear lower bound on the number of quantum gates/measurements needed to attack the inner product function.”