Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Security analysis of quantum key distribution on passive optical networks

Open Access Open Access

Abstract

Needs for providing security to end users have brought installation of quantum key distribution (QKD) in one-to-many access networks such as passive optical networks. In the networks, a presence of optical power splitters makes issues for secure key rate more important. However, researches for QKD in access networks have mainly focused on implementation issues rather than protocol development for key rate enhancement. Since secure key rate is theoretically limited by a protocol, researches without protocol development cannot overcome the limit of secure key rate given by a protocol. This brings need of researches for protocol development. In this paper, we provide a new approach which provides secure key rate enhancement over the conventional protocol. Specifically, we propose the secure key rate formula in a passive optical network by extending the secure key rate formula based on the decoy-state BB84 protocol. For a passive optical network, we provide a way that incorporates cooperation across end users. Then, we show that the way can mitigate a photon number splitting (PNS) attack which is crucial in an well known decoy BB84 protocol. Especially, the proposed scheme enables multi-photon states to serve as secure keys unlike the conventional decoy BB84 protocol. Numerical simulations demonstrate that our proposed scheme outperforms the decoy BB84 protocol in secure key rate.

© 2017 Optical Society of America

1. Introduction

Quantum key distribution (QKD) has been received much attention as it provides a new paradigm of secure communications. An application to point-to-point (P2P) links in a backbone network is a good example for the quantum secure networks. To achieve this, many research groups have conducted and reported theoretical and experimental results of QKD for P2P networks [1–8]. By being accelerated, nationwide QKD field trials have been conducted in leading countries [9–11]. Recently, QKD systems based on decoy BB84 protocol are commercialized [12]. However, due to different network structures between core and access networks, these results are not enough to characterize the security of multi-user networks. In order to provide services for end users, researches for multi-user networks have been carried out [13–16].

An objective of the point-to-multi-point networks is to provide higher secure key rate to end users. To achieve this, we aim to develop the way that all users collaborate to lower power of eavesdropping. We propose a way to combat against a photon number splitting (PNS) attack with the help of information on coincidence detection among end users at multi-points. By the proposed scheme, we show that some of pulses having multiple photons can be used as secret keys unlike in the conventional decoy BB84 protocol.

Nevertheless, most works for multi-user networks mainly focus on implementing QKD access networks with decoy BB84 protocol because a QKD system with decoy BB84 protocol is easy to implement and was theoretically proven to be unconditionally secure. Implementation issues such as wavelength assignment and consolidation between conventional and quantum channels are considered in [13–15]. The authors in [16] considered configuration issues by comparing downstream and upstream quantum access networks. They asserted it is beneficial in terms of cost and feasibility of the systems to configure the downstream quantum access networks in which transmitters are located in end users. However, secure key rate of the researches can be eventually limited without development of protocols. In the decoy BB84 protocol, a critical limiting factor in secure key rate is caused by a PNS attack. By the attack, pulses having multiple photons referred to as multi-photon states cannot generate secure keys [1]. Therefore, only pulses having a single photon referred to as single-photon states can generate secure keys in the decoy BB84 protocol. Since the researches did not consider the protocol development to mitigate a PNS attack, their performance cannot overcome the limitation regardless of system configurations such as a transmission direction. The insufficiency of researches to overcome the limitation has brought necessity for the research about protocol development.

In this work, we investigate access networks in which there is a splitter which makes the network structure of one-to-many type. One such example is passive optical network (PON). Based on the network, we show that the aforementioned limitation can be overcome by a simple way using the characteristics of a PON: coincidence detections among end users can lower the amount of secret keys taken by a PNS attack. Consequently, multi-photon states can be used to generate secret keys, which has been perceived unusable states for secure keys. Since a standard PON can be typically deployed with the maximum of 1 to 64 split ratio [17–19], we incorporate coincidence detection into the GLLP model [20] and performed numerical evaluations about a PON with 64 end users.

The remaining parts of this paper are structured as follows. In Section 2, a system model for QKD on PON is described. Section 3 introduces general decoy BB84 QKD protocol for PON. The proposed method is explained in Section 4. Corresponding secure key rate is discussed in Section 5. A numerical analysis of secret key rate of QKD protocol for PON with the proposed method is discussed in Section 6. Finally, we conclude our paper in Section 7 with some concluding remarks.

2. System model

A QKD system with decoy BB84 protocol on PON consists of one optical line terminal (OLT), one optical fiber channel and multiple optical network units (ONUs) as in Fig. 1. To describe the structure, specific characteristics of a laser source, a channel, and a detector such as a distribution of photons generated from a laser source, channel loss, and photon detection probabilities are modeled with a typical way as in [20].

 figure: Fig. 1

Fig. 1 System model for a general down-stream PON system.

Download Full Size | PDF

Alice in an OLT possesses a phase randomized coherent laser source and an encoder to generate the quantum states for QKD session. By the characteristics of the source, the number of photons follows the Poisson distribution as follows:

Pr(the number of photons=i)=μii!eμ,
where μ is a mean photon number of the source.

A channel considered in this paper can be called as quantum channel because a quantum state can be delivered through this channel. This quantum channel can be characterized by its internal transmittance. Let Tch denote the transmittance of a quantum channel. Then, Tch can be decomposed into two parts which are the transmittance of fiber itself, Tfiber, and transmittance of a splitter, Tsplitter.

Tch=TfiberTsplitter=10αl1010Lsplitter10,
where α, l, and Lsplitter represent channel loss coefficient in dB/km, distance of optical fiber in km, and splitting loss in dB, respectively.

A quantum state arrived at an ONU, Bob, suffers additionally from internal transmittance of the ONU. Internal transmittance of an ONU, TONU, can be expressed as follows:

TONU=10LONU10,
where LONU represents internal loss of an ONU in dB.

After internal optical circuits of an ONU, a quantum state is detected by one out of two single photon detectors (SPD) in an ONU. Detection efficiency of a SPD can be referred to as γdet. With γdet and Eqs. (2) and (3), we can calculate the overall detection quantum efficiency, γall, of a quantum state sent from Alice:

γall=γdetTONUTch.
The aforementioned γall is related to transmittance of a single photon. In a real situation, however, multiple photons can be transmitted by characteristics of a laser source in Eq. (1). Unfortunately, most conventional SPDs can only resolve either zero or non-zero photons [21]. Thereby, we cannot identify the number of photons in an incoming quantum state from a detection event. Due to this reason, detection efficiency of i-photon states, γi, can be expressed as follows:
γi=1(1γall)i.
There is another factor causing detection of a SPD, which is the dark count of a SPD. Due to the dark count, detection can occur in Bob’s side even for zero photon states. Accordingly, to calculate conditional probability that a quantum state is detected given a quantum state, we need to take into account γi and dark count. The conditional probability previously specified is also called yield as in [20]. We define Yi as the conditional probability that a quantum state is detected given an i-photon state generated by a laser source in Alice:
Yi=Pr(detection occurs|iphoton sate).
By assuming detection events from two different sources, which are a transmitted quantum state and dark count are independent, Yi can be comprised as follows:
Yi=γi+Y0γiY0,
where Y0 the false alarm probability caused by dark count. That is, Y0 corresponds to a dark count probability per unit time, pdark. As in [22], pdark is defined as probability that at least one dark count occurs among two detectors in Bob’s side.

