Effects of Different Q-swaps Modes on Percolation Threshold in Small-world Quantum Networks

• URL: http://arxiv.org/abs/2401.11862v1
• Date: Mon, 22 Jan 2024 11:30:22 GMT
• Title: Effects of Different Q-swaps Modes on Percolation Threshold in Small-world Quantum Networks
• Authors: JianXiong Liang, Xiaoguang Chen, and Yaoyao Wang
• Abstract summary: We show that Quantum Entanglement Percolation (QEP) has a better percolation performance than Classical Entanglement Percolation (CEP) We also introduce quantum walk as a new scheme to have an extra reduction in the percolation threshold.
• Score: 2.228665992307317
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum networks are interconnected by nodes, between singlets which are formed to ensure the successful transmission of information with a probability of 1. However, in real quantum networks, nodes often share a partially entangled state instead of a singlet due to factors such as environmental noise. Therefore, it is necessary to convert the partially entangled state into a singlet for efficient communication. Percolation happens during the conversion of connected edges in the whole network. As a result, when the singlet conversion probability (SCP) is greater than the percolation threshold, a giant interconnected cluster that meets the basic requirements of communication will appear in the network. The percolation threshold of the network reveals the minimum resources required to carry out large scale quantum communication. In this paper, we investigate the effect of different q-swaps on the percolation threshold in quantum entanglement percolation of small world networks. We show that Quantum Entanglement Percolation (QEP) has a better percolation performance than Classical Entanglement Percolation (CEP). By using different q swaps in Watts Strogatz (WS) small world networks and Kleinberg networks for simulation, we also show that the percolation threshold is minimized when SCP is equal to the average degree of the network. Furthermore, we introduce quantum walk as a new scheme to have an extra reduction in the percolation threshold.

Related papers

• 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)
• Quantum Networks Enhanced by Distributed Quantum Memories [0.0]
  We show that a network-wide synergistic usage of quantum memories distributed in a quantum communication network offers a fundamental advantage. We first map the problem of quantum communication with local usage of memories into a classical continuum percolation model. This improved mapping can be formulated in terms of graph-merging rules, analogous to the decimation rules of the renormalization group treatment of disordered quantum magnets.
  arXiv  Detail & Related papers  (2024-03-25T02:16:25Z)
• 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)
• Secure and Efficient Entanglement Distribution Protocol for Near-Term Quantum Internet [1.7562083088615124]
  This paper introduces a protocol to distribute entanglements among quantum devices within classical-quantum networks with limited quantum links. The proposed protocol uses entanglement swapping to distribute entanglements efficiently in a butterfly network. We also propose a protocol for securing entanglement distribution against malicious entanglements using quantum state encoding through rotation.
  arXiv  Detail & Related papers  (2023-12-10T05:38:40Z)
• Networking quantum networks with minimum cost aggregation [0.0]
  A quantum internet holds promise for achieving distributed quantum sensing and large-scale quantum computer networks. We present a practical recipe on how to aggregate quantum networks with arbitrary topology. This recipe forms the basis of designing a quantum internet protocol for networking self-organizing quantum networks.
  arXiv  Detail & Related papers  (2023-04-18T11:52:21Z)
• 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)
• 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)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Quantum Federated Learning with Quantum Data [87.49715898878858]
  Quantum machine learning (QML) has emerged as a promising field that leans on the developments in quantum computing to explore large complex machine learning problems. This paper proposes the first fully quantum federated learning framework that can operate over quantum data and, thus, share the learning of quantum circuit parameters in a decentralized manner.
  arXiv  Detail & Related papers  (2021-05-30T12:19:27Z)
• Entanglement Rate Optimization in Heterogeneous Quantum Communication Networks [79.8886946157912]
  Quantum communication networks are emerging as a promising technology that could constitute a key building block in future communication networks in the 6G era and beyond. Recent advances led to the deployment of small- and large-scale quantum communication networks with real quantum hardware. In quantum networks, entanglement is a key resource that allows for data transmission between different nodes.
  arXiv  Detail & Related papers  (2021-05-30T11:34:23Z)
• Concurrence Percolation in Quantum Networks [3.52359746858894]
  We introduce a new statistical theory, concurrence percolation theory (ConPT) We find that the entanglement transmission threshold predicted by ConPT is lower than the known classical-percolation-based results. ConPT also shows a percolation-like universal critical behavior derived by finite-size analysis on the Bethe lattice.
  arXiv  Detail & Related papers  (2021-03-25T17:14:48Z)

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.