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:2412.14317 · Physical Review Applied

Multiuser quantum key distribution using quotient graph states derived from continuous-variable dual-rail cluster states

Akash nag Oruganti

Published Nov 17, 2025• 2 citations
arXivHTMLPDF

Abstract

Multipartite entangled states are essential for multiuser quantum cryptography. While large-scale continuous-variable (CV) cluster states, particularly the dual-rail cluster state, have been well studied in measurement-based quantum computation, their cryptographic potential remains underexplored. Here, we propose a three-user conference key protocol using a CV dual-rail cluster state. By applying a node-coloring scheme to the infinite dual-rail graph, we create a six-mode pure graph state ideal for cryptographic tasks. Our results demonstrate near-GHZ (Greenberger-Horne-Zeilinger) performance for quantum conference key agreement (QCKA). Crucially, our protocol uniquely enables bipartite keys post-QCKA, which GHZ states cannot provide. It also surpasses two-mode squeezed vacuum states in generating bipartite keys within downstream-access networks. Considering finite-size effects and impure squeezed states, our scheme remains robust despite experimental imperfections. We also introduce an enhanced method to more accurately estimate bipartite key generation capacity in quantum networks, paving the way for practical multiuser quantum cryptography.

DOI
10.1103/vsqj-ndkn

Related papers

Continuous variable quantum conference network with a Greenberger–Horne–Zeilinger entangled state

Yue Qin, Jingxu Ma, Di Zhao +3 more

Quantum conference (QC) is a cryptographic task in secure communications that involves more than two users wishing to establish identical secret keys among N users. The Greenberger–Horne–Zeilinger (GHZ) entangled state is the basic resource for quantum cryptographic communication due to the existence of multipartite quantum correlations. An unconditional and efficient quantum network can be established with a continuous variable (CV) GHZ entangled state because of its deterministic entanglement. Here, we report an implementation of QC scheme using a CV multipartite GHZ entangled state. The submodes of a quadripartite GHZ entangled state are distributed to four spatially separated users. The proposed QC scheme is proved to be secure even when the entanglement is distributed through lossy quantum channels and the collective Gaussian attacks are in the all lossy channels. The presented QC scheme has the capability to be directly extended to a larger scale quantum network by using entangled states with more submodes.

Photonics Research•Feb 1, 2023•10 citations

Conference key agreement in a quantum network

Alexander Pickston, Joseph Ho, Andrés Ulibarrena +6 more

Abstract Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state. In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit, whereas up to N-1 entanglement pairs are consumed in the traditional pair-wise protocol. We demonstrate the advantage provided by GHZ states in a testbed consisting of a photonic six-user quantum network, where four users can distil either a GHZ state or the required number of Bell pairs for QCKA using network routing techniques. In the asymptotic limit, we report a more than two-fold enhancement of the conference key rate when comparing the two protocols. We extrapolate our data set to show that the resource advantage for the GHZ protocol persists when taking into account finite-key effects.

arXiv:2207.01643•npj Quantum Information•Aug 22, 2023•58 citations

Quantum conference key agreement using photonic graph states

Joseph Ho, Massimiliano Proietti, Federico Grasselli +5 more

Future quantum networks will provide multi-node entanglement enabling secure quantum communication on a global scale. Traditional two-party quantum key distribution (2QKD) consumes pairwise entanglement which is costly in constrained networks. Quantum conference key agreement (QCKA) leverages multipartite entanglement within networks to directly produce identical keys among N users, providing up to N-1 rate advantage over 2QKD. Here, we present a four-user QCKA protocol using photonic GHZ states distributed over fibre with combined lengths up to 50 km. Furthermore, we investigate a constrained network consisting of a 6-qubit photonic graph state which we apply network coding routines to distil suitable resource states.

Quantum Technology: Driving Commercialisation of an Enabling Science•Oct 6, 2021•0 citations

Experimental Efficient Source-Independent Quantum Conference Key Agreement

Wen-Ji Hua, Yi-Ran Xiao, Yu Bao +2 more