Let Qi denote the probability of detection of an i-photon state, which is called as gain of an i-photon state as in [20]. With Yi and the Poisson distribution of a laser source, Qi can be calculated as follows:

Qi=Pr(i-photon sate, detection occurs)=Yiμii!eμ.
Through detections, received states are converted to information having errors. This can be modeled as quantum bit error rate (QBER). To model QBER, define ei as QBER of an i-photon state. QBER is affected by two major factors which are dark count and system imperfection. In case of dark count, it causes errors with a probability of e0. Since dark counts of two detectors in Bob’s side are independent, e0 is 1/2 in this system. For a received quantum state, an error can occur with probability modeled as ed characterizing system imperfection. Based on the aforementioned features,
ei=Pr(erroneous detection occurs|i-photon sate)Pr(detection occurs|i-photon sate)=e0Y0(1γi)+edγi(1Y0)+e0edγiY0Yi.
Based on Eqs. (8) and (9), we can calculate the overall gain and QBER. First, the overall gain, Qμ, represents detection probability given a laser source with mean photon number μ.
Qμ=Pr(detection occurs)=i=0Qi=1(1Y0)eγallμ.
Second, the overall QBER, Eμ, represents error probability given a laser source with mean photon number μ. This can be calculated as follows:
Eμ=Pr(erroneous detection occurs)Pr(detection occurs)=i=0eiQii=0Qi=e0Y0eγallμ+ed(1Y0)(1eγallμ)1(1Y0)eγallμ.

3. General QKD protocol for PON

In this paper, we consider a decoy BB84 based QKD protocol for a down-stream PON with our proposed method which is an estimation step for photon number distribution utilizing characteristics of a PON. For understanding of the proposed method, we briefly introduce a decoy BB84 QKD protocol [20] on PON. As in most cases, assume that a QKD session is generated between a pair of an OLT and an ONU. That is, there exist N QKD sessions generated if a PON is installed with N ONUs. Due to the aforementioned assumption, the protocol is symmetric for each pair of an OLT and an ONU. Since transmitter and receiver are generally called as Alice and Bob in quantum cryptography, from now on, Alice and Bob substitute for OLT and ONU, respectively. The typical protocol is as follows:

  • Alice randomly chooses mean photon number of laser source to select either a decoy or a signal state. Then, Alice randomly generates weak coherent pulses and modulate them among four states using either phase or polarization modulation. Four states are selected from two bases which are Z = {|0〉, |0〉} or X={|+=(|0+|1)/2,|=(|0|1)/2} bases. Then, modulated pulses are sent to Bob.
  • To detect the received quantum state, Bob generates a random bit sequence to choose a basis between is Z and X bases.
  • After a session of transmission, Alice and Bob announce detection time and basis information through a public channel. Additionally, Alice announces whether decoy or signal states each pulse belonged to. Here, by investigating detection ratios of decoy and signal states, it is blocked that an eavesdropper, Eve, intentionally transmits more multi-photon states than single-photon states for a PNS attack. Then, detected outcomes are sifted out to discard the photon measurements at Bob that have used different bases from those of Alice. The remained bit sequence is called the sifted key.
  • Alice and Bob compare some of the sifted key to estimate QBER. Based on the estimated QBER, Alice and Bob calculate the corresponding secure key rate.
  • To generate a final secure key, Alice and Bob perform post-processing consisting of error correction and privacy amplification by sending additional information through a pubic channel.

4. Estimation of a photon number distribution

A photon number distribution can be estimated with photon number resolving detectors [23] or photon number non-resolving detectors [24, 25]. Obviously, the former is expected to better estimate the distribution. In this work, we consider the worst-case scenario based on the latter setting to evaluate the minimal performance gain that can also be guaranteed for the former case. We also emphasize that the latter case is more realistic due to the high cost of using the photon number resolving detectors.

As related works, the authors in [24,25] estimate the distribution with a photon number non-resolving detector and a variable attenuator in point-to-point network. In our proposed method, we utilize the collaboration among ONUs with photon number non-resolving detection. In this way, the photon state distributed over a point-to-multi-point PON by an optical splitter, instead of using variable attenuators can be collectively exploited for more information on photon number distribution, as discussed with specific details below.

When photon number distribution can be estimated by a collaborative measurement of photon detections at multiple Bobs we can anticipate increase of secure key rate, as it can mitigate a PNS attack, which leads generating of secure keys from multi-photon states. This can be achieved by using characteristics of a PON which provides coincidence detection among Bobs.

In a PON, a multi-photon state can be randomly routed to Bobs in the particle-like behavior limit at an optical splitter due to the fact that a photon is indivisible by nature [26]. This characteristics generates coincidence detections. The coincidence detection provides information about photon number distribution in a pulse sent by an OLT, Alice. By collecting all detection information, Alice can estimate the distribution of detections, e.g., the number of detections in one Bob, the number of detections in two different Bobs by the same pulse, and so on. This prevents an eavesdropper, Eve, from a certain PNS attack because it makes estimated distribution of detections apart from theoretically calculated distribution of detections with given system parameters. Therefore, Eve can perform a PNS attack to limited portion of multi-photon states.

For easy understanding, here, we address how the estimation limits a PNS attack with an example. Assume eavesdropping happens after the splitter. Specifically, there are two cases whether Eve can perform a PNS attack or not. A safe case is about multi-photon states in which Eve cannot perform a PNS attack. Assume there are the number N of Bobs and an i-photon state in which iN. Then, the safe case represents i Bobs detect at the same time slot. An example of a two-photon case, i = 2, is shown in Fig. 2(a). In this case, two Bobs detect a single photon. Unsafe cases that Eve can perform PNS attacks are all the cases that more than one photon can be routed to one Bob. An example for this is shown in Fig. 2(b). In this case, at least one Bob receives multiple photons.

 figure: Fig. 2

Fig. 2 The possible cases when a pulse having multiple photons is generated.

Download Full Size | PDF

For given system parameters such as detection channel loss, internal loss of Bob, and detection efficiency of a SPD, we can calculate the frequency of detection. After a session of transmission, Alice can estimate the frequency of detection by receiving detection information from Bobs. By comparing the calculated and estimated frequencies of detection, if Eve performs a PNS attack for all multi-photon states as if she does on a conventional decoy BB84 QKD system, it can be detected because the two values become different. Assume that Eve performs a PNS attack on the safe case. Then, coincidence detection among Bobs decreases. This manifests as difference between calculated and estimated frequency of detection.

