Next Article in Journal
Coupling Efficiency of a Partially Coherent Radially Polarized Vortex Beam into a Single-Mode Fiber
Next Article in Special Issue
Performance Analysis of Continuous-Variable Quantum Key Distribution with Multi-Core Fiber
Previous Article in Journal
Coupled Vibration Analysis of Submerged Floating Tunnel System in Wave and Current
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Multipartite Continuous Variable Quantum Conferencing Network with Entanglement in the Middle

1
School of Information Science and Engineering, Central South University, Changsha 410083, China
2
School of IOT Engineering, Taihu University, Wuxi 214064, China
*
Author to whom correspondence should be addressed.
Appl. Sci. 2018, 8(8), 1312; https://doi.org/10.3390/app8081312
Submission received: 28 June 2018 / Revised: 1 August 2018 / Accepted: 4 August 2018 / Published: 7 August 2018
(This article belongs to the Special Issue Quantum Optics and Quantum Information Processing 2018)

Abstract

:

Featured Application

This work may be used to establish a cryptographic conference for more than 100 users.

Abstract

We suggest a continuous variable quantum conferencing network scheme with an entangled source in the middle. Here, the source generates a multipartite entangled state and distributes the modes of the state to an arbitrary number of legitimate network users. The entangled modes that were received and measured by the users share mutual information, which is utilized to generate secure conferencing key between users. The scheme is proven secure against collective attacks on both the untrusted source in the middle and all the quantum links. Simulation results show that the presented scheme can achieve high rate secure conferencing for 100 users within a 400 m-radius community or factory area.
PACS:
03.67.Dd; 42.50.-p; 89.70.Cf

1. Introduction

Quantum key distribution (QKD) [1,2,3], which is one of the most widely implemented areas of quantum information, enables secure communication for legal participants over public channels. The security of QKD has been guaranteed on the theory of quantum physics against adversaries with unlimited computing power [4,5]. Continuous variable (CV) QKD [6,7,8] provides secret key rates as high as half of the Pirandola–Laurenza–Ottaviani–Banchi bound with off-the-shelf devices. So far, theoretical studies and experimental implementations of CVQKD have been put forward, respectively.
As a crucial landmark, a quantum network was proposed to extend QKD from point-to-point configuration to a multi-user and large-scale scenario. A series of quantum networks based on point-to-point QKD devices are designed and developed [9,10,11,12,13], including two principle types: quantum channel switching networks [14] and trusted-repeater-based quantum networks [15]. However, in these quantum network schemes, quantum memories are required for restoring quantum states. Moreover, there is an urgent need to address the security problems caused by the repeater nodes in the quantum networks, which may not be trusted in practical situations.
Recent developments in the field of entanglement based multipartite QKD [16,17,18] have led to a renewed interest in the construction of QKD. Unlike the conventional point-to-point QKD, the CV QKD with entanglement in the middle [16] utilizes an untrusted third party to generalize Einstein-Podolsky-Rosen states, which are used for establishing the secure communication between two legitimate parties against both collective attacks and coherent attacks [18]. On this basis, the tripartite CV QKD with entanglement source in the middle is proposed for providing secure key generation of three legitimate parties against coherent attacks on both the quantum links and the untrusted source. Although some research has been carried out on the CV QKD with entanglement in the middle, the mechanism by which utilizes an untrusted entanglement source to build a quantum network with arbitrary number of users has not been established.
Recently, an measurement-device-independent (MDI) star network based on CV systems has been proposed [19], which provides high-rate quantum conference and quantum secret sharing services of a building-sized transmission distance. However, the commercial implementation of this MDI star network is limited by the transmission distance. This paper proposes a new methodology for constructing a quantum conferencing network with an entanglement source in the middle, based on multipartite CV Greenberger-Horne-Zeilinger (GHZ) states generation and homodyne detection. Entangled modes of CV GHZ states are generated in the untrusted source in the middle, and distributed to an arbitrary number of legitimate network users. After the homodyne detections of the received modes and the postprocessing procedures, each pair of the parties share mutual information for generating multipartite quantum cryptographic conferencing key. Security analysis proves that the entanglement-based quantum conferencing scheme is able to provide secure communication against collective attacks. Moreover, by applying a Gaussian de Finetti reduction [20], the security against coherent attacks is also guaranteed [19]. Simulation results show that our scheme can establish high rate secure conferencing communication for about 100 users in a quantum network with a radius of hundreds of meters.
This paper is organized as follows. In Section 2, we propose the multipartite quantum conferencing scheme with entanglement in the middle. In Section 3, we analyze the security of the scheme against collective attacks and provide a derivation progress for the key rate. The simulation results are shown in Section 4. Finally, we draw our conclusions in Section 5.

