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:2503.09473

No quantum advantage without classical communication: fundamental limitations of quantum networks

Neumann, Justus, Tulja Varun Kondra, Kiara Hansenne, Lisa T. Weinbrenner, Hermann Kampermann, Otfried Gühne, Dagmar Bruß, Nikolai Wyderka

Published Mar 12, 2025• 6 citations
arXivHTMLPDF

Abstract

Quantum networks connect systems at separate locations via quantum links, enabling a wide range of quantum information tasks between distant parties. Large-scale networks have the potential to enable global secure communication, distributed quantum computation, enhanced clock synchronization, and high-precision multiparameter metrology. For the optimal development of these technologies, however, it is essential to identify the necessary resources and sub-routines that will lead to the quantum advantage, but this is demanding even for the simplest protocols in quantum information processing. Here we show that quantum networks relying on the long-distance distribution of bipartite entanglement, combined with local operations and shared randomness, cannot achieve a relevant quantum advantage. Specifically, we prove that these networks do not help in preparing resourceful quantum states such as Greenberger-Horne-Zeilinger states or cluster states, despite the free availability of long-distance entanglement. At an abstract level, our work points towards a fundamental difference between bipartite and multipartite entanglement. From a practical perspective, our results highlight the need for classical communication combined with quantum memories to fully harness the power of quantum networks.

DOI
10.48550/arxiv.2503.09473

Related papers

Entanglement assisted quantum communication protocols

Amélie Piveteau

Quantum entanglement plays a central role in many quantum communication protocols. It allows distant particles to share correlations beyond the limits of classical interactions. Entanglement is essential for superdense coding, quantum teleportation, and secure cryptographic key distribution in quantum communication. It is also a pillar for developing quantum networks, where the management and distribution of entanglement are crucial for connecting distant nodes. Although perfect entanglement is a sought-after ideal, experimental imperatives, including entanglement distribution over long distances, often limit the quality of entangled states. An important question is whether weaker entanglement still offers advantages. First, we study more general tasks than dense coding to show that simpler measurements, combined with entanglement, allow advantageous and sometimes even optimal qubit communication protocols to be obtained. We also demonstrate that simple measurements can generate quantum correlations that cannot be modelled by two classical communication bits and can constitute an optimal protocol with quantum resources. We implement a novel Bell-type inequality tailored for certifying full network non-locality (FNN) to develop certification methods guaranteeing security on an entanglement-based network. Our experiment uses two pairs of polarised entangled photons in a network configuration with three nodes, briefly referred to as a bilocal network scenario. Finally, we show that weakly entangled states can improve communication over a qubit channel using only separate (local) measurements on isotropic non-steerable two-qubit states, without interference, of individual photons, across two communication tasks: secret sharing and its stochastic variant.

•Jan 1, 2026•0 citations

Quantum-Enhanced Metrology with Network States

Yuxiang Yang, Benjamin Yadin, Zhen‐Peng Xu

Armed with quantum correlations, quantum sensors in a network have shown the potential to outclass their classical counterparts in distributed sensing tasks such as clock synchronization and reference frame alignment. On the other hand, this analysis was done for simple and idealized networks, whereas the correlation shared within a practical quantum network, captured by the notion of network states, is much more complex. Here, we prove a general bound that limits the performance of using quantum network states to estimate a global parameter, establishing the necessity of genuine multipartite entanglement for achieving a quantum advantage. The bound can also serve as an entanglement witness in networks and can be generalized to states generated by shallow circuits. Moreover, while our bound prohibits local network states from achieving the Heisenberg limit, we design a probabilistic protocol that, once successful, attains this ultimate limit of quantum metrology and preserves the privacy of involved parties. Our work establishes both the limitation and the possibility of quantum metrology within quantum networks.

arXiv:2307.07758•Physical Review Letters•May 20, 2024•29 citations

Multipartite Entanglement for Multi-node Quantum Networks

E. M. Ainley, A. Agrawal, D. Main +5 more

