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

arXiv:quant-ph/0404179 · Physical Review A

Entanglement flow in multipartite systems

Toby S. Cubitt, Frank Verstraete, J. I. Cirac

Published May 6, 2005• 62 citations
arXivHTMLPDF

Abstract

We investigate entanglement dynamics in multipartite systems, establishing a quantitative concept of entanglement flow: both flow through individual particles and flow along general networks of interacting particles. In the former case, the rate at which a particle can transmit entanglement is shown to depend on that particle's entanglement with the rest of the system. In the latter, we derive a set of entanglement rate equations, relating the rate of entanglement generation between two subsets of particles to the entanglement already present further back along the network. We use the rate equations to derive a lower bound on entanglement generation in qubit chains, and compare this to existing entanglement creation protocols.

DOI
10.1103/physreva.71.052308

Related papers

Entanglement Routing Based on Fidelity Curves

Bruno Coelho Coutinho, Monteiro, Raul, Luís Bugalho +1 more

How to efficiently distribute entanglement over large-scale quantum networks is still an open problem that greatly depends on the technology considered. In this work, we consider quantum networks where each link is 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, and the problem of finding the best starting node in order to connect three nodes in the network multipartite entanglement routing. Two entanglement distribution models are considered: one where entangled qubits are distributed one at a time, and a flow model where a large number of entangled qubits are distributed simultaneously. The paper proposes of a quite general methodology that uses 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 link models and networks considered, it is proven that the algorithm always converges to the optimal solution. It is also shown through simulation that the execution time grows polynomially with the number of network nodes (growing with a power between $1$ and $1.4$, depending on the network)

arXiv:2303.12864•Mar 22, 2023•7 citations

Rates of Multipartite Entanglement Transformations

Alexander Streltsov, Clément Meignant, Jens Eisert

The theory of the asymptotic manipulation of pure bipartite quantum systems can be considered completely understood: the rates at which bipartite entangled states can be asymptotically transformed into each other are fully determined by a single number each, the respective entanglement entropy. In the multipartite setting, similar questions of the optimally achievable rates of transforming one pure state into another are notoriously open. This seems particularly unfortunate in the light of the revived interest in such questions due to the perspective of experimentally realizing multipartite quantum networks. In this Letter, we report substantial progress by deriving simple upper and lower bounds on the rates that can be achieved in asymptotic multipartite entanglement transformations. These bounds are based on ideas of entanglement combing and state merging. We identify cases where the bounds coincide and hence provide the exact rates. As an example, we bound rates at which resource states for the cryptographic scheme of quantum secret sharing can be distilled from arbitrary pure tripartite quantum states. This result provides further scope for quantum internet applications, supplying tools to study the implementation of multipartite protocols over quantum networks.

arXiv:1709.09693•Physical Review Letters•Aug 17, 2020•26 citations

Quantum Entanglement Topological Flow (QETF)

Jincheng Zhang

The traditional view of quantum entanglement treats the pattern of correlations in a multipartite system as a static, combinatorial object. In this work we propose that entanglement possesses a dynamical component that can be described as a topological flow, denoted by J_T, which acts on an entanglement graph and continuously reshapes the connectivity of quantum subsystems. By formalizing J_T within the framework of tensor networks and groupoid symmetry, we derive a set of flow equations that govern the evolution of entanglement under unitary dynamics and open system processes. The resulting theory predicts universal behavior in the transport of entanglement entropy, revealing constraints that resemble topological conservation laws. These insights suggest new avenues for engineering robust entanglement structures in quantum simulators and may underpin future quantum algorithms that exploit topological protection. The Quantum Entanglement Topological Flow framework provides a unified language for describing entanglement dynamics in many-body systems, with implications for quantum computation, simulation, and fundamental physics.

•Aug 19, 2026•0 citations

Lower bounds of concurrence for multipartite states

Xue-Na Zhu, Ming Li, Shao-Ming Fei

We study the entanglement of multipartite quantum states. Some lower bounds of the multipartite concurrence are reviewed. We further present more effective lower bounds for detecting and qualifying entanglement, by establishing functional relations between the concurrence and the generalized partial transpositions of the multipartite systems.

arXiv:1205.0954•AIP conference proceedings•Jan 1, 2012•7 citations

Capacities of repeater-assisted quantum communications

Stefano Pirandola

We consider quantum and private communications assisted by repeaters, from the basic scenario of a single repeater chain to the general case of an arbitrarily-complex quantum network, where systems may be routed through single or multiple paths. In this context, we investigate the ultimate rates at which two end-parties may transmit quantum information, distribute entanglement, or generate secret keys. These end-to-end capacities are defined by optimizing over the most general adaptive protocols that are allowed by quantum mechanics. Combining techniques from quantum information and classical network theory, we derive single-letter upper bounds for the end-to-end capacities in repeater chains and quantum networks connected by arbitrary quantum channels, establishing exact formulas under basic decoherence models, including bosonic lossy channels, quantum-limited amplifiers, dephasing and erasure channels. For the converse part, we adopt a teleportation-inspired simulation of a quantum network which leads to upper bounds in terms of the relative entropy of entanglement. For the lower bounds we combine point-to-point quantum protocols with classical network algorithms. Depending on the type of routing (single or multiple), optimal strategies corresponds to finding the widest path or the maximum flow in the quantum network. Our theory can also be extended to simultaneous quantum communication between multiple senders and receivers.

arXiv:1601.00966•Jan 5, 2016•149 citations

Multipartite entanglement dynamics in quantum walks

Emil K. F. Donkersloot, René Sondenheimer, Jan Sperling

