Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

SPIE Quantum Information Science, Sensing, and Computation

A Poisson model for entanglement optimization in the quantum internet

László Gyöngyösi, Sándor Imre

Published May 14, 2018• 1 citation
Publisher

Abstract

A Poisson model for entanglement optimization in quantum repeater networks is defined in this paper. The optimization framework fuses the fundamental concepts of quantum Shannon theory with the theory of evolutionary algorithms and seismic wave propagations in nature. The optimization model aims to maximize the entanglement fidelity and relative entropy of entanglement for all entangled connections of the quantum network. The cost functions are subject of a minimization defined to cover and integrate the physical attributes of entanglement transmission, purification, and storage of entanglement in quantum memories. The method can be implemented with low complexity that allows a straightforward application in future quantum Internet and quantum networking scenarios.

DOI
10.1117/12.2309416

Related papers

A Poisson Model for Entanglement Optimization in the Quantum Internet

László Gyöngyösi, Sándor Imre

We define a nature-inspired model for entanglement optimization in the quantum Internet. The optimization model aims to maximize the entanglement fidelity and relative entropy of entanglement for the entangled connections of the entangled network structure of the quantum Internet. The cost functions are subject of a minimization defined to cover and integrate the physical attributes of entanglement transmission, purification, and storage of entanglement in quantum memories. The method can be implemented with low complexity that allows a straightforward application in the quantum Internet and quantum networking scenarios.

arXiv:1803.02469•Quantum Information Processing•Jun 5, 2019•8 citations

Opportunistic Entanglement Distribution for the Quantum Internet

László Gyöngyösi, Sándor Imre

Quantum entanglement is a building block of the entangled quantum networks of the quantum Internet. A fundamental problem of the quantum Internet is entanglement distribution. Since quantum entanglement will be fundamental to any future quantum networking scenarios, the distribution mechanism of quantum entanglement is a critical and emerging issue in quantum networks. Here we define the method of opportunistic entanglement distribution for the quantum Internet. The opportunistic model defines distribution sets that are aimed to select those quantum nodes for which the cost function picks up a local minimum. The cost function utilizes the error patterns of the local quantum memories and the predictability of the evolution of the entanglement fidelities. Our method provides efficient entanglement distributing with respect to the actual statuses of the local quantum memories of the node pairs. The model provides an easily-applicable, moderate-complexity solution for high-fidelity entanglement distribution in experimental quantum Internet scenarios.

arXiv:1905.00258•Scientific Reports•Feb 18, 2019•74 citations

Multilayer Optimization for the Quantum Internet

László Gyöngyösi, Sándor Imre

We define a multilayer optimization method for the quantum Internet. Multilayer optimization integrates separate procedures for the optimization of the quantum layer and the classical layer of the quantum Internet. The multilayer optimization procedure defines advanced techniques for the optimization of the layers. The optimization of the quantum layer covers the minimization of total usage time of quantum memories in the quantum nodes, the maximization of the entanglement throughput over the entangled links, and the reduction of the number of entangled links between the arbitrary source and target quantum nodes. The objective of the optimization of the classical layer is the cost minimization of any auxiliary classical communications. The multilayer optimization framework provides a practically implementable tool for quantum network communications, or long-distance quantum communications.

arXiv:1808.07860•Scientific Reports•Aug 17, 2018•39 citations

FENDI: Toward High-Fidelity Entanglement Distribution in the Quantum Internet

Huayue Gu, Zhouyu Li, Ruozhou Yu +4 more

A quantum network distributes quantum entanglements between remote nodes, and is key to many applications in secure communication, quantum sensing and distributed quantum computing. This paper explores the fundamental trade-off between the throughput and the quality of entanglement distribution in a multi-hop quantum repeater network. Compared to existing work which aims to heuristically maximize the entanglement distribution rate (EDR) and/or entanglement fidelity, our goal is to characterize the maximum achievable worst-case fidelity, while satisfying a bound on the maximum achievable expected EDR between an arbitrary pair of quantum nodes. This characterization will provide fundamental bounds on the achievable performance region of a quantum network, which can assist with the design of quantum network topology, protocols and applications. However, the task is highly non-trivial and is NP-hard as we shall prove. Our main contribution is a fully polynomial-time approximation scheme to approximate the achievable worst-case fidelity subject to a strict expected EDR bound, combining an optimal fidelity-agnostic EDR-maximizing formulation and a worst-case isotropic noise model. The EDR and fidelity guarantees can be implemented by a post-selection-and-storage protocol with quantum memories. By developing a discrete-time quantum network simulator, we conduct simulations to show the characterized performance region (the approximate Pareto frontier) of a network, and demonstrate that the designed protocol can achieve the performance region while existing protocols exhibit a substantial gap.

arXiv:2301.08269•IEEE/ACM Transactions on Networking•Sep 13, 2024•36 citations

Distributing Multipartite Entanglement over Noisy Quantum Networks

Luís Bugalho, Bruno Coelho Coutinho, Francisco A. Monteiro +1 more

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.

arXiv:2103.14759•Quantum•Feb 9, 2023•83 citations

Quantum Network Information Gain Maximization

Jincheng Zhang

