Strong bounds on required resources for quantum channels by local operations and classical communication
arXiv:1904.10980 · doi:10.1103/PhysRevA.100.042324
Abstract
Given a protocol that implements multipartite quantum channel by repeated rounds of local operations and classical communication (LOCC), we construct an alternate LOCC protocol for in no more rounds than and no more than a fixed, constant number of outcomes for each local measurement, the same constant number for every party and every round. We then obtain another upper bound on the number of outcomes that, under certain conditions, improves on the first. The latter bound shows that for LOCC channels that are extreme points of the convex set of all quantum channels, the parties can restrict the number of outcomes in their individual local measurements to no more than the square of their local Hilbert space dimension, , suggesting a possible link between the required resources for LOCC and the convex structure of the set of all quantum channels. Our bounds on the number of outcomes indicating the need for only constant resources per round, independent of the number of rounds including when that number is infinite, are a stark contrast to the exponential -dependence in the only previously published bound of which we are aware. If a lower bound is known on the number of product operators needed to represent the channel, we obtain a lower bound on the number of rounds required to implement the given channel by LOCC. Finally, we show that when the quantum channel is not required but only that a given task be implemented deterministically, then no more than outcomes are needed for each local measurement by party .
arXiv commentAlso see next arXiv article by Leung, Winter and Yu for related results. Comments welcome
References in corpus (21)
- Quantum entanglement
- Mixed State Entanglement and Quantum Error Correction
- Quantum secret sharing
- Concentrating Partial Entanglement by Local Operations
- Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
- Quantum Resource Theories
- Conditions for a class of entanglement transformations
- The capacity of the noisy quantum channel
- Distributed Quantum Computation over Noisy Channels
- Local Distinguishability of Multipartite Orthogonal Quantum States
- Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)
- The general structure of quantum resource theories
- (Quantumness in the context of) Resource Theories
- Entangled pure state transformations via local operations assisted by finitely many rounds of classical communication
- Local Transformations Requiring Infinite Rounds of Classical Communication
- Local copying of orthogonal entangled quantum states
- Round Complexity in the Local Transformations of Quantum and Classical States
- General approach to quantum channel impossibility by local operations and classical communication
- Local cloning of entangled states
- LOCC protocols with bounded width per round optimize convex functions
- Efficient implementation of unitary transformations