This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Key rates for quantum key distribution protocols with asymmetric noise

Gláucia Murta QuTech, Delft University of Technology, Lorentzweg 1, 2628 CJ Delft, The Netherlands Institut für Theoretische Physik III, Heinrich-Heine-Universität Düsseldorf, Universitätsstraße 1, D-40225 Düsseldorf, Germany    Filip Rozpędek QuTech, Delft University of Technology, Lorentzweg 1, 2628 CJ Delft, The Netherlands Kavli Institute of Nanoscience, Delft University of Technology, Lorentzweg 1, 2628 CJ Delft, The Netherlands    Jérémy Ribeiro QuTech, Delft University of Technology, Lorentzweg 1, 2628 CJ Delft, The Netherlands Kavli Institute of Nanoscience, Delft University of Technology, Lorentzweg 1, 2628 CJ Delft, The Netherlands    David Elkouss QuTech, Delft University of Technology, Lorentzweg 1, 2628 CJ Delft, The Netherlands    Stephanie Wehner QuTech, Delft University of Technology, Lorentzweg 1, 2628 CJ Delft, The Netherlands Kavli Institute of Nanoscience, Delft University of Technology, Lorentzweg 1, 2628 CJ Delft, The Netherlands
Abstract

We consider the asymptotic key rates achieved in the simplest quantum key distribution protocols, namely the BB84 and the six-state protocols, when non-uniform noise is present in the system. We first observe that higher qubit error rates do not necessarily imply lower key rates. Secondly, we consider protocols with advantage distillation and show that it can be advantageous to use the basis with higher quantum bit error rate for the key generation. We then discuss the relation between advantage distillation and entanglement distillation protocols. We show that applying advantage distillation to a string of bits formed by the outcomes of measurements in the basis with higher quantum bit error rate is closely connected to the two-to-one entanglement distillation protocol DEJMPS DEJMPS . Finally, we discuss the implications of these results for implementations of quantum key distribution.

I Introduction

Quantum key distribution (QKD) BB84 ; E91 is one of the most remarkable examples of the power of quantum mechanics. Many classical crypto-systems used for secure communication nowadays are based on computational assumptions. Computational assumptions make these systems vulnerable to retroactive attacks in case more powerful quantum computers become available in the future. In contrast, quantum mechanics allows two parties to distribute a key achieving information-theoretic security. This means that security is guaranteed even against an eavesdropper that has unlimited classical and quantum resources. Secure communication can then be achieved if this key is used in a one-time pad scheme Vernam26 ; Shannon49 (for a discussion about the assumptions present in a QKD implementation, see LCT14 ).

Near term quantum technologies suffer from imperfections. Therefore, even in the absence of an active eavesdropper, a QKD implementation will be subjected to a finite amount of noise. In order to guarantee security, one is interested in designing protocols that can tolerate levels of noise compatible with current technology and at the same time achieve the highest possible key rates.

The simplest proposed QKD protocol, BB84 BB84 , is based on the conjugate coding ideas developed by Wiesner in Wiesner83 . In the BB84, Alice prepares a single qubit state in one of the eigenstates of the Z-basis, {|0,|1}\left\{\left|0\right\rangle,\left|1\right\rangle\right\}, or one of the eigenstates of the X-basis, {|+,|}\left\{\left|+\right\rangle,\left|-\right\rangle\right\}. An extension of the BB84, exploring three conjugate bases, was proposed in 6state and is called the six-state protocol. In the six-state protocol, Alice can also prepare the qubit in one of the eigenstates of the Y-basis, {|+Y=12(|0+i|1),|Y12(|0i|1)}\left\{\left|+_{Y}\right\rangle=\frac{1}{\sqrt{2}}(\left|0\right\rangle+i\left|1\right\rangle),\left|-_{Y}\right\rangle\frac{1}{\sqrt{2}}(\left|0\right\rangle-i\left|1\right\rangle)\right\}. The six-state protocol was proven to be more robust to noise 6state . Intuitively, this is due to the fact that more parameters are characterized during the protocol, therefore restricting the possible actions of a potential eavesdropper.

In this article, we consider the asymptotic key rates that can be obtained in the BB84 and six-state protocols as a function of the quantum bit error rates (QBERs). We first consider instances of these protocols in which information reconciliation and privacy amplification are applied directly to the raw keys formed by the outcomes of Alice’s and Bob’s measurements. Then, we consider the case when, additionally, a sub-routine that allows Alice and Bob to select more correlated parts of their string, namely advantage distillation, is applied to the raw keys before information reconciliation. We discuss observed counter-intuitive behaviors of the asymptotic key rates with the QBER. As our main result, we show that in the presence of asymmetric noise, higher key rates may be obtained if the basis with higher QBER is used for the key generation in protocols with advantage distillation. This can have a direct impact for implementations that make use of advantage distillation rozpkedek2018near . Finally, we show that implementing the six-state protocol with advantage distillation and measurements in the basis with higher QBER, is closely connected to the two-to-one entanglement distillation protocol DEJMPS DEJMPS .

The manuscript is organized as following: in the remainder of this section we detail the general structure of the QKD protocols under consideration. In Section II, we first consider the asymptotic key rates of the BB84 and the six-state protocols without advantage distillation. We then proceed to analyze the effect of advantage distillation and show interesting behaviors of the key rates as a function of the QBERs. In Section III, we discuss the relation of QKD and entanglement distillation protocols. Finally, in Section IV, we discuss the implications of our results to experimental implementations.

I.1 Quantum Key Distribution protocols

For an implementation of the BB84 or six-state protocols, the only required resources are the preparation, transmission and measurement of single-qubit states. That is, these protocols can be implemented in a prepare-and-measure set-up without the need of entanglement. However, both protocols have an equivalent entanglement-based implementation E91 ; BBM92 , in which a source (that may be in Alice’s lab) produces a state that is distributed to Alice and Bob (ideally the maximally entangled state, |Φ+=12(|00+|11)\left|\Phi^{+}\right\rangle=\frac{1}{\sqrt{2}}(\left|00\right\rangle+\left|11\right\rangle)). Then, upon receiving their systems, Alice and Bob perform measurements in randomly chosen bases (having two choices of basis for the BB84, and three for the six-state protocol). As long as the measurement devices are well characterized and controlled, an entanglement-based implementation allows one to relax the need for a precise characterization of the state preparation. The entanglement-based version of the BB84 and six-state protocols played a key role to formalize their security proofs SP00 ; Lo01 ; RennerThesis . From now on, for the purpose of our analyses, we focus on the entanglement-based version of these protocols. However we remark that for all our results, there is an equivalent implementation that requires only single-qubit states preparation.

The BB84 and the six-state protocols can be described by four main steps:

  1. 1.

    Distribution and measurements: Alice uses the source to produce a two-qubit state. She keeps one qubit and sends the other to Bob using a quantum channel. Upon receiving the systems, Alice and Bob, each randomly chooses a basis and performs the corresponding measurement. They repeat this procedure NN times. With the outcomes of their measurements they establish a string of NN bits each.

  2. 2.

    Sifting and parameter estimation: Alice and Bob communicate the measurement bases and discard the rounds in which different bases were used. Moreover, they sacrifice mm bits in order to estimate their average correlation and decide whether to abort or proceed with the protocol. If the protocol does not abort, the remaining nn bits constitute the raw key.

  3. 3.

    Advantage distillation (optional): The goal is to classically post-process the raw key, in order to increase the correlation between Alice and Bob, and get an advantage over the eavesdropper.

  4. 4.

    Information reconciliation and privacy amplification: In this step, Alice and Bob first implement an information reconciliation protocol that allows Bob to correct his bit-string for errors. Finally, they apply a privacy amplification protocol to transform a partially secure key of nn bits into a secure key of l<nl<n bits.