Here we add a new behavior to the conventional protocol of Section 3:

  • Coincidence Monitoring: To accumulate the statistics of i-Bob coincidence detections to monitor whether it is different from the theoretically calculated value with given system parameters or not.

Therefore, Eve should perform a PNS attack except for the safe case to hide her existence. That is, Alice and Bob can obtain additional secure key from some multi-photon states corresponding to the safe case.

5. Secure key rate

In this section, we explicitly provide secure key rates depending on possible attacks. The corresponding results are summarized in Table 1.

Tables Icon

Table 1. Secure key rates for different attacks.

5.1. Attack before splitter

Assume the PNS attack performed before the splitter. First, consider that Eve cannot intentionally control the splitter. In this case, the PNS attack changes the distribution of coincidence detections because Eve cannot disambiguate the safe and unsafe cases. This leads to the following secure key rate based on the GLLP model of decoy-state BB84 protocol if the photon number distributions of signal and decoy states are invariant [27].

R12{Qμf(Eμ)H2(Eμ)+Q1[1H2(e1)]},
where H2(·) and f (·) represent binary Shannon entropy and error correction efficiency, respectively. Other parameters are defined in Section 2. In Eq. (12), the first term represents the number of required bits for error correction. When we consider leaked information to an eavesdropper, Eve, there are two cases that correspond to single photon and multi-photon states. In case of single-photon states, Eve cannot perform a PNS attack over single-photon states prevented by decoy states. Instead, Eve performs a coherent attack which is the most powerful attack constrained by only law of physics [28]. When a length of secret keys becomes infinity, the amount of information that can be extracted by a coherent attack becomes the same as that of collective attack [29]. In a collective attack, extracted information can be calculated based on Holevo information. Because Eve can obtain H2(e1) bits for a single-photon state by the attack [30], these should be removed by privacy amplification. This is expressed in the second term in Eq. (12) representing the number of remained bits after privacy amplification for a single-photon state. For multi-photon states, as already mentioned that Eve can perform a PNS attack on them, secure key cannot be generated from them. For that reason, gain from multi-photon states is not included in Eq. (12).

On the other hand, Eve can maintain the distribution for coincidence detections. In order to maintain it, Eve cannot perform a PNS attack. Since eavesdropping happens before the splitter and Eve doesn’t control the splitter in this case, the PNS attack maintaining the distribution is impossible. Instead, Eve can perform collective and unambiguous state discrimination (USD) attacks [31]. First, consider that a collective attack is performed without an USD attack. By the attack, the maximum mutual information between Alice and Eve, I(A; E)i, is expressed as follows:

I(A;E)i=H2(1+cosic2),
where cos c = 1 − 2ei. See Appendix A for the detailed calculation. This leads to:
R12{Qμf(Eμ)H2(Eμ)+Q1[1H2(e1)]+i=2Qi(1I(A;E)i)},

Assume Eve performs collective and USD attacks. An USD attack can succeed for more than two-photon states with a non-zero probability [31]. For more than two-photon states, if Eve transmits qubits only when the USD attack succeeds, she can do perfect eavesdropping without causing errors. On the other hand, for single and two-photon states, Eve can only perform the collective attack because the USD attack fails with certainty. Therefore, secure keys can be obtained from only single and two-photon states by performing privacy amplification on them. Based on this, we can calculate the secure key rate against the both attacks.

R12{Qμf(Eμ)H2(Eμ)+Q1[1H2(e1)]+i=2Qi(1I(A;E)2)},

If the distributions of photon numbers for signal and decoy states are altered, this indicates the distributions are controlled by Eve. This severely degrades a secure key rate regardless of the distribution for coincidence detections. In this case, the following secure key rate can be achieved as in [32].

R12{Qμf(Eμ)H2(Eμ)+(QμPmulti)[1H2(EμQμPmulti)]},
where Pmulti represents the probability that Alice generates multi-photon states.

Second, consider that Eve can intentionally control the splitter so that the distribution for coincidence detections is invariant. However, the PNS attack on the safe cases changes the photon number distributions of signal and decoy states because Eve cannot distinguish between signal and decoy states at each time instance. Therefore, the corresponding secure key rate can be calculated as in Eq. (16).

Instead, Eve can keep all the distributions under no PNS attack on the safe cases. In this case, Eve performs collective and USD attacks on the safe cases. First, consider the scenario of the collective attack without the USD attack.

For the secure key rate from the safe cases, we need to calculate the detection probability of the safe cases. For i ≥ 2, let Qii denote the probability that i Bobs detect single photons when Alice generates an i-photon state. This can be calculated as follows:

Qii=μii!eμ(1)(ii)γalli(2)1n(n1i1)(i1)!1!1!(1n)i1(3)(1Y0)ni(4).
In Eq. (17), the first factor (1) represents the probability that Alice generates an i-photon state. Since all i photons should be detected, it is reflected as in factor (2). Factor (3) refers to the probability that i photons are routed to i Bobs one by one. Since a secure key rate is calculated in terms of a given Bob, one single photon should be routed to that Bob. This is reflected as 1/n in factor (3). By using multinomial distribution, the other terms in factor (3) represent (i − 1) photons are routed to (i − 1) Bobs one by one. Simultaneously, no dark count should happen at any of (ni) Bobs that do not receive a photon.

Based on the number, NBob, of Bobs in a network, with Eqs. (13) and (17), we can formulate secure key rate R as follows:

R12{Qμf(Eμ)H2(Eμ)+Q1[1H2(e1)]+i=2NBobQii(1I(A;E)i)}=12{Qμf(Eμ)H2(Eμ)+QμPAoverall},
where
PAoverall=Q0+Q1H2(e1)+i=2NBobQiiI(A;E)i+i=2NBob(QiQii)+i=NBob+1Qi=Q0+Q1H2(e1)+i=2NBobQiiI(A;E)i+i=2NBob(QiQii)+Qμi=0NBobQi=Qμ+Q1(H2(e1)1)+i=2NBobQii(I(A;E)i1).
As in Eq. (18), the overall secure key rate can be expressed by three terms, which infer how the proposed protocol works. In Eq. (18), the first, second, and third terms indicate required information for error correction, detected information, and required information for privacy amplification, respectively. This infers that a secure key can be obtained by removing the amount of information corresponding to PAoverall from a detected signal without a procedure for distinguishing safe and unsafe cases.

Assume Eve performs collective and USD attacks. In this case, the USD attack for more than two-photon states and a PNS attack on the unsafe two-photon states guarantee perfect eavesdropping without causing errors. Therefore, only single and the safe two-photon states can generate secure keys through privacy amplification.

