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

Quantum digital signature with unidimensional continuous-variable against the measurement angular error

Open Access Open Access

Abstract

The continuous-variable quantum digital signature (CV-QDS) scheme relies on the components of quantum key generation protocol (KGP) to negotiate classical signature, which is more compatible with optical fibers. Nevertheless, the measurement angular error of heterodyne detection or homodyne detection will cause security issues when performing KGP in the distribution stage. For that, we propose to utilize unidimensional modulation in KGP components, which only requires to modulate single quadrature and without the process of basis choice. Numerical simulation results show that the security under collective attack, repudiation attack and forgery attack can be guaranteed. We expect that the unidimensional modulation of KGP components could further simplify the implementation of CV-QDS and circumvent the security issues caused by the measurement angular error.

© 2023 Optica Publishing Group under the terms of the Optica Open Access Publishing Agreement

1. Introduction

With the realization for Shor’s algorithm [1] on quantum computers, the digital signature (DS) is no longer secure since its security depends on unproven computational assumptions [2,3]. In contrast, Gottesman and Chuang proposed a scheme of quantum digital signature (QDS), whose security is guaranteed by quantum mechanics [4]. However, this scheme requires long-term quantum memory and SWAP test, which makes experiments difficult. Subsequently, Ref. [5] utilized an optical multiport, while the quantum memory is also required. Ref. [6] proposed to adopt the components of KGP in the distribution stage, which not only does not need to use quantum memory, but also can further expand the application range of QDS. Considering the security of practical implementations, Ref. [7] proposed the QDS scheme based on the measurement-device-independent structure [810], which can effectively avoid side channel attacks. Besides, some other QDS schemes [1113] based on key generation protocol (KGP) components have also been proposed.

To be specific, above QDS schemes are based on components of discrete-variable (DV) KGP, which adopts the coherent pulses to encode on the polarization of a single photon [1421]. Even though, imperfections of single-photon detection can still be exploited to attack the system. Different from DV-QDS scheme, Thornton et al. adopted the components of continuous-variable (CV) KGP for QDS scheme [22]. In particular, CV-KGP employs the weak coherent pulses for encoding and coherent detection to measure quantum signals, which is more compatible with optical fibers [2325]. Practically, in coherent detection, whether heterodyne detection or homodyne detection, measurement angular error will be introduced. In heterodyne detection, $\widehat {X}$ quadrature and $\widehat {P}$ quadrature require to measure simultaneously. For the $\widehat {P}$ quadrature, an optical phase shifter is required to constantly rotate the local oscillator pulse phase to achieve heterodyne detection [26]. Homodyne detection requires to randomly measure one of two quadratures through the process of basis choice [27]. Both of the above processes will refer to the deviation of phase, namely measurement angular error.

For CV-QDS protocol, we propose to utilize unidimensional modulation in the KGP components, whose security has been demonstrated [2831]. For one thing, the unidimensional modulation only requires single quadrature modulation of weak coherent pulses, which can provide simplified implementation; for another, it does not need the process of basis choice, so there without measurement angular error. Without loss of generality, QDS considers a nontrivial set that contains three participants. In the distribution stage, Alice creates two Gaussian random strings and forms the corresponding quantum states. For quantum states that send to Bob, Alice only modulates $\widehat {X}$ quadrature while $\widehat {P}$ quadrature is not; for another that send to Charlie, Alice only modulates $\widehat {P}$ quadrature while $\widehat {X}$ quadrature is not. In the messaging stage, Alice sends the classical triplet and passes it to Charlie via Bob.

This paper is organized as follows. In Sec.2, we analyze the influence of measurement angular error on the performance of the CV-QDS scheme, both in heterodyne detection and homodyne detection. In Sec.3, we describe the structure of the CV-QDS protocol with unidimensional modulation and analyze its security, such as collective attack, repudiation attack and forgery attack are considered. Finally, conclusions are drawn in Sec.4.

2. Measurement angular error in CV-QDS protocl

In the CV-QDS, the ultimate purpose of signature is to safely deliver messages from Alice to Bob and Charlie. In the distribution stage of CV-QDS, the quantum signature is generally obtained through the key generation protocol, which is essentially the quantum part of the CV-QKD protocol without the post-processing [3234]. Firstly, Alice sends coherent states to quantum channels, and then two receivers perform heterodyne detection or homodyne detection on the received states. After negotiation, the measurement results are signed by quantum signatures. However, whether heterodyne detection or homodyne detection, measurement angular error will be introduced in practice, which will lead to the security problems. During the messaging stage, three participants negotiate to obtain the classical signature, and that can be utilized for identity authentication. After the authentication is passed, the message will be delivered.

2.1 Practical security analysis in heterodyne detection

When the receiver adopts heterodyne detection in the CV-QDS protocol, he needs to measure $\widehat {X}$ quadrature and $\widehat {P}$ quadrature simultaneously. For the $\widehat {P}$ quadrature, an optical phase shifter is required to constantly rotate the local oscillator pulse phase to achieve heterodyne detection. Affected by external force, various factors in optical fibre system such as refractive index and geometrical size are susceptible to change, it will cause difficulties for optical phase shifter to perfectly rotate the phase by 90$^{\circ }$ in experimental implementations [26]. The measurement angular error in heterodyne detection refers to the deviation of the local oscillator phase by 90$^{\circ }$. In what follows, the interpretation of measurement angular error and parameter estimation model is described in detail.

Figure 1(a) depicts the entanglement-based (EB) scheme of CV-KGP with heterodyne detection [35]. In this scheme, Alice prepares a EPR state with variance $V$, while she stores the mode $A_0$ for heterodyne detection and injects the other half $B_0$ into the quantum linear channel controlled by Eve. In the equivalent prepare-and-measure (PM) scheme, Alice prepares Gaussian random numbers with the corresponding $\widehat {X}$ quadrature and $\widehat {P}$ quadrature, satisfying with $\widehat {X}=I_s \mathrm {cos}\phi _s$ and $\widehat {P}=I_s \mathrm {sin}\phi _s$, where two parmeters $\phi _s$ and $I_s$ represents the phase modulator information and intensity modulator information respectively, as depicted in Fig. 2(a). The covariance matrix of the system is [26]

