Skip to main content
Scientific Reports logoLink to Scientific Reports
. 2022 Oct 15;12:17329. doi: 10.1038/s41598-022-22251-8

Continuous variable measurement device independent quantum conferencing with postselection

Alasdair I Fletcher 1,, Stefano Pirandola 1
PMCID: PMC9569376  PMID: 36243765

Abstract

A continuous variable (CV), measurement device independent (MDI) quantum key distribution (QKD) protocol is analyzed, enabling three parties to connect for quantum conferencing. We utilise a generalised Bell detection at an untrusted relay and a postselection procedure, in which distant parties reconcile on the signs of the displacements of the quadratures of their prepared coherent states. We derive the rate of the protocol under a collective pure-loss attack, demonstrating improved rate-distance performance compared to the equivalent non-post-selected protocol. In the symmetric configuration in which all the parties lie the same distance from the relay, we find a positive key rate over 6 km. Such postselection techniques can be used to improve the rate of multi-party quantum conferencing protocols at longer distances at the cost of reduced performance at shorter distances.

Subject terms: Other photonics, Quantum information

Introduction

Quantum Key Distribution (QKD) promises provably secure communication1 based on fundamental physical principles. Relying on the inability to clone arbitrary quantum states2 and by utilising non-orthogonal states or entanglement3, two distant parties are able to agree symmetric cryptographic keys, secure against any attack possible within the laws of quantum mechanics. The technology has rapidly matured, advancing from the first proposed protocols based on transmission of discrete single qubit states4,5 and proof of principle of experiments to practical deployments over long distances68 and networks and network protocols enabling multiple users to communicate securely across metropolitan sized areas and beyond911.

However, whilst QKD offers ultimate security against channel attacks, its practical implementation remains challenging. Many approaches require trusted experimental devices and detectors and therefore suffer from the possibility of so-called side-channel attacks against such devices. Fully Device-Independent approaches to QKD are possible, which entirely eliminate such attacks1214 but these are practically limited by low rates and poor distance scaling. Instead Measurement Device Independent (MDI) QKD15,16 provides a middle ground, offering higher rates17 and various practical implementations1820, by relaxing the assumptions on the protocol to having distant parties send states to a central detector relay which may be controlled by an Eavesdropper (Eve). Malicious behaviour by Eve may be detected by the parties in the reconciliation and parameter estimation stage of the protocol.

Moreover, point-to-point quantum communications are known to be inherently distance limited by the PLOB bound21 expressed by the formula C=-log2(1-η) with the transmissivity η decaying exponentially with distance. Continuous variable (CV) QKD protocols are able to reach rates approaching the PLOB bound, outperforming discrete state protocols; furthermore their experimental implementation is more straightforward1,22. Naively, there was thought to be a 3db (corresponding to η=12) loss-limit on CV QKD, however this has since been exceeded with reverse reconciliation, twin-field QKD2326 and postselection techniques. Postselection techniques rely on the fact that even beyond 3db loss there are regions in parameter space in which the rate remains positive27. By announcing the absolute values of the quadratures of their prepared coherent states the two end parties are able to select only these regions, reconciling the signs of their quadratures into a key with a positive rate even beyond 3db loss. Such post selection techniques have been implemented experimentally28 and have recently been exploited in the MDI setting to extend the maximum distance of two-party CV MDI QKD29. Other similar postselection techniques are also possible and have recently been utilised in30,31 for discrete modulation CV QKD protocols to improve their distance scaling and tolerance to excess noise.

Whilst such postselection techniques have been shown to improve the distance scaling for typical QKD protocols with two end users; it is also frequently desirable, particularly within a network setting, for multiple users to be able to establish a common secret key. Quantum conferencing32 enables the secure distribution of such keys from a single QKD protocol rather than via the composition of multiple bipartite protocols. Such protocols rely on establishing multipartite entangled states between the users such as GHZ states33 in the discrete variable case. Quantum conferencing has attracted a great deal of interest and a variety of protocols have been proposed, including MDI protocols with discrete variables34, twin field protocols3537, consideration of the effect of finite sized keys38 and recently a continuous variable MDI protocol39.

In this work, we provide the first demonstration that the same post selection techniques typically applied to two party QKD can also be utilised to increase the effective range at which CV MDI quantum conferencing can occur. We utilise the same generalised Bell detection from the CV MDI quantum conferencing protocol introduced in39 to establish multipartite correlations between the user’s variables and a similar postselection procedure to that used in29 to extend the effective range of the protocol. Whilst we are restricted by the need to perform numerical integration in large number of dimensions to consider only three parties and pure loss attacks, the protocol presented here is in principle readily extended to N users and entangling cloner attacks.