R12{Qμf(Eμ)H2(Eμ)+Q1[1H2(e1)]+Q22(1I(A;E)2)}

5.2. Attack after splitter

Assume the PNS attack is performed after the splitter. First, consider that Eve cannot intentionally control the splitter. In this case, Eve can distinguish the safe and unsafe cases so that she can maintain the distribution for coincidence detections. Here, if Eve wants to maintain the photon number distributions of signal and decoy states, only the PNS attack on the unsafe cases is allowable. Therefore, Eve performs collective and USD attacks on the safe cases. The corresponding secure key rate can be calculated as in Eq. (19).

Second, assume Eve can control the splitter. Then, Eve can maintain all the distributions if she only performs the PNS attack on the unsafe cases. The corresponding secure key rate is the same as in Eq. (19).

6. Simulation results

Performance of the system with the proposed method in terms of secure key rate is numerically evaluated in this section. For performance comparison, the conventional BB84 protocol with decoy-state is used. Since attacks without the change of monitoring factors such as the distributions are mainly considered in QKD, we evaluate the secure key rates for the corresponding cases. Specifically, we simulate the secure key rates with Eqs. (12), (18) and (19). For fare performance comparisons, each simulation is conducted with an optimal mean photon number of each system. We conduct two numerical simulations depending on parameters of devices and the number of ONUs (Bobs) in a PON. The first simulation is conducted with almost ideal devices. The purpose of the first simulation is to provide an ideal upper bound in terms of secure key rate. Subsequently, we conduct the second simulation to identify an achievable secure key rate considering currently available devices to compare with the upper bound.

The simulation parameters used in the first case are as follow. Basically, the optical loss of fiber is α = 0.2dB/km as a conventional optical fiber. Each Bob has ideal SPDs with 100% detection efficiency, γdet = 1, and 0 dark count probability, Y0 = 0. Inside of each Bob, there is no optical loss, LONU = 0 dB, and no system error, ed = 0. In post-processing, it is assumed that Bob can perform ideal error correction, which means f (Eμ) = 1. Results of the corresponding evaluations are shown in Fig. 3, where solid and dotted lines indicate QKD systems with and without the proposed method, respectively. Since distance between an OLT and an ONU is about 20km or less in a conventional PON, we plot results up to 20km. In case of a QKD system without the proposed method, for N = 8 and 64, optimal mean photon numbers to achieve the maximum secure key rate are 1.001 obtained by differentiating Eq. (12). For N = 64 (8), the optimal mean photon numbers of the proposed system are 1.270 (1.220) under no USD attack and 1.190 (1.170) under the USD attack. At a distance of 20 km, for N = 64 (8), the secure key rates are enhanced by about 25.54% (21.44%) under no USD attack and 21.35% (18.82%) under the USD attack. The reason why we can obtain additional secure keys is utilizing multi-photon states as secret keys in the proposed method. By the same reason, the proposed method increases the usable mean photon number to generate additional secure keys because multi-photon states can be used to generate secure keys which is impossible without our proposed method.

 figure: Fig. 3

Fig. 3 Comparison of secure key rate between QKD system with and without the proposed method under an ideal setup.

Download Full Size | PDF

In case of the second simulation, implementable parameters are considered. The same optical fiber loss is assumed as that of the previous simulation. As for the SPDs of Bobs, superconductor SPDs are assumed to be used, for which one can assume 67% detection efficiency, γdet = 0.67, and 1.6 × 10−6 dark count probability, Y0 = 1.6 × 10−6 [33]. LONU, ed, and f (Eμ) are set to 3 dB, 2.3%, and 1.2, respectively, which are typical parameters in experimental results [34]. The corresponding simulation result is shown in Fig. 4. For N = 64(8), the optimal mean photon number of the conventional system is 0.593 (0.592), while those of the proposed system are 0.630 (0.630) under no USD attack and 0.630 (0.630) under an USD attack, respectively. Here, for N = 64(8), we demonstrate that our system provides 6.09 to 6.24% (5.33 to 5.43%) gain over the conventional system depending on the type of attacks at 20km. We see negligible performance degradation due to the USD attack.

 figure: Fig. 4

Fig. 4 Comparison of secure key rate between QKD system with and without the proposed method under an implementable setup.

Download Full Size | PDF

Although superconductor SPDs show high detector efficiency, deployment of such SPDs in a PON can be a burden due to their cost. In order to consider a more realistic scenario in which we employ lower-cost SPDs which typically yield lower detector efficiency, we also conduct more simulations in which detector efficiency is varied over a wide range from 25% to 100%. Fig. 5 shows the gain due to our protocol as a function of detector efficiency when we assume a fiber distance of 20km and the USD attack. We see that a gain increases with detector efficiency, although the detector efficiency depends highly on the cost of SPDs that we can employ. For the larger N, we should use cheaper SPDs given the same budget, and this yields lower detector efficiency. On the other hand, the larger N provides a higher gain, as illustrated in Fig. 5. This implies that given the detector cost constraint (which may depend on implementation technology), there may be a sweet spot on N such that the gain is maximized. So our result sheds some lights into how to design such secured access networks in practice.

 figure: Fig. 5

Fig. 5 Comparison of secure key rate gain depending on detector efficiency

Download Full Size | PDF

7. Conclusion

In this paper, we investigate how to improve secure key rate of QKD in a multi-user network such as PON. Specifically, to achieve that, we utilize characteristics of a PON which provides coincidence detection among ONUs, Bobs. Accordingly, we identify that secure keys can be exploited from multi-photon states unlike the conventional way which generates secure key only from single-photon states. For usable multi-photon states, we rigorously analyze the amount of information leaked to an eavesdropper, Eve. From this, we provide a mathematical model of secure key rate for QKD on a PON. Two different numerical simulations are conducted and presented for the cases of ideal and implementable setups. Our simulation results show that at 20km, the key rate improvement in the ideal setup is 21.35%. Even in the implementable setup, the gain is respectable: ∼ 6.09%. Furthermore, our results reveal that the effect of the USD attack is negligible. We believe that our work may pave a solid background for further researches on QKD in multi-user networks.

Appendix A: Mutual Information leaked to an eavesdropper under photon number splitting attack on safe multi-photon states

As mentioned in Section 5, an eavesdropper, Eve, can performs a collective attack to a multi-photon state [3].

Since a photon has single-qubit information on a 2-dimensional Hilbert space H⊗2, a general N-photon state can be modeled as multiple qubits on 2N-dimensional Hilbert space H⊗2N. Here, since photons in a pulse are indistinguishable, we need to consider input state representation pertinent to indistinguishable photons when we analyze an Eve’s attack for a N-photon state. For example, indistinguishable two photons are represented as four states such as |00〉, (|01+|10)/2, (|01|10)/2, and |11〉. Based on this, for a given N-photon state |QN〉 in which photons are indistinguishable, Eve’s attack U can be formulated as follows:

U|QN|ψ0=E{1,2,N}DE|QE|ψEQN,
where |ψ0〉 represents ancilla qubit states prepared by Eve, |QE〉 and |ψEQN are qubit states after the attack. Specifically, compared to the input state |QN〉, |QE〉 refers to qubits having errors on the i-th qubit where iE. |ψEQN refers to Eve’s ancilla qubits after the attack corresponding to |QE〉. The probability of each state is represented by DE. As in [3], by the Schmidt decomposition and characteristics of unitary transformation of Eq. (20), one can find a condition for |ψEQN.
ψEQN|ψEQN=0forEE.
Before proceeding detailed calculation, for easy understanding, we show calculation of a two-photon state case first. By expanding the result of a two-photon state case, a general case can be easily calculated. To represent the bases and states of input qubits |Q2〉, we define
|Q2|qbsqbs,
where qbs indicates a single qubit encoded with basis b ∈ {Z, X} and state s ∈ {0, 1}. For example, qz0 is a single qubit state encoded in state 0 with basis Z.

To analyze the information obtained by Eve, it is enough to consider a single basis case because Eve perform a symmetric attack regarding the bases. Unless Eve performs a symmetric attack, the attack can be easily detected because probability of error among bases are unbalanced. Therefore, we proceed calculation only for the ZZ basis, which means both qubits of Eve are encoded with Z basis. In this case, with Eq. (21) and a 16-dimensional Hilbert space to express all possible states of |ψEQ2, |ψEQ2 can be parametrized with four variables a1, a2, b1, and b2 as follows [3]:

|ψØqZ0qZ0=|0|0|0|0,
|ψ{1}qZ0qZ0=|0|1|0|0,
|ψ{2}qZ0qZ0=|0|0|0|1,
|ψ{1,2}qZ0qZ0=|0|1|0|1,
|ψØqZ1qZ0=|a1|0|0|0,
|ψ{1}qZ1qZ0=|b1|1|0|0,
|ψ{2}qZ1qZ0=|a1|0|0|1,
|ψ{1,2}qZ1qZ0=|b1|1|0|1,
|ψØqZ0qZ1=|0|0|a2|0,
|ψ{1}qZ0qZ1=|0|1|a2|0,
|ψ{2}qZ0qZ1=|0|0|b2|1,
|ψ{1,2}qZ  0qZ  1=|0|1|b2|1,
|ψØqZ1qZ1=|a1|0|a2|0,
|ψ{1}qZ1qZ1=|b1|1|a2|0,
|ψ{2}qZ1qZ1=|a1|0|b2|1,
|ψ{1,2}qZ1qZ1=|b1|1|b2|1,
where |ai〉 = cos ai |0〉 + sin ai |1〉 and |bi〉 = cos bi |0〉 + sin bi |1〉, for i ∈ {1, 2}.

As in [3], with Eqs. (20), (23) to (38), and E{1,2}DE=1, error probabilities can be expressed as follows:

DØ=f1f2(1+f1)(1+f2),
D{1}=f2(1+f1)(1+f2),
D{2}=f1(1+f1)(1+f2),
D{1,2}=1(1+f1)(1+f2).
where f1 = (1 + cos b1)/(1 − cos a1) and f2 = (1 + cos b2)/(1 cos a2).

Note that, for multi photon states, multiple qubits are encoded with the same basis and state. That is, Q2 can be |00〉 or |11〉 in the ZZ basis. This reduces the number of possible outcomes from Eve’s unitary operation working for arbitrary input states of Q2. As a result, this provides Eve has more information for a multi-qubit state than a single qubit state. To specifically calculate maximum mutual information between Alice and Eve for a two-qubit state I(A; E)2, we use Holevo’s theorem [35].

I(A;E)2S(ρE)s=01Pr(qZsqZs)S(ρEqZs,qZs),
where S(·) indicates von Neumann entropy, ρE represents Eve’s density matrix, Pr(qZs qZs) is the probability that Alice transmits qubit |qZs qZs〉, and ρEqZsqZs Eve’s conditional density matrix given a qubit |qZs qZs〉 sent by Alice. Since, Alice transmits states with uniform distribution in this protocol, Pr(qZs qZs) in Eq. (43) becomes 1/2. Eve’s density matrix is defined as ρE=s=01Pr(qZsqZs)ρEqZsqZs. Eve’s conditional density matrix can be easily calculated by a partial trace of Eq. (20) with parameterization of |ψEQ2.
ρEqZsqZs=E{1,2}DE|ψEqZsqZsψEqZsqZs|.
The remaining part of works are to calculate von Neumann entropies of ρE and ρEqZsqZs. First, for s = 0, 1, eigenvalues of ρEqZsqZs are D, D{1}, D{2}, and D{1,2}. Therefore,
s=01Pr(qZsqZs)S(ρEqZsqZs)=S(ρEqZ0qZ0)=E{1,2}DElog2DE.

Second, eigenvalues of ρE are D(1 ± cos a1 cos a2)/2, D{1}(1 ± cos b1 cos a2)/2, D{2}(1 ± cos a1 cos b2)/2, and D{1,2}(1 ± cos b1 cos b2)/2. With these eigenvalues, S(ρE) is calculated as follows:

S(ρE)=DØg(c+(a1,a2))+D{1}g(c+(b1,a2))+D{2}g(c+(a1,b2))+D{1,2}g(c+(b1,b2))+DØg(c(a1,a2))+D{1}g(c(b1,a2))+D{2}g(c(a1,b2))+D{1,2}g(c(b1,b2))E{1,2}DElog2DEg(DØc+(a1,a2)+D{1}c+(b1,a2)+D{2}c+(a1,b2)+D{1,2}c+(b1,b2))+g(DØc(a1,a2)+D{1}c(b1,a2)+D{2}c(a1,b2)+D{1,2}c(b1,b2))E{1,2}DElog2DE,
where g(x) = −x log2 x and c±(x, y) = (1± cos x cos y)/2. Inequality of Eq. (46) is derived from Jensen’s inequality because g(·) is concave a function. The equality condition of Eq. (46) is satisfied when a1 = a2 = b1 = b2 = c where c is constant. Then, we obtain
S(ρE)=g(1+cos2c2)+g(1cos2c2)E{1,2}DElog2DE,
DØ=(1+cosc2)2=(1D)2,
D{1}=(1cosc2)(1+cosc2)=D(1D),
D{2}=(1cosc2)(1+cosc]2)=(1D)D,
D{1,2}=(1cosc2)2=D2,
where D is error probability of a two-photon state. Since it is considered that errors by a channel are from eavesdropping, D is the same as error probability given two-photon state, e2.

