Shortest Path Finding in Quantum Networks With Quasi-Linear Complexity

Santos, Sara; Monteiro, Francisco A.; Coutinho, Bruno C.; Omar, Yasser

doi:10.1109/access.2023.3237997

Cited by 9 publications

(10 citation statements)

References 48 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where |φ + = ( 00| + |11 ) / √ 2 is a maximally entangled bell state, F is the fidelity of the state, and γ is the Werner parameter that relates to the fidelity as [12,17,20]…”

Section: Entanglement Propagationmentioning

confidence: 99%

“…In the rest of the paper, the term fidelity curves will be used to denote both fidelity and Werner parameter vs channel capacity, given the fact that the Werner parameter and the fidelity are linearly correlated to each other. In the following subsections, we look at that entanglement distribution rate, where we consider two distribution models: a single distribution ebit distribution model [12,17], and a flow model [11,22]. The capacity values are always between 0 and 0.5 since from Eqs.…”

Section: Entanglement Propagationmentioning

confidence: 99%

“…It is known that if a routing metric is both isotonic and monotonic, a multi-objective optimization algorithm will always converge to the set of optimal solutions [12,17,25], making it worthy to explore these two properties in detail. Monotonicity means that when a path is extended our metric will either always increase or decrease.…”

Section: Routing Metrics Isotonicity and Monotonicitymentioning

confidence: 99%

“…They proposed a polynomialtime algorithm to find both the optimal path and the optimal swapping order. Finally, Santos et al [17] proposed a multi-objective algorithm for bipartite entanglement distribution between two nodes, considering a network based on an asymptotic description of quantum-repeater-and-purification protocols [6,14], however with detail given on the specific protocol.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Entanglement Routing Based on Fidelity Curves for Quantum Photonics Channels

Coutinho¹,

Monteiro²,

Bugalho³

et al. 2023

Preprint

View full text Add to dashboard Cite

The quantum internet promises to extend entanglement correlations from nearby neighbors to any two nodes in a network. How to efficiently distribute entanglement over large-scale networks is still an open problem that greatly depends on the technology considered. In this work, we consider quantum networks composed of photonic channels characterized by a trade-off between the entanglement generation rate and fidelity. For such networks we look at the two following problems: the one of finding the best path to connect any two given nodes in the network bipartite entanglement routing, and the problem of finding the best starting node in order to connect three nodes in the network multipartite entanglement routing. We consider two entanglement distribution models: one where entangled qubit are distributed one at a time, and a flow model where a large number of entangled qubits are distributed simultaneously. We propose the use of continuous fidelity curves (i.e., entanglement generation fidelity vs rate) as the main routing metric. Combined with multi-objective path-finding algorithms, the fidelity curves describing each link allow finding a set of paths that maximize both the end-to-end fidelity and the entanglement generation rate. For the models and networks considered, we prove that the algorithm always converges to the optimal solution, and we show through simulation that its execution time grows polynomial with the number of nodes in the network. Our implementation grows with the number of nodes with a power between 1 and 1.4 depending on the network. This work paves the way for the development of path-finding algorithms for networks with complex entanglement distribution protocols, in particular for other protocols that exhibit a trade-off between generation fidelity and rate, such as repeater-and-purify protocols.

show abstract

“…where |φ + = ( 00| + |11 ) / √ 2 is a maximally entangled bell state, F is the fidelity of the state, and γ is the Werner parameter that relates to the fidelity as [12,17,20]…”

Section: Entanglement Propagationmentioning

confidence: 99%

Section: Entanglement Propagationmentioning

confidence: 99%

Section: Routing Metrics Isotonicity and Monotonicitymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Entanglement Routing Based on Fidelity Curves for Quantum Photonics Channels

Coutinho¹,

Monteiro²,

Bugalho³

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…The immediate question that arises on a quantum network is how to optimally generate bipartite entanglement between two user-nodes, as a function of the relevant metrics (fidelity, rate,...). This encompasses selecting the appropriate protocols for entanglement generation and entanglement swapping [9], and algorithms that find the optimal way to execute them over a quantum network [10][11][12][13][14][15][16].…”

Section: Introductionmentioning

confidence: 99%

Distributing Multipartite Entanglement over Noisy Quantum Networks

Bugalho

Coutinho

Monteiro

et al. 2023

Quantum

Self Cite

View full text Add to dashboard Cite

A quantum internet aims at harnessing networked quantum technologies, namely by distributing bipartite entanglement between distant nodes. However, multipartite entanglement between the nodes may empower the quantum internet for additional or better applications for communications, sensing, and computation. In this work, we present an algorithm for generating multipartite entanglement between different nodes of a quantum network with noisy quantum repeaters and imperfect quantum memories, where the links are entangled pairs. Our algorithm is optimal for GHZ states with 3 qubits, maximising simultaneously the final state fidelity and the rate of entanglement distribution. Furthermore, we determine the conditions yielding this simultaneous optimality for GHZ states with a higher number of qubits, and for other types of multipartite entanglement. Our algorithm is general also in the sense that it can optimise simultaneously arbitrary parameters. This work opens the way to optimally generate multipartite quantum correlations over noisy quantum networks, an important resource for distributed quantum technologies.

show abstract

Integration of two different road network models for emergency rescue pathfinding in indoor and outdoor environments

Zhu,

Hu,

Chen

et al. 2024

Meas. Sci. Technol.

View full text Add to dashboard Cite

The environment of buildings and outdoor transportation in urban areas is becoming increasingly complex. This poses a challenge for rescue pathfinding once an emergency occurs, which relies on the generation of road network models. To better balance efficiency and accuracy in pathfinding, a three-dimensional integrated road network model (3D-IRNM) derived from grid and topological road network models was developed in this study. Firstly, a cross-platform data loading method from BIM to Geographic Information Systems (GIS) is proposed, to serve as a data source for road network model generation and visual enhancement. Then, the topological and grid road network models are generated in indoor spaces of different functions, with IRNM obtained by the integration strategy. The 3D-IRNM can be formed by extracting indoor vertical paths from the stairs, and connecting them with the IRNM of each floor. To further combine the 3D-IRNM with outdoor environments, a CrossNode model is then proposed. Besides, an adaptive pathfinding algorithm is also proposed. Finally, the construction of an emergency path-finding system based on GIS technology is achieved. The pathfinding algorithm and the structure of 3D-IRNM helps the pathfinding both efficiency and accuracy. The practicability of the designed 3D-IRNM together with its pathfinding algorithm is well verified.

show abstract

Shortest Path Finding in Quantum Networks With Quasi-Linear Complexity

Cited by 9 publications

References 48 publications

Entanglement Routing Based on Fidelity Curves for Quantum Photonics Channels

Entanglement Routing Based on Fidelity Curves for Quantum Photonics Channels

Distributing Multipartite Entanglement over Noisy Quantum Networks

Integration of two different road network models for emergency rescue pathfinding in indoor and outdoor environments

Contact Info

Product

Resources

About