2. A Quantum Conferencing Scheme with Entanglement in the Middle

The proposed entanglement-based CV quantum conferencing network is consists of an arbitrary number (N) of legitimate users, an entanglement source in the middle and links from the source to the users, which include classical networks and quantum channels. The entanglement source prepares an x-quadrature-squeezed state a ^ 1 and N 1 p-quadrature-squeezed state a ^ 2 , , N , which are illustrated in Figure 1. As shown in Figure 1, the source combines the above N states by a sequence of beam splitters with decreasing transmissivities T k = 1 1 / ( N k + 1 ) for k = 1 , , N 1 . The output modes a ^ 1 , , N after the combinations by the beam splitters are entangled in a multipartite GHZ state which satisfies the relations of x-quadratures k = 1 N a ^ k x 0 and p-quadratures a ^ k p a ^ k p 0 for any k , k = 1 , , N . This multipartite GHZ state is utilized for generating secret key in our quantum conferencing scheme.
The source sends the N modes of the GHZ state to N legitimate parties named as Bob 1 , , N , respectively. The entangled modes travel through N noisy quantum channels toward the users, respectively. For simplicity, we consider a symmetric configuration of the quantum conferencing scheme that all quantum channels from the source to the users have the same length. In a practical scenario, the transmissivity and thermal noise of the longest quantum channel are selected as the reference to the network configuration. The legitimate parties receive the N entangled modes a ^ 1 , , N transmitted through the quantum channels and perform homodyne detection on them, respectively. With the measurement results, the users share mutual information which can generate a secret key for network communication after post-processing procedures. For a quantum conferencing scheme, the result of the ith user is used for reference to the reconciliation procedures, which let other users generate secret keys that can establish secure communication with the ith user, respectively. The CV quantum conferencing protocol with an entanglement source in the middle goes as follows.
  • The source in the middle prepares a CV GHZ state ρ 1 of N entangled modes a ^ 1 , , N , and sends them to N legitimate parties Bob 1 , , N through quantum channels with the same transmissivity η , respectively.
  • After travelling through the noisy channels, N entangled modes a ^ 1 , , N of the multipartite GHZ state ρ 2 are received by Bob 1 , , N , respectively.
  • The users perform homodyne detections on the p-quadratures of the received modes, respectively. Then, they perform quadrature measurement.
  • With the results of the measurement, the users use a public channel to complete following procedures as parameter estimation, information reconciliation and privacy amplification.

Collective Attacks on Quantum Conferencing Scheme with Entanglement in the Middle

The best attack strategy of the eavesdropper Eve on the quantum star network is to perform attacks on all the quantum links and the entangled source in the middle. Since the Gaussian state can maximize the information of both the users and Eve, we consider the worst case that Eve fakes the source and prepares the multipartite Gaussian GHZ state herself [16]. Moreover, the Gaussian attacks of the links and the entangled source can be reduced to an attack of the links only [21].
At the beginning of eavesdropping, Eve replaces each of the original lossy channels with a noiseless channel and a beam splitter, of which the transmissivity is equal to the channel loss of the original channel η , and the thermal noise is n ¯ . Eve prepares entangled ancillary modes E ^ 1 , , N and injects them onto the entangled modes a ^ 1 , , N by her beam splitters of the channels, respectively. The output ancillary modes E ^ 1 , , N are stored in Eve’s quantum memory, and the injected modes a ^ 1 , , N are sent to the users, respectively. For each ancillary mode of the beam splitters, Eve performs a collective Gaussian attack [22,23]. Although the entangled cloner collective attacks are simpler for analysing the security, coherent attacks are the most general and powerful attacks for the eavesdropper Eve [22]. Since the performance of coherent attacks can be calculated as in Ref. [20] by applying a Gaussian de Finetti reduction [24], in our work, we focus on the security analysis of the quantum conferencing scheme against collective Gaussian attacks.

