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.
A complexity theory for non-local quantum computation
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A review compiling upper and lower bounds on entanglement cost for non-local quantum computation and its connections to cryptography, complexity, communication, and quantum gravity.
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.
-
Entanglement cost in non-local quantum computation
A review compiling upper and lower bounds on entanglement cost for non-local quantum computation and its connections to cryptography, complexity, communication, and quantum gravity.