The parameters estimated in Step 2 are determined by the particular protocol. In an implementation of the BB84 protocol, Alice and Bob can estimate the values of the quantum bit error rates (QBERs) in the XX and ZZ bases, QXQ_{X} and QZQ_{Z}. For the six-state protocol, they will also have an estimate of the QBER in the YY-basis, QYQ_{Y}. The QBER in the ZZ(XX)-basis, QZ(QX)Q_{Z}(Q_{X}), is the probability that Alice and Bob get different outcomes when they both measure their systems in the basis ZZ(XX). The QBER in the YY-basis is defined in a similar way, however, since the target state |Φ+\left|\Phi^{+}\right\rangle exhibits anti-correlation in the YY-basis, Bob flips his outcomes whenever he chooses to measure in the YY-basis.

In the originally proposed BB84 and six-state protocols, all the bases were chosen with equal probability among the set of bases specified by the protocols. However, as shown in LCA05 , the efficiency of these protocols can be increased, without compromising security, if one of the bases is chosen with a higher probability. Then, in the asymptotic limit, the preferred basis is used almost all the time. The remaining bases are used only occasionally in order to test for the eavesdropper. This significantly increases the key rates, as only a small fraction of the rounds are discarded in the sifting process. In these protocols, the raw key is usually created from the rounds in which the preferred basis is used. The remaining rounds, in which other bases were chosen, are used for parameter estimation. For this reason, we denote the basis chosen with higher probability as the key generation basis.

Advantage distillation, in Step 3, is an optional step. It consists of Alice and Bob using two-way classical communication to select parts of the raw key that exhibit stronger correlation. This method was introduced in the context of classical protocols Mau93 and was proven to be useful for quantum protocols as well GL03 ; KBR07 . Usually, advantage distillation leads to significant drops in the key rate for the low noise regime, but it can considerably increase the noise tolerance of a protocol. For example, a BB84 implementation subjected to depolarizing noise (in which QX=QZQ_{X}=Q_{Z}) without advantage distillation can tolerate up to 11%11\% of QBER. If some advantage distillation is performed, the noise tolerance can be increased to 20%20\% QBER GL03 . Advantage distillation protocols that have better performance in the low noise regime were also proposed Watanabe .

Information reconciliation, in Step 4, aims at correcting Bob’s string in order to make it equal to Alice’s string. Information reconciliation can be implemented using only one-way communication from Alice to Bob. Interactive protocols BS94 , which are efficient to implement, are broadly used in QKD implementations cascadeApp . These protocols require two-way communication, however, they should not be confused with advantage distillation performed in Step 3. In advantage distillation, two-way communication is essential and, moreover, both Alice’s and Bob’s strings are modified during the protocol.

II Results

II.1 Key rates for protocols without advantage distillation

We first consider the BB84 and the six-state protocols when Alice and Bob skip Step 3. After measuring their quantum systems, Alice and Bob proceed to perform information reconciliation and privacy amplification. Information reconciliation protocols based on two-universal hashing functions leak the minimum amount of information necessary to correct for errors in Bob’s string BS94 . In RW05 , it was proven that the minimum leakage of a one-way information reconciliation protocol is given by nH(A|B)+𝒪(n)nH(A|B)+\mathcal{O}(\sqrt{n}), where H(A|B)H(A|B) is the entropy of Alice’s output conditioned on Bob’s output, defined as H(A|B)=a,bp(A=a,B=b)logp(A=a|B=b)H(A|B)=-\sum_{a,b}p(A=a,B=b)\log p(A=a|B=b) with p(A=a,B=b)p(A=a,B=b) being the probability that Alice and Bob obtain outcomes aa and bb, respectively, for the measurement in consideration, p(A=a|B=b)=p(A=a,B=b)p(B=b)p(A=a|B=b)=\frac{p(A=a,B=b)}{p(B=b)} is the conditional probability, and the logarithms are taken in basis 2.

In order to analyze the key rate of the BB84 and the six-state protocol we can assume w.l.o.g. that the state distributed by the source is a Bell-diagonal state RennerThesis :

ρ=λ00Φ00+λ01Φ01+λ10Φ10+λ11Φ11,\displaystyle\rho=\lambda_{00}\Phi_{00}+\lambda_{01}\Phi_{01}+\lambda_{10}\Phi_{10}+\lambda_{11}\Phi_{11}, (1)

where Φij=|ΦijΦij|\Phi_{ij}=\left|\Phi_{ij}\middle\rangle\middle\langle\Phi_{ij}\right| and |Φij=XiZjI|Φ+\left|\Phi_{ij}\right\rangle=X^{i}Z^{j}\otimes I\left|\Phi^{+}\right\rangle. Restricting the analysis to Bell-diagonal states is sufficiently general because for all states ρ\rho^{\prime} such that λij=Φij|ρ|Φij\lambda_{ij}=\left\langle\Phi_{ij}\right|\rho^{\prime}\left|\Phi_{ij}\right\rangle, the corresponding Bell-diagonal state exhibits the same QBERs as the original state and leads to the lowest key rate RennerThesis .

For the security analysis, it is also assumed that the measurements are perfect and all the noise can be mapped into the distributed state. In this case, the Bell coefficients {λij}\left\{\lambda_{ij}\right\} relate to the QBERs QXQ_{X}, QYQ_{Y}, and QZQ_{Z} by the following:

λ00=1(QX+QY+QZ)2,λ01=QX+QYQZ2,λ10=QX+QY+QZ2,λ11=QXQY+QZ2.\displaystyle\begin{split}\lambda_{00}&=1-\frac{(Q_{X}+Q_{Y}+Q_{Z})}{2},\\ \lambda_{01}&=\frac{Q_{X}+Q_{Y}-Q_{Z}}{2},\\ \lambda_{10}&=\frac{-Q_{X}+Q_{Y}+Q_{Z}}{2},\\ \lambda_{11}&=\frac{Q_{X}-Q_{Y}+Q_{Z}}{2}.\end{split} (2)

Note that a Bell-diagonal state is completely characterized by the three QBERs (QX,QY,QZ)(Q_{X},Q_{Y},Q_{Z}).

The key rates for the BB84 and the six-state protocols can be determined as a function of the coefficients of the estimated Bell-diagonal state, and therefore as a function of the QBERs. In a real implementation, in which a finite number of rounds is considered, statistical effects play a role in the value of the key rate. However, for a sufficiently large number of rounds, the key rate of the six-state protocol, with ZZ being the key generation basis, approaches the asymptotic value given by Lo01 ; KGN05 ; RennerThesis :

R6state=1H({λij}),\displaystyle R_{\rm 6state}=1-H(\left\{\lambda_{ij}\right\}), (3)

where H({λij})=ijλijlogλijH(\left\{\lambda_{ij}\right\})=\sum_{ij}-\lambda_{ij}\log\lambda_{ij}, and the logarithms are taken in basis 2.

For BB84, since information about QYQ_{Y} is not available, the key rate is given by the minimum over all possible values of QYQ_{Y}. This results in SP00 ; KGN05 ; RennerThesis :

