A Coding Theorem for Bipartite Unitaries in Distributed Quantum Computation
arXiv:1505.04352 · doi:10.1109/TIT.2017.2709754
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 , where 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.
arXiv comment32 pages, 8 figures
References in corpus (33)
- Entanglement of Formation of an Arbitrary State of Two Qubits
- Quantifying Entanglement
- Entanglement Measures and Purification Procedures
- Information Causality as a Physical Principle
- A simple formula for the average gate fidelity of a quantum dynamical operation
- On the quantum, classical and total amount of correlations in a quantum state
- Quantum information can be negative
- "Squashed Entanglement" - An Additive Entanglement Measure
- Optimal local implementation of non-local quantum gates
- Structure of states which satisfy strong subadditivity of quantum entropy with equality
- Quantum state merging and negative information
- Continuity of quantum conditional information
- Entangling operations and their implementation using a small amount of entanglement
- Quantum dynamics as a physical resource
- Continuity bounds for entanglement
- Efficient implementation of bipartite nonlocal unitary gates using prior entanglement and classical communication
- On the efficiency of nonlocal gates generation
- Compressibility of Mixed-State Signals
- Entanglement cost of implementing controlled-unitary operations
- Entanglement requirements for implementing bipartite unitary operations
- Local implementation of nonlocal operations of block forms
- Probabilistically implementing nonlocal operation using non-maximally entangled state
- Universal super-replication of unitary gates
- Deterministic superreplication of one-parameter unitary transformations
- Implementation of multipartite unitary operations with limited resources
- Efficient Implementation of Controlled-Rotations by Using Entanglement
- Markovianizing Cost of Tripartite Quantum States
- Optimizing local protocols implementing nonlocal quantum gates
- A probabilistic and information theoretic interpretation of quantum evolutions
- Lower bounds for communication capacities of two-qudit unitary operations
- The Cost of Randomness for Converting a Tripartite Quantum State to be Approximately Recoverable
- Asymptotic Compressibility of Entanglement and Classical Communication in Distributed Quantum Computation
- A Four-Round LOCC Protocol Outperforms All Two-Round Protocols in Reducing the Entanglement Cost for A Distributed Quantum Information Processing
Cited by in corpus (13)
- Fundamental limits on the capacities of bipartite quantum interactions
- Conditional Mutual Information of Bipartite Unitaries and Scrambling
- Entanglement and secret-key-agreement capacities of bipartite quantum interactions and read-only memory devices
- Deconstruction and conditional erasure of quantum correlations
- Universal limitations on implementing resourceful unitary evolutions
- Conditional Decoupling of Quantum Information
- Complexity of causal order structure in distributed quantum information processing and its trade-off with entanglement
- State exchange with quantum side information
- One-Shot Randomized and Nonrandomized Partial Decoupling
- Quantum State Merging for Arbitrarily Small-Dimensional Systems
- Distributed Encoding and Decoding of Quantum Information over Networks
- One-Shot Triple-Resource Trade-Off in Quantum Channel Coding
- The Round Complexity of Local Operations and Classical Communication (LOCC) in Random-Party Entanglement Distillation