3. Security Analysis

The entangled source generates the initial state ρ 0 of an x-quadrature squeezed mode a ^ 1 and N 1 p-quadrature squeezed modes a ^ 2 , , N . The covariance matrices of the initial modes are defined as
a 1 = e 2 r 0 0 e 2 r ,
and
a 2 , , N = e 2 r 0 0 e 2 r .
The quadrature vector ξ 0 of ρ 0 is denoted as
ξ 0 = a ^ 1 , a ^ 2 , , a ^ N T .
To represent the 2 N quadratures of the N modes, ξ 0 is restructured into the following form,
ξ 1 = a ^ 1 x , a ^ 2 x , , a ^ N x , a ^ 1 p , a ^ 2 p , , a ^ N p , T .
After generating the initial modes, the source firstly combines a ^ 1 and a ^ 2 by a beam splitter of transmissivity T 1 . In the next N 2 steps, one of the output mode from the k th combination and an initial mode a ^ k + 1 are combined by a beam splitter of transmissivity T k , for k = 2 , , N 1 . This series of combinations produces N output modes a ^ 1 , , N , which are entangled in a GHZ state.
The transmissivities of the N 1 beam splitters of the entangled source is denoted by T k = N k N k + 1 , for k = 1 , 2 , , N 1 . The output modes is described by the linear transformations on x-quadratures
a ^ 1 x a ^ 1 x N + j = 2 N a ^ j x ( N + 2 j ) ( N + 1 j ) ,
a ^ k x a ^ 1 x N + j = 2 k a ^ j x ( N + 2 j ) ( N + 1 j ) for k = 2 , , N ,
and the analogous linear transformations on p-quadratures. Moreover, the covariance matrices of the beam splitters are denoted by
T k = N k N + 1 k 1 N + 1 k 1 N + 1 k N k N + 1 k for k = 1 , , N 1 .
We use symplectic matrix R to describe the combinations of the beam splitters T 1 , , N 1 . The elements of R are given by
R 11 = 1 N ,
R 1 j = 1 ( N + 2 j ) ( N + 1 j ) for j = 2 , , N ,
R j k = R 1 k for j = 2 , , N and k = 1 , , j 1 ,
R k k = N + 1 k N + 2 k for k = 2 , , N .
The covariance matrix (CM) of the initial state ρ 0 is denoted by
V 0 = V x 0 0 V p ,
in which V x and V p are the CM of the x-quadratures and the p-quadratures of ρ 0 in terms of the quadrature vector ξ 1 , respectively. The CM V x and V p are denoted by the following forms
V x = e 2 r 0 0 e 2 r I N 1 , V p = e 2 r 0 0 e 2 r I N 1 ,
where r refers to the squeeze factor of the initial squeezed states. The source combines the modes of ρ 0 by the beam splitters, producing the entangled modes of a GHZ state ρ 1 , which is described by the following CM
V 1 = V x 0 0 V p = R · V 0 · R T ,
where
V x i j = 1 N e 2 r + 1 N e 2 r for i j , 1 N e 2 r + N 1 N e 2 r for i = j ,
and
V p i j = 1 N e 2 r 1 N e 2 r for i j , N 1 N e 2 r + 1 N e 2 r for i = j .
The eavesdropper Eve prepares an ancillary state ρ E to perform entangled cloner attacks. Each entangled mode of ρ E is injected onto a travelling mode a ^ k of ρ 1 , respectively. The CM of ρ E that corresponds to ρ 1 is given by
V E = ω I N 0 0 ω I N ,
where ω = 1 + 2 n ¯ denotes the variance of Eve’s ancillary modes. The CM of the whole system before the transmission through the quantum channels is defined by
V 2 = V 1 V E .
In order to implement eavesdropping, Eve replaces the noisy channels from the source to all the legitimate parties with noisy-free quantum links and beam splitters, respectively. The transmittance η of each beam splitter of Eve is the same as the original noisy channel it has replaced. The symplectic matrices of Eve’s beam splitters are denoted by
S k = η I 1 η I 1 η I η I , k = 1 , , N .
We use the symplectic matrix S E to describe the transmission action of the entire system of both the entangled modes from the source and Eve’s ancillary modes by Eve’s beam splitters
S E = η I 2 N 1 η I 2 N 1 η I 2 N η I 2 N .
After the transmission of the legitimate users’ modes through Eve’s thermal-loss channels and beam splitters, the CM of the whole system is described by
V 3 = S E · V 2 · S E T .
We distill the partial matrix V 4 from V 3 , which describes the entangled modes of the users’ received state ρ 2 . The form of V 4 is described by
V 4 = Λ Γ Γ Γ Λ Γ Γ Γ Λ ,
with
Λ = η N 1 N e 2 r + 1 N e 2 r + ( 1 η ) ω 0 0 η 1 N e 2 r + N 1 N e 2 r + ( 1 η ) ω ,
and
Γ = η 1 N e 2 r 1 N e 2 r 0 0 η 1 N e 2 r + 1 N e 2 r .
As a result, the CM of any ith and jth Bobs’ modes is described by
V 5 = Λ Γ Γ Λ .