RBB84=1h(QX)h(QZ),\displaystyle R_{\rm BB84}=1-h(Q_{X})-h(Q_{Z}), (4)

where h(x)=xlogx(1x)log(1x)h(x)=-x\log x-(1-x)\log(1-x) is the binary entropy.

If one of the other available bases is used for the key generation, the corresponding key rate can be obtained by simply permuting the QBERs in expressions (3) and (4). Note that choosing the basis for key generation implies a choice of protocol. Once the key generation basis is fixed, Alice and Bob can run the protocol using this basis for almost all the rounds. The key rate now depends on the information available to the eavesdropper when the estimated state, given in eq. (1), is measured in the chosen key generation basis. A measurement in the XX-basis, or the YY-basis, performed on the estimated state, eq. (1), can be seen as a ZZ-basis measurement performed on a rotated state. The corresponding rotated state for when the XX-basis, or the YY-basis, is used for the key generation measurement relates to eq. (1) by a permutation of the coefficients {λij}\left\{\lambda_{ij}\right\}. Eqs. (3) and (4) are invariant under permutation of the QBERs. Therefore, the resulting key rate for protocols that use information reconciliation with minimum leakage is the same regardless of which of the available bases, {X,Z}\left\{X,Z\right\} for BB84 and {X,Y,Z}\left\{X,Y,Z\right\} for six-state, is chosen for the key generation rounds. This is stated in Proposition 1.

Proposition 1.

In an implementation of the BB84 or the six-state protocol in which an information reconciliation protocol with minimum leakage is used, the asymptotic key rate does not depend on which of the available bases is chosen as the key generation basis.

Remark: It is important to remark that Proposition 1 takes into account that information reconciliation is performed using a protocol with minimum leakage. The minimum leakage is asymptotically given by h(QM)h(Q_{M}), where MM is the basis used for the key generation rounds, M{X,Z}M\in\left\{X,Z\right\} for BB84 and M{X,Y,Z}M\in\left\{X,Y,Z\right\} for the six-state protocol. Information reconciliation protocols with minimum leakage cannot be implemented in practice, and protocols that have higher leakage are used instead. There exist efficient information reconciliation protocols with asymptotic leakage given by fh(QM)f\cdot h(Q_{M}), where f1.2f\leq 1.2 vDK97 ; ELAB09 ; TMPE17 . The use of a sub-optimal information reconciliation protocol creates an asymmetry of the QBERs in the key rate, and in this case, in order to maximize the key, it is advantageous to choose the basis with the lowest QBER for the key generation rounds.

Now we state an interesting fact regarding the key rates of the six-states protocol when an information reconciliation protocol with minimum leakage is used.

Observation 1.

For fixed values of QXQ_{X} and QZQ_{Z}, the key rate is not a monotonically decreasing function of QYQ_{Y}.

Proof.

If we fix the values of QXQ_{X} and QZQ_{Z}, in order to ensure positivity of the corresponding Bell-diagonal state, the possible values of QYQ_{Y} are in the range

|QXQZ|QYQX+QZ.\displaystyle|Q_{X}-Q_{Z}|\leq Q_{Y}\leq Q_{X}+Q_{Z}. (5)

Additionally, we require that QX+QY+QZ<1Q_{X}+Q_{Y}+Q_{Z}<1 in order to have an entangled state. One can see this by inspecting eq. (2).

Now, evaluating the derivative of the key rate, eq. (3), with respect to QYQ_{Y}, we conclude that the minimum occurs for

QY=QX+QZ2QXQZ,\displaystyle Q_{Y}^{*}=Q_{X}+Q_{Z}-2Q_{X}Q_{Z}, (6)

which can be strictly smaller than the maximum attainable value for QYQ_{Y}. ∎

Observation 1 is illustrated in Figure 1 for the family of Bell-diagonal states (QX=0.1,QY,QZ=0.1)(Q_{X}=0.1,Q_{Y},Q_{Z}=0.1).

Refer to caption
Figure 1: Asymptotic key rate of the six-state protocol with minimum leakage information reconciliation as a function of the QBER in the YY-basis, QYQ_{Y}, for the family of Bell-diagonal states with QX=QZ=0.1Q_{X}=Q_{Z}=0.1.

Note that the minimum of the curve in Figure 1 gives the key rate for the BB84 protocol when QX=QZ=0.1Q_{X}=Q_{Z}=0.1.

Observation 1 together with the continuity of the key rate for the six-state protocol implies the following corollary.

Corollary 1.

There exist a state ρ(1)\rho^{(1)} with QBERs (QX(1),QY(1),QZ(1))(Q_{X}^{(1)},Q_{Y}^{(1)},Q_{Z}^{(1)}) and a state ρ(2)\rho^{(2)} with QBERs (QX(2),QY(2),QZ(2))(Q_{X}^{(2)},Q_{Y}^{(2)},Q_{Z}^{(2)}) such that

QX(1)>QX(2),QY(1)>QY(2),QZ(1)>QZ(2)\displaystyle Q_{X}^{(1)}>Q_{X}^{(2)}\;,\;Q_{Y}^{(1)}>Q_{Y}^{(2)}\;,\;Q_{Z}^{(1)}>Q_{Z}^{(2)}

and

R6state(ρ(1))>R6state(ρ(2)).\displaystyle R_{\rm 6state}(\rho^{(1)})>R_{\rm 6state}(\rho^{(2)}).

As an example of Corollary 1, take ρ(1)\rho^{(1)} to be the state with QBERs QX(1)=QZ(1)=10%Q_{X}^{(1)}=Q_{Z}^{(1)}=10\% and QY(1)=20%Q_{Y}^{(1)}=20\%, and ρ(2)\rho^{(2)} to be the state with QX(2)=QZ(2)=9.8%Q_{X}^{(2)}=Q_{Z}^{(2)}=9.8\% and QY(2)=18%Q_{Y}^{(2)}=18\%. It holds that R6state(ρ(1))>R6state(ρ(2))R_{\rm 6state}(\rho^{(1)})>R_{\rm 6state}(\rho^{(2)}).

We now investigate the behavior of the singlet fidelity and the entanglement of formation BDSW96 for the family of states considered in Figure 1.

For an entangled Bell-diagonal state ρ\rho, eq. (1), with λ00>12\lambda_{00}>\frac{1}{2}, the entanglement of formation BDSW96 , EoFEoF, is given by

EoF(ρ)\displaystyle EoF(\rho) =h(12+λ00(1λ00)),\displaystyle=h\left(\frac{1}{2}+\sqrt{\lambda_{00}(1-\lambda_{00})}\right), (7)

and the singlet fidelity FF is

F(ρ)\displaystyle F(\rho) =λ00.\displaystyle=\lambda_{00}. (8)

Figure 2 illustrates that both quantities are monotonically decreasing functions of QYQ_{Y}. This supports the intuition that a state with higher QBER is less close to the ideal state. However, as stated in Observation 1 - see also Figure 1, this monotonic behavior is not always observed in the key rates of the six-state protocol.

Refer to caption
(a)
Refer to caption
(b)
Figure 2: Singlet fidelity (a) and entanglement of formation (b) for the family of Bell-diagonal state specified by QBERs (0.1,QY,0.1)(0.1,Q_{Y},0.1). Both quantities decrease monotonically as QYQ_{Y} increases, in the range of possible values of QYQ_{Y}, 0QY0.20\leq Q_{Y}\leq 0.2.

II.2 Key rates for protocols with advantage distillation

