Percolation thresholds and connectivity in quantum networks

• URL: http://arxiv.org/abs/2502.17191v1
• Date: Mon, 24 Feb 2025 14:26:09 GMT
• Title: Percolation thresholds and connectivity in quantum networks
• Authors: Andrea De Girolamo, Giuseppe Magnifico, Cosmo Lupo,
• Abstract summary: We study entanglement percolation in qubit-based planar quantum network models.<n>We develop an algorithm designed to find a sequence of entanglement swapping and distillation operations.<n>We find distinct regimes of quantum percolation, which are clearly separated by the percolation thresholds of the employed strategies.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study entanglement percolation in qubit-based planar quantum network models of arbitrary topology, where neighboring nodes are initially connected by pure states with quenched disorder in their entanglement. To address this, we develop a physics-informed heuristic algorithm designed to find a sequence of entanglement swapping and distillation operations to connect any pair of distant nodes. The algorithm combines locally optimal percolation strategies between nodes at a maximum distance of one swapping operation. If this fails to produce a maximally entangled state, it looks for alternative paths surrounding intermediate states within the process. We analytically find and numerically verify thresholds in quantum percolation, which depend on the initial network configuration and entanglement, and are associated with specific percolation strategies. We classify these strategies based on the connectivity, a quantity that relates the entanglement in the final state and the level of integrity of the network at the end of the process. We find distinct regimes of quantum percolation, which are clearly separated by the percolation thresholds of the employed strategies and vastly vary according to the network topology.

Related papers

• Routing in Quantum Networks with End-to-End Knowledge [10.955844285189373]
  We introduce an approach that facilitates the establishment of paths capable of delivering end-to-end fidelity above a specified threshold.<n>In this study, we define algorithms that are specific instances of this approach and evaluate them in comparison to Dijkstra shortest path algorithm and a fully knowledge-aware algorithm.<n>Our results demonstrate that one of the proposed algorithms consistently outperforms the other methods in delivering paths above the fidelity threshold.
  arXiv  Detail & Related papers  (2024-07-19T15:34:51Z)
• 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)
• Distributed Partial Quantum Consensus of Qubit Networks with Connected Topologies [13.978557505365604]
  Two partial quantum consensus protocols, based on the Lyapunov method for chain graphs and the geometry method for connected graphs, are proposed. The numerical simulation over a qubit network is demonstrated to verify the validity and the effectiveness of the theoretical results.
  arXiv  Detail & Related papers  (2024-02-22T03:44:45Z)
• Influence of noise in entanglement-based quantum networks [0.0]
  We consider entanglement-based quantum networks, where multipartite entangled resource states are distributed and stored among the nodes. We study the influence of noise in this process, where we consider imperfections in state preparation, memories, and measurements. We find that in large networks, high-dimensional cluster states are favorable and lead to a significantly higher target state fidelity.
  arXiv  Detail & Related papers  (2023-05-05T18:00:06Z)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• Efficient Estimation for Longitudinal Networks via Adaptive Merging [21.62069959992736]
  We propose an efficient estimation framework for longitudinal network, leveraging strengths of adaptive network merging, tensor decomposition and point process. It merges neighboring sparse networks so as to enlarge the number of observed edges and reduce estimation variance. A projected descent algorithm is proposed to facilitate estimation, where upper bound of the estimation error in each iteration is established.
  arXiv  Detail & Related papers  (2022-11-15T03:17:11Z)
• Multiparty Entanglement Routing in Quantum Networks [0.0]
  A protocol is proposed for extracting maximally entangled (GHZn) states for any number of parties in quantum networks. The protocol only requires local measurements at the network nodes and just a single qubit memory per user.
  arXiv  Detail & Related papers  (2022-11-12T15:40:34Z)
• Optimal quantum control via genetic algorithms for quantum state engineering in driven-resonator mediated networks [68.8204255655161]
  We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator. We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
  arXiv  Detail & Related papers  (2022-06-29T14:34:00Z)
• A Quantum Optimal Control Problem with State Constrained Preserving Coherence [68.8204255655161]
  We consider a three-level $Lambda$-type atom subjected to Markovian decoherence characterized by non-unital decoherence channels. We formulate the quantum optimal control problem with state constraints where the decoherence level remains within a pre-defined bound.
  arXiv  Detail & Related papers  (2022-03-24T21:31:34Z)
• Quantum Causal Unravelling [44.356294905844834]
  We develop the first efficient method for unravelling the causal structure of the interactions in a multipartite quantum process. Our algorithms can be used to identify processes that can be characterized efficiently with the technique of quantum process tomography.
  arXiv  Detail & Related papers  (2021-09-27T16:28:06Z)
• Optimized Quantum Networks [68.8204255655161]
  Quantum networks offer the possibility to generate different kinds of entanglement prior to network requests. We utilize this to design entanglement-based quantum networks tailored to their desired functionality.
  arXiv  Detail & Related papers  (2021-07-21T18:00:07Z)
• Purification and Entanglement Routing on Quantum Networks [55.41644538483948]
  A quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We introduce effectives enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network.
  arXiv  Detail & Related papers  (2020-11-23T19:00:01Z)
• Policies for elementary links in a quantum network [0.0]
  An important problem, especially for near-term quantum networks, is to develop optimal entanglement distribution protocols. We address this problem by initiating the study of quantum network protocols for entanglement distribution using the theory of decision processes. We show that the previously-studied memory-cutoff protocol can be phrased as a policy within our decision process framework.
  arXiv  Detail & Related papers  (2020-07-07T04:10:41Z)

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.