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

• URL: http://arxiv.org/abs/2408.02506v2
• Date: Sun, 11 May 2025 10:05:22 GMT
• Title: Classical communication cost of a bipartite quantum channel assisted by non-signalling correlations
• Authors: Chengkai Zhu, Xuanqiang Zhao, Xin Wang,
• Abstract summary: This paper investigates the bidirectional communication cost of a bipartite quantum channel assisted by non-signalling correlations.<n>By introducing non-signalling superchannels, we present lower and upper bounds on the one-shot $epsilon$-assisted one-way classical communication cost.
• Score: 6.1108095842541
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Channel nonlocality under decoherence [0.0]
  We quantify nonlocality of bipartite quantum channels and identify its component resisting the effects of dephasing noise. We show that simulating certain processes with quantum channels undergoing decoherence has a communication advantage with respect to their classical simulation.
  arXiv  Detail & Related papers  (2024-08-19T18:00:05Z)
• eQMARL: Entangled Quantum Multi-Agent Reinforcement Learning for Distributed Cooperation over Quantum Channels [98.314893665023]
  Quantum computing has sparked a potential synergy between quantum entanglement and cooperation in multi-agent environments. Current state-of-the-art quantum MARL (QMARL) implementations rely on classical information sharing. eQMARL is a distributed actor-critic framework that facilitates cooperation over a quantum channel.
  arXiv  Detail & Related papers  (2024-05-24T18:43:05Z)
• Circuit Knitting Faces Exponential Sampling Overhead Scaling Bounded by Entanglement Cost [5.086696108576776]
  We show that the sampling overhead of circuit knitting is exponentially lower bounded by the exact entanglement cost of the target bipartite dynamic. Our work reveals a profound connection between virtual quantum information processing via quasi-probability decomposition and quantum Shannon theory.
  arXiv  Detail & Related papers  (2024-04-04T17:41:13Z)
• Communication Complexity of Common Randomness Generation with Isotropic States [5.312109949216557]
  The paper considers two communication models -- one-way classical communication and one-way quantum communication. We show that in the case of classical communication, quantum isotropic states have no advantage over noisy classical correlation. In the case of quantum communication, we demonstrate that the common randomness rate can be increased by using superdense coding on quantum isotropic states.
  arXiv  Detail & Related papers  (2023-11-08T14:48:15Z)
• Optimal unilocal virtual quantum broadcasting [5.80377843790023]
  We introduce protocols that can be approximated using physical operations with minimal cost. We formalize the simulation cost of a virtual quantum broadcasting protocol into a semidefinite programming problem.
  arXiv  Detail & Related papers  (2023-10-23T17:56:02Z)
• Quantum Broadcast Channel Simulation via Multipartite Convex Splitting [25.103483428654375]
  Communication cost of quantum broadcast channel simulation is characterized by an efficiently computable single-letter formula. New one-shot achievability result for multipartite quantum state splitting via multipartite convex splitting is presented.
  arXiv  Detail & Related papers  (2023-04-24T12:48:17Z)
• Correlation measures of a quantum state and information characteristics of a quantum channel [0.0]
  We discuss the interconnections between basic correlation measures of a bipartite quantum state and basic information characteristics of a quantum channel. We describe properties of the (unoptimized and optimized) quantum discord in infinite bipartite systems.
  arXiv  Detail & Related papers  (2023-04-11T17:58:13Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Quantum Causal Unravelling [44.356294905844834]
  We develop the first efficient method for unravelling the causal structure of the interactions in a multipartite quantum process. Our algorithms can be used to identify processes that can be characterized efficiently with the technique of quantum process tomography.
  arXiv  Detail & Related papers  (2021-09-27T16:28:06Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Enhancing nonclassical bosonic correlations in a Quantum Walk network through experimental control of disorder [50.591267188664666]
  We experimentally realize a controllable inhomogenous Quantum Walk dynamics. We observe two photon states which exhibit an enhancement in the quantum correlations between two modes of the network.
  arXiv  Detail & Related papers  (2021-02-09T10:57:00Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Quantum-enabled communication without a phase reference [1.14219428942199]
  A phase reference has been a standard requirement in continuous-variable quantum sensing and communication protocols. We show that quantum communication and entanglement-assisted communication without a phase reference are possible, when a short-time memory effect is present.
  arXiv  Detail & Related papers  (2020-10-22T18:19:00Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Environment-assisted bosonic quantum communications [0.0]
  We consider a quantum relay which is used by two parties to perform several continuous-variable protocols of quantum communication. In the worst case scenario where bipartite entanglement is completely lost at the relay, we show that the various protocols can be reactivated by the assistance of classical (separable) correlations in the environment. Our findings are confirmed by a proof-of-principle experiment where we show, for the first time, that memory effects in the environment can drastically enhance the performance of a quantum relay.
  arXiv  Detail & Related papers  (2020-03-20T12:58:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.