3.1. Mutual Information

In the presented CV quantum conferencing scheme, all the Bobs receive their entangled modes and then perform homodyne detection on the p-quadratures of them, respectively. The legitimate users pick the measurement results of an arbitrary ith Bob’s mode as the reference of the reconciliation procedure. Each of the other users (noted as the jth Bob) can generate a secret key with the ith Bob to establish secure communication between them.
The Bobs perform homodyne detections on the p-quadratures of their received modes, respectively. The conditional CM of the ith and the jth Bobs’ modes B i and B j after homodyne detections is given by
V B i | B j = Λ Γ ( Π Λ Π ) 1 Γ T ,
where
Π = 0 0 0 1 .
The mutual information between the ith and the jth Bobs’ results is generated by
I ( B i : B j ) = 1 2 l o g 2 Λ p V B i | B j p .
We also consider each user performs heterodyne detection on both x-quadrature and p-quadrature of their received mode. The conditional CM of the the ith and the jth Bobs’ modes after one of them performs heterodyne detection is given by
V B i | B j = Λ θ 1 Γ ( Θ Λ Θ T ) Γ T ,
where
θ = d e t Λ + T r Λ + 1 ,
and
Θ = 0 1 1 0 .
The mutual information between the ith and the jth Bobs’ heterodyne results is given by
I ( B i : B j ) = 1 2 l o g 2 Λ x V B i | B j x + 1 2 l o g 2 Λ p V B i | B j p .

3.2. Holevo Bound of the Stolen Information