This paper investigates the maximization of information gain within quantum networks, a critical challenge for realizing their full potential in secure communication and distributed quantum computing. We propose a novel optimization algorithm leveraging quantum information theory principles to dynamically manage quantum entanglement distribution, directly aiming to maximize the information gain achievable within the network. The core mechanism involves a dynamic adjustment of entanglement allocation based on the network's current state and the specific information demands. This approach represents a new paradigm for quantum network design and optimization, moving beyond static entanglement distribution strategies. The algorithm is formulated using concepts from quantum entropy, von Neumann entropy, and quantum mutual information. We present a theoretical framework and outline the key components of the algorithm, focusing on the mathematical formalism underlying the optimization process. The potential impact of this method is significant, offering a pathway to more efficient and robust quantum networks capable of handling complex information processing tasks. We define key performance metrics, such as the average information gain per communication round, and discuss the scalability challenges associated with implementing this approach. Further research will explore the practical implementation and performance validation of this algorithm.

•Sep 5, 2026•0 citations
A Poisson model for entanglement optimization in quantum repeater networks is defined in this paper. The optimization framework fuses the fundamental concepts of quantum Shannon theory with the theory of evolutionary algorithms and seismic wave propagations in nature. The optimization model aims to maximize the entanglement fidelity and relative entropy of entanglement for all entangled connections of the quantum network. The cost functions are subject of a minimization defined to cover and integrate the physical attributes of entanglement transmission, purification, and storage of entanglement in quantum memories. The method can be implemented with low complexity that allows a straightforward application in future quantum Internet and quantum networking scenarios.
We define a nature-inspired model for entanglement optimization in the quantum Internet. The optimization model aims to maximize the entanglement fidelity and relative entropy of entanglement for the entangled connections of the entangled network structure of the quantum Internet. The cost functions are subject of a minimization defined to cover and integrate the physical attributes of entanglement transmission, purification, and storage of entanglement in quantum memories. The method can be implemented with low complexity that allows a straightforward application in the quantum Internet and quantum networking scenarios.
Quantum entanglement is a building block of the entangled quantum networks of the quantum Internet. A fundamental problem of the quantum Internet is entanglement distribution. Since quantum entanglement will be fundamental to any future quantum networking scenarios, the distribution mechanism of quantum entanglement is a critical and emerging issue in quantum networks. Here we define the method of opportunistic entanglement distribution for the quantum Internet. The opportunistic model defines distribution sets that are aimed to select those quantum nodes for which the cost function picks up a local minimum. The cost function utilizes the error patterns of the local quantum memories and the predictability of the evolution of the entanglement fidelities. Our method provides efficient entanglement distributing with respect to the actual statuses of the local quantum memories of the node pairs. The model provides an easily-applicable, moderate-complexity solution for high-fidelity entanglement distribution in experimental quantum Internet scenarios.
We define a multilayer optimization method for the quantum Internet. Multilayer optimization integrates separate procedures for the optimization of the quantum layer and the classical layer of the quantum Internet. The multilayer optimization procedure defines advanced techniques for the optimization of the layers. The optimization of the quantum layer covers the minimization of total usage time of quantum memories in the quantum nodes, the maximization of the entanglement throughput over the entangled links, and the reduction of the number of entangled links between the arbitrary source and target quantum nodes. The objective of the optimization of the classical layer is the cost minimization of any auxiliary classical communications. The multilayer optimization framework provides a practically implementable tool for quantum network communications, or long-distance quantum communications.
A quantum network distributes quantum entanglements between remote nodes, and is key to many applications in secure communication, quantum sensing and distributed quantum computing. This paper explores the fundamental trade-off between the throughput and the quality of entanglement distribution in a multi-hop quantum repeater network. Compared to existing work which aims to heuristically maximize the entanglement distribution rate (EDR) and/or entanglement fidelity, our goal is to characterize the maximum achievable worst-case fidelity, while satisfying a bound on the maximum achievable expected EDR between an arbitrary pair of quantum nodes. This characterization will provide fundamental bounds on the achievable performance region of a quantum network, which can assist with the design of quantum network topology, protocols and applications. However, the task is highly non-trivial and is NP-hard as we shall prove. Our main contribution is a fully polynomial-time approximation scheme to approximate the achievable worst-case fidelity subject to a strict expected EDR bound, combining an optimal fidelity-agnostic EDR-maximizing formulation and a worst-case isotropic noise model. The EDR and fidelity guarantees can be implemented by a post-selection-and-storage protocol with quantum memories. By developing a discrete-time quantum network simulator, we conduct simulations to show the characterized performance region (the approximate Pareto frontier) of a network, and demonstrate that the designed protocol can achieve the performance region while existing protocols exhibit a substantial gap.
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.
This paper investigates the maximization of information gain within quantum networks, a critical challenge for realizing their full potential in secure communication and distributed quantum computing. We propose a novel optimization algorithm leveraging quantum information theory principles to dynamically manage quantum entanglement distribution, directly aiming to maximize the information gain achievable within the network. The core mechanism involves a dynamic adjustment of entanglement allocation based on the network's current state and the specific information demands. This approach represents a new paradigm for quantum network design and optimization, moving beyond static entanglement distribution strategies. The algorithm is formulated using concepts from quantum entropy, von Neumann entropy, and quantum mutual information. We present a theoretical framework and outline the key components of the algorithm, focusing on the mathematical formalism underlying the optimization process. The potential impact of this method is significant, offering a pathway to more efficient and robust quantum networks capable of handling complex information processing tasks. We define key performance metrics, such as the average information gain per communication round, and discuss the scalability challenges associated with implementing this approach. Further research will explore the practical implementation and performance validation of this algorithm.