The structure of the paper is as follows: in “Protocol and detector” we introduce the protocol and explain the structure of the detector; “Rate” explains how the rate of the protocol is calculated; “Results” provides results and “Conclusion” is for conclusions.

Protocol and detector

In this paper, we consider the case of three users undertaking quantum conferencing. The three parties: Alice, Bob and Charlie individually prepare Gaussian modulated coherent states. Each party individually has access to an independent zero-mean Gaussian distribution with standard deviations σA,σB,σC respectively. Each party then draws two independent values from their respective distributions for the value of the q and p quadratures of their coherent state. They encode the absolute values in the variables Qi and Pi respectively and the signs in κi and κi. Thus they prepare coherent states of the form:

|αi=|12(κiQi+κiPi)fori=A,B,C. 1

Each state is sent through a lossy channel to the detector which may be attacked by an eavesdropper (Eve). This is modelled as a beamsplitter attack in which Eve inserts a beamsplitter into each channel, storing the outputs in a quantum memory. In a pure loss attack, Eve does not actively inject any state at the beamsplitter and thus each coherent state is instead mixed with the vacuum state |0.

The structure of the detector is illustrated in Fig. 1 and was devised in39 to perform a generalised Bell detection on the incoming coherent states. It is comprised of a cascade of beamsplitters, each having transmissivity Ti=ii+1. In the case of three parties, which we consider, this corresponds to T1=1/2 and T2=2/3. The beamsplitters are followed by two q  (p) homodyne detections and a final homodyne detection in the p  (q) quadrature and the results of all the measurements are publicly broadcast. Operated correctly, in the entanglement based representation1 the detector has the effect of projecting the Alice-Bob-Charlie state into a symmetric state with GHZ-like correlations between each parties state39. The two possible configurations are switched between randomly and are announced during the basis reconciliation stage of the protocol. If the first configuration (two q and one p detection) was selected, the parties will attempt to reconcile their values of κA,κB,κC into a secure key. Conversely, if the second configuration is utilised, the parties will attempt to reconcile their values of κA,κB,κC. At this point each party reveals their values of Qi and Pi, and publicly broadcasts them to every other user. Using their knowledge of Qi and Pi, the parties can perform postselection, only retaining instances of the protocol where their mutual information exceeds Eve’s Holevo information. Figure 2 depicts the protocol being performed under the pure loss attack assumed throughout this paper.

Figure 1.

Figure 1

Structure of the detector, demonstrating the two possible orientations. Input modes are mixed by two beamsplitters with transmissivities T1=12 and T2=23. In the first configuration (pictured left) the states undergo two q homodyne detections and one p homodyne detection. The parties will attempt reconciliation between κA,κB,κC. In the second orientation (pictured right) the states undergo two p homodyne detections and one q homodyne detection. In this case the parties attempt reconciliation on κA,κB,κC.

Figure 2.

Figure 2

Operation of the detector under a collective pure loss attack. Eve attacks each of the incoming channels by inserting beamsplitters with transmissivities τA,τB,τC, which combine the incoming signals with vacuum states |0. Eve stores her output modes in a quantum memory (QM). The remaining modes are mixed in the cascade of beamsplitters and then undergo homodyne detection. The results of the homodyne detections γq1,γq2,γp are publicly announced. Alice, Bob and Charlie also publicly announce the absolute values of the quadratures of their prepared coherent states QA,QB,QC,PA,PB,PC. In this configuration the parties attempt to reconcile their values of κA,κB,κC.

Rate

We first sketch the method used to determine the rate. At the end of the protocol the parties perform pairwise reconciliation between κA,κB,κC or κA,κB,κC depending on the orientation of the detector. In the asymptotic limit of a large number of uses the rate of the protocol is given by:

Rij=Iij-χ 2

where Iij is the binary mutual information between the sign variables κi and κj or κi and κj. χ is the Holevo information. The mutual information can be found by utilising Bayes’ Theorem and the distribution of measurement outcomes as detailed in “Mutual information”. The Holevo information is calculated by carefully considering Eve’s state at the end of the protocol as explained in “Holevo bound”. Additionally, since we ultimately wish to perform postselection to increase the performance of the protocol we work with single-point versions of the above quantities I~ij and χ~ which are the values conditioned upon the quadratures and measurement outcome. To this end we start by considering the initial covariance matrix of the Alice–Bob–Charlie–Eve system, which is given by:

VABCE=IAIBICVE 3

where I is the two-by-two identity matrix and for a pure loss attack VE=III. The mean value of the Alice–Bob–Charlie system is:

x¯ABC=(κAQA,κAPA,κBQB,κBPB,κCQC,κCPC)T. 4

The mean value of Eve’s system is zero. After propagation through the detector’s array of beamsplitters and the homodyne detections, the distribution of measurement outcomes is given by:

p(γp|κA,κB,κC,PA,PB,PC)=12πvpexp(-(γp-p¯)22) 5

where

p¯=T1T2τAκAPA+(1-T1)T2τBκBPB+(1-T2)τCκCPC. 6

We have implicitly removed the conditioning on the modulus and absolute value of the q quadratures from the notation as there is no dependence upon them. Similarly for the opposite detector configuration:

p(γq|κA,κB,κC,QA,QB,QC)=12πvqexp(-(γq-q¯)22) 7

where

q¯=T1T2τAκAQA+(1-T1)T2τBκBQB+(1-T2)τCκCQC. 8

Finally, we have implicitly assumed throughout that the homodyne detectors have perfect efficiency.

Mutual information

We first introduce the following compact notation κ=(κA,κB,κC); P=(PA,PB,PC), κ\A=(κB,κC) which simplifies the following expressions. Let us recall the definition of the single point mutual information between the two binary variables κi and κj. This is clearly just the mutual information conditioned on the announced variables γp and P:

I~ij=Hκi|P,γp-κjp(κj|P,γp)Hκi|κjP,γp 9

where H is the binary entropy so that:

Hκi|P,γp=-p(κi|P,γp)log2(p(κi|P,γp))-(1-p(κi|P,γp))log2(1-p(κi|P,γp)) 10

and

Hκi|κj,P,γp=-p(κi|κj,P,γp)log2(p(κi|κj,P,γp))-(1-p(κi|κj,P,γp))log2(1-p(κi|κj,P,γp)). 11

From the symmetry of the detector we have IAB=IAC=IBC and for simplicity we consider only IAB from this point onwards. Using Eq. (5) and Bayes’ theorem we first calculate the probability of positive and negative values for κA conditioned on κB,κC, the magnitudes of the p quadratures P and the measurement outcome γp:

p(κA|κ\A,P,γp)=p(γp|κ,P)p(κA|κ\A,P)p(γp|κ\A,P) 12

Noting that,

p(γp|κ\A,P)=κAp(γp|κ,P)p(κA|κ\A,P) 13

and p(κA|κ\A,P)=1/2 we reach:

p(κA|κ\A,P,γp)=p(γp|κ,P)κAp(γp|κ,P). 14

We may then remove the conditioning on κC to find p(κA|κB,P,γp) for the second term in the single point mutual information.

p(κA|κB,P,γp)=κCp(κA|κ\A,Pγp)p(κ\b|κB,P), 15

so that we may write

p(κA|κB,P)=κCp(γp|κ,P)κAκCp(γp|κ,P). 16

Similarly to further remove the dependence from κB:

p(κA|P,γp)=κBκCp(γp|κ,P)κAκBκCp(γp|κ,P). 17

By the same approach we can also find p(κB|P,γp), enabling the sum in Eq. (9) to be taken. Finally in order to take the integral over the single point mutual information we require the probability of all the variables

p(γp,P)=κp(γp|κP)p(κAPA)p(κBPB)p(κCPC). 18

Holevo bound

At the end of the protocol Eve is left with the state ρ^E|P,γp which is her total state conditioned on the announced absolute values of the p quadratures P and the measurement outcome γp. This state is a convex combination of pure Gaussian states corresponding to given values of κA,κB,κC and hence Eve’s total state may be written:

ρ^E|P,γp=κp(κ|P,γp)ρ^E|κ,P,γp. 19

It is important to note that whilst the conditional states, ρ^E|κ,P,γp, are pure and Gaussian the total state, ρ^E|P,γp is not, which complicates our analysis. Nonetheless, assuming that Eve performs a collective attack on the protocol the relevant quantity to calculate is the Holevo information χ. We can again write this as a single point quantity in the following way.

χ~(E:κi|P,γp)=S(ρ^E|P,γp)-S(ρ^E|κi,P,γp) 20

where χ~(E:κi|P,γp) is the single point Holevo information and S is the von Neumann entropy which we recall is calculated from the eigenvalues {λi} of a density matrix ρ^ by:

S(ρ^)=-iλilog2(λi). 21

First let us write the conditional states ρ^E|κPγp as:

ρ^E|κPγp=|EκAκBκCP,γpEκAκBκCP,γp| 22

We consider the matrix of overlaps O of this state for all the combinations of κA,κB,κC.

O=1CBBCAACABABCC1BCBACAABCABBBC1CABABCAACBCBC1ABCABACAAACABABC1CBBCACAABCABC1BCBABABCAACBBC1CABCABACABCBC1(-1-1-1)(-1-11)(-11-1)(-111)(1-1-1)(1-11)(11-1)(111) 23

The values in the far column denote the row values of κA,κB,κC. The columns may be similarly labelled. O is clearly separable as:

O=1AA11BB11CC1 24

which implies:

|EκAκBκCP,γp=|EκAP,γp|EκBP,γp|EκCP,γp. 25

Each of these states lies in a two-dimensional Hilbert space. Using x to index the parties ABC we may expand the states as:

|Eκi=-1P,γp=c0|Φ0(x)+c1|Φ1(x) 26
|Eκi=1P,γp=c0|Φ0(x)-c1|Φ1(x) 27

and find the following relation for the coefficients:

|c0(x)|2=12(1+X) 28
|c1(x)|2=12(1-X) 29

where X labels the corresponding values ABC from Eq. (23). For two Gaussian states with the same covariance matrix V and mean values x¯1 and x¯2 the following relation holds40:

Tr(ρ^1ρ^2)=exp(-14(x¯1-x¯2)V-1(x¯1-x¯2)) 30

which we use to calculate

A=EκA=-1P,γp|EκA=1P,γp, 31
B=EκB=-1P,γp|EκB=1P,γp, 32
C=EκC=-1P,γp|EκC=1P,γp. 33

We are now able to give ρ^E|P,γp in the {|Φ0(A),|Φ1(A)}{|Φ0(B),|Φ1(B)}{|Φ0(C),|Φ1(C)} basis. Describing the row position with the binary string (ijk) and similarly the column position with (i,j,k) each component of the density matrix can be calculated by:

(ρ^E|Pγp)(ijk)(ijk)=κp(κ|P,γp)Φi(A)|EκAP,γpEκAP,γp|Φi(A)Φj(B)|EκBP,γpEκBP,γp|Φj(2)Φk(C)|EκCP,γpEκCP,γp|Φk(C). 34

By calculating the following inner products:

Φ0(x)|Eκx=-1P,γp=c0(x) 35
Φ0(i)|Eκx=1P,γp=c0(x) 36
Φ1(i)|Eκx=-1P,γp=c1(x) 37
Φ1(i)|Eκx=1P,γp=-c1(x) 38

we can therefore immediately find the diagonal components of the density matrix:

(ρ^E|P,γp)(ijk)(ijk)=|ci(A)|2|cj(B)|2|ck(C)|2. 39

The off diagonal terms are given by:

(ρ^E|P,γp)(ijk)(ijk)=ci(A)(ci(A))cj(B)(cj(B))ck(C)(ck(C))Λ(i,j,k,i,j,k) 40

where Λ(i,j,k,i,j,k) is given by

Λ(i,j,k,i,j,k)=κ(-1)f(κA)|i-i|+f(κB)|j-j|+f(κC)|k-k|p(κ|P,γp) 41

where f is a function such that f(κi=-1)=0 and f(κi=1)=1. We therefore have all the components of ρ^E|P,γp from which we may numerically find the eigenvalues and compute the first term in the Holevo bound (Eve’s conditional output state following the protocol ρ^E|P,γp has dimension 2N. Therefore for N3, including the tri-partite case considered in this paper, the eigenvalues of this state cannot be given in closed form. Therefore the entropy of the state and consequently the single point Holevo information χ~ can only be evaluated numerically for given values of the protocol’s parameters. This greatly complicates numerical integration in Eq. (47) as no explicit expression for the single point rate can be given. It is for this reason that our analysis is limited to pure loss attacks and three users, even though the analysis is readily extended to an arbitrary number of users and entangling cloner attacks.). For the second term in the Holevo bound we need Eve’s state conditioned on κA. If κA=-1:

ρ^E|κA=-1,P=|EκA=-1P,γpEκA=-1P,γp|(κBκCp(κB,κC|κA=-1,P,γp)|EκBκC|κA=-1P,γpEκBκC|κA=-1P,γp|); 42

if κA=1:

ρ^E|κA=1,P=|EκA=1P,γpEκA=1P,γp|(κBκCp(κB,κC|κA=1,P,γp)|EκBκC|κA=1P,γpEκBκC|κA=1P,γp|). 43

The same method explained above may be used to determine components of these density matrices in the {|Φ0(B),|Φ1(B)}{|Φ0(C),|Φ1(C)} basis. The eigenvalues may then be used to calculate the second term in the Holevo bound.

Postselection

We now demonstrate how the single point quantities may be used to calculate the postselected rate RPS. The mutual information IAB may be found by integrating the single point mutual information I~AB

IAB=p(P,γp)I~AB(P,γp)dPdγp 44

Similarly we do the same for the Holevo information:

χ=p(P,γp)χ~(P,γp)dPdγp 45

By defining the single point rate as R~=I~AB-χ~. Thus the overall rate becomes:

R=p(P,γp)R~(P,γp)dPdγp. 46

The postselection ensures the parties only use instances of the protocol where the single point rate is positive. Hence the postselected rate RPS becomes:

RPS=p(P,γp)max[R~(P,γp),0]dPdγp 47
=Γp(P,γp)R~(P,γp)dPdγp 48

where Γ denotes the region in which the single point rate is positive.

Results

We now present the numerical results for the post-selected rate of the protocol. By utilising the relation τ=10-γd and setting γ=0.02/km (equivalent to 0.2 db/km), which corresponds to state of the art fibre optics, the rate of the protocol is expressed in terms of distances (d) of the parties from the detector. In particular, we consider the symmetric configuration in which each of the parties is located the same distance from the detector. Other asymmetric configurations can be considered within the same framework, by mapping the distance of the user furthest away into the transmissivity of each incoming channel. Thus the results presented here represent the worst case scenario for any other asymmetric configuration of the parties.

Figure 3 shows the rate-distance performance of the protocol in the asymptotic limit, assuming that a pure-loss attack is undertaken by Eve. We work with perfect detector efficiency and with the variance of each prepared quadrature σA=σB=σB=1 . We note that in general it may be possible to optimise the performance of the protocol over these parameters. Our results demonstrate that a positive rate can be maintained over a greater distance than in the corresponding 3-party case (shown for comparison in Fig. 3, albeit at the cost of lower rates at short distances). In particular the new protocol outperforms the equivalent protocol without postselection for distances greater than 1km.

Figure 3.

Figure 3

Post-selected rate of the protocol for the symmetric party configuration. Rate plotted with perfect detector efficiency and the variance in all prepared quadratures satisfy σA=σB=σC=1. The rate of the equivalent 3-party protocol from39 with optimised parameters, under a pure loss attack from is shown for comparison (red dashed line).

Conclusion

We have demonstrated a 3-party CV-MDI-QKD protocol that combines a generalised Bell detection with a postselection regime based on performing reconciliation on the signs of prepared quadratures of coherent states. We show that improved rate-distance performance is possible compared to the equivalent 3-party protocol without postselection, allowing a rate in excess of 10-4 bits per use at greater than 3km and a positive rate for distances of up to 6km. Our protocol also outperforms the equivalent protocol without postselection for distances greater than 1km. Moreover since these protocols have exactly the same structure in terms of state preparation and the detector relay, it is possible to use one such relay to perform either protocol, choosing whichever will give the higher rate. That is, if the users are able to establish their distances from the detector, they choose whether or not to announce the absolute values of their quadratures and undertake postselection depending on whether or not this will produce a better rate. Whilst σA,σB,σC are preset so any optimisation over these parameters must consider both protocols simultaneously it is still possible to retain the advantages of higher rate at shorter distances from the non-postselected protocol in addition to the improved long distance performance from our protocol.

The need to undertake a high-dimensional numerical integral given in Eq. (47), for a function that cannot be given in closed form (Eve’s conditional output state following the protocol ρ^E|P,γp has dimension 2N. Therefore for N3, including the tri-partite case considered in this paper, the eigenvalues of this state cannot be given in closed form. Therefore the entropy of the state and consequently the single point Holevo information χ~ can only be evaluated numerically for given values of the protocol’s parameters. This greatly complicates numerical integration in Eq. (47) as no explicit expression for the single point rate can be given. It is for this reason that our analysis is limited to pure loss attacks and three users, even though the analysis is readily extended to an arbitrary number of users and entangling cloner attacks.) to compute the post-selected key rate, limits our analysis to the 3-party case and pure-loss attacks. Nonetheless it may be possible to extend the study to the general N party case, maintaining the same structure of detector as in39 and considering entangling cloner attacks. Thus, our new protocol demonstrates that secure, multi-party conferencing can be achieved over improved distances, while retaining the security advantages of an MDI QKD protocol.

