New lower-bound techniques based on controllable correlation and entanglement yield non-trivial bounds for Haar-random two-qubit unitaries and the first known bounds for CNOT, DCNOT, sqrt(SWAP), and XX gates, with a tight result for CNOT.
On the role of quantum communication and loss in attacks on quantum position verification.arXiv preprint arXiv:2208.04341, 2022
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Lower bounds on non-local computation from controllable correlation
New lower-bound techniques based on controllable correlation and entanglement yield non-trivial bounds for Haar-random two-qubit unitaries and the first known bounds for CNOT, DCNOT, sqrt(SWAP), and XX gates, with a tight result for CNOT.