Since the results of the ith Bob’s mode are utilized as the reference, the eavesdropper Eve’s stolen information is defined by the Holevo information H ( E : B i ) between Eve and the result of the ith Bob. Since Eve has the ability to purify the entire system, the state ρ E ρ 2 that describes the system after transmission through the quantum links is pure, where E denotes the measurement results of Eve’s restored modes E ^ 1 , , N . After the users’ homodyne measurement, the conditional state ρ E B | B i is still pure, where B denotes the measurement results of all the users. Hence, the Holevo bound of the stolen information is given by
H ( E : B i ) = S ( ρ E ) S ( ρ E | B i ) = S ( ρ 2 ) S ( ρ B | B i ) ,
where S ( ρ ) denotes the Holevo entropy of state ρ . In order to derive the Holevo entropy S ( ρ 2 ) , we calculate the symplectic eigenvalues of the CM V 4 , which is the eigenvalues of the Williamson normal form | I Ω V 4 | [25,26], where I is the imaginary unit and Ω is the symplectic form
Ω = i = 1 N 0 1 1 0 .
We derive the single N-degenerate symplectic eigenvalues of V 4 , which is described by
ν = [ η e r + ( 1 η ) e r ω ] [ η e r + ( 1 η ) e r ω ] .
The von Neumann entropy S ( ρ 2 ) is generated from the N symplectic eigenvalues ν by the following equation
S ( ρ 2 ) = N h ( ν ) ,
where
h ( x ) = x + 1 2 l o g 2 x + 1 2 x 1 2 l o g 2 x 1 2 .
The conditional CM V B | B i describes the received modes of the Bobs after the ith Bob performs homodyne detection on his mode. We reconstruct the CM V 4 in the following matrix:
V 4 = A 1 C 1 C 1 B 1 ,
where B 1 describes the mode of the ith Bob, A 1 describes all the other Bobs’ modes and C 1 describes the relations between the above two blocks. After the homodyne detection on the p-quadrature of the ith Bob’s mode, the conditional CM V B | B i is given by
V B | B i = A 1 C 1 Π B 1 Π C 1 T .
Similarly, we derive the symplectic eigenvalues of V B | B i , which contain N 1 identical symplectic eigenvalues given by Equation (36). The conditional von Neumann entropy S ( ρ B | B i ) is given by
S ( ρ B | B i ) = ( N 1 ) h ( ν ) .
Then, the Holevo bound of Eve’s stolen information is derived from the above equations
H ( E v e : B i ) = h ( ν ) .
In addition, we consider the Holevo bound when the users perform heterodyne detection on their received modes. The symplectic eigenvalues of V B | B i after the heterodyne detecion include N 2 symplectic eigenvalues given by Equation (36), and one given by
ν N = τ 1 τ 2 λ 1 λ 2 ,
where
τ 1 = N ( 1 η ) ω η + η e 4 r + e 2 r + η [ e 4 r + N η e 2 r + ( N 1 ) ] + N ( 1 η ) 2 e 2 r ω 2 , τ 2 = N ( 1 η ) ω η + η e 4 r + e 2 r + η [ ( N 1 ) e 4 r + N η e 2 r + 1 ] + N ( 1 η ) 2 e 2 r ω 2 , λ 1 = ( N 1 ) η + e 2 r [ N ( 1 η ) ω + η e 2 r + N ] , λ 2 = η + e 2 r [ N ( 1 η ) ω + ( N 1 ) η e 2 r + N ] .
The conditional von Neumann entropy S ( ρ B | B i ) is given by
S ( ρ B | B i ) = ( N 2 ) h ( ν ) + h ( ν N ) .
Then, the Holevo bound of Eve’s stolen information is derived from the above equations
H ( E v e : B i ) = 2 h ( ν ) h ( ν N ) .
With the results in Equations (28) and (41), we finally derive the secret key rate of our quantum conferencing with entanglement in the middle scheme
K R a t e = I ( B i : B j ) H ( E : B i ) .

4. Simulation Results

In this section, we consider the CV quantum conferencing with entanglement in the middle against collective attacks and give the simulation results of our security analysis. All of the quantum channels have the same transmissivity η , which is mapped into a fiber distance l in km, using η : = 10 l / 50 . Different conditions of thermal noise and number of users are taken into account.
In Figure 2, we plot the secret key rate of our quantum conferencing scheme versus the maximum distance of the quantum link in our network. The solid blue lines, small dashed red lines and large dashed black lines refer to N = 3 , N = 10 and N = 100 network users of our quantum conferencing scheme, respectively. As shown in Figure 2, the scheme can reach a network radius of 2 km when the number of users is less than 10. When the number of users increases to 100, the scheme can still provide a quantum conferencing network with a longest transmission distance of over 500 m (520 m when thermal noise is set to 0.05 , and 575 m when thermal noise is set to 0). Furthermore, the curves show that, with a network radius of 480 m, 100 users can establish secure conferencing communication at about 0.1 bit per pulse. The conferencing key rate can reach 2.5 Mbits per second based on a CV QKD network with a clock of 25 MHz [27].
Figure 3 presents the relationship between number of users and the maximum network distance when the secret conferencing key rate is asymptotic to 0, and the thermal noise is set to n ¯ = 0.05 in (a) and n ¯ = 0 in (b), respectively. As can be seen from Figure 3, there is a trade-off between the number of network users and the maximum transmission distance. Moreover, the conferencing scheme can achieve secure communication for 300 users on a building-size scale (about a radius of 150 m), or for dozens of users between multiple buildings (within a radius of 500 m or more). This result shows that the quantum conferencing with entanglement in the middle scheme can be applied to more scenarios than the MDI-based high-rate quantum conferencing scheme [19], which provides secure conference for 50 users within a radius of 40 m.
We consider different measurement methods that the network perform on their received modes. In the key rate equation Equation (46), we replace the mutual information I ( B i : B j ) that was derived in Equation (28) with the result in Equation (32), and give the simulation results in Figure 4. Obviously, the scheme with homodyne detection has better performance of the secure conferencing key rate than the scheme with heterodyne detection. As we mentioned in Section 2, the p-quadratures of the entangled GHZ state have correlations of a ^ k p a ^ k p 0 for any k , k = 1 , , N , which is utilized for the conferencing key generation of our scheme. As a result, we select homodyne detection as the measurement method for the network users.