$$\Gamma_{A_0B_1}= \left[ \begin{array}{ccc} V \mathbb{I}_2 & \sqrt{T(V^2-1)}\mathbb{Z} \\ \sqrt{T(V^2-1)}\mathbb{Z} & (TV+(1-T)\omega) \mathbb{I}_2 \end{array} \right] ,$$
with the notations $\omega =T\epsilon \ /(1-T) +1$, $\mathbb {I}_2=\mathrm {diag}(1,1)$ and $\mathbb {Z}=\mathrm {diag}(1,-1)$. Here, $T$ is the transmittance, $V$ is the variance, $\epsilon$ denotes excess noises and $\omega$ is Eve’s modulation variance. Bob use a balanced beam splitter to split mode $B_1$ into two modes, $B_2$ and $B_3$, the former is measured $\widehat {X}$ quadrature, and the latter is measured $\widehat {P}$ quadrature after a phase shift operation. The covariance matrix of state $\gamma _{A_0B_2B_3}$ can be expresses as
$$\Gamma_{A_0B_2B_3}= M_{bs}\cdot (\Gamma_{{A_0B_1}}\oplus\mathbb{I}_2)\cdot M_{bs}^{\mathrm{T}} ,$$
where matrix $M_{bs}$ denotes the balanced beam splitter transformation, with the notation
$$M_{bs}= \left[ \begin{array}{ccc} \mathbb{I} & 0 & 0 \\ 0 & \frac{1}{\sqrt{2}}\mathbb{I} & \frac{1}{\sqrt{2}}\mathbb{I} \\ 0 & -\frac{1}{\sqrt{2}}\mathbb{I} & \frac{1}{\sqrt{2}}\mathbb{I} \\ \end{array} \right] .$$
After a phase shifter operation, the final state $\gamma _{A_0B_2B_4}$ is written as
$$\Gamma_{A_0B_2B_4}= M_{ps}\cdot \Gamma_{A_0B_2B_3}\cdot M_{ps}^{\mathrm{T}} ,$$
where matrix $M_{PS}$ denotes the phase shifter operation with
$$M_{ps}= \left[ \begin{array}{ccc} \mathbb{I} & 0 & 0 \\ 0 & \mathrm{cos}\theta & \mathrm{sin}\theta \\ 0 & -\mathrm{sin}\theta & \mathrm{cos}\theta \end{array} \right] ,$$
and $\theta$ represents the measurement angular error.

 figure: Fig. 1.

Fig. 1. The entanglement-based model of the CV-KGP. (a) Heterodyne detetcion. (b) Homodyne detection. EPR, two-mode squeezed vacuum state; QM, quantum memory; PS, phases shift; BC, basis choice; RNG, random numbers generator.

Download Full Size | PDF

 figure: Fig. 2.

Fig. 2. Three modulation modes of quantum states. (a) Gaussian modulation. (b) Unidimensional modulation with $\widehat {X}$ quadrature. (c) Unidimensional modulation with $\widehat {P}$ quadrature.

Download Full Size | PDF

The secret key rate in CV-KGP is defined as

$$K=\beta I_{AB}-\chi_{BE},$$
where $\beta$ denotes the reconciliation efficiency for reverse reconciliation. To be specific, $I_{AB}$ represents the mutual information between two sides, which can be expressed as [26]
$$I_{AB}=\frac{1}{2}\mathrm{log}_2 \frac{V_A^{\widehat{X}}}{V_{A|B}^{\widehat{X}}}+ \frac{1}{2}\mathrm{log}_2 \frac{V_A^{\widehat{P}}}{V_{A|B}^{\widehat{P}}},$$
since two quadratures are used to extract keys. Besides, $\chi _{BE}$ denotes the Holevo quantity between receiver and eavesdropper, which reads
$$\chi_{BE}=G\left(\frac{\lambda_1-1}{2}\right) +G\left(\frac{\lambda_2-1}{2}\right) - G\left(\frac{\lambda_3-1}{2}\right) ,$$
where
$$G(x)=(x+1)\mathrm{log}(x+1)-x\mathrm{log}x.$$
Specifically, $\lambda _{1,2}$ and $\lambda _3$ are symplectic eigenvalues of matrix $\gamma _{A_0B_1}$ and matrix $\gamma _{A|B_2^x B_4^p}$ with respective. After measuring mode $B_4$ in $\widehat {P}$ quadrature, the conditional covariance matrix can be calculated as
$$\Gamma_{AB_2|B_4^p}=\Gamma_{AB_2}-\sigma_{AB_2B_4} \cdot (X_1 \Gamma_{B_4} X_1)^{\mathrm{MP}} \sigma_{AB_2B_4}^{\mathrm{T}},$$
where $\sigma _{AB_2B_4}$ and $\Gamma _{AB_2}$ are submatrices of covariance $\Gamma _{AB_2B_4}$, $X_1=\mathrm {diag}(0,1)$ and $\mathrm {MP}$ is the Moore-Penrose inverse. Subsequently, measuring mode $B_2$ in $\widehat {X}$ quadrature, the conditional covariance matrix is written as
$$\Gamma_{A|B_2^x B_4^p}=\Gamma_{A|B_4^p} -\sigma_{AB_2} \cdot(X_2 \Gamma_{B_2} X_2)^{\mathrm{MP}} \cdot \sigma_{AB_2}^{\mathrm{T}},$$
where $\sigma _{AB_2}$ and $\Gamma _{A|B_4^p}$ are submatrices of covariance $\Gamma _{AB_2|B_4^p}$.

2.2 Practical security analysis in homodyne detection

When the receiver adopts homodyne detection in the CV-QDS protocol, he needs to randomly measure one of two quadratures through the process of basis choice. To be specific, a digital-to-analog convertor (DAC) and a phase modulator are utilized to realize the procedure of basis choice. Nevertheless, it’s difficult for receiver to accurately control the phase modulator for 0 or $\frac {\pi }{2}$ phase since the finite bandwidth of the DAC [36]. Such finitenesses bring about the measurement angular error during procedure of basis choice. In what follows, an interpretation of measurement angular error of homodyne detection is described in detail.

It is known that the modulated phase can be evaluated as