By substituting Eqs. (45) and (46) to Eq. (43), we find

I(A;E)2g(1+cos2c2)+g(1cos2c2).
That is, Eq. (52) indicates leaked information to Eve from two-photon states. By expanding this result, the maximum mutual information between Alice and Eve for a general i-photon state can be obtained as follows:
I(A;E)iH2(1+cosic2).

Funding

ICT R&D program of MSIP/IITP (1711028311, Reliable crypto-system standards and core technology development for secure quantum key distribution network); KAIST School of Electrical Engineering BK21 Program.

References and links

1. W.-Y. Hwang, “Quantum key distribution with high loss: Toward global secure communication,” Phys. Rev. Lett. 91, 057901 (2003). [CrossRef]   [PubMed]  

2. H.-K. Lo, M. Curty, and B. Qi, “Measurement-device-independent quantum key distribution,” Phys. Rev. Lett. 108, 130503 (2012). [CrossRef]   [PubMed]  

3. K. Lim, H. Ko, K. Kim, C. Suh, and J.-K. Rhee, “The error tolerance bound for secure multi-qubit QKD against incoherent attack,” IEEE J. Sel. Topics Quantum Electron. 21, 1–9 (2015).

4. K. Patel, J. Dynes, M. Lucamarini, I. Choi, A. Sharpe, Z. Yuan, R. Penty, and A. Shields, “Quantum key distribution for 10 Gb/s dense wavelength division multiplexing networks,” Appl. Phys. Lett. 104, 051123 (2014). [CrossRef]  

5. Z. Tang, Z. Liao, F. Xu, B. Qi, L. Qian, and H.-K. Lo, “Experimental demonstration of polarization encoding measurement-device-independent quantum key distribution,” Phys. Rev. Lett. 112, 190503 (2014). [CrossRef]   [PubMed]  

6. F. Xu, K. Wei, S. Sajeed, S. Kaiser, S. Sun, Z. Tang, L. Qian, V. Makarov, and H.-K. Lo, “Experimental quantum key distribution with source flaws,” Phys. Rev. A 92, 032305 (2015). [CrossRef]  

7. J.-P. Bourgoin, N. Gigov, B. L. Higgins, Z. Yan, E. Meyer-Scott, A. K. Khandani, N. Lütkenhaus, and T. Jennewein, “Experimental quantum key distribution with simulated ground-to-satellite photon losses and processing limitations,” Phys. Rev. A 92, 052339 (2015). [CrossRef]  

8. W.-Y. Liang, M. Li, Z.-Q. Yin, W. Chen, S. Wang, X.-B. An, G.-C. Guo, and Z.-F. Han, “Simple implementation of quantum key distribution based on single-photon Bell-state measurement,” Phys. Rev. A 92, 012319 (2015). [CrossRef]  

9. M. Peev, C. Pacher, R. Alléaume, C. Barreiro, J. Bouda, W. Boxleitner, T. Debuisschert, E. Diamanti, M. Dianati, J. Dynes, S. Fasel, S. Fossier, M. Fürst, J.-D. Gautier, O. Gay, N. Gisin, P. Grangier, A. Happe, Y. Hasani, M. Hentschel, H. Hübel, G. Humer, T. Länger, M. Legré, R. Lieger, J. Lodewyck, T. Lorünser, N. Lütkenhaus, A. Marhold, T. Matyus, O. Maurhart, L. Monat, S. Nauerth, J.-B. Page, A. Poppe, E. Querasser, G. Ribordy, S. Robyr, L. Salvail, A. W. Sharpe, A. J. Shields, D. Stucki, M. Suda, C. Tamas, T. Themel, R. T. Thew, Y. Thoma, A. Treiber, P. Trinkler, R. Tualle-Brouri, F. Vannel, N. Walenta, H. Weier, H. Weinfurter, I. Wimberger, Z. L. Yuan, H. Zbinden, and A. Zeilinger, “The SECOQC quantum key distribution network in Vienna,” New J. Phys. 11, 075001 (2009). [CrossRef]  

10. M. Sasaki, M. Fujiwara, H. Ishizuka, W. Klaus, K. Wakui, M. Takeoka, S. Miki, T. Yamashita, Z. Wang, A. Tanaka, K. Yoshino, Y. Nambu, S. Takahashi, A. Tajima, A. Tomita, T. Domeki, T. Hasegawa, Y. Sakai, H. Kobayashi, T. Asai, K. Shimizu, T. Tokura, T. Tsurumaru, M. Matsui, T. Honjo, K. Tamaki, H. Takesue, Y. Tokura, J. F. Dynes, A. R. Dixon, A. W. Sharpe, Z. L. Yuan, A. J. Shields, S. Uchikoga, M. Legré, S. Robyr, P. Trinkler, L. Monat, J.-B. Page, G. Ribordy, A. Poppe, A. Allacher, O. Maurhart, T. Länger, M. Peev, and A. Zeilinger, “Field test of quantum key distribution in the Tokyo QKD Network,” Opt. Express 19, 10387–10409 (2011). [CrossRef]   [PubMed]  

11. S. Wang, W. Chen, Z.-Q. Yin, Y. Zhang, T. Zhang, H.-W. Li, F.-X. Xu, Z. Zhou, Y. Yang, D.-J. Huang, L.-J. Zhang, F.-Y. Li, D. Liu, Y.-G. Wang, G.-C. Guo, and Z.-F. Han, “Field test of wavelength-saving quantum key distribution network,” Opt. Lett. 35, 2454–2456 (2010). [CrossRef]   [PubMed]  

12. Y. Zhao, “Quantum secure communication networks: Products and solutions,” http://2014.qcrypt.net/wp-content/uploads/Zhao.pdf.

13. V. Fernandez, R. J. Collins, K. J. Gordon, P. D. Townsend, and G. S. Buller, “Passive optical network approach to gigahertz-clocked multiuser quantum key distribution,” IEEE J. Quantum Electron. 43, 130–138 (2007). [CrossRef]  

14. I. Choi, R. J. Young, and P. D. Townsend, “Quantum key distribution on a 10Gb/s WDM-PON,” Opt. Express 18, 9600–9612 (2010). [CrossRef]   [PubMed]  

15. A. Ciurana, J. Martínez-Mateo, M. Peev, A. Poppe, N. Walenta, H. Zbinden, and V. Martin, “Quantum metropolitan optical network based on wavelength division multiplexing,” Opt. Express 22, 1576–1593 (2014). [CrossRef]   [PubMed]  

16. B. Fröhlich, J. F. Dynes, M. Lucamarini, A. W. Sharpe, Z. Yuan, and A. J. Shields, “A quantum access network,” Nature 501, 69–72 (2013). [CrossRef]   [PubMed]  

