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

ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC)

On Matching in Multipartite Quantum Routers

Dagmar Bruß, Luis Gindorf, Julia Kunzelmann, Christian Laußmann, Jörg Rothe

Published Jul 20, 2025• 0 citations
Publisher

Abstract

Over the past few years, the concept of quantum routers and their usefulness in quantum communication networks (e.g., in the BB84 protocol [5]) has been popularized in quantum information theory. While quite some work has been done on the theoretical implementation of quantum routers using multiplexing, most of it is constrained to the bipartite case [2, 9]. We extend this setup to quantum routers used in multipartite conference key agreement protocols so as to distribute a secret key among N parties. We formalize the general quantum entanglement matching problem, and show it's NP-completeness. We then study special cases for which we found efficient algorithms. Finally, we consider the weighted case where the weights represent the qubit ages.

DOI
10.1145/3731545.3744148

Related papers

Multipartite multiplexing strategies for quantum routers

Julia Kunzelmann, Hermann Kampermann, Dagmar Bruß

This work explores the important role of quantum routers in communication networks and investigates the increase in efficiency using memories and multiplexing strategies. Motivated by the bipartite setup introduced by Abruzzo et al. [Phys. Rev. A 89, 012303 (2014)] for finite-range multiplexing in quantum repeaters, we extend the study to an $N$-partite network with a router as a central station. We present a general protocol for $N$ parties after defining the underlying matching problem and we calculate the router rate for different $N$. We analyze the improvement due to multiplexing and analyze the secret key rate with explicit results for the tripartite network. Investigating strategic qubit selection for the Greenberger-Horne-Zeilinger measurements, we show that using cutoffs to remove qubits after a certain number of rounds and consistently combining qubits with the lowest number of storage rounds leads to an optimal secret key rate.

arXiv:2406.13492•Physical Review A•Sep 18, 2024•2 citations

Application and Manipulation of Bipartite and Multipartite Entangled States

Ben Fortescue

The phenomenon of quantum entanglement is a fundamental feature of quantum mechanics which, as a counterintuitive and inherently ”quantum” phenomenon (with no classical analogue) has been the subject of much study, especially in quantum information theory. One fruitful approach to the description of entanglement has been in its operational description - that is, in the consideration of what can be achieved using entangled states under certain restrictions, typically the regime of local operations and classical communications.\n\nWe present results here related to the operational characterisation of entanglement in the resource model, in both bipartite and multipartite cases. First, we consider the conversion between pure bipartite entangled states in terms of an often-ignored resource - the classical communication cost. Using prior results for more specific conversions, we derive lower bounds on this cost (and the related quantity of the conversion inefficiency) for general bipartite pure states.\n\nWe also consider pure-state conversions of multipartite entanglement, in particular the class of protocols in which multipartite states are converted to states shared between fewer parties. We have found a previously-unconsidered variety of such conversions, in which the target state of the conversion is a state shared between a random subset of the parties. We find that when such post-selection of parties in the protocol is permitted allows for a wider variety of achievable target states; certain states which can not be reliably obtained between predetermined parties (even some where the probability of doing so is arbitrarily small) can be obtained between random parties. We consider a variety of states in which this phenomenon occurs, as well as bounds on such protocols can achieve.\n\nFinally we consider a practical use of entanglement as a resource, in an experimental implementation of a multipartite QKD protocol. This is based on the tripartite GHZ entangled state, but can be implemented using only bipartite entanglement. We adapt existing QKD results for both the bipartite and multipartite case to derive a secure key rate for this implementation, taking into account the ways in which it differs from the idealised theoretical case.

•Sep 24, 2009•0 citations

Multi-partite entanglement can speed up quantum key distribution in networks

Michael Epping, Hermann Kampermann, Chiara Macchiavello +1 more