We now consider the BB84 and the six-state protocols when advantage distillation is employed in Step 3. In particular, we consider the following advantage distillation protocol BA07 ; KBR07 ; RennerThesis :

Protocol I: Advantage Distillation

1:Let {a1,,an}\left\{a_{1},\ldots,a_{n}\right\} and {b1,,bn}\left\{b_{1},\ldots,b_{n}\right\} be strings of bits held by Alice and Bob, respectively.
2:Alice and Bob divide their strings in blocks of two consecutive bits.
3:for each block jj of size 2 do
4:     Alice chooses a random bit r{0,1}r\in\left\{0,1\right\} and publicly communicates (cj1,cj2):=(aj1r,aj2r)(c_{j_{1}},c_{j_{2}}):=(a_{j_{1}}\oplus r,a_{j_{2}}\oplus r) to Bob.
5:     Bob checks whether (bj1cj1,bj2cj2){0,1}(b_{j_{1}}\oplus c_{j_{1}},b_{j_{2}}\oplus c_{j_{2}})\in\left\{\vec{0},\vec{1}\right\}. If that is the case he accepts, acc=1acc=1, else he sets acc=0acc=0.
6:     Bob communicates accacc to Alice.
7:     If acc=1acc=1 Alice keeps aj1a_{j_{1}} and Bob keeps bj1b_{j_{1}} for their raw key. Else they discard the two bits of the block.
8:end for

The key rates for BB84 and six-state protocol with advantage distillation, Protocol I, were derived in KBR07 ; RennerThesis . For the six-state protocol, the key rate is given by

R6stateAD=12psuccAD(1H({λ~ij})),\displaystyle R_{\rm 6state}^{{AD}}=\frac{1}{2}p_{\rm succ}^{AD}(1-H(\{\tilde{\lambda}_{ij}\})), (9)

where psuccADp_{\rm succ}^{AD} is the probability that Protocol I succeeds, i.e that Alice and Bob do not discard a block. This occurs if either the two bits of Alice and Bob are equal or if both bits in the block are flipped. Note that steps 3 and 4 of Protocol I check whether the pair of bits of Alice and the pair of bits of Bob have the same parity. If the raw key is generated by measurements in the ZZ-basis, then

psuccAD\displaystyle p_{\rm succ}^{AD} =(λ00+λ01)2+(λ10+λ11)2\displaystyle=(\lambda_{00}+\lambda_{01})^{2}+(\lambda_{10}+\lambda_{11})^{2} (10)
=QZ2+(1QZ)2.\displaystyle=Q_{Z}^{2}+(1-Q_{Z})^{2}.

And the coefficients {λ~ij}\left\{\tilde{\lambda}_{ij}\right\} are given by

λ~00=(λ00+λ01)2+(λ00λ01)22psuccAD,λ~01=(λ00+λ01)2(λ00λ01)22psuccAD,λ~10=(λ10+λ11)2+(λ10λ11)22psuccAD,λ~11=(λ10+λ11)2(λ10λ11)22psuccAD.\displaystyle\begin{split}\tilde{\lambda}_{00}&=\frac{(\lambda_{00}+\lambda_{01})^{2}+(\lambda_{00}-\lambda_{01})^{2}}{2p_{\rm succ}^{AD}},\\ \tilde{\lambda}_{01}&=\frac{(\lambda_{00}+\lambda_{01})^{2}-(\lambda_{00}-\lambda_{01})^{2}}{2p_{\rm succ}^{AD}},\\ \tilde{\lambda}_{10}&=\frac{(\lambda_{10}+\lambda_{11})^{2}+(\lambda_{10}-\lambda_{11})^{2}}{2p_{\rm succ}^{AD}},\\ \tilde{\lambda}_{11}&=\frac{(\lambda_{10}+\lambda_{11})^{2}-(\lambda_{10}-\lambda_{11})^{2}}{2p_{\rm succ}^{AD}}.\end{split} (11)

where {λij}\left\{\lambda_{ij}\right\} relate to the QBERs by eq. (2).

In KBR07 ; RennerThesis it was shown that applying advantage distillation, Protocol I, has the same effect as if Alice and Bob would apply a quantum operation that brings two copies of a Bell-diagonal state with coefficients {λij}\left\{\lambda_{ij}\right\} into one copy of a Bell-diagonal state with coefficients {λ~ij}\left\{\tilde{\lambda}_{ij}\right\} and then perform the measurement in this final state. This operation succeeds with probability psuccADp_{\rm succ}^{AD}. We will see, in Section III, that the corresponding quantum operation is the application of bi-local CNOT gates (i.e. Alice applies a CNOT to her two subsystems, and Bob does the same to his subsystems), followed by measurements of the target qubits and post-selection of the results.

The key rate for the BB84 protocol is obtained by taking the minimum of eq. (9) over all possible values of QYQ_{Y}.

Note that, for protocols with advantage distillation, the key rate, eq. (9), is not symmetric over permutation of the QBERs. Therefore, choosing a different basis (among the set of available bases) for key generation may lead to different key rates. We now state a curious observation about QKD protocols in which advantage distillation, given by Protocol I, is performed.

Observation 2.

In an implementation of the BB84 or the six-state protocol in which advantage distillation, given by Protocol I, is performed, higher key rates may be obtained if the basis with higher QBER is used for the key generation rounds.

Refer to caption
Figure 3: (Color online) Key rates for the six-state protocol with advantage distillation, given by Protocol I, for the family of states QX=QZ=0.1Q_{X}=Q_{Z}=0.1. Blue (dark gray) curve shows the key rate when the ZZ-basis is used for key generation, and the yellow (light gray) curve when the YY-basis is used for key generation.

Figure 3 illustrates Observation 2 for the family of states QX=QZ=0.1Q_{X}=Q_{Z}=0.1 considered in the previous section. In comparison with Figure 1, we note that, for lower values of QYQ_{Y}, higher rates are obtained when no advantage distillation is performed. However, as QYQ_{Y} increases, an advantage is obtained with the use of advantage distillation and, specially, if the basis with higher QBER is used for the key generation rounds. Note also that, similar to Observation 1, an increase in the key rate with QYQ_{Y} for high values of QYQ_{Y} is also observed for the key generated with measurements in the YY-basis.

In order to explore Observation 2 in more detail, we have performed an extensive numerical check over the range of possible values of QBERs (QX,QY,QZ)(Q_{X},Q_{Y},Q_{Z}). For the BB84 protocol, Figure 4 illustrates that, for almost all the values of QXQ_{X} and QZQ_{Z} that lead to positive key, the highest asymptotic key rate is obtained when the key generation basis is the one with higher QBER. This behavior inverts only for a small range of parameters, next to the limiting region where positive key can no longer be obtained. It is interesting to note that the success probability of the advantage distillation protocol, given in eq. (10), is a monotonically decreasing function of the QBER of the key generation basis. However, even with the contribution of this factor to the key rate, see eq. (9), Figure 4 shows that it is typically advantageous to use the basis with higher QBER for the key generation rounds.

Refer to caption
Figure 4: (Color online) Comparison of the key rates for the BB84 protocol with advantage distillation given by Protocol I when the XX and the ZZ basis are used for the key generation. The blue (dark gray) dots represent the parameters for which higher key rates are achieved when ZZ is the key generation basis. The yellow (light gray) dots represent the case when higher rates are achieved if XX is used for key generation. One can observe that, for almost all the range of parameters, higher rates are obtained when the basis with higher QBER is used for key generation. This behavior only inverts for a small range of parameters, near the limiting region where positive key can no longer be extracted.