Scaling the number of entangled nodes in a quantum network is a challenge with significant implications for quantum computing, clock synchronisation, secure communications, and quantum sensing. In a quantum network, photons interact with matter qubits at different nodes, flexibly enabling the creation of remote entanglement between them. Multipartite entanglement among multiple nodes will be crucial for many proposed quantum network applications, including quantum computational tasks and quantum metrology. To date, experimental efforts have primarily focused on generating bipartite entanglement between nodes, which is widely regarded as the fundamental quantum resource for quantum networks. However, relying exclusively on bipartite entanglement to form more complex multipartite entanglement introduces several challenges. These include the need for ancillary qubits, extensive local entangling operations which increases the preparation latency, and increasingly stringent requirements on coherence times as the number of nodes grows. Here, we analyse various schemes that achieve multipartite entanglement between nodes in a single step, bypassing the need for multiple rounds of bipartite entanglement. We demonstrate that different schemes can produce distinct multipartite entangled states, with varying fidelity and generation rates. Additionally, we discuss the applicability of these schemes across different experimental platforms, highlighting their primary advantages and disadvantages.

arXiv:2408.00149•Jul 31, 2024•14 citations

How to Share Multipartite Entanglement in a Real-World Linear Network Connecting Two Metropoles

Janka Memmen, Anna Pappa

The development of large-scale quantum communication networks necessitates the efficient distribution of quantum states to enable advanced cryptographic applications and distributed tasks. Multipartite entanglement is a key resource in many of these proposals, yet its generation is experimentally challenging, especially in noisy and lossy networks. While a substantial body of work focuses on the distribution of multi-partite entanglement in star-like topologies, practical implementations often rely on linear network structures constrained by existing infrastructure. In this work, we investigate the generation of high-fidelity multipartite entangled states in a realistic quantum network, leveraging the existing infrastructure of the Q-net-Q project-a real-world long-distance link connecting Berlin and Frankfurt via seven trusted relay nodes. Given that only bipartite entanglement sources are available in our setting and that the network is highly lossy, we explore the role of quantum memories in enhancing multi-partite entanglement distribution and identify key performance requirements. Furthermore, we analyze the feasibility and performance of cryptographic primitives-including (Anonymous) Conference Key Agreement and Quantum Secret Sharing-highlighting the scenarios where the use of multipartite entanglement yields clear advantages.

arXiv:2507.17480•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•1 citation

Distributing and tailoring noisy resource states in quantum networks

Maria Flors Mor-Ruiz

Quantum information science is an interdisciplinary field that investigates the principles and applications of quantum mechanics in information processing. Upcoming quantum technologies promise a range of valuable applications, including powerful simulation of complex systems, enhanced computational capabilities, high-precision sensing and metrology, and secure communication via quantum key distribution. A central concept is entanglement, a unique type of correlation between quantum systems that has no classical counterpart. Entanglement plays a pivotal role in many quantum protocols, particularly as a key resource in quantum communication, where protocols such as distributed quantum computation and secret sharing are executed in a distributed setting. Hence, distributing entanglement over long distances and manipulating it locally is essential for enabling quantum communication applications. However, the effectiveness of such applications is limited by the challenges of transmitting quantum information and maintaining precise control over quantum systems. For example, quantum information carriers, such as photons traveling through optical fibers, may be lost, or the operations performed may not be perfect. Consequently, it is crucial to develop robust tools for distributing and manipulating entanglement in distributed settings in order to fully unlock the capabilities of quantum technologies. In this thesis, we explore the influence of noise on the manipulation of entanglement in entanglement-based quantum networks. First, we examine the noise resilience of various resource states, i.e., pre-established entangled states, used to achieve bipartite or tripartite communication. This is followed by an analysis of a fully asymmetric network scenario, incorporating the noise introduced by the delays from classical messaging within the quantum network. We then propose classical communication protocols to achieve bipartite communication and evaluate their noise impact under the optimization of the arrangement of the pre-established entanglement. In addition, we propose an alternative approach to quantum repeaters, a key device for entanglement distribution, based on growing multipartite states, allowing entanglement to be recycled and patched. All investigations have been carried out employing a novel formalism, also developed in this thesis, for efficiently and accurately simulating noisy quantum processes on classical hardware, with broader applicability beyond quantum communication.

•Jan 1, 2025•0 citations

Scalable and noise-robust communication advantage of multipartite quantum entanglement

Ananya Chakraborty, Ram Krishna Patra, Kunika Agarwal +4 more