The laws of quantum mechanics allow for the distribution of a secret random key between two parties.Here we analyse the security of a protocol for establishing a common secret key between N parties (i.e. a conference key), using resource states with genuine N-partite entanglement.We compare this protocol to conference key distribution via bipartite entanglement, regarding the required resources, achievable secret key rates and threshold qubit error rates.Furthermore we discuss quantum networks with bottlenecks for which our multipartite entanglement-based protocol can benefit from network coding, while the bipartite protocol cannot.It is shown how this advantage leads to a higher secret key rate. Multipartite QKD: protocol and security analysisThe entanglement-based Ekert protocol [7] can be generalised to N parties as follows, see also [31,34].The parties A and B 1 , B 2 , ..., B N 1 -share an N-partite entangled state and perform local projective measurements.The

arXiv:1612.05585•New Journal of Physics•Sep 14, 2017•221 citations

Anonymous and secret communication in quantum networks

Christopher Thalacker, Frederik Hahn, Jarn de Jong +2 more

Abstract Secure communication is one of the key applications of quantum networks. In recent years, following the demands for identity protection in classical communication protocols, the need for anonymity has also emerged for quantum networks. Here, we demonstrate that quantum physics allows parties—besides communicating securely over a network—to also keep their identities secret. We implement such an anonymous quantum conference key agreement by sharing multipartite entangled states in a quantum network. We demonstrate the protocol with four parties and establish keys in subsets of the network—different combinations of two and three parties—whilst keeping the participating parties anonymous. We additionally show that the protocol is verifiable and run multiple key generation and verification routines. Our work thus addresses one of the key challenges of networked communication: keeping the identities of the communicating parties private.

arXiv:2103.08722•New Journal of Physics•Jul 27, 2021•31 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

Detection and Characterisation of Multipartite Quantum Entanglement

Gabriel, Andreas

The research field of quantum entanglement theory is comparatively new. While a basic understanding of the most simple systems in question (i.e. bipartite systems) has been established over the past few decades, multipartite entanglement still holds many unsolved questions and intriguing riddles. In particular, it is completely unclear how several concepts from the bipartite case can be generalised in a meaningful way to multipartite scenarios. In this work, the main issues of multipartite entanglement detection, characterisation and classification are discussed. The differences and similarities between the bipartite and the multipartite situation are reviewed, various possible generalisations are presented and results are obtained in several areas. The focus of this work particularly lies on a formalism - the so called HMGH framework, which has been developed and expanded for the past several years - which allows for construction of very specific separability criteria, capable of discriminating between different kinds of multipartite entanglement. By means of these criteria, the questions of partial separability, genuine multipartite entanglement and - ultimately - multipartite entanglement classification (which appear to contain the most striking differences to bipartite entanglement) are adressed and discussed. In order to illustrate the theoretical conclusions in these respects, several examples are given from different (and differently closely related) fields, showing the capabilities, strengths and weaknesses of the HMGH framework as well as giving insights into the current status of research in multipartite entanglement theory as a whole.