For the six-state protocol, we numerically compared, for the range of allowed parameters, the rates achieved when each of the three bases is used for key generation. Similarly to the BB84 case, we observed that higher key rates are obtained for key generation in the basis with higher QBER except for a small range of parameters. We found that it is not advantageous to use the basis with higher QBER for key generation only for some range of QBERs (QX,QY,QZ)(Q_{X},Q_{Y},Q_{Z}) next to the region where no key can be obtained. As an example, for a state with QBERs (QX=0.39,QY=0.39,QZ=0.01)(Q_{X}=0.39,Q_{Y}=0.39,Q_{Z}=0.01), one can obtain a secret key only if the ZZ-basis is used for key generation in the six-state protocol with advantage distillation given by Protocol I.

It is interesting to remark that the advantage of using the basis with higher QBER for protocols with advantage distillation can also occur in practical implementations where information reconciliation is performed using an one-way protocol vDK97 ; ELAB09 ; TMPE17 with non-optimal asymptotic leakage fh(QM)f\cdot h(Q_{M}), for f1.2f\leq 1.2. Indeed, the advantage obtained by the use of a basis with higher QBER can be sufficiently large to compensate for the penalty of using an efficient information reconciliation protocol with higher leakage.

Protocol I can be generalized to blocks of arbitrary size bb Mau93 . Even though this leads to a significant decrease in the key rate in the low noise regime, higher noise tolerance can be achieved GL03 ; KBR07 ; BA07 . Figure 5 illustrates the behavior of the key rates for the BB84 with advantage distillation using blocks of size 7. We now find that it is advantageous to use the basis with higher QBER for key generation in all the range of parameters that lead to positive key rate.

Refer to caption
Figure 5: (Color online) Comparison of the key rates for the BB84 protocol with an advantage distillation protocol that uses blocks of size 7. The blue (dark gray) dots represent the parameters for which higher key rates are achieved when the ZZ-basis is used for key generation. The yellow (light gray) dots represent the case when higher key rates are achieved with measurements in the XX-basis. For this case, it is advantageous to always use the basis with higher QBER for key generation.

In Ref. Watanabe , Watanabe et al. introduced an advantage distillation protocol that does not suffer from a big drop of the key rate in the low noise regime. The protocol introduced in Watanabe contains Protocol I as a sub-routine, and in the high noise regime the key rate coincides with the one obtained using Protocol I. Therefore, we expected that Observation 2 may also have an impact in this protocol. Indeed, in Figure 6 we illustrate that choosing the basis with higher QBER for key generation leads to higher rates for the family of states QX=QZ=0.1Q_{X}=Q_{Z}=0.1 when the advantage distillation protocol of Ref. Watanabe is performed. This effect played a role on the key rates estimated in Ref. rozpkedek2018near , for near-term implementations based on nitrogen-vacancy platforms and quantum repeaters.

Refer to caption
Figure 6: (Color online) Key rates for the six-state protocol with the advantage distillation protocol introduced in Ref. Watanabe , for the family of states QX=QZ=0.1Q_{X}=Q_{Z}=0.1. Blue (dark gray) curve illustrates the key rates when the ZZ-basis is used for the key generation rounds, and the yellow (light gray) curve when the YY-basis is used for the key generation rounds.

III QKD and entanglement distillation protocols

In this section we show that the DEJMPS entanglement distillation protocol DEJMPS is related to advantage distillation, Protocol I, when it is applied to a string of bits generated by measurements in the basis with higher QBER.

A maximally entangled state provides a perfectly secure bit of key. Therefore, quantum key distribution and entanglement distillation are closely related SP00 ; E91 . In fact, if the states shared by Alice and Bob have distillable entanglement, Alice and Bob could first distill maximally entangled states out of their noisy shared states, and then proceed to extract a perfectly secure key by measuring the distilled states. Interestingly, some entanglement distillation protocols can be completely mapped into a classical post-processing of the string of bits obtained after measurements on the initial states GL03 . In that case, the entanglement distillation protocol has a corresponding QKD protocol that can be implemented in a prepare-and-measure set-up. In a prepare-and-measure protocol, measurements of the quantum states are performed as soon as the states are received by Alice and Bob. This is of great interest for practical implementations, as no quantum memory is required to implement these protocols. In GL03 , Gottesman and Lo characterized the properties that an entanglement distillation protocol needs to satisfy in order to be turned into a prepare-and-measure QKD protocol. The main idea is that some quantum operations (as CNOT gates) can be translated into classical operations (as XOR of the bits) on the string of bits generated by measurements in the initial state.

One-way information reconciliation based on hashing functions followed by privacy amplification is closely related to one-way entanglement distillation protocols based on Calderbank-Shor-Steane (CSS) codes that can correct for the corresponding amount of bit flip and phase flip errors SP00 ; Lo01 . Similarly, the advantage distillation protocol, given by Protocol I, can be related to a two-to-one entanglement distillation protocol that takes two copies of a two-qubit state and maps it into one two-qubit state, hopefully more entangled than the original ones. Under the assumption that the eavesdropper is restricted to individual attacks, it has been shown GW99 ; AMG03 that, a positive key can be extracted from any entangled state if advantage distillation with blocks of arbitrarily large size is applied. This shows that prepare-and-measure implementation is as powerful as entanglement distillation if the eavesdropper is restricted to individual attacks. This result was also generalized to high-dimensional QKD AGS03 ; Bruss03 . However, this equivalence does not hold true under general attacks BA07 .

In the following, we will focus on a two-to-one entanglement distillation protocol. We will prove an interesting relation betwen the two-to-one entanglement distillation protocol introduced in DEJMPS , the DEJMPS protocol, and advantage distillation with blocks of size two, given by Protocol I.

Protocol II: DEJMPS entanglement distillation

1:Consider that Alice and Bob share nn copies of a Bell-diagonal state.
2:Alice and Bob apply local unitary operations to each copy of their states in order to bring them to the form:
ρ=λ00Φ00+λ10Φ10+λ11Φ11+λ01Φ01,s.t. λ00>12 and λ00>λ10λ11λ01.\displaystyle\begin{split}\rho=\lambda_{00}\Phi_{00}+\lambda_{10}\Phi_{10}+\lambda_{11}\Phi_{11}+\lambda_{01}\Phi_{01},\\ \text{s.t. }\lambda_{00}>\frac{1}{2}\text{ and }\lambda_{00}>\lambda_{10}\geq\lambda_{11}\geq\lambda_{01}.\end{split} (12)
3:for every 22 systems do
4:     Apply bi-local CNOT gates between the two copies.
5:     Measure the target qubits and communicate the results.
6:     If the measured flags are 00 or 11 keep the first system. Else discard both pairs.
7:end for

Protocol II includes a rotation of the initial states, step 1, before the application of the CNOT gates. Any entangled two-qubit Bell-diagonal state can be brought to the form (12) by local unitaries (e.g., applying a Hadamard to each qubit leads to a permutation of the Bell states Φ01\Phi_{01} and Φ10\Phi_{10}). The originally proposed DEJMPS protocol DEJMPS includes specific rotations that are independent of the input state. In DNMV03 , it was proven that bringing the state to the form (12), before applying the CNOT gates, maximizes the fidelity of the output state. Here we include in the DEJMPS protocol, as a first step, the rotations that optimize the output fidelity. Moreover, note that the DEJMPS protocol can also be applied to non-Bell-diagonal states, as any two-qubit entangled state that has singlet fidelity higher than 12\frac{1}{2} can be brought to the form (12) by local operations and classical communication (BDSW96, , Appendix A).