Distributed computing, involving multiple servers collaborating on designated computations, faces a critical challenge in optimizing interserver communication---an issue central to the study of communication complexity. Quantum resources offer advantages over classical methods in addressing this challenge. In this work, we investigate a distributed computing scenario with multiple senders and a single receiver, establishing a scalable advantage of multipartite quantum entanglement in mitigating communication complexity. Specifically, we demonstrate that when the receiver and the senders share a multiqubit Greenberger-Horne-Zeilinger (GHZ) state---a quintessential form of genuine multipartite entanglement---certain global functions of the distributed inputs can be computed with only one bit of classical communication from each sender. In contrast, without entanglement, two bits of communication are required from all but one sender. Consequently, quantum entanglement reduces communication overhead by $n\ensuremath{-}1$ bits for $n$ senders, allowing for arbitrary scaling with an increasing number of senders. We also show that the entanglement-based protocol exhibits significant robustness under white noise, thereby establishing the potential for experimental realization of this quantum advantage.

arXiv:2409.13223•Physical Review A•Mar 20, 2025•8 citations
Quantum networks connect systems at separate locations via quantum links, enabling a wide range of quantum information tasks between distant parties. Large-scale networks have the potential to enable global secure communication, distributed quantum computation, enhanced clock synchronization, and high-precision multiparameter metrology. For the optimal development of these technologies, however, it is essential to identify the necessary resources and sub-routines that will lead to the quantum advantage, but this is demanding even for the simplest protocols in quantum information processing. Here we show that quantum networks relying on the long-distance distribution of bipartite entanglement, combined with local operations and shared randomness, cannot achieve a relevant quantum advantage. Specifically, we prove that these networks do not help in preparing resourceful quantum states such as Greenberger-Horne-Zeilinger states or cluster states, despite the free availability of long-distance entanglement. At an abstract level, our work points towards a fundamental difference between bipartite and multipartite entanglement. From a practical perspective, our results highlight the need for classical communication combined with quantum memories to fully harness the power of quantum networks.
Quantum entanglement plays a central role in many quantum communication protocols. It allows distant particles to share correlations beyond the limits of classical interactions. Entanglement is essential for superdense coding, quantum teleportation, and secure cryptographic key distribution in quantum communication. It is also a pillar for developing quantum networks, where the management and distribution of entanglement are crucial for connecting distant nodes. Although perfect entanglement is a sought-after ideal, experimental imperatives, including entanglement distribution over long distances, often limit the quality of entangled states. An important question is whether weaker entanglement still offers advantages. First, we study more general tasks than dense coding to show that simpler measurements, combined with entanglement, allow advantageous and sometimes even optimal qubit communication protocols to be obtained. We also demonstrate that simple measurements can generate quantum correlations that cannot be modelled by two classical communication bits and can constitute an optimal protocol with quantum resources. We implement a novel Bell-type inequality tailored for certifying full network non-locality (FNN) to develop certification methods guaranteeing security on an entanglement-based network. Our experiment uses two pairs of polarised entangled photons in a network configuration with three nodes, briefly referred to as a bilocal network scenario. Finally, we show that weakly entangled states can improve communication over a qubit channel using only separate (local) measurements on isotropic non-steerable two-qubit states, without interference, of individual photons, across two communication tasks: secret sharing and its stochastic variant.
Armed with quantum correlations, quantum sensors in a network have shown the potential to outclass their classical counterparts in distributed sensing tasks such as clock synchronization and reference frame alignment. On the other hand, this analysis was done for simple and idealized networks, whereas the correlation shared within a practical quantum network, captured by the notion of network states, is much more complex. Here, we prove a general bound that limits the performance of using quantum network states to estimate a global parameter, establishing the necessity of genuine multipartite entanglement for achieving a quantum advantage. The bound can also serve as an entanglement witness in networks and can be generalized to states generated by shallow circuits. Moreover, while our bound prohibits local network states from achieving the Heisenberg limit, we design a probabilistic protocol that, once successful, attains this ultimate limit of quantum metrology and preserves the privacy of involved parties. Our work establishes both the limitation and the possibility of quantum metrology within quantum networks.
Scaling the number of entangled nodes in a quantum network is a challenge with significant implications for quantum computing, clock synchronisation, secure communications, and quantum sensing. In a quantum network, photons interact with matter qubits at different nodes, flexibly enabling the creation of remote entanglement between them. Multipartite entanglement among multiple nodes will be crucial for many proposed quantum network applications, including quantum computational tasks and quantum metrology. To date, experimental efforts have primarily focused on generating bipartite entanglement between nodes, which is widely regarded as the fundamental quantum resource for quantum networks. However, relying exclusively on bipartite entanglement to form more complex multipartite entanglement introduces several challenges. These include the need for ancillary qubits, extensive local entangling operations which increases the preparation latency, and increasingly stringent requirements on coherence times as the number of nodes grows. Here, we analyse various schemes that achieve multipartite entanglement between nodes in a single step, bypassing the need for multiple rounds of bipartite entanglement. We demonstrate that different schemes can produce distinct multipartite entangled states, with varying fidelity and generation rates. Additionally, we discuss the applicability of these schemes across different experimental platforms, highlighting their primary advantages and disadvantages.
The development of large-scale quantum communication networks necessitates the efficient distribution of quantum states to enable advanced cryptographic applications and distributed tasks. Multipartite entanglement is a key resource in many of these proposals, yet its generation is experimentally challenging, especially in noisy and lossy networks. While a substantial body of work focuses on the distribution of multi-partite entanglement in star-like topologies, practical implementations often rely on linear network structures constrained by existing infrastructure. In this work, we investigate the generation of high-fidelity multipartite entangled states in a realistic quantum network, leveraging the existing infrastructure of the Q-net-Q project-a real-world long-distance link connecting Berlin and Frankfurt via seven trusted relay nodes. Given that only bipartite entanglement sources are available in our setting and that the network is highly lossy, we explore the role of quantum memories in enhancing multi-partite entanglement distribution and identify key performance requirements. Furthermore, we analyze the feasibility and performance of cryptographic primitives-including (Anonymous) Conference Key Agreement and Quantum Secret Sharing-highlighting the scenarios where the use of multipartite entanglement yields clear advantages.
Quantum information science is an interdisciplinary field that investigates the principles and applications of quantum mechanics in information processing. Upcoming quantum technologies promise a range of valuable applications, including powerful simulation of complex systems, enhanced computational capabilities, high-precision sensing and metrology, and secure communication via quantum key distribution. A central concept is entanglement, a unique type of correlation between quantum systems that has no classical counterpart. Entanglement plays a pivotal role in many quantum protocols, particularly as a key resource in quantum communication, where protocols such as distributed quantum computation and secret sharing are executed in a distributed setting. Hence, distributing entanglement over long distances and manipulating it locally is essential for enabling quantum communication applications. However, the effectiveness of such applications is limited by the challenges of transmitting quantum information and maintaining precise control over quantum systems. For example, quantum information carriers, such as photons traveling through optical fibers, may be lost, or the operations performed may not be perfect. Consequently, it is crucial to develop robust tools for distributing and manipulating entanglement in distributed settings in order to fully unlock the capabilities of quantum technologies. In this thesis, we explore the influence of noise on the manipulation of entanglement in entanglement-based quantum networks. First, we examine the noise resilience of various resource states, i.e., pre-established entangled states, used to achieve bipartite or tripartite communication. This is followed by an analysis of a fully asymmetric network scenario, incorporating the noise introduced by the delays from classical messaging within the quantum network. We then propose classical communication protocols to achieve bipartite communication and evaluate their noise impact under the optimization of the arrangement of the pre-established entanglement. In addition, we propose an alternative approach to quantum repeaters, a key device for entanglement distribution, based on growing multipartite states, allowing entanglement to be recycled and patched. All investigations have been carried out employing a novel formalism, also developed in this thesis, for efficiently and accurately simulating noisy quantum processes on classical hardware, with broader applicability beyond quantum communication.
Distributed computing, involving multiple servers collaborating on designated computations, faces a critical challenge in optimizing interserver communication---an issue central to the study of communication complexity. Quantum resources offer advantages over classical methods in addressing this challenge. In this work, we investigate a distributed computing scenario with multiple senders and a single receiver, establishing a scalable advantage of multipartite quantum entanglement in mitigating communication complexity. Specifically, we demonstrate that when the receiver and the senders share a multiqubit Greenberger-Horne-Zeilinger (GHZ) state---a quintessential form of genuine multipartite entanglement---certain global functions of the distributed inputs can be computed with only one bit of classical communication from each sender. In contrast, without entanglement, two bits of communication are required from all but one sender. Consequently, quantum entanglement reduces communication overhead by $n\ensuremath{-}1$ bits for nnn senders, allowing for arbitrary scaling with an increasing number of senders. We also show that the entanglement-based protocol exhibits significant robustness under white noise, thereby establishing the potential for experimental realization of this quantum advantage.