The Round Complexity of Local Operations and Classical Communication (LOCC) in Random-Party Entanglement Distillation
arXiv:2204.00781 · doi:10.22331/q-2023-09-07-1104
Abstract
A powerful operational paradigm for distributed quantum information processing involves manipulating pre-shared entanglement by local operations and classical communication (LOCC). The LOCC round complexity of a given task describes how many rounds of classical communication are needed to complete the task. Despite some results separating one-round versus two-round protocols, very little is known about higher round complexities. In this paper, we revisit the task of one-shot random-party entanglement distillation as a way to highlight some interesting features of LOCC round complexity. We first show that for random-party distillation in three qubits, the number of communication rounds needed in an optimal protocol depends on the entanglement measure used; for the same fixed state some entanglement measures need only two rounds to maximize whereas others need an unbounded number of rounds. In doing so, we construct a family of LOCC instruments that require an unbounded number of rounds to implement. We then prove explicit tight lower bounds on the LOCC round number as a function of distillation success probability. Our calculations show that the original W-state random distillation protocol by Fortescue and Lo is essentially optimal in terms of round complexity.
arXiv comment19 pages, 9 figures. Accepted in Quantum 2023-03-28
References in corpus (35)
- Quantum entanglement
- Entanglement of Formation of an Arbitrary State of Two Qubits
- Mixed State Entanglement and Quantum Error Correction
- Three qubits can be entangled in two inequivalent ways
- Quantum Nonlocality without Entanglement
- Conditions for a class of entanglement transformations
- Distillation of secret key and entanglement from quantum states
- Entanglement of pure states for a single copy
- Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)
- An improved bound on distillable entanglement
- Weak measurements are universal
- Optimizing practical entanglement distillation
- A framework for bounding nonlocality of state discrimination
- Three maximally entangled states can require two-way LOCC for local discrimination
- Binary search trees for generalized measurement
- A Return to the Optimal Detection of Quantum Information
- Random bipartite entanglement from W and W-like states
- Local Transformations Requiring Infinite Rounds of Classical Communication
- Transformations of -Type Entangled States
- Asymptotically perfect discrimination in the LOCC paradigm
- Local distinguishability of orthogonal 2\otimes3 pure states
- Difficulty of distinguishing product states locally
- An introduction to entanglement measures
- Random multiparty entanglement distillation
- Asymptotic State Discrimination and a Strict Hierarchy in Distinguishability Norms
- Round Complexity in the Local Transformations of Quantum and Classical States
- A Coding Theorem for Bipartite Unitaries in Distributed Quantum Computation
- Complexity of causal order structure in distributed quantum information processing and its trade-off with entanglement
- Bounds on Instantaneous Nonlocal Quantum Computation
- Randomly distilling W-class states into general configurations of two-party entanglement
- General approach to quantum channel impossibility by local operations and classical communication
- Construnctions of LOCC indistinguishable set of generalized Bell states
- Infinitesimal local operations and differential conditions for entanglement monotones
- LOCC protocols with bounded width per round optimize convex functions
- Interpolatability distinguishes LOCC from separable von Neumann measurements