The following theorem states that the DEJMPS protocol is actually related to the six-state protocol with advantage distillation, given by Protocol I, when the basis with higher QBER is chosen for the key generation.

Theorem 1.

The following two procedures result in the same key rates:

  • (i)

    Alice and Bob implement the six-state protocol with advantage distillation, given by Protocol I, using the basis with higher QBER for key generation.

  • (ii)

    Alice and Bob apply the DEJMPS protocol to every two copies of their states, and subsequently implement the six-state protocol, without advantage distillation, by measuring the distilled states.

Proof.

In order to prove the equivalence of procedures (i) and (ii), we show that generating a string of bits by performing measurements in the basis with higher QBER followed by advantage distillation is equivalent to performing the DEJMPS entanglement distillation protocol and measuring the resulting state in the ZZ-basis.

We first note that steps 2-6 of Protocol II, followed by the measurement of the remaining qubits, can be, equivalently, implemented in a prepare-and-measure scenario. This is due to the following observations: (a) the CNOT gate commutes with measurements in the ZZ-basis; (b) the final measurements performed on the remaining control qubits, also commute with the post-selection operation applied in step 5. This is due to the fact that in step 5, a pair of qubits is discarded according to the outputs of the target qubits only, therefore this operation acts as the identity on the control qubits of the remaining systems. Observations (a) and (b) imply that in an implementation of steps 2-6 of Protocol II followed by measurement of the remaining qubits, one can first measure all the subsystems and then proceed to apply the CNOT gate, step 3, and post-selection of results, step 5. In this equivalent description, in which all the systems are measured first, the CNOT gate and the post-selection act on classical strings. Their action, then, corresponds to Alice and Bob locally computing the XOR of their respective two bits and comparing if they have the same parity. And this is exactly the action of the advantage distillation described in Protocol I (note that, in Protocol I, acc=1acc=1 iff aj1aj2=bj1bj2a_{j_{1}}\oplus a_{j_{2}}=b_{j_{1}}\oplus b_{j_{2}}).

Protocol II includes a local rotation of the quantum states in step 1. Instead of rotating the state, we could equivalently rotate the operations. From the previous paragraphs we have seen that procedure (ii) of the Theorem can be implemented by performing measurements in the ZZ-basis on all the subsystems before applying the CNOT gates and post-selection of the results. The first step of measurements is described as

(i|ii|Ai|ii|B)ρAB(i|ii|Ai|ii|B)\displaystyle\left(\sum_{i}\left|i\middle\rangle\middle\langle i\right|_{A}\otimes\sum_{i}\left|i\middle\rangle\middle\langle i\right|_{B}\right)\cdot\rho_{AB}\cdot\left(\sum_{i}\left|i\middle\rangle\middle\langle i\right|_{A}\otimes\sum_{i}\left|i\middle\rangle\middle\langle i\right|_{B}\right) (13)

If the initial states are rotated before the measurements, ρABUAUBρABUAUB\rho_{AB}\mapsto U_{A}\otimes U_{B}\cdot\rho_{AB}\cdot U^{{\dagger}}_{A}\otimes U^{{\dagger}}_{B}, then we have

(i|ii|Ai|ii|B)(UAUBρABUAUB)(i|ii|Ai|ii|B)=(i|ii|UAi|ii|UB)ρAB(iUA|ii|iUB|ii|).\displaystyle\begin{split}&\left(\sum_{i}\left|i\middle\rangle\middle\langle i\right|_{A}\otimes\sum_{i}\left|i\middle\rangle\middle\langle i\right|_{B}\right)\cdot(U_{A}\otimes U_{B}\cdot\rho_{AB}\cdot U^{{\dagger}}_{A}\otimes U^{{\dagger}}_{B})\cdot\left(\sum_{i}\left|i\middle\rangle\middle\langle i\right|_{A}\otimes\sum_{i}\left|i\middle\rangle\middle\langle i\right|_{B}\right)\\ &=\left(\sum_{i}\left|i\middle\rangle\middle\langle i\right|U_{A}\otimes\sum_{i}\left|i\middle\rangle\middle\langle i\right|U_{B}\right)\cdot\rho_{AB}\cdot\left(\sum_{i}U^{{\dagger}}_{A}\left|i\middle\rangle\middle\langle i\right|\otimes\sum_{i}U^{{\dagger}}_{B}\left|i\middle\rangle\middle\langle i\right|\right).\end{split} (14)

Since the rotations are local, they can be mapped into the measurements, and the last expression of (14) describes measurements in the rotated bases {UA|i}\left\{U^{{\dagger}}_{A}\left|i\right\rangle\right\} and {UB|i}\left\{U^{{\dagger}}_{B}\left|i\right\rangle\right\} on the original state ρAB\rho_{AB}. By the equivalence established in the previous paragraph, Protocol II, followed by measurement of the remaining qubits, corresponds to applying the advantage distillation, Protocol I, to a string of outcomes obtained from measurements performed in the corresponding rotated basis.

Finally, let us evaluate the effect of the rotation performed in step 1 of Protocol II. The QBERs of a Bell-diagonal state are given by

QX=λ01+λ11,QY=λ01+λ10,QZ=λ10+λ11.\displaystyle\begin{split}Q_{X}&=\lambda_{01}+\lambda_{11},\\ Q_{Y}&=\lambda_{01}+\lambda_{10},\\ Q_{Z}&=\lambda_{10}+\lambda_{11}.\end{split} (15)

Given the relations satisfied by the coefficients after the rotation in step 1, eq. (12), we have that QZQXQ_{Z}\geq Q_{X} and QZQYQ_{Z}\geq Q_{Y}. Therefore, after the initial rotation, ZZ is the basis with the highest QBER. In the alternative picture in which all the measurements are performed first, and the rotation of the state is mapped into a rotation of the measurements, see eq. (14), we have that the rotated bases, {UA|i}\left\{U^{{\dagger}}_{A}\left|i\right\rangle\right\} and {UB|i}\left\{U^{{\dagger}}_{B}\left|i\right\rangle\right\}, correspond to measurements in the basis with the highest QBER.

So the DEJMPS protocol followed by a measurement in the ZZ-basis, corresponds to advantage distillation, given by Protocol I, applied to the outcomes of measurements in the basis with highest QBER. This proves the equivalence of procedures (i) and (ii) of Theorem 1. ∎

Theorem 1 establishes that the DEJMPS protocol falls into the category of entanglement distillation protocols that have a corresponding prepare-and-measure QKD as characterized by Gottesman and Lo GL03 . Moreover, it shows that the particular rotation introduced in step 1 of Protocol II can be implemented in the prepare-and-measure scenario by choosing the basis with higher QBER for key generation.

In DNMV03 , it was shown that the DEJMPS protocol, Protocol II, is the two-to-one entanglement distillation protocol that achieves the highest fidelity, among all possible protocols that involve Pauli rotations. In RSPEDW18 it was proven that the DEJMPS is the optimal two-to-one entanglement distillation protocol for rank 3 Bell-diagonal states. I.e., the highest possible fidelity is achieved with the highest possible probability of success, considering all possible protocols that take two copies into one. We now state analogous results for the key rates of the corresponding QKD protocol.