5. Conclusions

We have proposed a quantum network with entanglement in the middle scheme, which provides secure conferencing communication for an arbitrary number of users. An entanglement source in the middle generates an multipartite GHZ state and distributes each mode of the state to the network users, respectively. The legitimate users receive the entangled modes, and perform homodyne measurement on them to distill mutual information for generating secret conferencing keys for each pair of users. Our security analysis shows that the quantum conferencing scheme can generate secret keys against collective attacks on both the untrusted entangled source and all of the quantum links.
The aim of this paper is to establish a secure conferencing network for dozens of users within a community or a factory area. Simulation results show that our scheme can provide high rate secure conferencing keys for more than 100 users in a quantum network with a radius of hundreds of meters. The security analysis of our scheme is against collective attacks, whereas the analysis against coherent attacks can be achieved by applying a Gaussian de Finetti reduction [20]. Further research should be carried out to establish the finite-size composable security of the quantum conferencing with entanglement in the middle scheme.

Author Contributions

Conceptualization, Z.Z.; Methodology, Z.Z.; Formal Analysis, Z.Z.; Resources, R.S.; Writing—Original Draft Preparation, Z.Z.; Writing—Review and Editing, Y.G.; Visualization, Z.Z.; Supervision, Y.G.; Project Administration, Y.G.; Funding Acquisition, Y.G.

Funding

This research was funded by the National Natural Science Foundation of China (Grant No. 61572529).

Conflicts of Interest

The founding sponsors had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript, and in the decision to publish the results.

Abbreviations

The following abbreviations are used in this manuscript:
QKDQuantum Key Distribution
CVContinuous Variable
MDIMeasurement-Device-Independent
GHZGreenberger–Horne–Zeilinger
CMCovariance Matrix

