Unital Qubit Queue-channels: Classical Capacity and Product Decoding

• URL: http://arxiv.org/abs/2110.02800v2
• Date: Wed, 26 Oct 2022 15:19:51 GMT
• Title: Unital Qubit Queue-channels: Classical Capacity and Product Decoding
• Authors: Vikesh Siddhu, Avhishek Chatterjee, Krishna Jagannathan, Prabha Mandayam, Sridhar Tayur
• Abstract summary: Quantum queue-channels arise naturally in the context of buffering in quantum networks. We show that the upper-bound on the capacity of an additive queue-channel has a simple expression, and is achievable for the erasure and depolarizing channels. Our results provide useful insights towards designing practical quantum communication networks.
• Score: 4.971638713979981
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum queue-channels arise naturally in the context of buffering in quantum networks, wherein the noise suffered by the quantum states depends on the time spent waiting in the buffer. It has been shown that the upper-bound on the classical capacity of an additive queue-channel has a simple expression, and is achievable for the erasure and depolarizing channels [IEEE JSAIT, 1(2):432-444]. In this paper, we characterise the classical capacity for the class of unital qubit queue-channels, and show that a simple product (non-entangled) decoding strategy is capacity-achieving. As an intermediate result, we derive an explicit capacity achieving product decoding strategy for any i.i.d. unital qubit channel, which could be of independent interest. As an important special case, we also derive the capacity and optimal decoding strategies for a symmetric generalized amplitude damping (GAD) queue-channel. Our results provide useful insights towards designing practical quantum communication networks, and highlight the need to explicitly model the impact of buffering.

Related papers

• Classical capacity of quantum non-Gaussian attenuator and amplifier channels [0.8409980020848168]
  We consider a quantum bosonic channel that couples the input mode via a beam splitter or two-mode squeezer to an environmental mode prepared in an arbitrary state. We investigate the classical capacity of this channel, which we call a non-Gaussian attenuator or amplifier channel.
  arXiv  Detail & Related papers  (2023-12-25T06:05:51Z)
• On Simultaneous Information and Energy Transmission through Quantum Channels [15.387256204743407]
  We introduce the quantum-classical analogue of the capacity-power function. We generalize results in classical information theory for transmitting classical information through noisy channels.
  arXiv  Detail & Related papers  (2023-09-24T16:46:47Z)
• Information capacity analysis of fully correlated multi-level amplitude damping channels [0.9790236766474201]
  We investigate some of the information capacities of the simplest member of multi-level Amplitude Damping Channel, a qutrit channel. We find the upper bounds of the single-shot classical capacities and calculate the quantum capacities associated with a specific class of maps.
  arXiv  Detail & Related papers  (2023-05-08T06:10:56Z)
• 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)
• The Classical Capacity of Quantum Jackson Networks with Waiting Time-Dependent Erasures [0.0]
  We study the fundamental limits of classical communication using quantum states that decohere as they traverse through a network of queues. Our work quantifies the impact of delay-induced decoherence on the fundamental limits of classical communication over quantum networks.
  arXiv  Detail & Related papers  (2022-06-09T04:13:53Z)
• Commitment capacity of classical-quantum channels [70.51146080031752]
  We define various notions of commitment capacity for classical-quantum channels. We prove matching upper and lower bound on it in terms of the conditional entropy.
  arXiv  Detail & Related papers  (2022-01-17T10:41:50Z)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• Queue-Channel Capacities with Generalized Amplitude Damping [4.971638713979981]
  We consider a symmetric GAD channel characterized by the parameter $n=1/2,$ and derive its exact classical capacity. We show that the Holevo quantity for the GAD channel equals the Shannon capacity of the induced binary symmetric channel. We exploit a conditional independence property in conjunction with additivity of the channel model, to obtain a capacity expression for the GAD queue channel.
  arXiv  Detail & Related papers  (2021-07-28T16:52:24Z)
• Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network [64.1951227380212]
  We propose that quantum circuits can be modeled as queuing networks. Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
  arXiv  Detail & Related papers  (2021-06-26T10:55:52Z)
• 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)
• 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.