A Bell-diagonal state of rank up to 3 satisfies that one of the QBERs is equal to the sum of the other two. Without loss of generality, we can consider QY=QX+QZQ_{Y}=Q_{X}+Q_{Z}. The corresponding Bell-diagonal state is then

ρ=(1QXQZ)Φ00+QZΦ10+QXΦ11.\displaystyle\rho=(1-Q_{X}-Q_{Z})\Phi_{00}+Q_{Z}\Phi_{10}+Q_{X}\Phi_{11}. (16)

We numerically compared the key rates achieved by the state given in eq. (16) for the six-state protocol with advantage distillation given by Protocol I and key generation in all of the three bases. In the region of positive key rate, we observed that, over all the range of values of QXQ_{X} and QZQ_{Z}, higher rate is achieved when YY is the key generation basis.

For rank 4 states, using the basis with highest QBER is not always advantageous. As mentioned in Section II, a counter-example is given by the state with QBERs (QX=0.39,QY=0.39,QZ=0.01)(Q_{X}=0.39,Q_{Y}=0.39,Q_{Z}=0.01). For a Bell-diagonal state with the specified QBERs, a positive key rate can only be obtained by performing measurements in the ZZ-basis in an implementation of the six-state protocol with advantage distillation given by Protocol I. We remark, however, that this does not contradict the fact that the corresponding state after an application of the DEJMPS procedure has higher fidelity. Indeed, as we have seen from Observation 1, higher fidelity does not necessarily imply higher key rates in the six-state protocol. Analyzing this example in detail, we find that the fidelity of the initial state is 0.6050.605 and no key can be extracted by directly applying information reconciliation and privacy amplification. If entanglement distillation is performed without the previous rotations, i.e. by applying only steps 4-6 of Protocol II, the final fidelity is 0.5250.525 and positive key can be extracted from the corresponding final state using a six-state protocol with an optimal one-way hashing information reconciliation. Applying the DEJMPS protocol, in which the initial rotations are performed, we obtain a state with higher fidelity, equal to 0.6980.698, yet this state does not lead to positive key rate in the six-state protocol.

IV Implications to experimental implementations

We now discuss the implications of our results to fibre-based implementations of quantum key distribution over long distances.

The most common way of transmitting qubits over long distances is by using photons sent through optical fibres. One of the challenges of a fibre-based implementation is that the transmissivity of the channel decays exponentially with the distance. It has been shown that this also leads to an exponential decay of the achievable secret-key rate over such channel takeoka2014fundamental ; pirandola2015fundamental , thus making practical QKD over direct fibre connections impossible for larger distances. Significant amount of both theoretical and experimental efforts are being invested into overcoming this problem using the so-called quantum repeaters briegel1998quantum , which have the capability of beating the exponential scaling of secret-key rate with distance. One of the fundamental building blocks of such quantum repeater schemes is a memory node that can store quantum information over time. By dividing the channel into elementary links, entanglement generation can be attempted independently over those segments, thanks to the quantum memories at the intermediate repeater stations. Unfortunately, quantum states stored in such memories decohere with time.

Decoherence is often a complex process that could be modeled by a composition of different noise channels depending on the physical implementation of the quantum memory. However, often the dominant type of noise corresponds to the dephasing channel. This has been observed for many physical platforms which are promising candidates for long-lived quantum memories, such as nitrogen-vacancy centres reiserer2016robust ; kalb2018 ; maurer2012room , trapped ions kielpinski2001entanglement and neutral atoms schrader2004neutral . Therefore, the dephasing channel is frequently used to model memory decoherence in quantum repeater literature, thus leading to expected non-uniform QBER over the three bases luong2015overcoming ; parameterregimes ; razavi2009quantum ; nemoto2016photonic ; rozpkedek2018near . Hence, the results of this paper will be highly relevant for choosing the key generation basis for entanglement based QKD schemes implemented across a future quantum repeater network. In fact, some of the authors of this manuscript have already applied the results of this work into their model of near-term proof-of-principle quantum repeaters based on nitrogen-vacancy centres rozpkedek2018near .

Regarding prepare-and-measure QKD schemes, the method of decoy states was introduced to overcome vulnerabilities due to imperfections in the source Hwang_Decoy ; Lo_Decoy . In a decoy state protocol, the asymptotic key rates, (3) and (4), are modified to account for the information leakage from the rounds in which multiple photons are generated. The modified key rates have a much more intricate dependence on the QBERs and, therefore, a detailed analysis is required to determine the effects of asymmetric noise in decoy state implementations. We leave it as an interesting open question for future investigation.

V Acknowledgements

We thank K. Goodenough, J. Kaniewski, S. de Bone, and T. Coopmans for helpful discussions. This work was supported by the European Research Council through a Starting Grant, and the Netherlands Organisation for Scientific Research (NWO) through a VIDI grant, and a Zwaartekracht grant. GM was also funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – Cluster of Excellence Matter and Light for Quantum Computing (ML4Q) EXC 2004/1 – 390534769. DE was also supported by the Netherlands Organization for Scientific Research (NWO/OCW), as part of the Quantum Software Consortium program (project number 024.003.037/3368).

