General Communication Enhancement via the Quantum Switch

• URL: http://arxiv.org/abs/2407.02726v1
• Date: Wed, 3 Jul 2024 00:47:13 GMT
• Title: General Communication Enhancement via the Quantum Switch
• Authors: Zhen Wu, James Fullwood, Zhihao Ma, Siqi Zhou, Qi Zhao, Giulio Chiribella,
• Abstract summary: We conjecture that $mathcalP_n>0$ is both a necessary and sufficient condition for communication enhancement via the quantum $tt SWITCH$. We then formulate a communication protocol involving the quantum $tt SWITCH$ which enhances the private capacity of the BB84 channel.
• Score: 15.779145740528417
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recent studies have shown that quantum information may be effectively transmitted by a finite collection of completely depolarizing channels in a coherent superposition of different orders, via an operation known as the quantum $\tt SWITCH$. Such results are quite remarkable, as completely depolarizing channels taken in isolation and in a definite order can only output white noise. For general channels however, little is known about the potential communication enhancement provided by the quantum $\tt SWITCH$. In this Letter, we define an easily computable quantity $\mathcal{P}_n$ associated with the quantum ${\tt SWITCH}$ of $n$ copies of a fixed channel, and we conjecture that $\mathcal{P}_n>0$ is both a necessary and sufficient condition for communication enhancement via the quantum $\tt SWITCH$. In support of our conjecture, we derive a simple analytic expression for the classical capacity of the quantum $\tt SWITCH$ of $n$ copies of an arbitrary Pauli channel in terms of the quantity $\mathcal{P}_n$, which we then use to show that our conjecture indeed holds in the space of all Pauli channels. Utilizing such results, we then formulate a communication protocol involving the quantum $\tt SWITCH$ which enhances the private capacity of the BB84 channel.

Related papers

• The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the extreme multimode bosonic Gaussian channels [53.253900735220796]
  Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes. Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
  arXiv  Detail & Related papers  (2024-10-18T13:59:50Z)
• Phase Transition in the Quantum Capacity of Quantum Channels [0.0]
  We prove that every quantum channel $Lambda$ in arbitrary dimension, when contaminated by white noise, completely loses its capacity of transmitting quantum states. We also find the quantum capacity of the complement of the depolarizing channel in closed form.
  arXiv  Detail & Related papers  (2024-08-11T09:49:52Z)
• Deterministic identification over channels with finite output: a dimensional perspective on superlinear rates [53.66705737169404]
  We consider the problem in its generality for memoryless channels with finite output, but arbitrary input alphabets. Our main findings are that the maximum number of messages thus identifiable scales super-exponentially as $2R,nlog n$ with the block length $n$. Results are shown to generalise directly to classical-quantum channels with finite-dimensional output quantum system.
  arXiv  Detail & Related papers  (2024-02-14T11:59:30Z)
• 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)
• Enhanced Optimal Quantum Communication by Generalized Phase Shift Keying Coherent Signal [0.0]
  We consider the quantum communication with $N$-ary phase shift keying ($N$-PSK) signal for an arbitrary positive integer $N>1$. Unlike the binary case, we show that even super-Poissonianity of non-standard coherent state can improve the maximal success probability of $N$-PSK quantum communication.
  arXiv  Detail & Related papers  (2021-12-29T07:13:50Z)
• 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)
• 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)
• Quantum and Classical Data Transmission through Completely Depolarising Channels in a Superposition of Cyclic Orders [0.5735035463793007]
  We show that the ability to place N completely depolarising channels in a superposition of N alternative causal orders enables transmission of quantum information with error vanishing as 1/N. The ability to place quantum channels in a superposition of orders also leads to an increase of the classical communication capacity with N, which we rigorously prove by deriving an exact single-letter expression.
  arXiv  Detail & Related papers  (2020-05-01T21:28:00Z)
• Bosonic quantum communication across arbitrarily high loss channels [68.58838842613457]
  A general attenuator $Phi_lambda, sigma$ is a bosonic quantum channel that acts by combining the input with a fixed environment state. We show that for any arbitrary value of $lambda>0$ there exists a suitable single-mode state $sigma(lambda)$. Our result holds even when we fix an energy constraint at the input of the channel, and implies that quantum communication at a constant rate is possible even in the limit of arbitrarily low transmissivity.
  arXiv  Detail & Related papers  (2020-03-19T16:50:11Z)
• Communication Cost of Quantum Processes [49.281159740373326]
  A common scenario in distributed computing involves a client who asks a server to perform a computation on a remote computer. An important problem is to determine the minimum amount of communication needed to specify the desired computation. We analyze the total amount of (classical and quantum) communication needed by a server in order to accurately execute a quantum process chosen by a client.
  arXiv  Detail & Related papers  (2020-02-17T08:51:42Z)

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.