Quantum and Classical Data Transmission through Completely Depolarising Channels in a Superposition of Cyclic Orders

• URL: http://arxiv.org/abs/2005.00618v5
• Date: Thu, 7 Oct 2021 02:14:33 GMT
• Title: Quantum and Classical Data Transmission through Completely Depolarising Channels in a Superposition of Cyclic Orders
• Authors: Giulio Chiribella, Matt Wilson, and H. F. Chau
• Abstract summary: 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.
• Score: 0.5735035463793007
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Completely depolarising channels are often regarded as the prototype of physical processes that are useless for communication: any message that passes through them along a well-defined trajectory is completely erased. When two such channels are used in a quantum superposition of two alternative orders, they become able to transmit some amount of classical information, but still no quantum information can pass through them. Here we show that the ability to place N completely depolarising channels in a superposition of N alternative causal orders enables a high-fidelity, heralded transmission of quantum information with error vanishing as 1/N. This phenomenon highlights a fundamental difference with the N = 2 case, where completely depolarising channels are unable to transmit quantum data, even when placed in a superposition of causal orders. 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. Our results highlight the more complex patterns of correlations arising from multiple causal orders, which are similar to the more complex patterns of entanglement arising in multipartite quantum systems.

Related papers

• Unextendible entanglement of quantum channels [4.079147243688764]
  We study the ability of quantum channels to perform quantum communication tasks. A quantum channel can distill a highly entangled state between two parties. We generalize the formalism of $k$-extendibility to bipartite superchannels.
  arXiv  Detail & Related papers  (2024-07-22T18:00:17Z)
• Normal quantum channels and Markovian correlated two-qubit quantum errors [77.34726150561087]
  We study general normally'' distributed random unitary transformations. On the one hand, a normal distribution induces a unital quantum channel. On the other hand, the diffusive random walk defines a unital quantum process.
  arXiv  Detail & Related papers  (2023-07-25T15:33:28Z)
• Entanglement Distribution and Quantum Teleportation in Higher Dimension over the Superposition of Causal Orders of Quantum Channels [13.359442837017202]
  We develop and formulate the theoretical framework for transmission of classical information through entanglement distribution of qudits over two quantum channels. Results show that entanglement distribution of a qudit provides a considerable gain in fidelity even with increase in noise.
  arXiv  Detail & Related papers  (2023-03-19T15:06:24Z)
• Exact solution for the quantum and private capacities of bosonic dephasing channels [10.787390511207686]
  We provide the first exact calculation of the quantum, private, two-way assisted quantum, and secret-key capacities of bosonic dephasing channels.
  arXiv  Detail & Related papers  (2022-05-11T19:12:12Z)
• Multipartite entanglement to boost superadditivity of coherent information in quantum communication lines with polarization dependent losses [0.0]
  We show that in the limit of the infinite number of channel uses the superadditivity phenomenon takes place whenever the channel is neither degradable nor antidegradable. We also provide a method how to modify the proposed states and get a higher quantum communication rate by doubling the number of channel uses.
  arXiv  Detail & Related papers  (2021-09-08T12:24:44Z)
• 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)
• Quantum information spreading in a disordered quantum walk [50.591267188664666]
  We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern. We focus on the coherent static and dynamic disorder to investigate anomalous and classical transport. Our results show that a Quantum Walk can be considered as a readout device of information about defects and perturbations occurring in complex networks.
  arXiv  Detail & Related papers  (2020-10-20T20:03:19Z)
• 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)
• Aggregating Quantum Networks [0.0]
  Single packets of information can now be split and transmitted in a coherent way over different routes. This aggregation allows information to be transmitted in a fault tolerant way between different parts of the quantum network. It is a quantum phenomenon not available in conventional telecommunication networks either.
  arXiv  Detail & Related papers  (2020-08-10T01:53:10Z)

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.