arXiv:1305.7401•May 31, 2013•1 citation
Over the past few years, the concept of quantum routers and their usefulness in quantum communication networks (e.g., in the BB84 protocol [5]) has been popularized in quantum information theory. While quite some work has been done on the theoretical implementation of quantum routers using multiplexing, most of it is constrained to the bipartite case [2, 9]. We extend this setup to quantum routers used in multipartite conference key agreement protocols so as to distribute a secret key among N parties. We formalize the general quantum entanglement matching problem, and show it's NP-completeness. We then study special cases for which we found efficient algorithms. Finally, we consider the weighted case where the weights represent the qubit ages.
This work explores the important role of quantum routers in communication networks and investigates the increase in efficiency using memories and multiplexing strategies. Motivated by the bipartite setup introduced by Abruzzo et al. [Phys. Rev. A 89, 012303 (2014)] for finite-range multiplexing in quantum repeaters, we extend the study to an NNN-partite network with a router as a central station. We present a general protocol for NNN parties after defining the underlying matching problem and we calculate the router rate for different NNN. We analyze the improvement due to multiplexing and analyze the secret key rate with explicit results for the tripartite network. Investigating strategic qubit selection for the Greenberger-Horne-Zeilinger measurements, we show that using cutoffs to remove qubits after a certain number of rounds and consistently combining qubits with the lowest number of storage rounds leads to an optimal secret key rate.
The phenomenon of quantum entanglement is a fundamental feature of quantum mechanics which, as a counterintuitive and inherently ”quantum” phenomenon (with no classical analogue) has been the subject of much study, especially in quantum information theory. One fruitful approach to the description of entanglement has been in its operational description - that is, in the consideration of what can be achieved using entangled states under certain restrictions, typically the regime of local operations and classical communications.\n\nWe present results here related to the operational characterisation of entanglement in the resource model, in both bipartite and multipartite cases. First, we consider the conversion between pure bipartite entangled states in terms of an often-ignored resource - the classical communication cost. Using prior results for more specific conversions, we derive lower bounds on this cost (and the related quantity of the conversion inefficiency) for general bipartite pure states.\n\nWe also consider pure-state conversions of multipartite entanglement, in particular the class of protocols in which multipartite states are converted to states shared between fewer parties. We have found a previously-unconsidered variety of such conversions, in which the target state of the conversion is a state shared between a random subset of the parties. We find that when such post-selection of parties in the protocol is permitted allows for a wider variety of achievable target states; certain states which can not be reliably obtained between predetermined parties (even some where the probability of doing so is arbitrarily small) can be obtained between random parties. We consider a variety of states in which this phenomenon occurs, as well as bounds on such protocols can achieve.\n\nFinally we consider a practical use of entanglement as a resource, in an experimental implementation of a multipartite QKD protocol. This is based on the tripartite GHZ entangled state, but can be implemented using only bipartite entanglement. We adapt existing QKD results for both the bipartite and multipartite case to derive a secure key rate for this implementation, taking into account the ways in which it differs from the idealised theoretical case.
The laws of quantum mechanics allow for the distribution of a secret random key between two parties.Here we analyse the security of a protocol for establishing a common secret key between N parties (i.e. a conference key), using resource states with genuine N-partite entanglement.We compare this protocol to conference key distribution via bipartite entanglement, regarding the required resources, achievable secret key rates and threshold qubit error rates.Furthermore we discuss quantum networks with bottlenecks for which our multipartite entanglement-based protocol can benefit from network coding, while the bipartite protocol cannot.It is shown how this advantage leads to a higher secret key rate. Multipartite QKD: protocol and security analysisThe entanglement-based Ekert protocol [7] can be generalised to N parties as follows, see also [31,34].The parties A and B 1 , B 2 , ..., B N 1 -share an N-partite entangled state and perform local projective measurements.The
Abstract Secure communication is one of the key applications of quantum networks. In recent years, following the demands for identity protection in classical communication protocols, the need for anonymity has also emerged for quantum networks. Here, we demonstrate that quantum physics allows parties—besides communicating securely over a network—to also keep their identities secret. We implement such an anonymous quantum conference key agreement by sharing multipartite entangled states in a quantum network. We demonstrate the protocol with four parties and establish keys in subsets of the network—different combinations of two and three parties—whilst keeping the participating parties anonymous. We additionally show that the protocol is verifiable and run multiple key generation and verification routines. Our work thus addresses one of the key challenges of networked communication: keeping the identities of the communicating parties private.
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.
The research field of quantum entanglement theory is comparatively new. While a basic understanding of the most simple systems in question (i.e. bipartite systems) has been established over the past few decades, multipartite entanglement still holds many unsolved questions and intriguing riddles. In particular, it is completely unclear how several concepts from the bipartite case can be generalised in a meaningful way to multipartite scenarios. In this work, the main issues of multipartite entanglement detection, characterisation and classification are discussed. The differences and similarities between the bipartite and the multipartite situation are reviewed, various possible generalisations are presented and results are obtained in several areas. The focus of this work particularly lies on a formalism - the so called HMGH framework, which has been developed and expanded for the past several years - which allows for construction of very specific separability criteria, capable of discriminating between different kinds of multipartite entanglement. By means of these criteria, the questions of partial separability, genuine multipartite entanglement and - ultimately - multipartite entanglement classification (which appear to contain the most striking differences to bipartite entanglement) are adressed and discussed. In order to illustrate the theoretical conclusions in these respects, several examples are given from different (and differently closely related) fields, showing the capabilities, strengths and weaknesses of the HMGH framework as well as giving insights into the current status of research in multipartite entanglement theory as a whole.