Classical communication cost of a bipartite quantum channel assisted by non-signalling correlations

Abstract

Understanding the classical communication cost of simulating a quantum channel is a fundamental problem in quantum information theory, which becomes even more intriguing when considering the role of non-locality in quantum information processing. This paper investigates the bidirectional classical communication cost of simulating a bipartite quantum channel assisted by non-signalling correlations, which are permitted across the spatial dimension between the two parties. By introducing non-signalling superchannels, we present lower and upper bounds on the one-shot $\epsilon$-error one-way classical communication cost of a bipartite channel via its smooth max-relative entropy of one-way classical communication, and establish that the asymptotic exact cost is given by its max-relative entropy of one-way classical communication. For the bidirectional scenario, we derive semidefinite programming (SDP) formulations for the one-shot exact bidirectional classical communication cost via non-signalling bipartite superchannels. We further introduce a channel's bipartite conditional min-entropy as an efficiently computable lower bound on the asymptotic cost of bidirectional classical communication. Our results in both one-shot and asymptotic settings provide lower bounds on the entanglement-assisted simulation cost in scenarios where entanglement is available to the two parties. Moreover, we propose a seesaw-based algorithm to compute an upper bound on the minimum simulation error via local operations and shared entanglement, which provides valuable insights into the relationship between non-signalling bipartite superchannels and more physically realizable protocols. Numerical experiments demonstrate the effectiveness of our bounds in estimating communication costs for various quantum channels, showing that our bounds can be tight in different scenarios.

arXiv comment31 pages, 8 figures, results updated

References in corpus (51)

• The role of quantum information in thermodynamics --- a topical review
• On quantum Renyi entropies: a new generalization and some properties
• Quantum correlations with no causal order
• Entanglement-Assisted Classical Capacity of Noisy Quantum Channels
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
• Min- and Max- Relative Entropies and a New Entanglement Monotone
• Quantum Circuits Architecture
• Transforming quantum operations: quantum supermaps
• Quantum Reverse Shannon Theorem
• Causal and localizable quantum operations
• Popescu-Rohrlich correlations as a unit of nonlocality
• The Quantum Reverse Shannon Theorem based on One-Shot Information Theory
• Second-order asymptotics for quantum hypothesis testing
• On the capacities of bipartite Hamiltonians and unitary gates
• Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
• Comparison of Quantum Channels by Superchannels
• Approaches for approximate additivity of the Holevo information of quantum channels
• On the strong converses for the quantum channel capacity theorems
• Fundamental bound on the reliability of quantum information transmission
• Semicausal operations are semilocalizable
• Amortized Channel Divergence for Asymptotic Quantum Channel Discrimination
• How to quantify a dynamical quantum resource
• Using and reusing coherence to realize quantum processes
• On the power of PPT-preserving and non-signalling codes
• On quantum non-signalling boxes
• Zero-error channel capacity and simulation assisted by non-local correlations
• Semidefinite programming strong converse bounds for classical capacity
• Quantum Relative Lorenz Curves
• No-Signalling Assisted Zero-Error Capacity of Quantum Channels and an Information Theoretic Interpretation of the Lovasz Number
• Dynamical Resource Theory of Quantum Coherence
• Playing Games with Multiple Access Channels
• Quantum Channel Simulation and the Channel's Smooth Max-Information
• Dynamical Entanglement
• Second-Order Asymptotics for the Classical Capacity of Image-Additive Quantum Channels
• On the Second-Order Asymptotics for Entanglement-Assisted Communication
• Thermodynamic Capacity of Quantum Processes
• Fundamental work cost of quantum processes
• Optimal two-qubit quantum circuits using exchange interactions
• Limits on classical communication from quantum entropy power inequalities
• A linear program for the finite block length converse of Polyanskiy-Poor-Verdú via non-signalling codes
• Fundamental limits on the capacities of bipartite quantum interactions
• Classical communication over a quantum interference channel
• Entropy power inequalities for qudits
• On converse bounds for classical communication over quantum channels
• Semidefinite programming hierarchies for constrained bilinear optimization
• Algorithmic Aspects of Optimal Channel Coding
• Two-way quantum communication channels
• Bounding the forward classical capacity of bipartite quantum channels
• Multiple-Access Channel Coding with Non-Signaling Correlations
• Broadcast Channel Coding: Algorithmic Aspects and Non-Signaling Assistance
• Quantum Network Discrimination