LOCC protocols with bounded width per round optimize convex functions

DOI10.1142/S0129055X21500136MaRDI QIDQ5156088zbMATH OpenFDO

Authors Andreas Winter, Nengkun Yu, Debbie Leung

Publication date 14 October 2021

Published in Reviews in Mathematical Physics (Search for Journal in Brave)

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

zbMATH Keywords

bounded widthLOCCstate discrimination

Mathematics Subject Classification ID

Quantum measurement theory, state operations, state preparations (81P15) Quantum state tomography, quantum state discrimination (81P18) LOCC, teleportation, dense coding, remote state operations, distillation (81P48)

Abstract: We start with the task of discriminating finitely many multipartite quantum states using LOCC protocols, with the goal to optimize the probability of correctly identifying the state. We provide two different methods to show that finitely many measurement outcomes in every step are sufficient for approaching the optimal probability of discrimination. In the first method, each measurement of an optimal LOCC protocol, applied to a $d_{mloc}$-dim local system, is replaced by one with at most $2d_{mloc}^2$ outcomes, without changing the probability of success. In the second method, we decompose any LOCC protocol into a convex combination of a number of "slim protocols" in which each measurement applied to a $d_{mloc}$-dim local system has at most $d_{mloc}^2$ outcomes. To maximize any convex functions in LOCC (including the probability of state discrimination or fidelity of state transformation), an optimal protocol can be replaced by the best slim protocol in the convex decomposition without using shared randomness. For either method, the bound on the number of outcomes per measurement is independent of the global dimension, the number of parties, the depth of the protocol, how deep the measurement is located, and applies to LOCC protocols with infinite rounds, and the "measurement compression" can be done "top-down" -- independent of later operations in the LOCC protocol. The second method can be generalized to implement LOCC instruments with finitely many outcomes: if the instrument has $n$ coarse-grained final measurement outcomes, global input dimension $D_0$ and global output dimension $D_i$ for $i=1,\mathrm{...},n$ conditioned on the $i$-th outcome, then one can obtain the instrument as a convex combination of no more than $R=su{m}_{i=1}^n{D}_0^2{D}_i^2-D_0^2+1$ slim protocols; in other words, $lo{g}_{2}R$ bits of shared randomess suffice.

Recommendations

• Everything you always wanted to know about LOCC (but were afraid to ask)
• Volume of the set of LOCC-convertible quantum states
• Optimal local protocols for processing of entangled states -- local cloning and eavesdropping
• A framework for bounding nonlocality of state discrimination
• Testing for a pure state with local operations and classical communication

Cites work

• Classical randomness in quantum measurements
• Distinguishability of complete and unextendible product bases
• Distinguishability of maximally entangled states
• Distinguishability of Quantum States by Positive Operator-Valued Measures With Positive Partial Transpose
• Distinguishability of Quantum States by Separable Operations
• Distinguishability of quantum states under restricted families of measurements with an application to quantum data hiding
• Distinguishing bipartitite orthogonal states using LOCC: Best and worst cases
• Distinguishing multi-partite states by local measurements
• Everything you always wanted to know about LOCC (but were afraid to ask)
• EXTREMAL DECISION RULES IN QUANTUM HYPOTHESIS TESTING
• Information and quantum measurement
• Limitations on Separable Measurements by Convex Optimization
• Local information as a resource in distributed quantum systems
• LOCC distinguishability of unilaterally transformable quantum states
• Mixed-state entanglement and quantum error correction
• On the Chernoff distance for asymptotic LOCC discrimination of bipartite quantum states
• Optimal Extraction of Information from Finite Quantum Ensembles
• Quantum data hiding
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• The geometric measure of entanglement for a symmetric pure state with non-negative amplitudes
• The theory of quantum information
• Unextendible product bases, uncompletable product bases and bound entanglement

Cited in

(1)

• Everything you always wanted to know about LOCC (but were afraid to ask)

Describes a project that uses

Uses Software

• QETLAB

This page was built for publication: LOCC protocols with bounded width per round optimize convex functions

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