References

  1. Gisin, N.; Ribordy, G.; Tittel, W.; Zbinden, H. Quantum cryptography. Rev. Mod. Phys. 2002, 74, 145. [Google Scholar] [CrossRef]
  2. Scarani, V.; Bechmann-Pasquinucci, H.; Cerf, N.J.; Dušek, M.; Lütkenhaus, N.; Peev, M. The security of practical quantum key distribution. Rev. Mod. Phys. 2009, 81, 1301. [Google Scholar] [CrossRef]
  3. Weedbrook, C.; Pirandola, S.; Garcia-Patron, R.; Cerf, N.J.; Ralph, T.C.; Shapiro, J.H.; Lloyd, S. Gaussian quantum information. Rev. Mod. Phys. 2012, 84, 621. [Google Scholar] [CrossRef]
  4. Wootters, W.K.; Zurek, W.H. A single quantum cannot be cloned. Nature 1982, 299, 802–803. [Google Scholar] [CrossRef]
  5. Bang, J.Y.; Berger, M.S. Quantum mechanics and the generalized uncertainty principle. Phys. Rev. D 2006, 74, 125012. [Google Scholar] [CrossRef]
  6. Braunstein, S.L.; Van Loock, P. Quantum information with continuous variables. Rev. Mod. Phys. 2005, 77, 513. [Google Scholar] [CrossRef]
  7. Grosshans, F.; Van Assche, G.; Wenger, J.; Brouri, R.; Cerf, N.J.; Grangier, P. Quantum key distribution using gaussian-modulated coherent states. Nature 2003, 421, 238–241. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  8. Weedbrook, C.; Lance, A.M.; Bowen, W.P.; Symul, T.; Ralph, T.C.; Lam, P.K. Quantum cryptography without switching. Phys. Rev. Lett. 2004, 93, 170504. [Google Scholar] [CrossRef] [PubMed]
  9. Elliott, C. Building the quantum network. New J. Phys. 2002, 4, 46. [Google Scholar] [CrossRef]
  10. Elliott, C.; Colvin, A.; Pearson, D.; Pikalo, O.; Schlafer, J.; Yeh, H. Current status of the DARPA quantum network. In Quantum Information and Computation III; International Society for Optics and Photonics: Bellingham, WA, USA, 2005; Volume 5815, pp. 138–150. [Google Scholar]
  11. Chen, W.; Han, Z.F.; Zhang, T.; Wen, H.; Yin, Z.Q.; Xu, F.X.; Wu, Q.L.; Liu, Y.; Zhang, Y.; Mo, X.F.; et al. Field experiment on a “star type” metropolitan quantum key distribution network. IEEE Photon. Technol. Lett. 2009, 21, 575–577. [Google Scholar] [CrossRef]
  12. Poppe, A.; Peev, M.; Maurhart, O. Outline of the SECOQC quantum-key-distribution network in Vienna. Int. J. Q. Inf. 2008, 6, 209–218. [Google Scholar] [CrossRef]
  13. Peev, M.; Pacher, C.; Alléaume, R.; Barreiro, C.; Bouda, J.; Boxleitner, W.; Debuisschert, T.; Diamanti, E.; Dianati, M.; Dynes, J.; et al. The SECOQC quantum key distribution network in Vienna. New J. Phys. 2009, 11, 075001. [Google Scholar] [CrossRef] [Green Version]
  14. Biham, E.; Huttner, B.; Mor, T. Quantum cryptographic network based on quantum memories. Phys. Rev. A 1996, 54, 2651. [Google Scholar] [CrossRef] [PubMed]
  15. Salvail, L.; Peev, M.; Diamanti, E.; Alléaume, R.; Lütkenhaus, N.; Länger, T. Security of trusted repeater quantum key distribution networks. J. Comput. Secur. 2010, 18, 61–87. [Google Scholar] [CrossRef] [Green Version]
  16. Weedbrook, C. Continuous-variable quantum key distribution with entanglement in the middle. Phys. Rev. A 2013, 87, 022308. [Google Scholar] [CrossRef]
  17. Guo, Y.; Liao, Q.; Wang, Y.; Huang, D.; Huang, P.; Zeng, G. Performance improvement of continuous-variable quantum key distribution with an entangled source in the middle via photon subtraction. Phys. Rev. A 2017, 95, 032304. [Google Scholar] [CrossRef]
  18. Zhang, Z.; Shi, R.; Zeng, G.; Guo, Y. Coherent attacking continuous-variable quantum key distribution with entanglement in the middle. Q. Inf. Process. 2018, 17, 1–18. [Google Scholar] [CrossRef]
  19. Ottaviani, C.; Lupo, C.; Laurenza, R.; Pirandola, S. High-rate quantum conferencing and secret sharing. arXiv, 2017; arXiv:1709.06988. [Google Scholar]
  20. Lupo, C.; Ottaviani, C.; Papanastasiou, P.; Pirandola, S. Continuous-variable measurement-device-independent quantum key distribution: Composable security against coherent attacks. Phys. Rev. A 2018, 97, 052327. [Google Scholar] [CrossRef] [Green Version]
  21. Pirandola, S.; Ottaviani, C.; Spedalieri, G.; Weedbrook, C.; Braunstein, S.L.; Lloyd, S.; Gehring, T.; Jacobsen, C.S.; Andersen, U.L. High-rate measurement-device-independent quantum cryptography. Nat. Photon. 2015, 9, 397. [Google Scholar] [CrossRef] [Green Version]
  22. Garcia-Patron, R.; Cerf, N.J. Unconditional optimality of Gaussian attacks against continuous-variable quantum key distribution. Phys. Rev. Lett. 2006, 97, 190503. [Google Scholar] [CrossRef] [PubMed]
  23. Pirandola, S.; Braunstein, S.L.; Lloyd, S. Characterization of collective Gaussian attacks and security of coherent-state quantum cryptography. Phys. Rev. Lett. 2008, 101, 200504. [Google Scholar] [CrossRef] [PubMed]
  24. Leverrier, A. Composable security proof for continuous-variable quantum key distribution with coherent states. Phys. Rev. Lett. 2015, 114, 070501. [Google Scholar] [CrossRef] [PubMed]
  25. Simon, R.; Chaturvedi, S.; Srinivasan, V. Congruences and canonical forms for a positive matrix: Application to the Schweinler–Wigner extremum principle. J. Math. Phys. 1999, 40, 3632–3642. [Google Scholar] [CrossRef] [Green Version]
  26. Nicolas, C.; SANCHEZ, R.G.P. Quantum Information with Optical Continuous Variables: From Bell Tests to Key Distribution. Ph.D. Thesis, Université Libre de Bruxelles, Bruxelles, Belgium, 2007. [Google Scholar]
  27. Wang, C.; Huang, D.; Huang, P.; Lin, D.; Peng, J.; Zeng, G. 25 MHz clock continuous-variable quantum key distribution system over 50 km fiber channel. Sci. Rep. 2015, 5, 14607. [Google Scholar] [CrossRef] [PubMed] [Green Version]