17. H. Shim, K. Cho, Y. Takushima, and Y. Chung, “Correlation-based OTDR for in-service monitoring of 64-split TDM PON,” Opt. Express 20, 4921–4926 (2012). [CrossRef]   [PubMed]  

18. Q. Feng, W. Li, Q. Zheng, J. Han, J. Xiao, Z. He, M. Luo, Q. Yang, and S. Yu, “Impacts of backscattering noises on upstream signals in full-duplex bidirectional PONs,” Opt. Express 23, 15575–15586 (2015). [CrossRef]   [PubMed]  

19. X. Zhang, F. Lu, S. Chen, X. Zhao, M. Zhu, and X. Sun, “Remote coding scheme based on waveguide Bragg grating in PLC splitter chip for PON monitoring,” Opt. Express 24, 4351–4364 (2016). [CrossRef]  

20. X. Ma, B. Qi, Y. Zhao, and H.-K. Lo, “Practical decoy state for quantum key distribution,” Phys. Rev. A 72, 012326 (2005). [CrossRef]  

21. P. Kok, W. J. Munro, K. Nemoto, T. C. Ralph, J. P. Dowling, and G. J. Milburn, “Linear optical quantum computing with photonic qubits,” Rev. Mod. Phys. 79, 135 (2007). [CrossRef]  

22. D. Hrg, A. Poppe, A. Fedrizzi, B. Blauensteiner, H. Hübel, and A. Zeilinger, “Security aspects and simulations of practical QKD platforms,” Quantum physics of nature Theory, experiment and interpretation in collaboration with 6th European QIPC workshop, Austria (2005).

23. F. Mattioli, Z. Zhou, A. Gaggero, R. Gaudio, R. Leoni, and A. Fiore, “Photon-counting and analog operation of a 24-pixel photon number resolving detector based on superconducting nanowires,” Opt. Express 24, 9067–9076 (2016). [CrossRef]   [PubMed]  

24. T. Moroder, M. Curty, and N. Lütkenhaus, “Detector decoy quantum key distribution,” New J. Phys. 11, 045008 (2009). [CrossRef]  

25. H.-L. Yin, Y. Fu, Y. Mao, and Z.-B. Chen, “Detector-decoy quantum key distribution without monitoring signal disturbance,” Phys. Rev. A 93, 022330 (2016). [CrossRef]  

26. P. Curtacci, F. Garzia, R. Cusani, and E. Baccarelli, “Performance analysis of different multi-user optical passive networks for quantum cryptography applications,” Proc. SPIE 6187, 61870U (2006). [CrossRef]  

27. H.-K. Lo, X. Ma, and K. Chen, “Decoy state quantum key distribution,” Phys. Rev. Lett. 94, 230504 (2005). [CrossRef]   [PubMed]  

28. F. Benatti, M. Fannes, R. Floreanini, and D. Petritis, Quantum Information, Computation and Cryptography: An Introductory Survey of Theory, Technology and Experiments, vol. 808 (Springer, 2010). [CrossRef]  

29. R. Renner, “Security of quantum key distribution,” Int. J. Quantum Inf. 6, 1–127 (2008). [CrossRef]  

30. P. W. Shor and J. Preskill, “Simple proof of security of the BB84 quantum key distribution protocol,” Phys. Rev. Lett. 85, 441 (2000). [CrossRef]   [PubMed]  

31. M. Dušek, M. Jahma, and N. Lütkenhaus, “Unambiguous state discrimination in quantum cryptography with weak coherent states,” Phys. Rev. A 62, 022306 (2000). [CrossRef]  

32. D. Gottesman, H.-K. Lo, N. Lutkenhaus, and J. Preskill, “Security of quantum key distribution with imperfect devices,” in “Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on,” (IEEE, 2004), p. 136.

33. S. Miki, T. Yamashita, H. Terai, and Z. Wang, “High performance fiber-coupled NbTiN superconducting nanowire single photon detectors with Gifford-McMahon cryocooler,” Opt. Express 21, 10208–10214 (2013). [CrossRef]   [PubMed]  

34. K. Takemoto, Y. Nambu, T. Miyazawa, Y. Sakuma, T. Yamamoto, S. Yorozu, and Y. Arakawa, “Quantum key distribution over 120 km using ultrahigh purity single-photon source and superconducting single-photon detectors,” Sci. Rep. 5, 14383 (2015). [CrossRef]   [PubMed]  

35. A. S. Holevo, “Bounds for the quantity of information transmitted by a quantum communication channel,” Probl. Peredachi Inf. 9, 3–11 (1973).

Cited By

Optica participates in Crossref's Cited-By Linking service. Citing articles from Optica Publishing Group journals and other participating publishers are listed here.

Alert me when this article is cited.


Figures (5)

Fig. 1
Fig. 1 System model for a general down-stream PON system.
Fig. 2
Fig. 2 The possible cases when a pulse having multiple photons is generated.
Fig. 3
Fig. 3 Comparison of secure key rate between QKD system with and without the proposed method under an ideal setup.
Fig. 4
Fig. 4 Comparison of secure key rate between QKD system with and without the proposed method under an implementable setup.
Fig. 5
Fig. 5 Comparison of secure key rate gain depending on detector efficiency

Tables (1)

Tables Icon

Table 1 Secure key rates for different attacks.

Equations (54)

Equations on this page are rendered with MathJax. Learn more.

