Quantum aggregation with temporal delay

• URL: http://arxiv.org/abs/2404.03262v1
• Date: Thu, 4 Apr 2024 07:35:39 GMT
• Title: Quantum aggregation with temporal delay
• Authors: Nicolò Lo Piparo, William J. Munro, Kae Nemoto,
• Abstract summary: We explore the effects of a depolarization channel that occurs for the quantum Reed-Solomon code when quantum aggregation involving different channel lengths is used. Our results will have a significant impact on the ways physical resources are distributed across a quantum network.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Advanced quantum networking systems rely on efficient quantum error correction codes for their optimal realization. The rate at which the encoded information is transmitted is a fundamental limit that affects the performance of such systems. Quantum aggregation allows one to increase the transmission rate by adding multiple paths connecting two distant users. Aggregating channels of different paths allows more users to simultaneously exchange the encoded information. Recent work has shown that quantum aggregation can also reduce the number of physical resources of an error correction code when it is combined with the quantum multiplexing technique. However, the different channel lengths across the various paths means some of the encoded quantum information will arrive earlier than others and it must be stored in quantum memories. The information stored will then deteriorate due to decoherence processes leading to detrimental effects for the fidelity of the final quantum state. Here, we explore the effects of a depolarization channel that occurs for the quantum Reed-Solomon code when quantum aggregation involving different channel lengths is used. We determine the best distribution of resources among the various channels connecting two remote users. Further we estimate the coherence time required to achieve a certain fidelity. Our results will have a significant impact on the ways physical resources are distributed across a quantum network.

Related papers

• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• Quantum channel correction outperforming direct transmission [0.0]
  Long-distance optical quantum channels are necessarily lossy. Quantum states carrying information in the channel can be probabilistically amplified to compensate for loss, but are destroyed when amplification fails. We perform distillation by heralded amplification to improve a noisy entanglement channel. We employ entanglement swapping to demonstrate that arbitrary quantum information transmission is unconditionally improved.
  arXiv  Detail & Related papers  (2024-06-07T06:09:26Z)
• Entanglement swapping via lossy channels using photon-number-encoded states [0.33459832796735894]
  Entanglement shared between distant parties is a key resource in quantum networks. Quantum repeaters using entanglement swapping can mitigate this effect, but usually require high-performance photonic quantum memories. We use photon-number-encoded states that can effectively alleviate quantum channel losses without requiring photonic quantum memories.
  arXiv  Detail & Related papers  (2024-05-07T02:17:34Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• 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)
• 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)
• Testing a Quantum Error-Correcting Code on Various Platforms [5.0745290104790035]
  We propose a simple quantum error-correcting code for the detected amplitude damping channel. We implement the encoding, the channel, and the recovery on an optical platform, the IBM Q System, and a nuclear magnetic resonance system.
  arXiv  Detail & Related papers  (2020-01-22T13:15:16Z)

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.