Requirements for upgrading trusted nodes to a repeater chain over 900 km of optical fiber

• URL: http://arxiv.org/abs/2303.03234v1
• Date: Mon, 6 Mar 2023 15:51:19 GMT
• Title: Requirements for upgrading trusted nodes to a repeater chain over 900 km of optical fiber
• Authors: Francisco Ferreira da Silva and Guus Avis and Joshua A. Slater and Stephanie Wehner
• Abstract summary: We study the distribution of entanglement on a real-world fiber grid connecting the German cities of Bonn and Berlin. We find that requirements for blind quantum computing are markedly different than those for quantum key distribution.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We perform a numerical study of the distribution of entanglement on a real-world fiber grid connecting the German cities of Bonn and Berlin. The connection is realized using a chain of processing-node quantum repeaters spanning roughly 900 kilometers. We investigate how minimal hardware requirements depend on the target application, as well as on the number of repeaters in the chain. We find that requirements for blind quantum computing are markedly different than those for quantum key distribution, with the required coherence time being around two and a half times larger for the former. Further, we observe a trade-off regarding how target secret-key rates are achieved when using different numbers of repeaters: comparatively low-quality entangled states generated at a high rate are preferred for higher numbers of repeaters, whereas comparatively high-quality states generated at a lower rate are favored for lower numbers of repeaters. To obtain our results we employ an extensive simulation framework implemented using NetSquid, a discrete-event simulator for quantum networks. These are combined with an optimization methodology based on genetic algorithms to determine minimal hardware requirements.

Related papers

• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• 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)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• Entangled Pair Resource Allocation under Uncertain Fidelity Requirements [59.83361663430336]
  In quantum networks, effective entanglement routing facilitates communication between quantum source and quantum destination nodes. We propose a resource allocation model for entangled pairs and an entanglement routing model with a fidelity guarantee. Our proposed model can reduce the total cost by at least 20% compared to the baseline model.
  arXiv  Detail & Related papers  (2023-04-10T07:16:51Z)
• Requirements for a processing-node quantum repeater on a real-world fiber grid [0.4547191277076407]
  We numerically study the distribution of entanglement between the Dutch cities of Delft and Eindhoven realized with a processing-node quantum repeater. We find minimal hardware requirements by solving an optimization problem using genetic algorithms on a high-performance-computing cluster.
  arXiv  Detail & Related papers  (2022-07-21T16:17:38Z)
• Optimizing Tensor Network Contraction Using Reinforcement Learning [86.05566365115729]
  We propose a Reinforcement Learning (RL) approach combined with Graph Neural Networks (GNN) to address the contraction ordering problem. The problem is extremely challenging due to the huge search space, the heavy-tailed reward distribution, and the challenging credit assignment. We show how a carefully implemented RL-agent that uses a GNN as the basic policy construct can address these challenges.
  arXiv  Detail & Related papers  (2022-04-18T21:45:13Z)
• 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)
• Entanglement Distribution in Multi-Platform Buffered-Router-Assisted Frequency-Multiplexed Automated Repeater Chains [0.0]
  We propose a quantum network architecture based on quantum processing devices based on NV$-$ colour centers. Long-distance entanglement distribution is enabled by spectrally-multiplexed quantum repeaters based on rare-earth ion-doped crystals and imperfect entangled photon-pair sources.
  arXiv  Detail & Related papers  (2021-06-08T20:25:43Z)
• Multiplexed quantum repeaters based on dual-species trapped-ion systems [0.8819673391477034]
  Trapped ions form an advanced technology platform for quantum information processing with long qubit coherence times. These traits make them attractive not only for quantum computing but also for quantum networking. Dedicated, special-purpose trapped-ion processors in conjunction with suitable interconnecting hardware can be used to form quantum repeaters.
  arXiv  Detail & Related papers  (2021-05-14T08:35:41Z)
• Optimizing Entanglement Generation and Distribution Using Genetic Algorithms [0.640476282000118]
  Long-distance quantum communication via entanglement distribution is of great importance for the quantum internet. Quantum repeaters could in theory be used to extend the distances over which entanglement can be distributed, but in practice hardware quality is still lacking. We propose a methodology based on genetic algorithms and simulations of quantum repeater chains for optimization of entanglement generation and distribution.
  arXiv  Detail & Related papers  (2020-10-30T17:09:34Z)
• Quantum repeaters in space [0.0]
  Long-distance entanglement is a very precious resource, but its distribution is difficult due to the exponential losses of light in optical fibres. We propose to combine quantum repeaters and satellite-based links, into a scheme that allows to achieve entanglement distribution over global distances. The integration of satellite-based links with ground repeater networks can be envisaged to represent the backbone of the future Quantum Internet.
  arXiv  Detail & Related papers  (2020-05-20T15:43:42Z)

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.