Multipartite entanglement enables secure group key distribution among multiple users while providing immunity against hacking attacks targeting source devices, thereby realizing source-independent quantum conference key agreement (SI-QCKA). However, previous experimental demonstrations of SI-QCKA have encountered substantial technical challenges, primarily due to the low efficiency and scalability limitations inherent in the generation and distribution of multipartite entanglement. Here, we experimentally demonstrate a scalable and efficient SI-QCKA protocol using polarization-entangled photon pairs in a three-user star network, where Greenberger-Horne-Zeilinger correlations are realized via a post-matching method. We achieve a secure group key rate of $2.11 \times 10^{4}$ bits/s under the single-user channel transmission of 1.64 $\times$ $10^{-1}$ in a symmetric channel loss network. Additionally, we conduct six sets of experiments to investigate the impact of varying channel transmission and random basis selection probabilities on secure key rates. Our work establishes an efficient pathway for SI-QCKA and demonstrates potential scalability for future large-scale multi-user quantum networks.

quant-pharXiv:2512.20038•Research•Dec 24, 2025•7 citations

Quantum conference key agreement with photonic graph states

Alessandro Fedrizzi, Joseph Ho

Future quantum networks will provide multi-node entanglement enabling secure quantum communication on a global scale. Traditional two-party quantum key distribution (2QKD) consumes pairwise entanglement which is costly in constrained networks. Quantum conference key agreement (QCKA) leverages multipartite entanglement within networks to directly produce identical keys among N users, providing up to N-1 rate advantage over 2QKD. In this contribution I will present work on the implementation of QCKA using photonic GHZ states distributed over telecom fibre of up to 50 km combined length. Furthermore, we implemented QCKA on a constrained network consisting of a 6-qubit photonic graph state on which we apply network coding routines to demonstrate the multi-partite advantage over the two-party paradigm.

Quantum Computing, Communication, and Simulation•Mar 9, 2022•0 citations

Performance Analysis of Multiparty GHZ-State Quantum Conference Key Agreement over Optical Fiber Channel

Dipanjan Bera, Ramniwas Meena, Neel Kanth Kundu

Quantum conference key agreement (QCKA) enables multiple spatially separated users to establish a common key with composable information-theoretic security by exploiting multipartite quantum correlations. Greenberger--Horne--Zeilinger (GHZ) states are a natural resource for this task, but their distribution over optical fiber is degraded by transmission loss, polarization decoherence, and detector imperfections. We investigate the finite-key performance of an $N$-party GHZ-based QCKA system using the $N$-BB84 protocol, where each optical link is modeled by extending the bipartite erasure--Pauli channel to incorporate detector dark counts. We characterize the impact of this quantum channel on the shared GHZ state and derive closed-form expressions for the error rates. The analytical results reveal that the local bit-error rate depends only on transmissivity and dark counts, while the global phase-error rate compounds over all $N-1$ links and therefore degrades faster with both distance and the number of parties. These error rates are integrated into a finite-key secret-key-rate (SKR) framework, in which we optimize the parameter-estimation probability via Brent's derivative-free method. Numerical results show that increasing fiber distance and network size reduce the achievable SKR. Furthermore, the optimized parameter-estimation probability consistently increases the SKR and extends the maximum secure distance relative to a fixed-allocation baseline, with comparison to the asymptotic limit quantifying the residual finite-key penalty.