$$\phi=\pi \cdot \frac{ v_m }{v_{\pi}},$$
where $v_{\pi }$ denotes the half-wave voltage, $v_m$ is the modulation voltage. However, it’s difficult for phase modulator to perfectly modulate 0 or $\frac {\pi }{2}$ in experimental implementation. On this condition, the actual modulation phase $\phi '$ will deviate from the expected value, which leads to
$$\phi'=\frac{|LG|}{1+|LG|} \cdot \frac{v_m }{v_{\pi}} \cdot \pi.$$
In the DAC, LG denotes the loop gain of operational amplifier. Furthermore, the expectation transmittance and excess noise are redefined as [27]
$$T'=T[E(\mathrm{sin}\phi')]^2, \epsilon'=\frac{(T-T')(V-1)+T\epsilon}{T'}.$$

The EB scheme of the CV-KGP with homodyne detection is depicted in Fig. 1(b), where Alice prepares ERP state and send one mode $B_0$ to the channel, and state $\gamma _{A_0B_2}$ has the covariance matrix

$$\Gamma_{A_0B_2}= \left[ \begin{array}{ccc} V \mathbb{I}_2 & \sqrt{T(V^2-1)}\mathbb{Z} \\ \sqrt{T(V^2-1)}\mathbb{Z} & (T(V+\chi_{\mathrm{line}})) \mathbb{I}_2 \end{array} \right] ,$$
where $\chi _\mathrm {h}=\left [ 1-\eta +v_{el}\right ]/\eta$ represents the channel-added noise, $v_{el}$ denotes the electronic noise and $\eta$ characterizes the detector’s efficiency. Unlike heterodyne detection, the mutual information of homodyne detection is calculated as
$$I_{AB}=\frac{1}{2}\mathrm{log}_2 \frac{\gamma_B}{\gamma_{B|A}},$$
where $\gamma _{B|A}$ is the conditional variance with
$$\gamma_{B|A}=\gamma_{B_2}-\sigma_{A_0B_2}\cdot(X_1 \gamma_{A_0} X_1)^{\mathrm{MP}} \cdot\sigma_{A_0B_2}^\mathrm{T} ,$$
where $\gamma _{A_0}$, $\gamma _{B_2}$ and $\sigma _{A_0B_2}$ are the submatrices and correlation in $\Gamma _{A_0B_2}$, respectively. The Holevo quantity $\chi _{BE}$ is given by
$$\chi_{BE}=\sum_{i=1}^2 G\left( \frac{\lambda_i-1}{2}\right) -\sum_{i=3}^5 G\left( \frac{\lambda_i-1}{2}\right) ,$$
where $G(\cdot )$ is defined in Eq. (9) and symplectic sigenvalues are calculated as [37]
$$\lambda_{1,2}^2=\frac{1}{2} (A\pm \sqrt{A^2-4B}), \lambda_{3,4}^2=\frac{1}{2} (C\pm \sqrt{C^2-4D}), \lambda_5=1,$$
with notations
$$\begin{aligned}A&=V^2+T^2(V+\chi_{\mathrm{line}})-2T(V^2-1),\\ B&= T^2 (V\chi_{\mathrm{line}}+1 )^2,\\ C&=\frac{A \chi_{\mathrm{h}}+V\sqrt{B}+T(V+\chi_{\mathrm{line}}) }{T(V+\chi_{\mathrm{tot}})},\\ D&=\frac{\sqrt{B}(V+\sqrt{B}\chi_{\mathrm{h}})}{T(V+\chi_{\mathrm{tot}})}, \end{aligned}$$
where $\chi _{\mathrm {tot}}=\chi _{\mathrm {line}}+\chi _{\mathrm {h}}/T$ is the total noise.

2.3 Simulation results

In this subsection, we employ numerical simulation to explore how $\theta$ affects the performance of the scheme. Figure 3 shows the secret key rate $K$ as a function of the transmission distance $L$. Specifically, Fig. 3(a) is the simulation reuslts for heterodyne detection, from left to right, the four solid lines denote to different $\theta =15^{\circ },10^{\circ },5^{\circ },0^{\circ }$ with respective, and the dotted line denotes the PLOB bound [38,39]. Figure 3(b) is the simulation results for homodyne detection, form left to right, the four solid lines correspond to $\theta =6^{\circ },4^{\circ },2^{\circ },0^{\circ }$ respectively. For one thing, the secure $K$ and $L$ increase as $\theta$ decreases. For another, with the same $\theta$, heterodyne detection is obviously outperformed by homodyne detection, which can gain longer secure distance and higher key rates.

 figure: Fig. 3.

Fig. 3. The secret key rate as a function of the transmission distance for (a) heterodyne detection and (b) homodyne detection, with different measurement angular error $\theta$. Other parameters are set as $V=20$, $\beta =0.95$ and $\epsilon =0.01$.

Download Full Size | PDF

Then, we reveal how measurement angular error affects the maximum transmission distance. The plot of Fig. 4 shows the transmission distance versus the measurement angular error for heterodyne detection and homodyne detection. From top to bottom, the four colors of lines correspond to different excess noise $\epsilon =0.01,0.03,0.05,0.07$ with respective. For one thing, when measurement angular error increases, the maximum transmission distance decreases evidently. For another, the maximum transmission distance with imperfect angular derivation seems to be sensitive to changes in excess noise that both in heterodyne detection and homodyne detection. Accordingly, excess noise is a key parameter to direct impact the maximum transmission distance. Besides, as depicted in Fig. 4(b), the maximum transmission distance for homodyne detection decreases sharply with the increase of $\theta$ derivation compared with Fig. 4(a).

 figure: Fig. 4.

Fig. 4. The maximum transmission distance as a function of measurement angular error $\theta$ for (a) heterodyne detection and (b) homodyne detection, with different excess noise $\epsilon$. Other parameters are set as $V=20$ and $\beta =0.95$.

Download Full Size | PDF

Shown in Fig. 5, we plot the secret key rates versus modulation variance. The secret key rates at the transmission distance of 10 km is denoted by dotted lines, meanwhile the distance of 40 km is denoted by solid lines. We can see that, from the transmission distance of 10 km to the distance of 40 km, the secret key rate reduces evidently and the optional region of modulation variance is gradually compressed. Moreover, the feasible range of modulation variance and the optimal secret key rate for heterodyne are much larger than that for homodyne detection. From three-dimensional Fig. 6, we can see that the two parameters, measurement angular error $\theta$ and modulation variance $V$ directly decide the impact of secret key rates. In addition, the maximum key rate in heterodyne detection is higher than that in homodyne detection, and the feasible regions of $\theta$ and $V$ are also greater than that in homodyne detection.

 figure: Fig. 5.

Fig. 5. The secret key rate as a function of the modulation variance for (a) heterodyne detection and (b) homodyne detection. Transmission distance $L$ are set to 10 km and 20 km. Other parameter is set as $\beta =0.95$, and SUN represents the shot noise variance.

Download Full Size | PDF

 figure: Fig. 6.

Fig. 6. Secret key rate versus measurement angular error $\theta$ and modulation variance $V$ at the transmission distance of 10km for (a) heterodyne detection and (b) homodyne detection.

Download Full Size | PDF

3. Scheme of unidimensional modulation for CV-QDS

3.1 Protocol description

In this section, we illustrate our CV-QDS scheme, in which the key generation process adopts unidimensional modulation technology. The scheme is depicted in Fig. 7 and described as follows.

 figure: Fig. 7.

Fig. 7. The CV-QDS protocol. Solid lines, dot-dashed lines and dashed line are denotes the quantum channels, public classical channels and encrypted classical channel, respectively.

Download Full Size | PDF

Distribution stage 1-4

Step 1. A signed one-bit message needs to be sent from Alice to Bob and Charlie. First of all, Alice creates two different Gaussian random strings, string $\{CS_B\}_j^l = \{X_{B_j}\}_{j=1}^l$ for Bob and string $\{CS_C\}_j^l = \{P_{C_j}\}_{j=1}^l$ for Charlie. Here, $l$ represents the signature length.

Step 2. For one string $\{CS_B\}_j^l$, Alice prepares the corresponding quantum states $\otimes _{j=1}^l |X_{B_j}+iP_B\rangle$, that only the $\widehat {X}$ quadrature is modulated, as depicted in Fig. 2(b). If the value of $X_{B_j}$ greater than $0$, the corresponding signature element owned by Alice can be noted as $QA_{B_j}=1$. Otherwise, $QA_{B_j}=0$. Therefore, the quantum signature for Bob prepared by Alice is $\{QA_{B_j}\}_{j=1}^l$. For another string $\{CS_C\}_j^l$, Alice prepares the corresponding quantum states $\otimes _{j=1}^l |X_C+iP_{C_j}\rangle$, that only the $\widehat {P}$ quadrature is modulated, as depicted in Fig. 2(c). Similarly, the quantum signature for Charlie prepared by Alice is $\{QA_{C_j}\}_{j=1}^l$. And then, the prepared quantum signatures are sent to Bob and Charlie through the quantum channels respectively.

Step 3. Two receivers measure the quantum states by homodyne detection and form new signatures. This is due to the presence of channel loss and possible external interference, making it possible for the discrepancy between the quantum signatures sent by Alice and the signatures received by the two receivers. As for Bob, he measures each of received states $|X_{B_j}+iP_B\rangle$ in $\widehat {X}$ quadrature, mapping the result greater than $0$ into the received signature $QS_{B_j}=1$ and the result no more than $0$ into $QS_{B_j}=0$. Therefore, Bob can get his received signature $\{QS_{B_j}\}_{j=1}^l$. As for Charlie, he measures each of received states $|X_C+iP_{C_j}\rangle$ in $\widehat {P}$ quadrature, and the mapping rules are the same as Bob’s. In the same way, Charlie can get the received signature $\{QS_{C_j}\}_{j=1}^l$.

Step 4. Bob sends random $l/2$ elements $\{QS_{B_j}^f\}_{j=1}^{l/2}$ to Charlie, while Charlie sends random $l/2$ elements $\{QS_{C_j}^f\}_{j=1}^{l/2}$ to Bob. This process is performed over a classical encrypted channel. The remained elements are denoted as $\{QS_{B_j}^k\}_{j=1}^{l/2}$ and $\{QS_{C_j}^k\}_{j=1}^{l/2}$ for Bob and Charlie. Hence, Bob’s final signatures are denoted as $\{SK_{B_j}\}_{j=1}^l:=\{\{QS_{B_j}^k\}_{j=1}^{l/2},\{QS_{C_j}^f\}_{j=1}^{l/2}\}$, and Charlie’s final signatures are denoted as $\{SK_{C_j}\}_{j=1}^l:=\{\{QS_{C_j}^k\}_{j=1}^{l/2},\{QS_{B_j}^f\}_{j=1}^{l/2}\}$.

Messaging stage 5-7

Step 5. Alice sends the classical triplet through the public channel to Bob. The classical triplet consists of three parts, one-bit message $m$, classical information $\{CS_B\}_j^l$ correlated with Bob, and $\{CS_C\}_j^l$ correlated with Charlie.

Step 6. Bob decodes his final signatures $\{SK_{B_j}\}_{j=1}^l$, then compares the results with the elements in $\{CS_B\}_j^l$, and records the mismatching rate. The protocol aborts when the mismatching rate for both halves of his signature are higher than $t_bl/2$. Otherwise, it will continue.

Step 7. Charlie received the classical triplet from Bob and also records the mismatching rate. The protocol aborts if the mismatching rate for both half of signatures are higher than $t_cl/2$. Othewise, the protocol will succeed. In particular, parameters $t_b$ and $t_c$ are the security threshold to protect the protocol against repudiation, satisfied with $0<t_b<t_c<1/2$.

3.2 Security analysis

3.2.1 Collective attacks

We analyze the security of CV-KGP with unidimensional modulation under Eve’s collective attacks in this subsection. As depicted in Fig. 8, Alice prepares a EPR state and performs homodyne detection on mode $A_0$ and squeezing mode $B_0$ with squeezing parameter $-\mathrm {log}\sqrt {V}$. After squeezing, state $\rho _{A_0 B_1}$ has the covariance matrix with

$$\Gamma_{A_0 B_1}= \left[ \begin{array}{cccc} V & 0 & \sqrt{V(V^2-1)} & 0 \\ 0 & V & 0 & -\sqrt{\frac{V^2-1}{V}} \\ \sqrt{V(V^2-1)} & 0 & V^2 & 0 \\ 0 & -\sqrt{\frac{V^2-1}{V}} & 0 & 1 \end{array} \right] .$$
As stated above, Alice only modulated the $\widehat {X}$ quadrature. Then Alice sends mode $B_1$ to Bob, resulting in
$$\Gamma_{A_0 B_2}= \left[ \begin{array}{@{}cccc@{}} V & 0 & \sqrt{T_x V_M}(1+V_M)^{\frac{1}{4}} & 0 \\ 0 & V & 0 & -\sqrt{T_p V_M}(1+V_M)^{-\frac{1}{4}} \\ \sqrt{T_x V_M}(1+V_M)^{\frac{1}{4}} & 0 & 1+T_x(V_M+\epsilon_x) & 0 \\ 0 & -\sqrt{T_p V_M}(1+V_M)^{-\frac{1}{4}} & 0 & 1+T_x\epsilon_p \end{array} \right] ,$$
where $T_{x,p}$ and $\epsilon _{x,p}$ denotes the transmittance and excess noise, and $V_M=V^2-1$.

 figure: Fig. 8.

Fig. 8. The entanglement-based model for CV-KGP with unidimensional modulation. EPR, two-mode squeezed state; QM, quantum memory; Sqz, squeezer.

Download Full Size | PDF

The secret key rate also can be defined in Eq. (6). The mutual information $I_{AB}$ can be calculated as

$$I_{AB}=\frac{1}{2} \mathrm{log}\frac{V_A}{V_{A|X_B}} =\frac{1}{2}\mathrm{log} \left( \frac{1+T_x(\epsilon_x+V_M)}{1+T_x\epsilon_x} \right) .$$
The Holevo quantity $\chi _{BE}$ is given by
$$\chi_{BE}=G\left(\frac{\lambda_1-1}{2}\right) +G\left(\frac{\lambda_2-1}{2}\right) - G\left(\frac{\lambda_3-1}{2}\right).$$
In particular, $\lambda _{1,2}$ are symplectic eigenvalues of matrix $\gamma _{A_0 B_1}$, calculated as
$$\lambda_{1,2}^2=\frac{1}{2} (A\pm \sqrt{A^2-4B}),$$
with notations
$$A=\mathrm{det}\gamma_{B_2}+\mathrm{det}\gamma_{A_0}+2\mathrm{det} \sigma_{A_0 B_2}, B=\mathrm{det}\Gamma_{A_0 B_2},$$
where $\gamma _{A_0}$, $\gamma _{B_2}$ denote the submatrices of $\Gamma _{A_0 B_2}$, $\sigma _{A_0 B_2}$ is the correlation in $\Gamma _{A_0 B_2}$. Besides, $\lambda _3$ is the symplectic eigenvalue and can be calculated as
$$\lambda_3^2= \mathrm{det} \gamma_{A_0|X_{B_2}},$$
with the notation
$$\gamma_{A_0|X_{B_2}}=\gamma_{A_0} -\sigma_{A_0 B_2}^{\mathrm{T}}(X\gamma_{B_2}X)^{\mathrm{MP}}\sigma_{A_0 B_2}.$$

As mentioned above, Alice modulated the $\widehat {X}$ quadrature while the $\widehat {P}$ quadrature is not, so that the transmittance $T_p$ and excess noise $\epsilon _p$ cannot be estimated during the process of parameter estimation. Even though, the two unknown parameters are still bounded by Heisenberg uncertainty principle, where [40]

$$\Gamma_{A_0 B_2}+i\Omega \geq 0,$$
with the notation
$$\Omega= \mathop{\oplus}_{i=1}^n \left[ \begin{array}{cccc} 0 & 1\\ -1 & 0 \\ \end{array} \right] .$$
Fig. 9 shows the secret key rate changing with the $T_p$ and $\epsilon _p$ with the given parameters $V_M=0.3$, $T_x=0.1$, $\epsilon =0.01$ and $\beta =0.95$. We can see that the plane is divided into secure region and unsecure region. To be specific, secure region denotes that unidimensional modulation can generate positive secret key rate with suitable transmittance $T_p$ and excess noise $\epsilon _p$ against collective attack, while the unsecure region cannot.

 figure: Fig. 9.

Fig. 9. The impact of $T_p$ and $\epsilon _p$ on the positive secret key rate and secure region. Here, we set $V_M=3$, $T_x=0.1$, $\epsilon _x=0.01$ and $\beta =0.95$.

Download Full Size | PDF

As for quantum channel between Alice and Charlie, the state $\rho _{A_0 C_1}$ with variance $V$ can be written as

$$\Gamma_{A_0 C_1}= \left[ \begin{array}{cccc} V & 0 & \sqrt{\frac{V^2-1}{V}} & 0 \\ 0 & V & 0 & -\sqrt{V(V^2-1)} \\ \sqrt{\frac{V^2-1}{V}} & 0 & 1 & 0 \\ 0 & -\sqrt{V(V^2-1)} & 0 & V^2 \end{array} \right] .$$
Here, Alice modulates the $\widehat {P}$ quadrature and does not modulates the $\widehat {X}$ quadrature. Then, Alice sends mode $C_1$ to Charlie through quantum channel, resulting in
$$\Gamma_{A_0 C_2}= \left[\begin{array}{@{}cccc@{}} V & 0 & \sqrt{T_x V_M}(1+V_M)^{-\frac{1}{4}} & 0 \\ 0 & V & 0 & -\sqrt{T_p V_M}(1+V_M)^{\frac{1}{4}} \\ \sqrt{T_x V_M}(1+V_M)^{-\frac{1}{4}} & 0 & 1+T_x\epsilon_x & 0 \\ 0 & -\sqrt{T_p V_M}(1+V_M)^{\frac{1}{4}} & 0 & 1+T_p(V_M+\epsilon_p) \end{array} \right].$$
The method for secret key rate calculation is described above, and for Alice and Charlie will not be repeated here. Without loss of generality, we expect the transmittance and excess noise in $\widehat {X}$ quadrature and $\widehat {P}$ quadrature are symmetric, namely $T_x=T_p$ and $\epsilon _x=\epsilon _p$.

Considering the loss rate $\alpha =0.2$ dB/km, the realistic transmittance are $T_{x,p}=10^{-\alpha L/10}$, where $L$ is the transmission distance. As depicted in Fig. 10, from left to right, the four colors of dotted lines correspond to unidimensional modulation to different variance $V=18,16,14,12$, the green solid line represents Gaussian modulation with variance $V_M=19$, and the black dot-dashed line denotes the PLOB bound. It should be noticed that the unidimensional modulation with $V_M=12$ has a similar performance with Gaussian modulation with $V_M=19$. In other words, the unidimensional modulation is similar to the Gaussian modulation with a relatively large variance. Or more accurately, the secret key rates of unidimensional modulation are lower than Gaussian modulation, since unidimensional modulation utilizes one quanrature to modulate useful information, while Gaussian modulation utilizes both of two quadratures.

 figure: Fig. 10.

Fig. 10. Secret key rate versus channel losses both for unidimensional modulation and Gaussian modulation. The basic parameters are set as $T_x=T_p$, $\epsilon _x=\epsilon _p$ and $\beta =0.95$.

Download Full Size | PDF

3.2.2 Security against repudiation and forgery

In addition to resist collective attacks, the proposed scheme also needs to be secure against repudiation and forgery. In this subsection, we show that the scheme is secure against both repudiation and forgery attacks.

Robustness. Considering the presence of excess noise in the quantum channel, even if all three participants are honest, there will be a signature mismatch rate of $p_{err}$. Based on Hoeffding’s inequalities, the probability that the number of mismatches for Bob or Charlie is above $t_bl/2$ or $t_cl/2$ can be bounded as [41]

$$e_{rob}=2 \mathrm{exp} [-(t_{b,c}-p_{err})^2l],$$
where the parameters satisfy $p_{err}<t_{b,c}$.

Security against repudiation. When Alice performs the repudiation attack, she needs to convince Bob to accept the message while making Charlie reject it. Hence, Alice needs to forge signatures, namely one fake signature $\{\widetilde {QA}_{B_j}\}_{j=1}^l$ for Bob and another fake signature $\{\widetilde {QA}_{C_j}\}_{j=1}^l$ for Charlie, that the number of mismatches is below $t_bl/2$ for each half of Bob’s signature while above $t_cl/2$ one half of Charlie’s signature at least. Consequently, the probability of successful repudiation is defined as

$$e_{rep}=2\mathrm{exp}\left[ -(t_c-t_b)^2 \frac{l}{4} \right] .$$
As mentioned above in Step 4, Bob and Charlie exchange half of the signature elements with each other, which protects the scheme secure against repudiation. In other words, it’s difficult for Alice to fake two signature $\{\widetilde {QA}_{B_j}\}_{j=1}^l$ and $\{\widetilde {QA}_{C_j}\}_{j=1}^l$, that can pass Bob’s test but cannot pass Charlie’s test.

Security against forgery. If there is a dishonest player in the messaging stage, his intention will be to forge message $m'$ and get the other players to accept it. Considering that Bob receives the message and passes it to Charlie, he is the most likely to be a forger. Hence, Bob will induce a mismatch probability $p_e$, and the probability of successful forging is thus given by

$$e_{forg}=2\mathrm{exp}\left[ -(p_e-t_c)^2 l \right] .$$
We can see that the probability $e_{forg}$ decays exponentially with signature length, so that the scheme can be secure against forgery attack.

Signature length. So far, we have discussed three situations, robustness, security against repudiation and security against forgery, and given the corresponding probabilities $e_{rob}$, $e_{rep}$ and $e_{forg}$ for each of them. Assuming that the protocol can fail in any of the above three ways, the probability of failure is equal, we have

$$e_{fail}=e_{rob}=e_{rep}=e_{forg}.$$
Accordingly, the probability of failure is calculated as
$$e_{fail}=2\mathrm{exp}\left[ -(p_e-p_{err})^2 \frac{l}{16} \right] ,$$
and satisfied with $p_{err}\leq t_b \leq t_c \leq p_e$. Eq. (37) decays exponentially with signature length, so that the protocol can be secure by an appropriate length of signature. The derivation of Eq. (33)$\sim$(35) is detailed in Ref. [41] , and we will not derive here.

4. Conclusion

This study proposes a novel CV-QDS protocol, which uses unidimensional modulation in its KGP components. Traditionally, Gaussian modulation is used in KGP along with coherent detection techniques (e.g., heterodyne detection and homodyne detection) in order to measure quantum states. However, both these techniques require additional processes like constant rotation of local oscillator pulse phase and phase modulator, respectively, leading to measurement angular error. In contrast, unidimensional modulation only needs one quadrature modulation, eliminating the need for basis selection. The proposed protocol is tested with a nontrivial set of three participants, namely, Alice, Bob and Charlie. During the distribution stage, Alice creates quantum states and modulates only the $\widehat {X}$ quadrature for the string of states sent to Bob and only the $\widehat {P}$ quadrature for the string sent to Charlie, simplifying the implementation process. Numerical simulations show that this CV-QDS scheme using unidimensional modulation is secure against collective attack, repudiation attack and forgery attack.

Funding

National Key Research and Development Program of China (2021YFF0901300); “20 New Universities" Project of Jinan City (202228077); Major Innovation Projects of the Pilot Project of Science, Education and Industry Integration (2022JBZ01-01); National Natural Science Foundation of China (61872390).

Acknowledgments

We acknowledge the support from the Optoelectronic Information Center of Central South University.

Disclosures

The authors declare no conflicts of interest.

Data availability

Data underlying the results presented in this paper are not publicly available at this time but may be obtained from the authors upon reasonable request.

References

1. P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM Rev. 41(2), 303–332 (1999). [CrossRef]  

2. R. L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Commun. ACM 21(2), 120–126 (1978). [CrossRef]  

3. T. Elgamal, “A public key cryptosystem and a signature scheme based on discrete logarithms,” IEEE Trans. Inf. Theory 31(4), 469–472 (1985). [CrossRef]  

4. D. Gottesman and I. Chuang, “Quantum digital signatures,” arXiv, arXiv:quant-ph/0105032 (2001). [CrossRef]  

5. E. Andersson, M. Curty, and I. Jex, “Experimentally realizable quantum comparison of coherent states and its applications,” Phys. Rev. A 74(2), 022304 (2006). [CrossRef]  

6. P. Wallden, V. Dunjko, A. Kent, and E. Andersson, “Quantum digital signatures with quantum-key-distribution components,” Phys. Rev. A 91(4), 042304 (2015). [CrossRef]  

7. I. V. Puthoor, R. Amiri, P. Wallden, M. Curty, and E. Andersson, “Measurement-device-independent quantum digital signatures,” Phys. Rev. A 94(2), 022328 (2016). [CrossRef]  

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

9. H. J. Ding, X. Y. Zhou, C. H. Zhang, J. Li, and Q. Wang, “Measurement-device-independent quantum key distribution with insecure sources,” Opt. Lett. 47(3), 665 (2022). [CrossRef]  

10. R. Xue, X. Liu, H. Li, L. X. You, Y. D. Huang, and W. Zhang, “Measurement-device-independent quantum key distribution of frequency-nondegenerate photons,” Phys. Rev. Appl. 17(2), 024045 (2022). [CrossRef]  

11. H. L. Yin, Y. Fu, and Z. B. Chen, “Practical quantum digital signature,” Phys. Rev. A 93(3), 032316 (2016). [CrossRef]  

12. R. Amiri, P. Wallden, A. Kent, and E. Andersson, “Secure quantum signatures using insecure quantum channels,” Phys. Rev. A 93(3), 032325 (2016). [CrossRef]  

13. J. M. Arrazola, P. Wallden, and E. Andersson, “Multiparty quantum signature schemes,” Quantum Inf. Comput. 16(5&6), 435–464 (2016). [CrossRef]  

14. H. Weier, H. Krauss, M. Rau, M. Furst, S. Nauerth, and H. Weinfurter, “Quantum eavesdropping without interception: an attack exploiting the dead time of single-photon detectors,” New J. Phys. 13(7), 073024 (2011). [CrossRef]  

15. I. Gerhardt, Q. Liu, A. Lamas-Linares, J. Skaar, C. Kurtsiefer, and V. Makarov, “Full-field implementation of a perfect eavesdropper on a quantum cryptography system,” Nat. Commun. 2(1), 349 (2011). [CrossRef]  

16. P. Jouguet, S. Kunz-Jacques, and E. Diamanti, “Preventing calibration attacks on the local oscillator in continuous-variable quantum key distribution,” Phys. Rev. A 87(6), 062313 (2013). [CrossRef]  

17. J. S. Sidhu, T. Brougham, D. McArthur, R. G. Pousa, and D. K. L. Oi, “Finite key effects in satellite quantum key distribution,” NPJ Quantum Inf. 8(1), 18 (2022). [CrossRef]  

18. C. Zhang, X. L. Hu, C. Jiang, J. P. Chen, Y. Liu, W. J. Zhang, Z. W. Yu, H. Li, L. X. You, Z. Wang, X. B. Wang, Q. Zhang, and J. W. Pan, “Experimental side-channel-secure quantum key distribution,” Phys. Rev. Lett. 128(19), 190503 (2022). [CrossRef]  

19. Y. Y. Feng, J. Zhou, J. Li, W. Zhao, J. J. Shi, and R. H. Shi, “SKC-CCCO: an encryption algorithm for quantum group signature,” Quantum Inf. Process. 21(9), 328 (2022). [CrossRef]  

20. Y. Y. Feng, R. H. Shi, J. J. Shi, W. Zhao, Y. H. Lu, and Y. Z. Tang, “Arbitrated quantum signature protocol with boson sampling-based random unitary encryption,” J. Phys. A - Math. Theor. 53(13), 135301 (2020). [CrossRef]  

21. Y. Y. Feng, R. H. Shi, J. J. Shi, J. Zhou, and Y. Guo, “Arbitrated quantum signature scheme with quantum walk-based teleportation,” Quantum Inf. Process. 18(5), 154 (2019). [CrossRef]  

22. M. Thornton, H. Scott, C. Croal, and N. Korolkova, “Continuous-variable quantum digital signatures over insecure channels,” Phys. Rev. A 99(3), 032341 (2019). [CrossRef]  

23. L. S. Madsen, V. C. Usenko, M. Lassen, R. Filip, and U. L. Andersen, “Continuous variable quantum key distribution with modulated entangled states,” Nat. Commun. 3(1), 1083 (2012). [CrossRef]  

24. S. Sarmiento, S. Etcheverry, J. Aldama, I. H. Lopez, L. T. Vidarte, G. B. Xavier, D. A. Nolan, J. S. Stone, M. J. Li, D. Loeber, and V. Pruneri, “Continuous-variable quantum key distribution over a 15 km multi-core fiber,” New J. Phys. 24(6), 063011 (2022). [CrossRef]  

25. B. H. Wu, Z. S. Zhang, and Q. T. Zhuang, “Continuous-variable quantum repeaters based on bosonic error-correction and teleportation: architecture and applications,” Quantum Science and Technology 7(2), 025018 (2022). [CrossRef]  

26. T. Shen, Y. D. Huang, X. Y. Wang, H. P. Tian, Z. Y. Chen, and S. Yu, “Strengthening practical continuous-variable quantum key distribution against measurement angular error,” Opt. Express 29(20), 30978–30990 (2021). [CrossRef]  

27. W. Q. Liu, J. Y. Peng, J. Qi, Z. W. Cao, and C. He, “Imperfect basis choice in continuous-variable quantum key distribution,” Laser Phys. Lett. 17(5), 055203 (2020). [CrossRef]  

28. V. C. Usenko and F. Grosshans, “Unidimensional continuous-variable quantum key distribution,” Phys. Rev. A 92(6), 062337 (2015). [CrossRef]  

29. P. Wang, X. Y. Wang, J. Q. Li, and Y. M. Li, “Finite-size analysis of unidimensional continuous-variable quantum key distribution under realistic conditions,” Opt. Express 25(23), 27995–28009 (2017). [CrossRef]  

30. V. C. Usenko, “Unidimensional continuous-variable quantum key distribution using squeezed states,” Phys. Rev. A 98(3), 032321 (2018). [CrossRef]  

31. X. Y. Wang, W. Y. Liu, P. Wang, and Y. M. Li, “Experimental study on all-fiber-based unidimensional continuous-variable quantum key distribution,” Phys. Rev. A 95(6), 062330 (2017). [CrossRef]  

32. S. Pirandola, U. L. Andersen, L. Banchi, M. Berta, D. Bunandar, R. Colbeck, D. Englund, T. Gehring, C. Lupo, C. Ottaviani, J. L. Pereira, M. Razavi, J. S. Shaari, M. T omamichel, V. C. Usenko, G. Vallone, P. Villoresi, and P. Wallden, “Advances in quantum cryptography,” Adv. Opt. Photonics 12(4), 1012 (2020). [CrossRef]  

33. X. C. Ruan, H. Zhang, W. Zhao, D. Jin, Z. P. Wang, and Y. Guo, “Orbital angular momentum-encoded quantum digital signature over atmospheric channel,” Quantum Inf. Process. 21(5), 191 (2022). [CrossRef]  

34. W. Zhao, R. H. Shi, J. J. Shi, P. Huang, Y. Guo, and D. Huang, “Multibit quantum digital signature with continuous variables using basis encoding over insecure channels,” Phys. Rev. A 103(1), 012410 (2021). [CrossRef]  

35. G. Ribordy, J. Brendel, J. D. Gautier, N. Gisin, and H. Zbinden, “Long-distance entanglement-based quantum key distribution,” Phys. Rev. A 63(1), 012309 (2000). [CrossRef]  

36. W. Y. Liu, X. Y. Wang, N. Wang, S. N. Du, and Y. M. Li, “Imperfect state preparation in continuous-variable quantum key distribution,” Phys. Rev. A 96(4), 042312 (2017). [CrossRef]  

37. H. Zhang, J. Fang, and G. Q. He, “Improving the performance of the four-state continuous-variable quantum key distribution by using optical amplifiers,” Phys. Rev. A 86(2), 022338 (2012). [CrossRef]  

38. S. Pirandola, R. Laurenza, C. Ottaviani, and L. Banchi, “Fundamental limits of repeaterless quantum communications,” Nat. Commun. 8(1), 15043 (2017). [CrossRef]  

39. A. S. Holevo and R. F. Werner, “Evaluating capacities of bosonic Gaussian channels,” Phys. Rev. A 63(3), 032312 (2001). [CrossRef]  

40. A. Serafini, M. G. A. Paris, F. Illuminati, and S. De Siena, “Quantifying decoherence in continuous variable systems,” J. Opt. B 7(4), R19–R36 (2005). [CrossRef]  

41. C. Croal, C. Peuntinger, B. Heim, I. Khan, C. Marquardt, G. Leuchs, P. Wallden, E. Andersson, and N. Korolkova, “Free-space quantum signatures using heterodyne measurements,” Phys. Rev. Lett. 117(10), 100503 (2016). [CrossRef]  

Data availability

Data underlying the results presented in this paper are not publicly available at this time but may be obtained from the authors upon reasonable request.

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 (10)

Fig. 1.
Fig. 1. The entanglement-based model of the CV-KGP. (a) Heterodyne detetcion. (b) Homodyne detection. EPR, two-mode squeezed vacuum state; QM, quantum memory; PS, phases shift; BC, basis choice; RNG, random numbers generator.
Fig. 2.
Fig. 2. Three modulation modes of quantum states. (a) Gaussian modulation. (b) Unidimensional modulation with $\widehat {X}$ quadrature. (c) Unidimensional modulation with $\widehat {P}$ quadrature.
Fig. 3.
Fig. 3. The secret key rate as a function of the transmission distance for (a) heterodyne detection and (b) homodyne detection, with different measurement angular error $\theta$. Other parameters are set as $V=20$, $\beta =0.95$ and $\epsilon =0.01$.
Fig. 4.
Fig. 4. The maximum transmission distance as a function of measurement angular error $\theta$ for (a) heterodyne detection and (b) homodyne detection, with different excess noise $\epsilon$. Other parameters are set as $V=20$ and $\beta =0.95$.
Fig. 5.
Fig. 5. The secret key rate as a function of the modulation variance for (a) heterodyne detection and (b) homodyne detection. Transmission distance $L$ are set to 10 km and 20 km. Other parameter is set as $\beta =0.95$, and SUN represents the shot noise variance.
Fig. 6.
Fig. 6. Secret key rate versus measurement angular error $\theta$ and modulation variance $V$ at the transmission distance of 10km for (a) heterodyne detection and (b) homodyne detection.
Fig. 7.
Fig. 7. The CV-QDS protocol. Solid lines, dot-dashed lines and dashed line are denotes the quantum channels, public classical channels and encrypted classical channel, respectively.
Fig. 8.
Fig. 8. The entanglement-based model for CV-KGP with unidimensional modulation. EPR, two-mode squeezed state; QM, quantum memory; Sqz, squeezer.
Fig. 9.
Fig. 9. The impact of $T_p$ and $\epsilon _p$ on the positive secret key rate and secure region. Here, we set $V_M=3$, $T_x=0.1$, $\epsilon _x=0.01$ and $\beta =0.95$.
Fig. 10.
Fig. 10. Secret key rate versus channel losses both for unidimensional modulation and Gaussian modulation. The basic parameters are set as $T_x=T_p$, $\epsilon _x=\epsilon _p$ and $\beta =0.95$.

Equations (37)

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

Γ A 0 B 1 = [ V I 2 T ( V 2 1 ) Z T ( V 2 1 ) Z ( T V + ( 1 T ) ω ) I 2 ] ,
Γ A 0 B 2 B 3 = M b s ( Γ A 0 B 1 I 2 ) M b s T ,
M b s = [ I 0 0 0 1 2 I 1 2 I 0 1 2 I 1 2 I ] .
Γ A 0 B 2 B 4 = M p s Γ A 0 B 2 B 3 M p s T ,
M p s = [ I 0 0 0 c o s θ s i n θ 0 s i n θ c o s θ ] ,
K = β I A B χ B E ,
I A B = 1 2 l o g 2 V A X ^ V A | B X ^ + 1 2 l o g 2 V A P ^ V A | B P ^ ,
χ B E = G ( λ 1 1 2 ) + G ( λ 2 1 2 ) G ( λ 3 1 2 ) ,
G ( x ) = ( x + 1 ) l o g ( x + 1 ) x l o g x .
Γ A B 2 | B 4 p = Γ A B 2 σ A B 2 B 4 ( X 1 Γ B 4 X 1 ) M P σ A B 2 B 4 T ,
Γ A | B 2 x B 4 p = Γ A | B 4 p σ A B 2 ( X 2 Γ B 2 X 2 ) M P σ A B 2 T ,
ϕ = π v m v π ,
ϕ = | L G | 1 + | L G | v m v π π .
T = T [ E ( s i n ϕ ) ] 2 , ϵ = ( T T ) ( V 1 ) + T ϵ T .
Γ A 0 B 2 = [ V I 2 T ( V 2 1 ) Z T ( V 2 1 ) Z ( T ( V + χ l i n e ) ) I 2 ] ,
I A B = 1 2 l o g 2 γ B γ B | A ,
γ B | A = γ B 2 σ A 0 B 2 ( X 1 γ A 0 X 1 ) M P σ A 0 B 2 T ,
χ B E = i = 1 2 G ( λ i 1 2 ) i = 3 5 G ( λ i 1 2 ) ,
λ 1 , 2 2 = 1 2 ( A ± A 2 4 B ) , λ 3 , 4 2 = 1 2 ( C ± C 2 4 D ) , λ 5 = 1 ,
A = V 2 + T 2 ( V + χ l i n e ) 2 T ( V 2 1 ) , B = T 2 ( V χ l i n e + 1 ) 2 , C = A χ h + V B + T ( V + χ l i n e ) T ( V + χ t o t ) , D = B ( V + B χ h ) T ( V + χ t o t ) ,
Γ A 0 B 1 = [ V 0 V ( V 2 1 ) 0 0 V 0 V 2 1 V V ( V 2 1 ) 0 V 2 0 0 V 2 1 V 0 1 ] .
Γ A 0 B 2 = [ V 0 T x V M ( 1 + V M ) 1 4 0 0 V 0 T p V M ( 1 + V M ) 1 4 T x V M ( 1 + V M ) 1 4 0 1 + T x ( V M + ϵ x ) 0 0 T p V M ( 1 + V M ) 1 4 0 1 + T x ϵ p ] ,
I A B = 1 2 l o g V A V A | X B = 1 2 l o g ( 1 + T x ( ϵ x + V M ) 1 + T x ϵ x ) .
χ B E = G ( λ 1 1 2 ) + G ( λ 2 1 2 ) G ( λ 3 1 2 ) .
λ 1 , 2 2 = 1 2 ( A ± A 2 4 B ) ,
A = d e t γ B 2 + d e t γ A 0 + 2 d e t σ A 0 B 2 , B = d e t Γ A 0 B 2 ,
λ 3 2 = d e t γ A 0 | X B 2 ,
γ A 0 | X B 2 = γ A 0 σ A 0 B 2 T ( X γ B 2 X ) M P σ A 0 B 2 .
Γ A 0 B 2 + i Ω 0 ,
Ω = i = 1 n [ 0 1 1 0 ] .
Γ A 0 C 1 = [ V 0 V 2 1 V 0 0 V 0 V ( V 2 1 ) V 2 1 V 0 1 0 0 V ( V 2 1 ) 0 V 2 ] .
Γ A 0 C 2 = [ V 0 T x V M ( 1 + V M ) 1 4 0 0 V 0 T p V M ( 1 + V M ) 1 4 T x V M ( 1 + V M ) 1 4 0 1 + T x ϵ x 0 0 T p V M ( 1 + V M ) 1 4 0 1 + T p ( V M + ϵ p ) ] .
e r o b = 2 e x p [ ( t b , c p e r r ) 2 l ] ,
e r e p = 2 e x p [ ( t c t b ) 2 l 4 ] .
e f o r g = 2 e x p [ ( p e t c ) 2 l ] .
e f a i l = e r o b = e r e p = e f o r g .
e f a i l = 2 e x p [ ( p e p e r r ) 2 l 16 ] ,
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.