References

  • [1] D. Deutsch, A. Ekert, R. Jozsa, C. Macchiavello, S. Popescu, and A. Sanpera. Quantum privacy amplification and the security of quantum cryptography over noisy channels. Phys. Rev. Lett., 77:2818–2821, 1996.
  • [2] C. H. Bennett and G. Brassard. Quantum cryptography: Public key distribution and coin tossing. In Proceedings of IEEE International Conference on Computers, Systems and Signal Processing, pages 175 – 179, 1984.
  • [3] A. K. Ekert. Quantum cryptography based on Bell’s theorem. Phys. Rev. Lett., 67:661–663, 1991.
  • [4] G S. Vernam. Cipher printing telegraph systems for secret wire and radio telegraphic communications. American Institute of Electrical Engineers, Transactions of the, XLV:295 – 301, 1926.
  • [5] C. E. Shannon. Communication theory of secrecy systems. The Bell System Technical Journal, 28(4):656–715, 1949.
  • [6] H-K. Lo, M. Curty, and K. Tamaki. Secure quantum key distribution. Nature Photonics, 8:595–604, 2014.
  • [7] S. Wiesner. Conjugate coding. SIGACT News, 15(1):78–88, 1983.
  • [8] D. Bruß. Optimal eavesdropping in quantum cryptography with six states. Phys. Rev. Lett., 81:3018–3021, 1998.
  • [9] F. Rozpędek, R. Yehia, K. Goodenough, M. Ruf, P. C. Humphreys, R. Hanson, S. Wehner, and D. Elkouss. Near-term quantum-repeater experiments with nitrogen-vacancy centers: Overcoming the limitations of direct transmission. Phys. Rev. A, 99:052330, 2019.
  • [10] C. H. Bennett, G. Brassard, and N. D. Mermin. Quantum cryptography without Bell’s theorem. Phys. Rev. Lett., 68:557–559, 1992.
  • [11] P. W. Shor and J. Preskill. Simple Proof of Security of the BB84 Quantum Key Distribution Protocol. Phys. Rev. Lett., 85:441–444, 2000.
  • [12] H-K. Lo. Proof of unconditional security of six-state quatum key distribution scheme. Quantum Info. Comput., 1(2):81–94, 2001.
  • [13] R. Renner. Security of quantum key distribution. International Journal of Quantum Information, 06(01):1–127, 2008.
  • [14] H-K. Lo, H.F. Chau, and M. Ardehali. Efficient quantum key distribution scheme and a proof of its unconditional security. Journal of Cryptology, 18(2):133–165, 2005.
  • [15] U. M. Maurer. Secret key agreement by public discussion from common information. IEEE Transactions on Information Theory, 39(3):733–742, 1993.
  • [16] D. Gottesman and H.-K. Lo. Proof of security of quantum key distribution with two-way classical communications. IEEE Transactions on Information Theory, 49(2):457–475, 2003.
  • [17] B. Kraus, C. Branciard, and R. Renner. Security of quantum-key-distribution protocols using two-way classical communication or weak coherent pulses. Phys. Rev. A, 75:012316, 2007.
  • [18] S. Watanabe, R. Matsumoto, T. Uyematsu, and Y. Kawano. Key rate of quantum key distribution with hashed two-way classical communication. Phys. Rev. A, 76:032312, 2007.
  • [19] G. Brassard and L. Salvail. Secret-key reconciliation by public discussion. In Tor Helleseth, editor, Advances in Cryptology — EUROCRYPT ’93, pages 410–423, Berlin, Heidelberg, 1994. Springer Berlin Heidelberg.
  • [20] J. Martinez-Mateo, C. Pacher, M. Peev, A. Ciurana, and V. Martin. Demystifying the information reconciliation protocol cascade. Quantum Info. Comput., 15(5-6):453–477, 2015.
  • [21] R. Renner and S. Wolf. Simple and tight bounds for information reconciliation and privacy amplification. In Bimal Roy, editor, Advances in Cryptology - ASIACRYPT 2005, pages 199–216, Berlin, Heidelberg, 2005. Springer Berlin Heidelberg.
  • [22] B. Kraus, N. Gisin, and R. Renner. Lower and upper bounds on the secret-key rate for quantum key distribution protocols using one-way classical communication. Phys. Rev. Lett., 95:080501, 2005.
  • [23] M. van Dijk and A. Koppelaar. High rate reconciliation. In Proceedings of IEEE International Symposium on Information Theory, pages 92–, 1997.
  • [24] D. Elkouss, A. Leverrier, R. Alleaume, and J. J. Boutros. Efficient reconciliation protocol for discrete-variable quantum key distribution. In 2009 IEEE International Symposium on Information Theory, pages 1879–1883, 2009.
  • [25] M. Tomamichel, J. Martinez-Mateo, C. Pacher, and D. Elkouss. Fundamental finite key limits for one-way information reconciliation in quantum key distribution. Quantum Information Processing, 16(11):280, 2017.
  • [26] C. H. Bennett, D. P. DiVincenzo, John A. Smolin, and William K. Wootters. Mixed-state entanglement and quantum error correction. Phys. Rev. A, 54:3824–3851, 1996.
  • [27] J. Bae and A. Acín. Key distillation from quantum channels using two-way communication protocols. Phys. Rev. A, 75:012334, 2007.
  • [28] N. Gisin and S. Wolf. Quantum cryptography on noisy channels: Quantum versus classical key-agreement protocols. Phys. Rev. Lett., 83:4200–4203, 1999.
  • [29] Antonio Acín, Lluis Masanes, and Nicolas Gisin. Equivalence between two-qubit entanglement and secure key distribution. Phys. Rev. Lett., 91:167901, 2003.
  • [30] Antonio Acin, Nicolas Gisin, and Valerio Scarani. Security bounds in quantum cryptography using d-level systems. Quantum Info. Comput., 3(6):563–580, 2003.
  • [31] Dagmar Bruß, Matthias Christandl, Artur Ekert, Berthold-Georg Englert, Dagomir Kaszlikowski, and Chiara Macchiavello. Tomographic quantum cryptography: Equivalence of quantum and classical key distillation. Phys. Rev. Lett., 91:097901, Aug 2003.
  • [32] J. Dehaene, M. Van den Nest, B. De Moor, and F. Verstraete. Local permutations of products of Bell states and entanglement distillation. Phys. Rev. A, 67:022310, 2003.
  • [33] F. Rozpędek, T. Schiet, Le Phuc Thinh, D. Elkouss, Andrew C. Doherty, and S. Wehner. Optimizing practical entanglement distillation. Phys. Rev. A, 97:062333, 2018.
  • [34] M. Takeoka, S. Guha, and M. M. Wilde. Fundamental rate-loss tradeoff for optical quantum key distribution. Nature Communications, 5:5235, 2014.
  • [35] S. Pirandola, R. Laurenza, C. Ottaviani, and L. Banchi. Fundamental limits of repeaterless quantum communications. Nature Communications, 8:15043, 2017.
  • [36] H-J. Briegel, W. Dür, J. I. Cirac, and P. Zoller. Quantum repeaters: The role of imperfect local operations in quantum communication. Physical Review Letters, 81(26):5932, 1998.
  • [37] A. Reiserer, N. Kalb, M. S. Blok, K. J.M. van Bemmelen, T. H. Taminiau, R. Hanson, D. J. Twitchen, and M. Markham. Robust quantum-network memory using decoherence-protected subspaces of nuclear spins. Physical Review X, 6(2):021040, 2016.
  • [38] N. Kalb, P. C. Humphreys, J. J. Slim, and R. Hanson. Dephasing mechanisms of diamond-based nuclear-spin memories for quantum networks. Physical Review A, 97(6):062330, 2018.
  • [39] P. C. Maurer, G. Kucsko, C. Latta, L. Jiang, N. Y. Yao, S. D. Bennett, F. Pastawski, D. Hunger, N. Chisholm, M. Markham, et al. Room-temperature quantum bit memory exceeding one second. Science, 336(6086):1283–1286, 2012.
  • [40] D. Kielpinski. Entanglement and decoherence in a trapped-ion quantum register. PhD thesis, University of Colorado at Boulder, 2001.
  • [41] D. Schrader, I. Dotsenko, M. Khudaverdyan, Y. Miroshnychenko, A. Rauschenbeutel, and D. Meschede. Neutral atom quantum register. Physical Review Letters, 93(15):150501, 2004.
  • [42] D. Luong, L. Jiang, J. Kim, and N. Lütkenhaus. Overcoming lossy channel bounds using a single quantum repeater node. Applied Physics B, 122(4):1–10, 2016.
  • [43] F. Rozpędek, K. D. Goodenough, J. Ribeiro, N. Kalb, V. Caprara Vivoli, A. Reiserer, R. Hanson, S. Wehner, and D. Elkouss. Parameter regimes for a single sequential quantum repeater. Quantum Science and Technology, 3:034002, 2018.
  • [44] M. Razavi, M. Piani, and N. Lütkenhaus. Quantum repeaters with imperfect memories: Cost and scalability. Physical Review A, 80(3):032301, 2009.
  • [45] K. Nemoto, M. Trupke, S. J. Devitt, B. Scharfenberger, K. Buczak, J. Schmiedmayer, and W. J. Munro. Photonic quantum networks formed from NV-centers. Scientific reports, 6:26284, 2016.
  • [46] Won-Young Hwang. Quantum key distribution with high loss: Toward global secure communication. Phys. Rev. Lett., 91:057901, Aug 2003.
  • [47] Hoi-Kwong Lo, Xiongfeng Ma, and Kai Chen. Decoy state quantum key distribution. Phys. Rev. Lett., 94:230504, Jun 2005.