Acknowledgements

A.I.F. acknowledges funding from the EPSRC via a Doctoral Training Partnership (EP/R513386/1). S. P. acknowledges funding from the European Union via the flagship project “Continuous Variable Quantum Communications” (CiViQ, Grant agreement No. 820466) and the EPSRC via the UK Quantum Communications Hub (Grant No. EP/T001011/1). The authors would like to thank Kieran Wilkinson for helpful discussions.

Author contributions

A.I.F. performed the analysis of the rate of the protocol, collected the numerical results and wrote the manuscript. S.P. devised the protocol and supervised the project. Both authors reviewed the manuscript and contributed to improving it.

Data availability

The datasets used and analysed during the current study are available from the corresponding author on reasonable request.

Competing interests

The authors declare no competing interests.

Footnotes

Publisher's note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

References

  • 1.Pirandola S, Wallden P, et al. Advances in quantum cryptography. Adv. Opt. Photon. 2020;12:1012. doi: 10.1364/aop.361502. [DOI] [Google Scholar]
  • 2.Wootters WK, Zurek WH. A single quantum cannot be cloned. Nature. 1982;299:802. doi: 10.1038/299802a0. [DOI] [Google Scholar]
  • 3.Ekert AK. Quantum cryptography based on Bell’s theorem. Phys. Rev. Lett. 1991;67:661. doi: 10.1103/PhysRevLett.67.661. [DOI] [PubMed] [Google Scholar]
  • 4.Quantum cryptography: Public-key distribution and coin tossing. In Proceedings of IEEE International Conference on Computers, Systems and Signal Processing, Bangalore, India, pp. 175–179 (1984).
  • 5.Bennett CH. Quantum cryptography using any two nonorthogonal states. Phys. Rev. Lett. 1992;68:3121. doi: 10.1103/PhysRevLett.68.3121. [DOI] [PubMed] [Google Scholar]
  • 6.Stucki D, Walenta N, Vannel F, Thew RT, Gisin N, Zbinden H, Gray S, Towery CR, Ten S. High rate, long-distance quantum key distribution over 250 km of ultra low loss fibres. New J. Phys. 2009;11:075003. doi: 10.1088/1367-2630/11/7/075003. [DOI] [Google Scholar]
  • 7.Pittaluga M, Minder M, Lucamarini M, Sanzaro M, Woodward RI, Li M-J, Yuan Z, Shields AJ. 600-km repeater-like quantum communications with dual-band stabilization. Nat. Photon. 2021;15:530. doi: 10.1038/s41566-021-00811-0. [DOI] [Google Scholar]
  • 8.Zhang Y, Chen Z, Pirandola S, Wang X, Zhou C, Chu B, Zhao Y, Xu B, Yu S, Guo H. Long-distance continuous-variable quantum key distribution over 202.81 km of fiber. Phys. Rev. Lett. 2020;125:10502. doi: 10.1103/PhysRevLett.125.010502. [DOI] [PubMed] [Google Scholar]
  • 9.Joshi SK, Aktas D, Wengerowsky S, Loncaric M, Neumann SP, Liu B, Scheidl T, Lorenzo GC, Samec E, Kling L, Qiu A, Razavi M, Stipcevic M, Rarity JG, Ursin R. A trusted node-free eight-user metropolitan quantum communication network. Sci. Adv. 2020 doi: 10.1126/sciadv.aba0959. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 10.Dynes JF, Wonfor A, Tam WW, Sharpe AW, Takahashi R, Lucamarini M, Plews A, Yuan ZL, Dixon AR, Cho J, Tanizawa Y, Elbers JP, Greißer H, White IH, Penty RV, Shields AJ. Cambridge quantum network. NPJ Quantum Inf. 2019;5:101. doi: 10.1038/s41534-019-0221-4. [DOI] [Google Scholar]
  • 11.Solomons NR, Fletcher AI, Aktas D, Venkatachalam N, Wengerowsky S, Loncaric M, Neumann SP, Liu B, Samec icv, Stipčevič M, Ursin R, Pirandola S, Rarity JG, Joshi SK. Scalable authentication and optimal flooding in a quantum network. PRX Quantum. 2022;3:020311. doi: 10.1103/PRXQuantum.3.020311. [DOI] [Google Scholar]
  • 12.Barrett J, Hardy L, Kent A. No signaling and quantum key distribution. Phys. Rev. Lett. 2005;95:010503. doi: 10.1103/PhysRevLett.95.010503. [DOI] [PubMed] [Google Scholar]
  • 13.Schwonnek R, Goh KT, Primaatmaja IW, Tan EY, Wolf R, Scarani V, Lim CC. Device-independent quantum key distribution with random key basis. Nat. Commun. 2021;12:2880. doi: 10.1038/s41467-021-23147-3. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 14.Pironio S, Acin A, Brunner N, Gisin N, Massar S, Scarani V. Device-independent quantum key distribution secure against collective attacks. New J. Phys. 2009;11:045021. doi: 10.1088/1367-2630/11/4/045021. [DOI] [PubMed] [Google Scholar]
  • 15.Braunstein SL, Pirandola S. Side-channel-free quantum key distribution. Phys. Rev. Lett. 2012;108:130502. doi: 10.1103/PhysRevLett.108.130502. [DOI] [PubMed] [Google Scholar]
  • 16.Lo HK, Curty M, Qi B. Measurement-device-independent quantum key distribution. Phys. Rev. Lett. 2012;108:130503. doi: 10.1103/PhysRevLett.108.130503. [DOI] [PubMed] [Google Scholar]
  • 17.Pirandola S, Ottaviani C, Spedalieri G, Weedbrook C, Braunstein SL, Lloyd S, Gehring T, Jacobsen CS, Andersen UL. High-rate measurement-device-independent quantum cryptography. Nat. Photon. 2015;9:397. doi: 10.1038/nphoton.2015.83. [DOI] [Google Scholar]
  • 18.Tang G-Z, Li C-Y, Wang M. Polarization discriminated time-bin phase-encoding measurement-device-independent quantum key distribution. Quantum Eng. 2021;3:e79. doi: 10.1002/que2.79. [DOI] [Google Scholar]
  • 19.Kwek L-C, Cao L, Luo W, Wang Y, Sun S, Wang X, Liu AQ. Chip-based quantum key distribution. AAPPS Bull. 2021;31:15. doi: 10.1007/s43673-021-00017-0. [DOI] [Google Scholar]
  • 20.Cui ZX, Zhong W, Zhou L, Sheng YB. Measurement-device-independent quantum key distribution with hyper-encoding. Sci. China Phys. Mech. Astron. 2019 doi: 10.1007/s11433-019-1438-6. [DOI] [Google Scholar]
  • 21.Pirandola S, Laurenza R, Ottaviani C, Banchi L. Fundamental limits of repeaterless quantum communications. Nat. Commun. 2017;8:15043. doi: 10.1038/ncomms15043. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 22.Laudenbach F, Pacher C, Fung C-HF, Poppe A, Peev M, Schrenk B, Hentschel M, Walther P, Hübel H. Continuous-variable quantum key distribution with Gaussian modulation—the theory of practical implementations (Adv. Quantum Technol. 1/2018) Adv. Quantum Technol. 2018;1:1870011. doi: 10.1002/qute.201870011. [DOI] [Google Scholar]
  • 23.Lucamarini M, Yuan ZL, Dynes JF, Shields AJ. Overcoming the rate-distance limit of quantum key distribution without quantum repeaters. Nature. 2018;557:400. doi: 10.1038/s41586-018-0066-6. [DOI] [PubMed] [Google Scholar]
  • 24.Chen JP, Zhang C, Liu Y, Jiang C, Zhang WJ, Han ZY, Ma SZ, Hu XL, Li YH, Liu H, Zhou F, Jiang HF, Chen TY, Li H, You LX, Wang Z, Wang XB, Zhang Q, Pan JW. Twin-field quantum key distribution over a 511 km optical fibre linking two distant metropolitan areas. Nat. Photon. 2021;15:570. doi: 10.1038/s41566-021-00828-5. [DOI] [Google Scholar]
  • 25.Wang S, Yin ZQ, He DY, Chen W, Wang RQ, Ye P, Zhou Y, Fan-Yuan GJ, Wang FX, Chen W, Zhu YG, Morozov PV, Divochiy AV, Zhou Z, Guo GC, Han ZF. Twin-field quantum key distribution over 830-km fibre. Nat. Photon. 2022;16:154. doi: 10.1038/s41566-021-00928-2. [DOI] [Google Scholar]
  • 26.Yin HL, Fu Y. Measurement-device-independent twin-field quantum key distribution. Sci. Rep. 2019;9:1. doi: 10.1038/s41598-019-39454-1. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 27.Silberhorn C, Ralph TC, Lütkenhaus N, Leuchs G. Continuous variable quantum cryptography: Beating the 3 dB loss limit. Phys. Rev. Lett. 2002;89:167901. doi: 10.1103/PhysRevLett.89.167901. [DOI] [PubMed] [Google Scholar]
  • 28.Symul T, Alton DJ, Assad SM, Lance AM, Weedbrook C, Ralph TC, Lam PK. Experimental demonstration of post-selection-based continuous-variable quantum key distribution in the presence of Gaussian noise. Phys. Rev. A Atom. Mol. Opt. Phys. 2007;76:030303. doi: 10.1103/PhysRevA.76.030303. [DOI] [Google Scholar]
  • 29.Wilkinson KN, Papanastasiou P, Ottaviani C, Gehring T, Pirandola S. Long-distance continuous-variable measurement-device-independent quantum key distribution with postselection. Phys. Rev. Res. 2020;2:033424. doi: 10.1103/physrevresearch.2.033424. [DOI] [Google Scholar]
  • 30.Lin J, Upadhyaya T, Lütkenhaus N. Asymptotic security analysis of discrete-modulated continuous-variable quantum key distribution. Phys. Rev. X. 2019;91:41064. doi: 10.1103/PhysRevX.9.041064. [DOI] [Google Scholar]
  • 31.Liu WB, Li CL, Xie YM, Weng CX, Gu J, Cao XY, Lu YS, Li BH, Yin HL, Chen ZB. Homodyne detection quadrature phase shift keying continuous-variable quantum key distribution with high excess noise tolerance. PRX Quantum. 2021;2:1. doi: 10.1103/PRXQuantum.2.040334. [DOI] [Google Scholar]
  • 32.Murta G, Grasselli F, Kampermann H, Bruß D. Quantum conference key agreement: A review. Adv. Quantum Technol. 2020;3:2000025. doi: 10.1002/qute.202000025. [DOI] [Google Scholar]
  • 33.Chen K, Lo H-K. Multi-partite quantum cryptographic protocols with noisy GHZ States. Quantum Inf. Comput. 2007;7:689. [Google Scholar]
  • 34.Fu Y, Yin HL, Chen TY, Chen ZB. Long-distance measurement-device-independent multiparty quantum communication. Phys. Rev. Lett. 2015;114:1. doi: 10.1103/PhysRevLett.114.090501. [DOI] [PubMed] [Google Scholar]
  • 35.Zhao S, Zeng P, Cao W-F, Xu X-Y, Zhen Y-Z, Ma X, Li L, Liu N-L, Chen K. Phase-matching quantum cryptographic conferencing. Phys. Rev. Appl. 2020;14:024010. doi: 10.1103/PhysRevApplied.14.024010. [DOI] [Google Scholar]
  • 36.Cao X-Y, Lu Y-S, Li Z, Gu J, Yin H-L, Chen Z-B. High key rate quantum conference key agreement with unconditional security. IEEE Access. 2021;9:128870. doi: 10.1109/ACCESS.2021.3113939. [DOI] [Google Scholar]
  • 37.Li Z, Cao XY, Li CL, Weng CX, Gu J, Yin HL, Chen ZB. Finite-key analysis for quantum conference key agreement with asymmetric channels. Quantum Sci. Technol. 2021 doi: 10.1088/2058-9565/ac1e00. [DOI] [Google Scholar]
  • 38.Grasselli F, Kampermann H, Bruß D. Finite-key effects in multipartite quantum key distribution protocols. N. J. Phys. 2018 doi: 10.1088/1367-2630/aaec34. [DOI] [Google Scholar]
  • 39.Ottaviani C, Lupo C, Laurenza R, Pirandola S. Modular network for high-rate quantum conferencing. Commun. Phys. 2019;2:118. doi: 10.1038/s42005-019-0209-6. [DOI] [Google Scholar]
  • 40.Banchi L, Braunstein SL, Pirandola S. Quantum fidelity for arbitrary Gaussian states. Phys. Rev. Lett. 2015;115:260501. doi: 10.1103/PhysRevLett.115.260501. [DOI] [PubMed] [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Data Availability Statement

The datasets used and analysed during the current study are available from the corresponding author on reasonable request.


Articles from Scientific Reports are provided here courtesy of Nature Publishing Group

RESOURCES