Quantum walks constitute a rich area of quantum information science, where multipartite entanglement plays a central role in the dynamics and scalability of quantum advantage over classical simulators. In this work, we study the multipartite entanglement of quantum walks in optical settings. We present methods for computing a geometric measure of entanglement for arbitrary partitions of a single-walker quantum walk and for analyzing the entanglement in multi-walker scenarios. These techniques are used for numerical studies on the entanglement dynamics of quantum walks in large systems and under various initial conditions. For a given bipartition, based on the coin degrees of freedom, we derive exact expressions describing the complete entanglement dynamics for arbitrary localized initial conditions. We use these expressions for analytic statements about the asymptotic behavior of the system. Furthermore, we demonstrate the emergence of entanglement typicality in statistical ensembles of random optical networks.

quant-pharXiv:2603.24679•Mar 27, 2026•0 citations
We investigate entanglement dynamics in multipartite systems, establishing a quantitative concept of entanglement flow: both flow through individual particles and flow along general networks of interacting particles. In the former case, the rate at which a particle can transmit entanglement is shown to depend on that particle's entanglement with the rest of the system. In the latter, we derive a set of entanglement rate equations, relating the rate of entanglement generation between two subsets of particles to the entanglement already present further back along the network. We use the rate equations to derive a lower bound on entanglement generation in qubit chains, and compare this to existing entanglement creation protocols.
How to efficiently distribute entanglement over large-scale quantum networks is still an open problem that greatly depends on the technology considered. In this work, we consider quantum networks where each link is 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, and the problem of finding the best starting node in order to connect three nodes in the network multipartite entanglement routing. Two entanglement distribution models are considered: one where entangled qubits are distributed one at a time, and a flow model where a large number of entangled qubits are distributed simultaneously. The paper proposes of a quite general methodology that uses 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 link models and networks considered, it is proven that the algorithm always converges to the optimal solution. It is also shown through simulation that the execution time grows polynomially with the number of network nodes (growing with a power between 111 and 1.41.41.4, depending on the network)
The theory of the asymptotic manipulation of pure bipartite quantum systems can be considered completely understood: the rates at which bipartite entangled states can be asymptotically transformed into each other are fully determined by a single number each, the respective entanglement entropy. In the multipartite setting, similar questions of the optimally achievable rates of transforming one pure state into another are notoriously open. This seems particularly unfortunate in the light of the revived interest in such questions due to the perspective of experimentally realizing multipartite quantum networks. In this Letter, we report substantial progress by deriving simple upper and lower bounds on the rates that can be achieved in asymptotic multipartite entanglement transformations. These bounds are based on ideas of entanglement combing and state merging. We identify cases where the bounds coincide and hence provide the exact rates. As an example, we bound rates at which resource states for the cryptographic scheme of quantum secret sharing can be distilled from arbitrary pure tripartite quantum states. This result provides further scope for quantum internet applications, supplying tools to study the implementation of multipartite protocols over quantum networks.
The traditional view of quantum entanglement treats the pattern of correlations in a multipartite system as a static, combinatorial object. In this work we propose that entanglement possesses a dynamical component that can be described as a topological flow, denoted by J_T, which acts on an entanglement graph and continuously reshapes the connectivity of quantum subsystems. By formalizing J_T within the framework of tensor networks and groupoid symmetry, we derive a set of flow equations that govern the evolution of entanglement under unitary dynamics and open system processes. The resulting theory predicts universal behavior in the transport of entanglement entropy, revealing constraints that resemble topological conservation laws. These insights suggest new avenues for engineering robust entanglement structures in quantum simulators and may underpin future quantum algorithms that exploit topological protection. The Quantum Entanglement Topological Flow framework provides a unified language for describing entanglement dynamics in many-body systems, with implications for quantum computation, simulation, and fundamental physics.
We consider quantum and private communications assisted by repeaters, from the basic scenario of a single repeater chain to the general case of an arbitrarily-complex quantum network, where systems may be routed through single or multiple paths. In this context, we investigate the ultimate rates at which two end-parties may transmit quantum information, distribute entanglement, or generate secret keys. These end-to-end capacities are defined by optimizing over the most general adaptive protocols that are allowed by quantum mechanics. Combining techniques from quantum information and classical network theory, we derive single-letter upper bounds for the end-to-end capacities in repeater chains and quantum networks connected by arbitrary quantum channels, establishing exact formulas under basic decoherence models, including bosonic lossy channels, quantum-limited amplifiers, dephasing and erasure channels. For the converse part, we adopt a teleportation-inspired simulation of a quantum network which leads to upper bounds in terms of the relative entropy of entanglement. For the lower bounds we combine point-to-point quantum protocols with classical network algorithms. Depending on the type of routing (single or multiple), optimal strategies corresponds to finding the widest path or the maximum flow in the quantum network. Our theory can also be extended to simultaneous quantum communication between multiple senders and receivers.
Quantum walks constitute a rich area of quantum information science, where multipartite entanglement plays a central role in the dynamics and scalability of quantum advantage over classical simulators. In this work, we study the multipartite entanglement of quantum walks in optical settings. We present methods for computing a geometric measure of entanglement for arbitrary partitions of a single-walker quantum walk and for analyzing the entanglement in multi-walker scenarios. These techniques are used for numerical studies on the entanglement dynamics of quantum walks in large systems and under various initial conditions. For a given bipartition, based on the coin degrees of freedom, we derive exact expressions describing the complete entanglement dynamics for arbitrary localized initial conditions. We use these expressions for analytic statements about the asymptotic behavior of the system. Furthermore, we demonstrate the emergence of entanglement typicality in statistical ensembles of random optical networks.