On the Utility of Quantum Entanglement for Joint Communication and Instantaneous Detection

• URL: http://arxiv.org/abs/2503.21134v1
• Date: Thu, 27 Mar 2025 03:51:59 GMT
• Title: On the Utility of Quantum Entanglement for Joint Communication and Instantaneous Detection
• Authors: Yuhang Yao, Syed A. Jafar,
• Abstract summary: Entanglement is known to significantly improve the performance of communication and detection schemes that utilize quantum resources.<n>This work explores the simultaneous utility of quantum entanglement for (joint) communication and detection schemes.
• Score: 2.6641834518599303
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Entanglement is known to significantly improve the performance (separately) of communication and detection schemes that utilize quantum resources. This work explores the simultaneous utility of quantum entanglement for (joint) communication and detection schemes, over channels that are convex combinations of identity, depolarization and erasure operators, both with perfect and imperfect entanglement assistance. The channel state is binary, rapidly time-varying and unknown to the transmitter. While the communication is delay-tolerant, allowing the use of arbitrarily long codewords to ensure reliable decoding, the channel state detection is required to be instantaneous. The detector is neither co-located with the transmitter, nor able to wait for the decoding in order to learn the transmitted waveform. The results of this work appear in the form of communication-rate vs instantaneous-detection-error tradeoffs, with and without quantum entanglement. Despite the challenges that place the two tasks at odds with each other, the results indicate that quantum entanglement can indeed be simultaneously and significantly beneficial for joint communication and instantaneous detection.

Related papers

• Quantum Information Processing, Sensing and Communications: Their Myths, Realities and Futures [61.25494706587422]
  The state-of-the-art, knowledge gaps and future evolution of quantum machine learning are discussed.<n>We conclude with a set of promising future research ideas in the field of ultimately secure quantum communications.
  arXiv  Detail & Related papers  (2024-12-01T22:28:02Z)
• Covert Quantum Communication Over Optical Channels [2.094817774591302]
  We show a emphsquare root law (SRL) for quantum covert communication similar to that for classical. Our proof uses photonic dual-rail qubit encoding, which has been proposed for long-range repeater-based quantum communication. Our converse employs prior covert signal power limit results and adapts well-known methods to upper bound quantum capacity of optical channels.
  arXiv  Detail & Related papers  (2024-01-12T18:54:56Z)
• Time correlations in atmospheric quantum channels [0.0]
  Efficient transfer of quantum information between remote parties is a crucial challenge for quantum communication over atmospheric channels. Random fluctuations of the channel transmittance are a major disturbing factor for its practical implementation. We study correlations between channel transmittances at different moments of time and focus on two transmission protocols.
  arXiv  Detail & Related papers  (2023-11-13T20:25:36Z)
• Optical fibres with memory effects and their quantum communication capacities [8.388591755871735]
  We show that reliable quantum communication is attainable even for highly noisy regimes.<n>We find the critical time interval between subsequent signals below which quantum communication, two-way entanglement distribution, and quantum key distribution become achievable.
  arXiv  Detail & Related papers  (2023-09-29T08:58:03Z)
• Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
  This paper studies the study of fault-tolerant channel coding for quantum channels. We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario. We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
  arXiv  Detail & Related papers  (2022-10-06T14:09:16Z)
• Channel capacity of relativistic quantum communication with rapid interaction [0.0]
  We study nonperturbatively the transmission of classical and quantum information in globally hyperbolic spacetimes. We show that when both detectors interact via delta-coupling, one can arrange and tune the detectors so that the channel capacity is as good as the quantum channel constructed nonperturbatively.
  arXiv  Detail & Related papers  (2022-02-24T19:00:00Z)
• 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)
• Detecting Quantum Capacities of Continuous-Variable Quantum Channels [0.7614628596146599]
  We introduce a method for detecting the quantum capacity of continuous variable communication channels and memories without performing a full process tomography. Our method works in the general scenario where the devices are used a finite number of times, can exhibit correlations across multiple uses, and can change dynamically under the control of a malicious adversary.
  arXiv  Detail & Related papers  (2021-08-30T16:18:39Z)
• 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)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• 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)
• 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)

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.