Figure 1. Schematic of the multipartite CV quantum conferencing scheme with entanglement in the middle. The source prepares CV squeezed states a ^ 1 , , N , and combines them by beam splitters B S 1 , , N . The output entangled modes a ^ 1 , , N are distributed to legitimate users B o b 1 , , N through noisy quantum links, which are controlled by the eavesdropper Eve. The users receive the modes a ^ 1 , , N and perform homodyne detection on them to distill mutual information.
Figure 1. Schematic of the multipartite CV quantum conferencing scheme with entanglement in the middle. The source prepares CV squeezed states a ^ 1 , , N , and combines them by beam splitters B S 1 , , N . The output entangled modes a ^ 1 , , N are distributed to legitimate users B o b 1 , , N through noisy quantum links, which are controlled by the eavesdropper Eve. The users receive the modes a ^ 1 , , N and perform homodyne detection on them to distill mutual information.
Applsci 08 01312 g001
Figure 2. The performance analysis of the entanglement-based multipartite CV quantum conferencing scheme in terms of the derived secret key rate. The curves represent the conferencing key rate as a function of the radius of the network, in conditions of N = 3 (solid blue line), N = 10 (small dashed red line) and N = 100 (large dashed black line) of users, respectively. The thermal noise is set to n ¯ = 0.05 in (a) and n ¯ = 0 in (b), respectively.
Figure 2. The performance analysis of the entanglement-based multipartite CV quantum conferencing scheme in terms of the derived secret key rate. The curves represent the conferencing key rate as a function of the radius of the network, in conditions of N = 3 (solid blue line), N = 10 (small dashed red line) and N = 100 (large dashed black line) of users, respectively. The thermal noise is set to n ¯ = 0.05 in (a) and n ¯ = 0 in (b), respectively.
Applsci 08 01312 g002
Figure 3. The maximum distance from the source to a user with conferencing key rate K 0 , in terms of different number N of network users. The thermal noise is set to n ¯ = 0.05 in (a) and n ¯ = 0 in (b), respectively.
Figure 3. The maximum distance from the source to a user with conferencing key rate K 0 , in terms of different number N of network users. The thermal noise is set to n ¯ = 0.05 in (a) and n ¯ = 0 in (b), respectively.
Applsci 08 01312 g003
Figure 4. The maximum transmission distance of the network with different detection methods of the users. The number of users is set to 10 in (a) and 100 in (b), respectively. The blue solid (red dashed) lines show the conferencing key rate when all the users perform homodyne (heterodyne) detection on their received modes.
Figure 4. The maximum transmission distance of the network with different detection methods of the users. The number of users is set to 10 in (a) and 100 in (b), respectively. The blue solid (red dashed) lines show the conferencing key rate when all the users perform homodyne (heterodyne) detection on their received modes.
Applsci 08 01312 g004

Share and Cite

MDPI and ACS Style

Zhang, Z.; Shi, R.; Guo, Y. Multipartite Continuous Variable Quantum Conferencing Network with Entanglement in the Middle. Appl. Sci. 2018, 8, 1312. https://doi.org/10.3390/app8081312

AMA Style

Zhang Z, Shi R, Guo Y. Multipartite Continuous Variable Quantum Conferencing Network with Entanglement in the Middle. Applied Sciences. 2018; 8(8):1312. https://doi.org/10.3390/app8081312

Chicago/Turabian Style

Zhang, Zhaoyuan, Ronghua Shi, and Ying Guo. 2018. "Multipartite Continuous Variable Quantum Conferencing Network with Entanglement in the Middle" Applied Sciences 8, no. 8: 1312. https://doi.org/10.3390/app8081312

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop