Extendible quantum measurements and limitations on classical communication

Abstract

Unextendibility of quantum states and channels is inextricably linked to the no-cloning theorem of quantum mechanics, it has played an important role in understanding and quantifying entanglement, and more recently it has found applications in providing limitations on quantum error correction and entanglement distillation. Here we generalize the framework of unextendibility to quantum measurements and define $k$-extendible measurements for every integer $k\ge 2$. Our definition provides a hierarchy of semidefinite constraints that specify a set of measurements containing every measurement that can be realized by local operations and one-way classical communication. Furthermore, the set of $k$-extendible measurements converges to the set of measurements that can be realized by local operations and one-way classical communication as $k\to \infty$. To illustrate the utility of $k$-extendible measurements, we establish a semidefinite programming upper bound on the one-shot classical capacity of a channel, which outperforms the best known efficiently computable bound from [Matthews and Wehner, IEEE Trans. Inf. Theory 60, pp. 7317-7329 (2014)] and also leads to efficiently computable upper bounds on the $n$-shot classical capacity of a channel.

6+12 pages. Submission to the 2025 International Symposium on Information Theory to be held at University of Michigan. v2: Added Appendix D, demonstrating the efficient computability of the SDP upper bound on the n-shot classical capacity of a channel for a fixed 'k'. v3: Added Remark 2

References in corpus (20)

• A complete family of separability criteria
• Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)
• Quantum Data Hiding
• Distinguishing separable and entangled states
• Measurements incompatible in Quantum Theory cannot be measured jointly in any other local theory
• Distinguishability of quantum states under restricted families of measurements with an application to quantum data hiding
• Finite blocklength converse bounds for quantum channels
• Distinguishability of Quantum States by Positive Operator-Valued Measures with Positive Partial Transpose
• Semidefinite programming strong converse bounds for classical capacity
• Extendibility limits the performance of quantum processors
• Approximating the Set of Separable States Using the Positive Partial Transpose Test
• Semidefinite programming hierarchies for constrained bilinear optimization
• Resource theory of unextendibility and non-asymptotic quantum capacity
• Quantum Pufferfish Privacy: A Flexible Privacy Framework for Quantum Systems
• Parallelization of Adaptive Quantum Channel Discrimination in the Non-Asymptotic Regime
• Quantifying the performance of approximate teleportation and quantum error correction via symmetric two-PPT-extendibility
• A hierarchy of efficient bounds on quantum capacities exploiting symmetry
• Measured Hockey-Stick Divergence and its Applications to Quantum Pufferfish Privacy
• Extendible quantum measurements and limitations on classical communication
• Extendibility limits quantum-secured communication and key distillation

Cited by in corpus (2)

• Measured Hockey-Stick Divergence and its Applications to Quantum Pufferfish Privacy
• Extendible quantum measurements and limitations on classical communication