Optimistic Entanglement Purification in Quantum Networks

• URL: http://arxiv.org/abs/2401.08034v1
• Date: Tue, 16 Jan 2024 01:08:17 GMT
• Title: Optimistic Entanglement Purification in Quantum Networks
• Authors: Mohammad Mobayenjarihani, Gayane Vardoyan, Don Towsley
• Abstract summary: Noise and photon loss encountered on quantum channels pose a major challenge for reliable entanglement generation in quantum networks. In near-term networks, heralding is required to inform endpoints of successfully generated entanglement. We apply optimism to the entanglement pumping scheme, ground- and satellite-based EPR generation sources, and current state-of-the-art purification circuits.
• Score: 11.511763058777259
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Noise and photon loss encountered on quantum channels pose a major challenge for reliable entanglement generation in quantum networks. In near-term networks, heralding is required to inform endpoints of successfully generated entanglement. If after heralding, entanglement fidelity is too low, entanglement purification can be utilized to probabilistically increase fidelity. Traditionally, purification protocols proceed as follows: generate heralded EPR pairs, execute a series of quantum operations on two or more pairs between two nodes, and classically communicate results to check for success. Purification may require several rounds while qubits are stored in memories, vulnerable to decoherence. In this work, we explore the notion of optimistic purification in a single link setup, wherein classical communication required for heralding and purification is delayed, possibly to the end of the process. Optimism reduces the overall time EPR pairs are stored in memory. While this is beneficial for fidelity, it can result in lower rates due to the continued execution of protocols with sparser heralding and purification outcome updates. We apply optimism to the entanglement pumping scheme, ground- and satellite-based EPR generation sources, and current state-of-the-art purification circuits. We evaluate sensitivity performance to a number of parameters including link length, EPR source rate and fidelity, and memory coherence time. We observe that our optimistic protocols are able to increase fidelity, while the traditional approach becomes detrimental to it for long distances. We study the trade-off between rate and fidelity under entanglement-based QKD, and find that optimistic schemes can yield higher rates compared to non-optimistic counterparts, with most advantages seen in scenarios with low initial fidelity and short coherence times.

Related papers

• Optimized Generation of Entanglement by Real-Time Ordering of Swapping Operations [4.152766500389854]
  Long-distance quantum communication in quantum networks faces significant challenges due to the constraints imposed by the no-cloning theorem. Most existing quantum communication protocols rely on the a priori distribution of entanglement pairs (EPs) We present a greedy algorithm that iteratively determines the best route and/or entanglement-swapping operation to perform at each stage based on the current network.
  arXiv  Detail & Related papers  (2024-05-13T06:43:11Z)
• Analysis of Asynchronous Protocols for Entanglement Distribution in Quantum Networks [9.971549076128268]
  We explore two minimal asynchronous protocols for entanglement in quantum networks. A parallel scheme generating entanglement independently at the link level, and a sequential scheme extending entanglement iteratively from one party to the other. Our findings suggest the sequential scheme's superiority due to comparable performance with the parallel scheme, coupled with simpler implementation.
  arXiv  Detail & Related papers  (2024-05-03T18:04:11Z)
• Entanglement buffering with two quantum memories [0.0]
  Quantum networks crucially rely on the availability of high-quality entangled pairs of qubits, known as entangled links. Maintaining the quality of these links is a challenging task due to the presence of time-dependent noise. Entanglement purification protocols offer a solution by converting multiple low-quality entangled states into a smaller number of higher-quality ones.
  arXiv  Detail & Related papers  (2023-11-16T17:46:00Z)
• On the Fidelity Distribution of Link-level Entanglements under Purification [3.5957268592786966]
  Link-level Einstein-Podolsky-Rosen (EPR) pairs may be continuously generated and stored in a few quantum memories. A major challenge is that qubits suffer from unavoidable noise due to their interaction with the environment. We show the probability distribution of the fidelity of stored link-level EPR pairs in a system with two quantum memories at each node.
  arXiv  Detail & Related papers  (2023-10-27T15:16:19Z)
• Enhancing Dispersive Readout of Superconducting Qubits Through Dynamic Control of the Dispersive Shift: Experiment and Theory [47.00474212574662]
  A superconducting qubit is coupled to a large-bandwidth readout resonator. We show a beyond-state-of-the-art two-state-readout error of only 0.25,%$ in 100 ns integration time. The presented results are expected to further boost the performance of new and existing algorithms and protocols.
  arXiv  Detail & Related papers  (2023-07-15T10:30:10Z)
• 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)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Entanglement-assisted entanglement purification [62.997667081978825]
  We present a new class of entanglement-assisted entanglement purification protocols that can generate high-fidelity entanglement from noisy, finite-size ensembles. Our protocols can deal with arbitrary errors, but are best suited for few errors, and work particularly well for decay noise.
  arXiv  Detail & Related papers  (2020-11-13T19:00:05Z)
• Progressive Skeletonization: Trimming more fat from a network at initialization [76.11947969140608]
  We propose an objective to find a skeletonized network with maximum connection sensitivity. We then propose two approximate procedures to maximize our objective. Our approach provides remarkably improved performance on higher pruning levels.
  arXiv  Detail & Related papers  (2020-06-16T11:32:47Z)
• Efficient optimization of cut-offs in quantum repeater chains [0.0]
  We develop an algorithm for computing the probability distribution of the waiting time and fidelity of entanglement produced by repeater chain protocols. We use the algorithm to optimize cut-offs in order to maximize secret-key rate between the end nodes of the repeater chain.
  arXiv  Detail & Related papers  (2020-05-11T09:17:21Z)

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.