Classical Feedback in a Quantum Network

• URL: http://arxiv.org/abs/2509.16333v1
• Date: Fri, 19 Sep 2025 18:22:01 GMT
• Title: Classical Feedback in a Quantum Network
• Abstract summary: An achievable rate region is derived using superposition block Markov coding and a quantum multiparty lemma.<n>As an example, we show that the quantum binary adder MAC can benefit from feedback.
• Score: 14.303513951759818
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Classical communication over a quantum multiple access channel (MAC) is considered. Since the no-cloning prohibits universal copying of arbitrary quantum states, classical feedback is generated through measurement. An achievable rate region is derived using superposition block Markov coding and a quantum multiparty lemma for the analysis. Our region generalizes both the classical Cover-Leung region and the generalized feedback region. As an example, we show that the quantum binary adder MAC can benefit from feedback.

Related papers

• Keyless Covert Communication Over Quantum MACs with General Message Sets [11.619051850120044]
  We study covert classical communication over quantum multiple-access channels (MACs) with general message sets.<n>We demonstrate the feasibility of achieving a positive covert rate over this channel and establish general one-shot and achievable rate regions.<n>This is the first work to achieve positive-rate covert communication over both classical and quantum MACs.
  arXiv  Detail & Related papers  (2026-07-09T19:40:38Z)
• No-Go Theorem for Gaussian Quantum Repeaters from Fractional Extendibility [2.277447144331876]
  We prove a no-go theorem for Gaussian quantum repeaters in a quantum network.<n>Our proof introduces a generalisation of $k$-extendibility to a notion of fractional extendibility for Gaussian states.
  arXiv  Detail & Related papers  (2026-06-03T17:00:00Z)
• Generalised simultaneous transmission of arbitrary quantum states and classical information [0.34376560669160394]
  We present a protocol which allows for arbitrary optical quantum states to simultaneously carry and transmit classical data.<n>Our scheme encodes classical information via displacements in the phase space prior to transmission.<n>The original quantum state is then restored by guessing the the original displacement and performing the appropriate inverse operation.
  arXiv  Detail & Related papers  (2026-06-02T05:41:03Z)
• Quantum-Classical Separation in Bounded-Resource Tasks Arising from Measurement Contextuality [107.84586711462556]
  We show that quantum contextuality enables certain tasks to be performed with success probabilities beyond classical limits.<n>Our work proposes novel ways to benchmark quantum processors using contextuality-based algorithms.
  arXiv  Detail & Related papers  (2025-12-01T23:54:32Z)
• Operationally classical simulation of quantum states [41.94295877935867]
  A classical state-preparation device cannot generate superpositions and hence its emitted states must commute.<n>We show that no such simulation exists, thereby certifying quantum coherence.<n>Our approach is a possible avenue to understand how and to what extent quantum states defy generic models based on classical devices.
  arXiv  Detail & Related papers  (2025-02-03T15:25:03Z)
• Quantum information with quantum-like bits [0.0]
  We show how arbitrary gates can be implemented by manipulating many-body correlations.<n>This suggests the possibility of quantum-like information processing on a special class of many-body classical systems.
  arXiv  Detail & Related papers  (2024-08-12T20:40:54Z)
• Overcoming Traditional No-Go Theorems: Quantum Advantage in Multiple Access Channels [0.0]
  We establish a novel advantage of quantum communication in a commonly encountered network configuration known as the Multiple Access Channel (MAC) Unlike the quantum superdense coding protocol, the advantage reported here is realized without invoking entanglement between the senders and the receiver. The presented quantum advantage hints at a profound connection with the concept of quantum nonlocality without inputs' and holds the potential for semi-device-independent certification of entangled measurements.
  arXiv  Detail & Related papers  (2023-09-29T14:15:35Z)
• Classical Capacity of Arbitrarily Distributed Noisy Quantum Channels [11.30845610345922]
  We study the impact of a mixture of classical and quantum noise on an arbitrary quantum channel carrying classical information. We formulate the achievable channel capacity over an arbitrary distributed quantum channel in presence of the mixed noise.
  arXiv  Detail & Related papers  (2023-06-28T11:14:12Z)
• Singleton Bounds for Entanglement-Assisted Classical and Quantum Error Correcting Codes [0.0]
  We show that entirely quantum Shannon theoretic methods can be used to derive Singleton bounds on the performance of EACQ error correcting codes. We show that a large part of this region is attainable by certain EACQ codes, whenever the local alphabet size is large enough.
  arXiv  Detail & Related papers  (2022-02-04T15:22:18Z)
• Computation-aided classical-quantum multiple access to boost network communication speeds [61.12008553173672]
  We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC. We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
  arXiv  Detail & Related papers  (2021-05-30T11:19:47Z)
• Universal classical-quantum superposition coding and universal classical-quantum multiple access channel coding [67.6686661244228]
  We derive universal classical-quantum superposition coding and universal classical-quantum multiple access channel code. We establish the capacity region of a classical-quantum compound broadcast channel with degraded message sets.
  arXiv  Detail & Related papers  (2020-11-01T03:26:08Z)
• 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)
• From a quantum theory to a classical one [117.44028458220427]
  We present and discuss a formal approach for describing the quantum to classical crossover. The method was originally introduced by L. Yaffe in 1982 for tackling large-$N$ quantum field theories.
  arXiv  Detail & Related papers  (2020-04-01T09:16:38Z)
• Permutation Enhances Classical Communication Assisted by Entangled States [67.12391801199688]
  We show that the capacity satisfies the strong converse property and thus the formula serves as a sharp dividing line between achievable and unachievable rates of communication. As examples, we derive analytically the classical capacity of various quantum channels of interests.
  arXiv  Detail & Related papers  (2020-01-07T01:49:31Z)

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.