The reciprocal of a graph's isoperimetric number lower-bounds entanglement creation time on any qubit architecture, and a max-flow protocol saturates it up to a logarithmic factor.
They wish to implement an arbitrary two-qubit unitary using only local operations and classical control
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Entanglement bounds on the performance of quantum computing architectures
The reciprocal of a graph's isoperimetric number lower-bounds entanglement creation time on any qubit architecture, and a max-flow protocol saturates it up to a logarithmic factor.