A Coding Theorem for Bipartite Unitaries in Distributed Quantum Computation

DOI10.1109/TIT.2017.2709754MaRDI QIDQ5369877zbMATH OpenFDO

Authors Eyuri Wakakuwa, Akihito Soeda, Mio Murao

Publication date 19 October 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1505.04352

Mathematics Subject Classification ID

Quantum computation (81P68)

Abstract: 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. The formula is given by the "Markovianizing cost" of a tripartite state associated with the unitary, which can be computed by a finite-step algorithm. We also derive a lower bound on the minimum cost of resources, which applies for protocols with arbitrary number of rounds.

Recommendations

• Coding Theorems for Compound Problems via Quantum Rényi Divergences
• An extended coding theorem with application to quantum complexities
• Network Coding for Distributed Quantum Computation Over Cluster and Butterfly Networks
• Quantum Coding Theorem from Privacy and Distinguishability
• On the Distributed Compression of Quantum Information
• Coding theorem and strong converse for quantum channels
• A coding theorem for distributed computation
• Quantum network coding on networks with arbitrarily distributed hidden channels
• Distributed compression and multiparty squashed entanglement
• Quantum coding theorems

Cited in

(5)

• Conditional mutual information of bipartite unitaries and scrambling
• One-shot randomized and nonrandomized partial decoupling
• A dynamic programming approach for distributing quantum circuits by bipartite graphs
• A coding theorem for distributed computation
• State transfer on the multi-access channel network

This page was built for publication: A Coding Theorem for Bipartite Unitaries in Distributed Quantum Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5369877)