Entanglement Distribution in the Quantum Internet: Knowing when to Stop!

• URL: http://arxiv.org/abs/2307.05123v2
• Date: Wed, 24 Jan 2024 20:27:15 GMT
• Title: Entanglement Distribution in the Quantum Internet: Knowing when to Stop!
• Authors: Angela Sara Cacciapuoti, Jessica Illiano, Michele Viscardi, Marcello Caleffi
• Abstract summary: Entanglement distribution is a key functionality of the Quantum Internet. This paper develops a theoretical framework, able to capture the quantum noise effects.
• Score: 8.124633573706763
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Entanglement distribution is a key functionality of the Quantum Internet. However, quantum entanglement is very fragile, easily degraded by decoherence, which strictly constraints the time horizon within the distribution has to be completed. This, coupled with the quantum noise irremediably impinging on the channels utilized for entanglement distribution, may imply the need to attempt the distribution process multiple times before the targeted network nodes successfully share the desired entangled state. And there is no guarantee that this is accomplished within the time horizon dictated by the coherence times. As a consequence, in noisy scenarios requiring multiple distribution attempts, it may be convenient to stop the distribution process early. In this paper, we take steps in the direction of knowing when to stop the entanglement distribution by developing a theoretical framework, able to capture the quantum noise effects. Specifically, we first prove that the entanglement distribution process can be modeled as a Markov decision process. Then, we prove that the optimal decision policy exhibits attractive features, which we exploit to reduce the computational complexity. The developed framework provides quantum network designers with flexible tools to optimally engineer the design parameters of the entanglement distribution process.

Related papers

• Optimizing entanglement distribution via noisy quantum channels [44.99833362998488]
  Entanglement distribution is a crucial problem in quantum information science.<n>We investigate strategies for distributing quantum entanglement between two distant parties through noisy quantum channels.
  arXiv  Detail & Related papers  (2025-06-06T13:48:20Z)
• High-rate discrete-modulated continuous-variable quantum key distribution with composable security [17.348175817014234]
  We report a discrete-modulated continuous-variable quantum key distribution system with a composable secret key rate of 18.93 Mbps against collective attacks over a 25 km fiber channel. This record breaking rate is achieved through the probability shaped 16QAM-modulated protocol, which employs semidefinite programming to ensure its composable security.
  arXiv  Detail & Related papers  (2025-03-19T03:59:19Z)
• High-rate discrete-modulated continuous-variable quantum key distribution with composable security [17.348175817014234]
  We report a continuous-variable quantum key distribution system with a composable secret key rate of 18.93 Mbps against collective attacks over a 25 km fiber channel. This record-breaking rate is achieved through the probability shaped 16QAM-modulated protocol, which employs semidefinite programming to ensure its composable security.
  arXiv  Detail & Related papers  (2025-03-14T14:21:08Z)
• Pushing Boundaries: Quantum-Enhanced Leader Election and the Limits of Consensus [1.931746645731674]
  We show that quantum entanglement does not bypass the Fischer-Lynch-Paterson (FLP) impossibility theorem in asynchronous networks. We develop a leader election algorithm as a proof of concept, demonstrating how entanglement can enhance efficiency while still contending with asynchronous delays.
  arXiv  Detail & Related papers  (2024-11-07T11:29:04Z)
• Quantum Advantage in Distributed Sensing with Noisy Quantum Networks [37.23288214515363]
  We show that quantum advantage in distributed sensing can be achieved with noisy quantum networks. We show that while entanglement is needed for this quantum advantage, genuine multipartite entanglement is generally unnecessary.
  arXiv  Detail & Related papers  (2024-09-25T16:55:07Z)
• Simple loss-tolerant protocol for GHZ-state distribution in a quantum network [0.0]
  We propose a simple loss-tolerant protocol for the Greenberger-Horne-Zeilinger state distribution. Our protocol does not use quantum repeaters and is achievable with current quantum optics technology.
  arXiv  Detail & Related papers  (2024-04-30T11:16:37Z)
• 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)
• A New Initial Distribution for Quantum Generative Adversarial Networks to Load Probability Distributions [4.043200001974071]
  We propose a novel method for generating an initial distribution that improves the learning efficiency of qGANs. Our method uses the classical process of label replacement to generate various probability distributions in shallow quantum circuits.
  arXiv  Detail & Related papers  (2023-06-21T14:33:35Z)
• 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)
• Scaling Limits of Quantum Repeater Networks [62.75241407271626]
  Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing. Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability. In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
  arXiv  Detail & Related papers  (2023-05-15T14:57:01Z)
• The Quantum Internet: an Efficient Stabilizer states Distribution Scheme [0.0]
  Quantum networks constitute a major part of quantum technologies. They will boost quantum computing drastically by providing a scalable modular architecture of quantum chips. They will provide the backbone of the future quantum internet, allowing for high margins of security.
  arXiv  Detail & Related papers  (2023-05-04T08:53:38Z)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• Cluster-Promoting Quantization with Bit-Drop for Minimizing Network Quantization Loss [61.26793005355441]
  Cluster-Promoting Quantization (CPQ) finds the optimal quantization grids for neural networks. DropBits is a new bit-drop technique that revises the standard dropout regularization to randomly drop bits instead of neurons. We experimentally validate our method on various benchmark datasets and network architectures.
  arXiv  Detail & Related papers  (2021-09-05T15:15:07Z)
• 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)

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.