A Coding Theorem for Bipartite Unitaries in Distributed Quantum Computation

Understand

We analyze implementations of bipartite unitaries by means of local operations and classical communication (LOCC) assisted by shared entanglement.

• We employ concepts and techniques developed in quantum Shannon theory to study an asymptotic scenario, in which two distant parties perform the same bipartite unitary on infinitely many pairs of inputs.
• We analyze minimum cost of entanglement and classical communication per copy.
• For two-round LOCC protocols, we derive a single-letter formula for the minimum cost of entanglement and classical communication, under an additional requirement that the error converges to zero faster than $1/n^4$, where $n$ is the number of input pairs.