Pr ( the number of photons = i ) = μ i i ! e μ ,
T ch = T fiber T splitter = 10 α l 10 10 L splitter 10 ,
T ONU = 10 L ONU 10 ,
γ all = γ det T ONU T ch .
γ i = 1 ( 1 γ all ) i .
Y i = Pr ( detection occurs | i photon sate ) .
Y i = γ i + Y 0 γ i Y 0 ,
Q i = Pr ( i -photon sate, detection occurs ) = Y i μ i i ! e μ .
e i = Pr ( erroneous detection occurs | i -photon sate ) Pr ( detection occurs | i -photon sate ) = e 0 Y 0 ( 1 γ i ) + e d γ i ( 1 Y 0 ) + e 0 e d γ i Y 0 Y i .
Q μ = Pr ( detection occurs ) = i = 0 Q i = 1 ( 1 Y 0 ) e γ all μ .
E μ = Pr ( erroneous detection occurs ) Pr ( detection occurs ) = i = 0 e i Q i i = 0 Q i = e 0 Y 0 e γ all μ + e d ( 1 Y 0 ) ( 1 e γ all μ ) 1 ( 1 Y 0 ) e γ all μ .
R 1 2 { Q μ f ( E μ ) H 2 ( E μ ) + Q 1 [ 1 H 2 ( e 1 ) ] } ,
I ( A ; E ) i = H 2 ( 1 + cos i c 2 ) ,
R 1 2 { Q μ f ( E μ ) H 2 ( E μ ) + Q 1 [ 1 H 2 ( e 1 ) ] + i = 2 Q i ( 1 I ( A ; E ) i ) } ,
R 1 2 { Q μ f ( E μ ) H 2 ( E μ ) + Q 1 [ 1 H 2 ( e 1 ) ] + i = 2 Q i ( 1 I ( A ; E ) 2 ) } ,
R 1 2 { Q μ f ( E μ ) H 2 ( E μ ) + ( Q μ P multi ) [ 1 H 2 ( E μ Q μ P multi ) ] } ,
Q i i = μ i i ! e μ ( 1 ) ( i i ) γ all i ( 2 ) 1 n ( n 1 i 1 ) ( i 1 ) ! 1 ! 1 ! ( 1 n ) i 1 ( 3 ) ( 1 Y 0 ) n i ( 4 ) .
R 1 2 { Q μ f ( E μ ) H 2 ( E μ ) + Q 1 [ 1 H 2 ( e 1 ) ] + i = 2 N Bob Q i i ( 1 I ( A ; E ) i ) } = 1 2 { Q μ f ( E μ ) H 2 ( E μ ) + Q μ PA overall } ,
PA overall = Q 0 + Q 1 H 2 ( e 1 ) + i = 2 N Bob Q i i I ( A ; E ) i + i = 2 N Bob ( Q i Q i i ) + i = N Bob + 1 Q i = Q 0 + Q 1 H 2 ( e 1 ) + i = 2 N Bob Q i i I ( A ; E ) i + i = 2 N Bob ( Q i Q i i ) + Q μ i = 0 N Bob Q i = Q μ + Q 1 ( H 2 ( e 1 ) 1 ) + i = 2 N Bob Q i i ( I ( A ; E ) i 1 ) .
R 1 2 { Q μ f ( E μ ) H 2 ( E μ ) + Q 1 [ 1 H 2 ( e 1 ) ] + Q 22 ( 1 I ( A ; E ) 2 ) }
U | Q N | ψ 0 = E { 1 , 2 , N } D E | Q E | ψ E Q N ,
ψ E Q N | ψ E Q N = 0 for E E .
| Q 2 | q b s q b s ,
| ψ Ø q Z 0 q Z 0 = | 0 | 0 | 0 | 0 ,
| ψ { 1 } q Z 0 q Z 0 = | 0 | 1 | 0 | 0 ,
| ψ { 2 } q Z 0 q Z 0 = | 0 | 0 | 0 | 1 ,
| ψ { 1 , 2 } q Z 0 q Z 0 = | 0 | 1 | 0 | 1 ,
| ψ Ø q Z 1 q Z 0 = | a 1 | 0 | 0 | 0 ,
| ψ { 1 } q Z 1 q Z 0 = | b 1 | 1 | 0 | 0 ,
| ψ { 2 } q Z 1 q Z 0 = | a 1 | 0 | 0 | 1 ,
| ψ { 1 , 2 } q Z 1 q Z 0 = | b 1 | 1 | 0 | 1 ,
| ψ Ø q Z 0 q Z 1 = | 0 | 0 | a 2 | 0 ,
| ψ { 1 } q Z 0 q Z 1 = | 0 | 1 | a 2 | 0 ,
| ψ { 2 } q Z 0 q Z 1 = | 0 | 0 | b 2 | 1 ,
| ψ { 1 , 2 } q Z     0 q Z     1 = | 0 | 1 | b 2 | 1 ,
| ψ Ø q Z 1 q Z 1 = | a 1 | 0 | a 2 | 0 ,
| ψ { 1 } q Z 1 q Z 1 = | b 1 | 1 | a 2 | 0 ,
| ψ { 2 } q Z 1 q Z 1 = | a 1 | 0 | b 2 | 1 ,
| ψ { 1 , 2 } q Z 1 q Z 1 = | b 1 | 1 | b 2 | 1 ,
D Ø = f 1 f 2 ( 1 + f 1 ) ( 1 + f 2 ) ,
D { 1 } = f 2 ( 1 + f 1 ) ( 1 + f 2 ) ,
D { 2 } = f 1 ( 1 + f 1 ) ( 1 + f 2 ) ,
D { 1 , 2 } = 1 ( 1 + f 1 ) ( 1 + f 2 ) .
I ( A ; E ) 2 S ( ρ E ) s = 0 1 P r ( q Z s q Z s ) S ( ρ E q Z s , q Z s ) ,
ρ E q Z s q Z s = E { 1 , 2 } D E | ψ E q Z s q Z s ψ E q Z s q Z s | .
s = 0 1 P r ( q Z s q Z s ) S ( ρ E q Z s q Z s ) = S ( ρ E q Z 0 q Z 0 ) = E { 1 , 2 } D E log 2 D E .
S ( ρ E ) = D Ø g ( c + ( a 1 , a 2 ) ) + D { 1 } g ( c + ( b 1 , a 2 ) ) + D { 2 } g ( c + ( a 1 , b 2 ) ) + D { 1 , 2 } g ( c + ( b 1 , b 2 ) ) + D Ø g ( c ( a 1 , a 2 ) ) + D { 1 } g ( c ( b 1 , a 2 ) ) + D { 2 } g ( c ( a 1 , b 2 ) ) + D { 1 , 2 } g ( c ( b 1 , b 2 ) ) E { 1 , 2 } D E log 2 D E g ( D Ø c + ( a 1 , a 2 ) + D { 1 } c + ( b 1 , a 2 ) + D { 2 } c + ( a 1 , b 2 ) + D { 1 , 2 } c + ( b 1 , b 2 ) ) + g ( D Ø c ( a 1 , a 2 ) + D { 1 } c ( b 1 , a 2 ) + D { 2 } c ( a 1 , b 2 ) + D { 1 , 2 } c ( b 1 , b 2 ) ) E { 1 , 2 } D E log 2 D E ,
S ( ρ E ) = g ( 1 + cos 2 c 2 ) + g ( 1 cos 2 c 2 ) E { 1 , 2 } D E log 2 D E ,
D Ø = ( 1 + cos c 2 ) 2 = ( 1 D ) 2 ,
D { 1 } = ( 1 cos c 2 ) ( 1 + cos c 2 ) = D ( 1 D ) ,
D { 2 } = ( 1 cos c 2 ) ( 1 + cos c ] 2 ) = ( 1 D ) D ,
D { 1 , 2 } = ( 1 cos c 2 ) 2 = D 2 ,
I ( A ; E ) 2 g ( 1 + cos 2 c 2 ) + g ( 1 cos 2 c 2 ) .
I ( A ; E ) i H 2 ( 1 + cos i c 2 ) .
Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.