Monogamy of highly symmetric states (2023)
The results in this paper imply a $\ln(2) \approx 0.69$ upper bound on the success probability of unentangled attacks.
- from
- Position-Based Quantum Cryptography
- added
- 2026-10-10
- likes
- 0
similar
-
A monogamy-of-entanglement game with applications to device-independent quantum cryptography (2013) doi.org
Shows a tight upper bound for unentangled attacks, parallel repetition and a linear lower bound for the repeated protocol.
-
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.
-
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…
-
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.
-
Position-based quantum cryptography: Impossibility and constructions (2011) doi.org
Shows security against unentangled attacks.
-
Tightly characterises the secure region of the protocol depending on the loss and error rates.
Position-Based Quantum Cryptography › First Protocols > Bell QPV: “The results in this paper imply a $\ln(2) \approx 0.69$ upper bound on the success probability of unentangled attacks.”