quant-pharXiv:2610.05448•Oct 6, 2026•0 citations
Multipartite entangled states are essential for multiuser quantum cryptography. While large-scale continuous-variable (CV) cluster states, particularly the dual-rail cluster state, have been well studied in measurement-based quantum computation, their cryptographic potential remains underexplored. Here, we propose a three-user conference key protocol using a CV dual-rail cluster state. By applying a node-coloring scheme to the infinite dual-rail graph, we create a six-mode pure graph state ideal for cryptographic tasks. Our results demonstrate near-GHZ (Greenberger-Horne-Zeilinger) performance for quantum conference key agreement (QCKA). Crucially, our protocol uniquely enables bipartite keys post-QCKA, which GHZ states cannot provide. It also surpasses two-mode squeezed vacuum states in generating bipartite keys within downstream-access networks. Considering finite-size effects and impure squeezed states, our scheme remains robust despite experimental imperfections. We also introduce an enhanced method to more accurately estimate bipartite key generation capacity in quantum networks, paving the way for practical multiuser quantum cryptography.
Quantum conference (QC) is a cryptographic task in secure communications that involves more than two users wishing to establish identical secret keys among N users. The Greenberger–Horne–Zeilinger (GHZ) entangled state is the basic resource for quantum cryptographic communication due to the existence of multipartite quantum correlations. An unconditional and efficient quantum network can be established with a continuous variable (CV) GHZ entangled state because of its deterministic entanglement. Here, we report an implementation of QC scheme using a CV multipartite GHZ entangled state. The submodes of a quadripartite GHZ entangled state are distributed to four spatially separated users. The proposed QC scheme is proved to be secure even when the entanglement is distributed through lossy quantum channels and the collective Gaussian attacks are in the all lossy channels. The presented QC scheme has the capability to be directly extended to a larger scale quantum network by using entangled states with more submodes.
Abstract Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state. In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit, whereas up to N-1 entanglement pairs are consumed in the traditional pair-wise protocol. We demonstrate the advantage provided by GHZ states in a testbed consisting of a photonic six-user quantum network, where four users can distil either a GHZ state or the required number of Bell pairs for QCKA using network routing techniques. In the asymptotic limit, we report a more than two-fold enhancement of the conference key rate when comparing the two protocols. We extrapolate our data set to show that the resource advantage for the GHZ protocol persists when taking into account finite-key effects.
Future quantum networks will provide multi-node entanglement enabling secure quantum communication on a global scale. Traditional two-party quantum key distribution (2QKD) consumes pairwise entanglement which is costly in constrained networks. Quantum conference key agreement (QCKA) leverages multipartite entanglement within networks to directly produce identical keys among N users, providing up to N-1 rate advantage over 2QKD. Here, we present a four-user QCKA protocol using photonic GHZ states distributed over fibre with combined lengths up to 50 km. Furthermore, we investigate a constrained network consisting of a 6-qubit photonic graph state which we apply network coding routines to distil suitable resource states.
Multipartite entanglement enables secure group key distribution among multiple users while providing immunity against hacking attacks targeting source devices, thereby realizing source-independent quantum conference key agreement (SI-QCKA). However, previous experimental demonstrations of SI-QCKA have encountered substantial technical challenges, primarily due to the low efficiency and scalability limitations inherent in the generation and distribution of multipartite entanglement. Here, we experimentally demonstrate a scalable and efficient SI-QCKA protocol using polarization-entangled photon pairs in a three-user star network, where Greenberger-Horne-Zeilinger correlations are realized via a post-matching method. We achieve a secure group key rate of 2.11×1042.11 \times 10^{4}2.11×104 bits/s under the single-user channel transmission of 1.64 ×\times× 10−110^{-1}10−1 in a symmetric channel loss network. Additionally, we conduct six sets of experiments to investigate the impact of varying channel transmission and random basis selection probabilities on secure key rates. Our work establishes an efficient pathway for SI-QCKA and demonstrates potential scalability for future large-scale multi-user quantum networks.
Future quantum networks will provide multi-node entanglement enabling secure quantum communication on a global scale. Traditional two-party quantum key distribution (2QKD) consumes pairwise entanglement which is costly in constrained networks. Quantum conference key agreement (QCKA) leverages multipartite entanglement within networks to directly produce identical keys among N users, providing up to N-1 rate advantage over 2QKD. In this contribution I will present work on the implementation of QCKA using photonic GHZ states distributed over telecom fibre of up to 50 km combined length. Furthermore, we implemented QCKA on a constrained network consisting of a 6-qubit photonic graph state on which we apply network coding routines to demonstrate the multi-partite advantage over the two-party paradigm.
Quantum conference key agreement (QCKA) enables multiple spatially separated users to establish a common key with composable information-theoretic security by exploiting multipartite quantum correlations. Greenberger--Horne--Zeilinger (GHZ) states are a natural resource for this task, but their distribution over optical fiber is degraded by transmission loss, polarization decoherence, and detector imperfections. We investigate the finite-key performance of an NNN-party GHZ-based QCKA system using the NNN-BB84 protocol, where each optical link is modeled by extending the bipartite erasure--Pauli channel to incorporate detector dark counts. We characterize the impact of this quantum channel on the shared GHZ state and derive closed-form expressions for the error rates. The analytical results reveal that the local bit-error rate depends only on transmissivity and dark counts, while the global phase-error rate compounds over all N−1N-1N−1 links and therefore degrades faster with both distance and the number of parties. These error rates are integrated into a finite-key secret-key-rate (SKR) framework, in which we optimize the parameter-estimation probability via Brent's derivative-free method. Numerical results show that increasing fiber distance and network size reduce the achievable SKR. Furthermore, the optimized parameter-estimation probability consistently increases the SKR and extends the maximum secure distance relative to a fixed-allocation baseline, with comparison to the asymptotic limit quantifying the residual finite-key penalty.