Entanglement Routing using Quantum Error Correction for Distillation

• URL: http://arxiv.org/abs/2405.00849v1
• Date: Wed, 1 May 2024 20:25:36 GMT
• Title: Entanglement Routing using Quantum Error Correction for Distillation
• Authors: Ashlesha Patil, Michele Pacenti, Bane Vasić, Saikat Guha, Narayanan Rengaswamy,
• Abstract summary: Bell-state measurement (BSM) on entangled states shared between quantum repeaters is the fundamental operation used to route entanglement in quantum networks. We use quantum error correcting codes (QECCs) for emphdeterministic entanglement distillation to route Werner states on a chain of repeaters.
• Score: 2.26958010283863
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Bell-state measurement (BSM) on entangled states shared between quantum repeaters is the fundamental operation used to route entanglement in quantum networks. Performing BSMs on Werner states shared between repeaters leads to exponential decay in the fidelity of the end-to-end Werner state with the number of repeaters, necessitating entanglement distillation. Generally, entanglement routing protocols use \emph{probabilistic} distillation techniques based on local operations and classical communication. In this work, we use quantum error correcting codes (QECCs) for \emph{deterministic} entanglement distillation to route Werner states on a chain of repeaters. To maximize the end-to-end distillable entanglement, which depends on the number and fidelity of end-to-end Bell pairs, we utilize global link-state knowledge to determine the optimal policy for scheduling distillation and BSMs at the repeaters. We analyze the effect of the QECC's properties on the entanglement rate and the number of quantum memories. We observe that low-rate codes produce high-fidelity end-to-end states owing to their excellent error-correcting capability, whereas high-rate codes yield a larger number of end-to-end states but of lower fidelity. The number of quantum memories used at repeaters increases with the code rate as well as the classical computation time of the QECC's decoder.

Related papers

• Bosonic quantum error correction with microwave cavities for quantum repeaters [0.0]
  We provide a theoretical analysis of the secret key rates for a quantum repeater system incorporating bosonic error correction and memory components. We discuss a physical implementation of such a quantum repeater comprising a microwave cavity and a superconducting transmon.
  arXiv  Detail & Related papers  (2025-03-27T14:50:57Z)
• Measurement-Based Entanglement Distillation and Constant-Rate Quantum Repeaters over Arbitrary Distances [3.496737164472548]
  Measurement-based quantum repeaters employ entanglement distillation and swapping across links. We introduce a systematic protocol for measurement-based entanglement distillation and its application to repeaters that can leverage any stabilizer code. This work establishes a scalable backbone for future global-scale fault-tolerant quantum networks.
  arXiv  Detail & Related papers  (2025-02-16T15:53:09Z)
• Continuous-Variable Multiplexed Quantum Repeater Networks [0.0]
  We propose a quantum repeater protocol based on cat codes with a few quantum memories or graph states as additional resources. This allows us to considerably increase the secret key rate by several orders of magnitude.
  arXiv  Detail & Related papers  (2024-11-22T06:27:30Z)
• Correction of circuit faults in a stacked quantum memory using rank-metric codes [13.996171129586733]
  We introduce a model for a stacked quantum memory made with multi-qubit cells. We design quantum error correction codes for this model by generalizing rank-metric codes to the quantum setting.
  arXiv  Detail & Related papers  (2024-11-14T04:19:40Z)
• Quantum repeaters based on stationary Gottesman-Kitaev-Preskill qubits [0.0]
  We consider the bosonic Gottesman-Kitaev-Preskill (GKP) code as a natural choice for a loss-correction-based quantum repeater. We analyze and assess the performance of such a GKP-based quantum repeater where, apart from the initial state generations and distributions, all operations can be performed via deterministic linear mode transformations.
  arXiv  Detail & Related papers  (2024-06-11T11:04:49Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Performance of Rotation-Symmetric Bosonic Codes in a Quantum Repeater Network [0.0]
  Quantum error correction codes based on continuous variables play an important role for the implementation of quantum communication systems. A natural application of such codes occurs within quantum repeater systems which are used to combat severe channel losses and local gate errors. Here we consider a cavity-QED based repeater scheme to address the losses in the quantum channel.
  arXiv  Detail & Related papers  (2023-08-30T07:39:11Z)
• Entanglement Distribution in Quantum Repeater with Purification and Optimized Buffer Time [53.56179714852967]
  We explore entanglement distribution using quantum repeaters with optimized buffer time. We observe that increasing the number of memories on end nodes leads to a higher entanglement distribution rate per memory. When imperfect operations are considered, however, we make the surprising observation that the per-memory entanglement rate decreases with increasing number of memories.
  arXiv  Detail & Related papers  (2023-05-23T23:23:34Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• All-photonic one-way quantum repeaters [15.3862808585761]
  We propose a general framework for all-photonic one-way quantum repeaters based on the measurement-based error correction. We present a novel decoding scheme, where the error correction process is carried out at the destination based on the accumulated data from the measurements made across the network.
  arXiv  Detail & Related papers  (2022-10-18T18:07:19Z)
• 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)
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
  We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
  arXiv  Detail & Related papers  (2021-09-26T07:29:54Z)
• Entanglement purification by counting and locating errors with entangling measurements [62.997667081978825]
  We consider entanglement purification protocols for multiple copies of qubit states. We use high-dimensional auxiliary entangled systems to learn about number and positions of errors in the noisy ensemble.
  arXiv  Detail & Related papers  (2020-11-13T19:02:33Z)
• 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.