betaFeedback

WorksPhysics and Astronomy

On the design of sequential quantum repeaters with error detection

Abstract

Long-distance, trust-free quantum communications rely on the development of scalable quantum repeater schemes. Sequential entanglement generation with error detection is a promising approach that combines manageable implementation requirements with a hop-by-hop architecture compatible with existing classical infrastructure. In this paper, we investigate key design choices for such schemes over a repeater chain using quantum key distribution as a benchmark. We find that simple quantum error-detecting codes, such as repetition codes or quantum parity codes, perform well under near-term hardware assumptions and outperform strategies without any encoding. In particular, we show that two-qubit repetition codes may well be all that we need to implement in many practical scenarios. We also examine different architectures for the generation of initial entanglement and assess their merits. Additionally, we show that moderate improvements in some hardware components can partially mitigate the slow technological progress of others.

Introduction

Quantum technologies continue to attract widespread attention, thanks to their promising applications [1, 2]. A key area of focus is the development of a global network of quantum devices, i.e. the so-called quantum Internet [3, 4, 5, 6, 7]. However, long-distance quantum communications still faces many challenges. While networks relying on trusted nodes have already been deployed for scientific and military purposes [8, 9, 10, 11], a trust-free architecture is preferable for commercial deployments.

The key solution for trust-free quantum communications in terrestrial settings relies on quantum repeaters [12, 13, 14]. Such platforms generally work by distributing entanglement as a resource across a quantum network. This entanglement can then be used by various quantum applications. Several strategies are commonly employed by repeater schemes to ensure scalability. These include generating entanglement between adjacent nodes using a repeat-until-success (RUS) approach, performing entanglement distillation to probabilistically increase the quality of the entanglement, and/or encoding the distributed entanglement using quantum error correction (QEC) techniques [15, 16]. A specific type of quantum repeater, the so-called encoded repeaters [17], combines the RUS and QEC mechanisms, limiting the use of the latter to the swapping stage. This approach can potentially achieve higher rates at long distances when compared with schemes relying exclusively on RUS and distillation [12, 18], while remaining less technologically demanding than the so-called one-way schemes that employ QEC to encode and transmit quantum information directly [19, 20]. Nevertheless, longer distances often require encoded repeaters to make use of increasingly complex codes in order to correct errors, which may impede the development of large commercial networks in the short term.

An alternative approach that aims to simplify encoded repeaters to increase their feasibility is to use techniques from QEC exclusively for detecting errors [21, 22, 23, 24]. When using error detection, as opposed to error correction, a system checks the error syndromes only to verify that they correspond to the identity error, and either aborts or restarts operation when this is not the case. This verification step is generally an easier task than error correction, and benefits from the fact that smaller codes can detect more errors than they can correct. In the context of entanglement distribution, the sequential entanglement generation with error detection (SEG-ED) protocol introduced in [24] executes the error detection step at every intermediate node, involving the next node in the path from one user to the other only if no error was detected within that distribution round. Subsequently, whenever an error is detected any node beyond the one detecting the error never commits resources to that round, possibly leading to a more efficient use of network resources [24]. However, there are still many open questions regarding the performance of this protocol.

In this paper, we remain within the two-user scenario and delve into some of the outstanding design considerations for practical SEG-ED implementations. As in [24], we analyse the protocol from the perspective of a repeater chain setup representing a single path between two users within a broader network, and adopt quantum key distribution (QKD) [25, 26, 27, 28, 29] as the benchmark application. However, in contrast to previous work which attempted to validate SEG-ED’s performance by weighing it against other alternatives, here we focus solely on SEGED systems and compare their performance under different designs and constraints. Specifically, we investigate whether larger codes can improve performance under realistic hardware assumptions, explore which method for the generation of initial entanglement fits best depending on the underlying infrastructure, and examine the hardware requirements which enable practical key distribution at long distances.

To address these questions, we expand and generalise the analytical framework from [24], originally proposed as a tailor-made solution for systems using a three-qubit repetition code. Using tools from the stabiliser formalism [30, 31], we develop a general framework which offers fast and exact calculations of density matrices whenever only stabiliser circuits and Pauli-diagonal noise channels are involved. Though designed independently, this framework is analogous to a specialisation of Yoder’s formalism in [32], and can be easily adapted for use in diverse applications. Here, we show how to use this framework to model encoded repeater chains using CSS codes [33, 34], as these are the most commonly used codes for those systems [17].

The main findings of this paper are summarised below:

  • We derive the secret key rates achievable using different error-detecting codes of small size. We show that the two-qubit repetition code achieves the highest rates at short-to-moderately-long distances under our near-term hardware assumptions, despite being unable to correct any errors. Additionally, we demonstrate that the Leung-Nielsen-Chuang-Yamamoto (LNCY) code [35] and the so-called “four-qubit code” [36], i.e. the shortest codes capable of simultaneously detecting bit-flip and phase-flip errors, can outperform the former at long distances and extend the reach of secure communications.

  • We compare the practical range of the repeater chain using two different configurations for two-photon interference schemes [37, 38, 39, 40] for generating the initial entanglement. In particular, we compare a setup performing the optical Bell state measurement [37, 41, 42, 43] (BSM) within the memory-equipped repeater nodes to another that requires an additional intermediate node in between each pair of adjacent memory-equipped nodes for this purpose. Our results suggest that the former performs better in networks where the devices are further apart, such as current long-distance optical infrastructure [44, 45], while the latter setup is better suited to more tightly spaced networks.

  • We explore how the poor performance of one of the hardware parameters, e.g. due to slow technological development, could be mitigated by the over-performance of some other parameter. Specifically, we find that practical key distribution (K>1K > 1 bps) could be achieved beyond 1000 km with an initial fidelity as low as 95%, provided around 30 multiplexed quantum channels are available at each hop and the “four-qubit code” is used.

The remainder of the paper is structured as follows. First, Section II introduces the setup considered in this paper, as well as how SEG-ED fits into it. Then, Section III explains the mathematical framework used to model such a setup and includes the derivations of the performance metrics. This analysis is used in Section IV to obtain the main results of this paper, based on some realistic parameter values introduced in the same section. Finally, Section V summarizes the paper and ends with a brief discussion on future directions for this work.

Setup description

We consider a homogeneous repeater chain between two users, Alice and Bob, separated by a total distance LL. The chain consists of NrN_{\mathrm{r}} evenly-spaced and identical repeater nodes connected to their two nearest neighbours through physical channels of length L0=L/(Nr+1)L_0 = L/(N_{\mathrm{r}} + 1). This setup is illustrated in Figure 1, where we have denoted the nodes by R0 (Alice), R1, R2, …\ldots, RNr+1_{N_{\mathrm{r}}+1} (Bob).

Figure 1. Schematic representation of the homogeneous repeater chain. Circles represent communication qubits, single lines represent quantum channels and double lines represent classical channels.

We assume that each pair of consecutive nodes is connected by a classical channel and NmuxN_{\mathrm{mux}} multiplexed quantum channels. Each quantum channel connects a pair of quantum memories, one in each node, allowing them to distribute entanglement through some photon-mediated scheme. We refer to these quantum memories by the name of communication qubits. In addition to communication qubits, each node also possesses several quantum memories that do not interact directly with the quantum channels, but only with each other and with the communication qubits. These memories, which we call data qubits, fulfil two main roles: (1) they participate in the generation of encoded entangled states; and (2) they are used for long-term buffering of the encoded data, crucial in sequential schemes [24].

We consider that Alice and Bob use the repeater chain to distribute a secret key. Specifically, they use a kk-qubit variant of BB84-QKD [46, 47]. In order to enable this protocol, which we describe in detail in Section II A, the repeater chain follows the SEG-ED [24] strategy using some [[n,k]][[n,k]] CSS code [17, 33, 34] to sequentially distribute kk-qubit logical states, encoded using nn physical qubits. That is, we start from node R0 and generate subsequent encoded entangled states, hop-by-hop. At every hop, we apply a logical BSM to perform the entanglement connection. If we detect an error during this step, the protocol is aborted; otherwise, we continue until we reach Bob.

In the remainder of this section, we review and discuss this strategy in the context of our setup. First, we describe the QKD protocol executed by the users in Section II A; then, we explain the procedure employed at each hop to generate logical entanglement in Section II B; and, finally, we put everything together in Section II C, where we delve into the details of the protocol and how subsequent rounds are initiated.

Two-basis multi-qubit QKD

In this paper, we go beyond the standard BB84 protocol [46], and instead consider the protocol described in [47] to distribute kk key bits per round. More specifically, we employ the two-basis protocol with the mutually unbiased bases Z⊗k\mathcal{Z}^{\otimes k} and X⊗k\mathcal{X}^{\otimes k}, and distribute kk-qubit states each round, which are analogous to using 2k2^k-dimensional qudits instead. This allows us to maximise the performance of the setup when using error detection codes with k>1k > 1. The reason is that, if the errors affecting the qubits within a given round are asymmetric (i.e. they affect some qubits differently than others), we obtain a full characterisation of the channel, unlike with the standard BB84 QKD, which strictly focuses on the overall error rate. We now describe the protocol employed.

Let ∣Φ⟩AB\lvert\Phi\rangle_{\mathrm{AB}} denote a maximally entangled bipartite state between kk-qubit systems A and B. This state can be written as:

∣Φ⟩AB=12k/2∑s=02k−1∣s⟩A⊗∣s⟩B,(1)\lvert\Phi\rangle_{\mathrm{AB}} = \frac{1}{2^{k/2}}\sum_{s=0}^{2^k-1}\lvert s\rangle_{\mathrm{A}}\otimes\lvert s\rangle_{\mathrm{B}}, \tag*{(1)}

where ss in ∣s⟩\lvert s\rangle is expressed as a kk-bit string, such that ∣s⟩\lvert s\rangle is a state in the computational basis.

In the entanglement-based version of the protocol [47], Alice prepares such a maximally entangled state each round, and sends one of the kk-qubit systems to Bob, such that they ideally share the state ∣Φ⟩R0RNr+1\lvert\Phi\rangle_{\mathrm{R}_0\mathrm{R}_{N_r+1}}. Then, they each choose one of Z\mathcal{Z} or X\mathcal{X} at random, and obtain respective kk-bit strings which we denote by kA\mathbf{k}_{\mathrm{A}} and kB\mathbf{k}_{\mathrm{B}}. After many of these rounds have been completed, Alice and Bob discuss the bases they have selected each round over an authenticated classical channel, and discard the rounds on which they chose different bases. Then, they use a subset of the sifted rounds for parameter estimation, computing the parameters e0∣Be_{0\mid B} through e2k−1∣Be_{2^k-1\mid B}, where B∈{Z,X}B\in\{\mathcal{Z},\mathcal{X}\} and ex∣Be_{x\mid B} denotes the probability that kA⊕kB=x\mathbf{k}_{\mathrm{A}}\oplus\mathbf{k}_{\mathrm{B}}=x, with ⊕\oplus representing the bitwise XOR operation and xx being represented as a kk-bit string, provided that both have measured their qubits in the basis B\mathcal{B}. The bit-strings from the remaining rounds go on to be processed by the latter steps of the QKD protocol [46, 47], namely error correction and privacy amplification, before the final key is obtained.

In the context of our setup, we use an encoded version of this protocol. That is, rather than sharing the state ∣Φ⟩\lvert\Phi\rangle, we distribute its logical counterpart, ∣ΦL⟩\lvert\Phi_{\mathrm{L}}\rangle, which can be written as:

∣ΦL⟩AB=12k/2∑w∈W∣w⟩A⊗∣w⟩B,(2)\lvert\Phi_{\mathrm{L}}\rangle_{\mathrm{AB}}=\frac{1}{2^{k/2}}\sum_{w\in\mathcal{W}}\lvert w\rangle_{\mathrm{A}}\otimes\lvert w\rangle_{\mathrm{B}}, \tag*{(2)}

for arbitrary nn-qubit systems A and B, where W\mathcal{W} denotes a basis for the state space associated to the [[n,k]][[n,k]] code used by the repeater system (note that ∣W∣=2k\lvert\mathcal{W}\rvert=2^k, so the state is normalized). The users can then apply appropriate decoding measurements to each of the nn-qubit systems in order to obtain the kk-bit strings kA\mathbf{k}_{\mathrm{A}} and kB\mathbf{k}_{\mathrm{B}}. In the particular case of CSS codes, these measurements may consist simply of nn single-qubit measurements in the selected basis, plus some conditioning on the set of accepted outcomes.

Logical entanglement generation

Consider two consecutive nodes in the repeater chain, say RiR_i and Ri+1R_{i+1}. The goal of the logical entanglement generation step is to, ideally, prepare the logical entangled state ∣ΦL⟩RiRi+1\lvert\Phi_{\mathrm{L}}\rangle_{R_iR_{i+1}}, defined in Eq. (2). To make our analysis more straightforward, we make two important assumptions about the logical entanglement generation procedure: (1) It is always initiated on demand; that is, each upstream node, RiR_i, must send an explicit initialization message to its downstream neighbour, Ri+1R_{i+1}, in order to request the generation of a logical entangled state. (2) It always starts from scratch; that is, if any leftover entanglement resources remain available to the nodes at the end of the procedure, these are discarded before the next request starts.

The logical entanglement generation procedure is composed of two steps: initial entanglement generation and encoding. After the downstream node receives the initialization message, both nodes employ some probabilistic scheme to entangle nn pairs of communication qubits. Generally, such a probabilistic scheme allows communication qubits to interact over the quantum channel in order to make an entangling attempt. The result of the attempt is classically announced to the nodes to verify whether it was successful. We assume that the nodes use all available quantum channels in parallel, such that these are bundled in “batches”. In the first batch, all NmuxN_{\mathrm{mux}} quantum channels attempt to generate entanglement at the same time. If less than nn pairs of qubits succeed in becoming entangled, those that have failed make another attempt in the following batch. This goes on until nn (or more) successes are registered.

We assume that the following two-photon interference setup [37, 38, 39, 40] is used to implement the entanglement generation attempts. Consider a single pair of communication qubits, connected by a quantum channel. At each entanglement generation attempt, the communication qubits act as emissive quantum memories [18, 48, 49], becoming entangled to single photons that are then transmitted through the quantum channel, as depicted in Figure 2. These photons are interfered in an optical BSM, and the results of the measurement are sent back to the nodes. If the BSM was successful, the communication qubits are ideally projected into an entangled state. In these types of setups, the BSM is executed in a device we call the BSM module, also known as a Bell state analyser [37, 41, 42, 43]. The location of the BSM module determines the timing of the scheme. We consider here two common options [42]: (1) In the receiver-sender (RxTx) layout, depicted in Figure 2(a), the BSM module is co-located with the upstream node, such that entangled photons are sent upstream and the heralding message travels downstream. (2) In the meet-in-the-middle (MITM) layout, depicted in Figure 2(b), the BSM module is located at the midpoint between the nodes, such that the nodes send photons to it from both directions, and the heralding message then flows outwards. In practice, each of these layouts has its advantages and disadvantages, which we discuss in Section IV B.

Figure 2. Layouts for two-photon interference schemes according to the location of the BSM module. (a) Receiver-sender (RxTx). (b) Meet-in-the-middle (MITM). In both figures, circles represent communication qubits; diamonds, photons; single lines, quantum channels; and double lines, classical channels. Arrows indicate the direction of communications.

Once the necessary initial entanglement has been distributed, the nodes RiR_i and Ri+1R_{i+1} respectively prepare nn of their data qubits into the “logical plus” and “logical zero” states, denoted by ∣+L⟩\lvert+_L\rangle and ∣0L⟩\lvert0_L\rangle. Then, using the prepared entangled pairs, they implement a remote logical CNOT gate using local CNOT gates and single-qubit measurements [17]. The results of these measurements, which determine the Pauli frame of the resulting state, are classically exchanged between the nodes. After appropriate local adjustments, the data qubits in the nodes are projected into ∣ΦL⟩RiRi+1\lvert\Phi_L\rangle_{R_iR_{i+1}}.

QKD over the SEG-ED repeater chain

Let us start the description of our protocol by observing a single key distribution round. Alice initiates each round by distributing logical entanglement to R1R_1, following the method in Section II B. Then, she immediately selects either the Z\mathcal{Z} or X\mathcal{X} basis at random, and independently measures all of her nn recently entangled data qubits in said basis. Using this decoding measurement [22], Alice can, on reception of the classical description of the Pauli frame from R1R_1, determine whether an error has been detected. If an error was indeed detected, she lets R1R_1 know and aborts the distribution round. Otherwise, she obtains the kk-bit string kAk_A and the data qubits in R1R_1 are projected into a logical state which is completely determined by those bits and the chosen basis.

From here, the SEG-ED strategy [24, 50] is employed to teleport the encoded data to Bob hop by hop. We now outline the steps followed at each hop, summarized in Figure 3. Consider that some node, say RiR_i, has the encoded data stored in nn of its data qubits. This node then initiates the logical entanglement generation procedure with the next node in the chain, Ri+1R_{i+1}. Immediately after applying its local encoding circuit, node RiR_i applies a logical BSM to the newly entangled data qubits and the stored encoded data. In the case where CSS encoding is employed, this consists of nn transversal CNOT gates, as well as 2n2n single-qubit measurements [17] (see Appendix B). The results from the encoding and the logical BSM are then transmitted to Ri+1R_{i+1}, which appends them to its own encoding results and determines whether an error is detected. If it was, the distribution round is aborted; otherwise, a Pauli frame adjustment recovers the state containing the encoded data in Ri+1R_{i+1}.

Figure 3. Sequence diagram for the operations corresponding to an intermediate hop using the SEG-ED strategy. The dotted line is included to denote physical separation. Double lines denote a classical transmission of information.

Provided no errors are detected, the encoded data is eventually teleported to Bob. At this point, immediately after his encoding circuit is applied, Bob chooses one of the bases at random and performs his own decoding measurement. Once he receives the corresponding results from RNrR_{N_r}, which he uses to adjust the Pauli frame of his own observation, Bob checks whether any error was detected by either the last logical BSM or by his own decoding. If he detects an error, he simply discards the results, effectively aborting the distribution. Otherwise, he obtains kBk_B. The distribution round is then successfully completed, and the generated bits are employed as described in Section II A.

To maximize the overall rate, Alice initiates subsequent rounds of the protocol, as described above, as soon as possible. That is, each round starts as soon as the first hop of the previous round is completed. We assume every intermediate node has a large enough buffer space (i.e. data qubits) to ensure requests do not accumulate, such that a continuous pipeline of distribution rounds is implemented [24].

Rate analysis of the SEG-ED chain

The main performance metric in QKD protocols is the secret key rate, KK. We compute this in the asymptotic regime and in the absence of eavesdropping as:

K=r∞Rdist,(3)K = r_{\infty} R_{\mathrm{dist}}, \tag*{(3)}

where r∞r_{\infty} is the secret fraction, representing the expected number of secret key bits that can be extracted from each successful round [25, 47], and RdistR_{\mathrm{dist}} is the round completion rate, that is, the rate at which a key distribution round is successfully completed.

In the asymptotic regime, the secret fraction can be computed as [47]:

r∞=k−H(e⃗Z)−H(e⃗X),(4)r_{\infty} = k - H(\vec{e}_{Z}) - H(\vec{e}_{X}), \tag*{(4)}

where:

H(e⃗B):=−∑x=02k−1ex∣Blog⁡2(ex∣B),(5)H(\vec{e}_{B}) := - \sum_{x=0}^{2^{k}-1} e_{x|B} \log_{2}(e_{x|B}), \tag*{(5)}

for B∈{Z,X}B \in\{Z, X\}, and the parameters ex∣Be_{x|B} were defined in § 1.1 A.

From now on, we refer to the parameters ex∣Be_{x|B} above as the error rates of the protocol, though it should be noted that e0∣Be_{0|B} corresponds to the case where no bit error is observed. These rates are derived by introducing a virtual entanglement distribution protocol [24] between Alice and Bob. The virtual protocol proceeds in the same manner as described in § 1.1, except that Alice delays her decoding measurement until the end of the round. Crucially, the virtual protocol is identical to the real protocol provided Alice’s data qubits suffer no memory decoherence [24]. We analyse this protocol in Section III C.

Next, in order to compute the round completion rate, we assume that a sufficient number of data qubits are allocated to the intermediate nodes to allow for pipelining (see § 1.1 C) without any blockage. That is, the amount of requests waiting in the buffers does not indefinitely increase. Under this assumption, we have that

Rdist=pendτhop,(6)R_{\mathrm{dist}} = \frac{p_{\mathrm{end}}}{\tau_{\mathrm{hop}}}, \tag*{(6)}

where τhop\tau_{\mathrm{hop}} is the average time required for one hop to process and forward a distribution request, and pendp_{\mathrm{end}} is the probability that a distribution round is completed.

We assume that local operations (gates, measurements and classical processing) incur no delay, such that τhop:=τ^gn\tau_{\mathrm{hop}} := \hat{\tau}_{gn}, where τ^gj\hat{\tau}_{gj} denotes the average time required to entangle jj pairs of communication qubits. This quantity is computed as:

τ^gj=τinit+τattG^j,(7)\hat{\tau}_{gj} = \tau_{\mathrm{init}} + \tau_{\mathrm{att}}\hat{G}_{j}, \tag*{(7)}

where τinit\tau_{\mathrm{init}} is the time taken to transmit the initialization message downstream, τatt\tau_{\mathrm{att}} is the duration of an entanglement generation attempt, and G^j\hat{G}_{j} is the average number of batches of attempts (see § 1.1 B) it takes to entangle jj pairs of communication qubits.

The values for τinit\tau_{\mathrm{init}} and τatt\tau_{\mathrm{att}} are determined by the location of the BSM module. More precisely, τinit=L0/c\tau_{\mathrm{init}} = L_{0}/c for both the RxTx and MITM layouts, while τatt=2L0/c\tau_{\mathrm{att}} = 2L_{0}/c for the former and τatt=L0/c\tau_{\mathrm{att}} = L_{0}/c for the latter. The value of G^j\hat{G}_{j} [24], on the other hand, is:

G^j=∑t=0j−1∑l=0t(Nmuxt)(tl)(−1)t−l1−(1−pgen)Nmux−l,(8)\hat{G}_{j} = \sum_{t=0}^{j-1} \sum_{l=0}^{t} \binom{N_{\mathrm{mux}}}{t} \binom{t}{l} \frac{(-1)^{t-l}}{1-(1-p_{\mathrm{gen}})^{N_{\mathrm{mux}}-l}}, \tag*{(8)}

where pgenp_{\mathrm{gen}} is the probability that a pair of communication qubits becomes entangled after one attempt, calculated as:

pgen=(pcouηD)2210−L0αch/10,(9)p_{\mathrm{gen}} = \frac{(p_{\mathrm{cou}}\eta_{\mathrm{D}})^{2}}{2} 10^{-L_{0}\alpha_{\mathrm{ch}}/10}, \tag*{(9)}

with pcoup_{\mathrm{cou}} denoting the effective coupling efficiency of each quantum memory to the fibre [24], including any losses related to frequency conversion; ηD\eta_{\mathrm{D}} denoting the efficiency of the single photon detectors in the BSM; αch\alpha_{\mathrm{ch}} denoting the attenuation parameter of the fibre; and the factor of 2 accounting for the fact that only two Bell states may be distinguished if the BSM consists exclusively of linear optics and photodetectors [41].

The remainder of the section is structured as follows. First, we describe the error models we consider for our setup in Section III A. Then, we introduce in Section III B some background on stabiliser and CSS codes, and review the framework we use to analyse the virtual protocol. Finally, we use a recursive approach to complete the analysis in Section III C.

Error models

We account for three main sources of noise in the repeater chain: (1) errors in the initial entanglement between the communication qubits; (2) circuit errors, including measurement and gate errors; and (3) memory decoherence. We now provide the formal descriptions for the relevant noise channels.

We assume that, at the moment that two nodes receive confirmation of a pair of their respective communication qubits becoming entangled, the state in those qubits can be expressed as a Werner state with fidelity FinitF_{\mathrm{init}} with respect to ∣ϕ+⟩=(∣00⟩+∣11⟩)/2|\phi^{+}\rangle= (|00\rangle+ |11\rangle)/\sqrt{2}. Specifically, this initial state is described by a density matrix ρinit\rho^{\mathrm{init}} of the following form:

ρinit=Finit∣ϕ+⟩⟨ϕ+∣+(1−Finit)I4−∣ϕ+⟩⟨ϕ+∣3,(10)\rho^{\mathrm{init}} = F_{\mathrm{init}} \lvert\phi^{+}\rangle\langle\phi^{+}\rvert+ (1-F_{\mathrm{init}})\frac{I_{4}-\lvert\phi^{+}\rangle\langle\phi^{+}\rvert}{3}, \tag*{(10)}

where I4I_{4} denotes the 4×44 \times4 identity matrix.

All circuits considered in this paper consist only of single-qubit measurements, as well as single-qubit and two-qubit gates. We assume that each single-qubit measurement has an independent probability of error δ\delta. In contrast, we consider single-qubit gates to be ideal. This is because these gates are often less error-prone than two-qubit gates [51, 52, 53], leading to an almost negligible contribution to the overall noise. For two-qubit gates, on the other hand, we assume that the pair of qubits on which the gate acts undergo a joint depolarizing channel with probability β\beta. That is, consider some gate acting on qubits A and B. Provided the ideal operation of the gate is described by the unitary matrix UABU_{AB}, the action of the gate on a quantum state with density matrix ρ\rho is described by the following transformation:

ρ→(1−β)UABρUAB†+β4Tr⁡AB{ρ}⊗IAB,(11)\rho\to(1-\beta)U_{AB}\rho U_{AB}^{\dagger}+\frac{\beta}{4}\operatorname{Tr}_{AB}\{\rho\}\otimes I_{AB}, \tag*{(11)}

where Tr⁡AB\operatorname{Tr}_{AB} denotes the partial trace on qubits A and B, and IAB/4I_{AB}/4 corresponds to the maximally mixed state in those qubits.

Lastly, we consider two models for the memory decoherence: dephasing and depolarizing. Suppose a qubit, Q, is stored for some time τ\tau in a quantum memory with coherence time TcohT_{\mathrm{coh}}. Under the dephasing model, Q suffers a phase flip with a probability [1−exp⁡(−τ/Tcoh)]/2[1-\exp(-\tau/T_{\mathrm{coh}})]/2, and remains untouched otherwise. That is, given an initial state with density matrix ρ\rho, the decoherence is expressed via the quantum operation EQmpf(τ)\mathcal{E}_{Q}^{\mathrm{mpf}(\tau)}, defined as:

EQmpf(τ)(ρ)=1+e−τ/Tcoh2ρ+1−e−τ/Tcoh2ZQρZQ,(12)\mathcal{E}_{Q}^{\mathrm{mpf}(\tau)}(\rho)=\frac{1+e^{-\tau/T_{\mathrm{coh}}}}{2}\rho+\frac{1-e^{-\tau/T_{\mathrm{coh}}}}{2}Z_{Q}\rho Z_{Q}, \tag*{(12)}

where ZQZ_{Q} denotes the Pauli-Z operator acting on qubit Q. Under the depolarizing model, on the other hand, the qubit fully depolarizes (i.e. becomes the maximally mixed state) with probability 1−exp⁡(−τ/Tcoh)1-\exp(-\tau/T_{\mathrm{coh}}). This transformation is described by the operation EQmdp(τ)\mathcal{E}_{Q}^{\mathrm{mdp}(\tau)}, defined as:

EQmdp(τ)(ρ)=1+3e−τ/Tcoh4ρ+1−e−τ/Tcoh4(XQρXQ+YQρYQ+ZQρZQ),(13)\mathcal{E}_{Q}^{\mathrm{mdp}(\tau)}(\rho)=\frac{1+3e^{-\tau/T_{\mathrm{coh}}}}{4}\rho+\frac{1-e^{-\tau/T_{\mathrm{coh}}}}{4}\left(X_{Q}\rho X_{Q}+Y_{Q}\rho Y_{Q}+Z_{Q}\rho Z_{Q}\right), \tag*{(13)}

where XQX_{Q} and YQY_{Q} are the Pauli-X and Pauli-Y operators on qubit Q.

Analytical framework

We now review the framework proposed in [24] and outline how we implement and improve it within the context of our analysis. We provide further details about this implementation in Appendix A, where we also introduce relevant tools from the stabiliser formalism [30, 31].

Consider an arbitrary quantum state with density matrix ρ\rho. It is possible to find an orthonormal basis B={∣b0⟩,∣b1⟩,…,∣bD−1⟩}\mathcal{B}=\{\lvert b_{0}\rangle,\lvert b_{1}\rangle,\ldots,\lvert b_{D-1}\rangle\} for its associated state space, where DD is the dimension of the Hilbert space, such that ρ\rho can be written as:

ρ=∑i=0D−1λi∣bi⟩⟨bi∣,(14)\rho=\sum_{i=0}^{D-1}\lambda_i\lvert b_i\rangle\langle b_i\rvert, \tag*{(14)}

for λi≥0\lambda_i \ge0 and ∑iλi=1\sum_i\lambda_i=1. That is, any state can be expressed as a probabilistic mixture of states in some orthonormal basis, e.g., B\mathcal{B}. We define the diagonal representation of the state ρ\rho to be the tuple {Λ⃗,B}\{\vec{\Lambda},\mathcal{B}\}, where we refer to Λ⃗\vec{\Lambda} as the diagonal vector of the state ρ\rho in B\mathcal{B}, defined as:

Λ⃗=[λ0 λ1 … λD−1]T.(15)\vec{\Lambda}=\left[\lambda_0\ \lambda_1\ \ldots\ \lambda_{D-1}\right]^{\mathrm{T}}. \tag*{(15)}

Whenever a state admits a diagonal representation with respect to a specific basis, we say that the state is diagonal in that basis. Moreover, we express the diagonal representation of a state by using only its diagonal vector whenever the basis is clear from context.

System composition can be neatly represented in the diagonal representation. To see this, consider two states, {Λ⃗a,Ba}\{\vec{\Lambda}_{a},\mathcal{B}_{a}\} and {Λ⃗b,Bb}\{\vec{\Lambda}_{b},\mathcal{B}_{b}\}, for two orthonormal bases Ba\mathcal{B}_{a} and Bb\mathcal{B}_{b}. Then, the joint state of the compound system admits a diagonal representation {Λ⃗a⊗KΛ⃗b,Ba⊗KBb}\{\vec{\Lambda}_{a}\otimes_{\mathrm{K}}\vec{\Lambda}_{b},\mathcal{B}_{a}\otimes_{\mathrm{K}}\mathcal{B}_{b}\}, where ⊗K\otimes_{\mathrm{K}} denotes the Kronecker product.

Furthermore, the diagonal representation is convenient to represent certain quantum operations. In particular, consider an operation E\mathcal{E} that results in a diagonal state in some basis, Bout={∣v0⟩,…,∣vD′−1⟩}\mathcal{B}_{\mathrm{out}}=\{\lvert v_{0}\rangle,\ldots,\lvert v_{D'-1}\rangle\}, whenever the input is diagonal in that basis, Bin={∣b0⟩,…,∣bD−1⟩}\mathcal{B}_{\mathrm{in}}=\{\lvert b_{0}\rangle,\ldots,\lvert b_{D-1}\rangle\}, which may coincide with Bout\mathcal{B}_{\mathrm{out}}. That is, E({Λ⃗in,Bin})={Λ⃗out,Bout}\mathcal{E}(\{\vec{\Lambda}_{\mathrm{in}},\mathcal{B}_{\mathrm{in}}\})=\{\vec{\Lambda}_{\mathrm{out}},\mathcal{B}_{\mathrm{out}}\} for any diagonal vector Λ⃗in\vec{\Lambda}_{\mathrm{in}}. Then, the diagonal vector of the output state in Bout\mathcal{B}_{\mathrm{out}} can be computed as:

Λ⃗out=TΛ⃗in,(16)\vec{\Lambda}_{\mathrm{out}}=T\vec{\Lambda}_{\mathrm{in}}, \tag*{(16)}

where TT is a transition matrix of dimension D′×DD' \times D, whose elements are given by:

Tij=⟨vi∣E(∣bj⟩⟨bj∣)∣vi⟩,(17)T_{ij}=\langle v_i\lvert\mathcal{E}(\lvert b_j\rangle\langle b_j\rvert)\rvert v_i\rangle, \tag*{(17)}

with i,ji,j being the row and column indices, respectively. Whenever E\mathcal{E} is trace-preserving, the additional condition ∑iTij=1\sum_i T_{ij}=1 must hold for all jj, while ∑iTij≤1\sum_i T_{ij}\le1 holds for all jj in any trace-non-increasing operation.

Importantly, unlike the diagonal representation of a state, the transition matrix TT does not provide a complete description of the operation E\mathcal{E}, since it is conditioned on the input state being diagonal in Bin\mathcal{B}_{\mathrm{in}}. Nevertheless, this partial description is sufficient for many important operations.

Consider now some positive operator-valued measure (POVM) M={P0,P1,…,PM−1}\mathcal{M} = \{P_0, P_1, \ldots, P_{M-1}\}, where outcome rr is associated to the positive operator PrP_r, acting on a diagonal state {Λ⃗,B}\{\vec{\Lambda},\mathcal{B}\} in orthonormal basis B={∣b0⟩,…,∣bD−1⟩}\mathcal{B} = \{|b_0\rangle,\ldots,|b_{D-1}\rangle\}. The probability that outcome rr occurs is given by:

pr=P⃗rTΛ⃗,(18)p_r = \vec{P}_r^{\mathsf{T}}\vec{\Lambda}, \tag*{(18)}

where P⃗r\vec{P}_r is the measurement vector associated to outcome rr in basis B\mathcal{B}, given by:

P⃗r=[⟨b0∣Pr∣b0⟩,…,⟨bD−1∣Pr∣bD−1⟩]T.(19)\vec{P}_r = \left[\langle b_0|P_r|b_0\rangle,\ldots,\langle b_{D-1}|P_r|b_{D-1}\rangle\right]^{\mathsf{T}}. \tag*{(19)}

The diagonal representation introduced here is particularly convenient when dealing with any combination of stabiliser circuits [30, 31] and Pauli-diagonal channels. Consequently, it is useful for our setting, since CSS codes [33, 34] are a subclass of stabiliser codes [54], and thus the ideal operations of the repeater chain correspond to stabiliser circuits. In addition, all noise processes in Section III A are Pauli-diagonal, i.e., for an operation E\mathcal{E} acting on mm qubits in state ρ\rho, the output is given by:

E(ρ)=∑σ∈Pmλσσρσ†,(20)\mathcal{E}(\rho) = \sum_{\sigma\in\mathcal{P}_m} \lambda_\sigma\sigma\rho\sigma^\dagger, \tag*{(20)}

where ρ\rho is some density matrix; Pm\mathcal{P}_m is the Pauli group on mm qubits; and ∑σ∈Pmλσ=1\sum_{\sigma\in\mathcal{P}_m} \lambda_\sigma= 1, with λσ≥0\lambda_\sigma\ge0.

Based on the above, we note that, for any stabiliser state [30, 31], one can construct an orthonormal basis containing that state such that any Pauli operator maps one element in the basis to another, up to a global phase. This is known as the stabiliser basis [32]. Consequently, the action of any Pauli-diagonal channel can be represented by a transition matrix from this basis to itself. Moreover, ideal stabiliser circuits can be efficiently simulated by updating the underlying basis [32], while leaving the diagonal vector unchanged.

Analysis of the virtual protocol

We now derive the error rates in Eq. (4) and the round completion probability pendp_{\mathrm{end}} within the virtual protocol. First, suppose that Alice and Bob have successfully distributed logical entanglement between them without detecting any errors at any intermediate swap. Then, before the decoding measurement, their end-to-end entangled state has diagonal representation {Λ⃗end,Benc}\{\vec{\Lambda}_{\mathrm{end},\mathcal{B}_{\mathrm{enc}}\}}, where Benc\mathcal{B}_{\mathrm{enc}} is the stabiliser basis for the logical entangled state, ∣ΦL⟩|\Phi_L\rangle, as defined in Eq. (2). Consequently, we compute the error rates as:

ej∣B=P⃗xor=j∣BTΛ⃗endpdcd∣B,(21)e_{j|\mathcal{B}} = \frac{\vec{P}_{\mathrm{xor}=j|\mathcal{B}}^{\mathsf{T}}\vec{\Lambda}_{\mathrm{end}}}{p_{\mathrm{dcd}|\mathcal{B}}}, \tag*{(21)}

where B∈{Z,X}\mathcal{B} \in\{Z, X\}; P⃗xor=j∣B\vec{P}_{\mathrm{xor}=j|\mathcal{B}} is the measurement vector associated to the outcome where the XOR between Alice’s and Bob’s key bits is jj provided the round was completed and they chose to measure in B\mathcal{B}; and pdcd∣Bp_{\mathrm{dcd}|\mathcal{B}} is the probability that no error is detected during the decoding under the same conditions. We compute pdcd∣Bp_{\mathrm{dcd}|\mathcal{B}} as:

pdcd∣B=∑j=02k−1P⃗xor=j∣BTΛ⃗end,(22)p_{\mathrm{dcd}|\mathcal{B}} = \sum_{j=0}^{2^k-1} \vec{P}_{\mathrm{xor}=j|\mathcal{B}}^{\mathsf{T}}\vec{\Lambda}_{\mathrm{end}}, \tag*{(22)}

and we derive P⃗xor=j∣B\vec{P}_{\mathrm{xor}=j|\mathcal{B}} in Appendix B3.

The value of Λ⃗end\vec{\Lambda}_{\mathrm{end}} can be obtained recursively [24, 50]. Specifically, provided our assumption of smooth pipelining holds (see Section II C), we can analyse each hop independently. Thus, we define {Λ⃗hi,Benc}\{\vec{\Lambda}_{h_i},\mathcal{B}_{\mathrm{enc}}\} as the diagonal representation of the state distributed between Alice and Ri+1R_{i+1} after ii hops, provided no errors were detected. It follows that Λ⃗end=Λ⃗hnr\vec{\Lambda}_{\mathrm{end}} = \vec{\Lambda}_{h_{n_r}}. Additionally, we set the first logical entangled state, shared between Alice and R1R_1, to Λ⃗h0:=Λ⃗∣ΦL⟩\vec{\Lambda}_{h_0} := \vec{\Lambda}_{|\Phi_L\rangle}, where {Λ⃗∣ΦL⟩,Benc}\{\vec{\Lambda}_{|\Phi_L\rangle},\mathcal{B}_{\mathrm{enc}}\} is the state generated via the logical entanglement generation procedure.

In order to simplify our analysis, we make the assumption that the time it takes to entangle jj pairs of communication qubits from the start of the logical communication is given by the expected value τ^gj\hat{\tau}_{g_j} at every hop [24]. Notably, though on average the total entanglement generation time remains unchanged under this simplification, the total decoherence suffered by the qubits does not. This is because, as shown in Eqs. (12) and (13), the probability of a qubit maintaining coherence is not linear with respect to the storage time. Specifically, this probability is a convex function of the storage time, so our simplification overestimates the decoherence suffered by the qubits during the entanglement generation phase. Additionally, a corollary of the above simplification is that our analysis disregards queuing times, since the timing of every hop in the repeater chain is deterministic. Naturally, this is not true in a practical setting, as the time spent buffering in packet-switched networks can often be significant. Nevertheless, an analysis of the queueing times would require a more complex model for the queue system (see e.g. the analysis of an uncoded repeater chain in [55]), and important assumptions regarding the traffic of the overall network. Thus, our simplified model can be interpreted as giving us a view of the repeater chain during a period of relatively low-traffic in the network.

Taking the simplifications above into account, we now compute:

Λ⃗hi=TSWP(TMEMΛ⃗hi−1⊗KΛ⃗∣ΦL⟩)phi,(23)\vec{\Lambda}_{h_i} = \frac{\mathsf{T}^{\mathrm{SWP}}\left(\mathsf{T}^{\mathrm{MEM}}\vec{\Lambda}_{h_{i-1}} \otimes_{\mathrm{K}} \vec{\Lambda}_{|\Phi_L\rangle}\right)}{p_{h_i}}, \tag*{(23)}

where TSWP\mathsf{T}^{\mathrm{SWP}} is the transition matrix associated to the operation of the logical BSM selecting the outcomes associated to no errors being detected; TMEM\mathsf{T}^{\mathrm{MEM}} is the transition matrix associated to the memory decoherence of the data qubits in RiR_i for a time τhop\tau_{\mathrm{hop}}; and phip_{h_i} is the probability that no errors are detected by this operation, calculated as:

phi=P⃗SWPT(TMEMΛ⃗hi−1⊗KΛ⃗∣ΦL⟩).(24)p_{h_i} = \vec{P}_{\mathrm{SWP}}^{\mathsf{T}}\left(\mathsf{T}^{\mathrm{MEM}}\vec{\Lambda}_{h_{i-1}} \otimes_{\mathrm{K}} \vec{\Lambda}_{|\Phi_L\rangle}\right). \tag*{(24)}

with P⃗SWP\vec{P}_{\mathrm{SWP}} denoting the measurement vector associated to detecting no errors in the logical BSM. We derive the values of TSWPT^{\mathrm{SWP}}, TMEMT^{\mathrm{MEM}} and P⃗SWP\vec{P}_{\mathrm{SWP}} in Appendix B 2.

We now turn our attention to the derivation of Λ⃗∣ΦL⟩\vec{\Lambda}_{|\Phi_L\rangle}, that is, the Benc\mathcal{B}_{\mathrm{enc}}-diagonal vector of the logical entangled state generated at each hop. As we show in Appendix B 1, this can be computed using only 2n2n-qubit operations, such that:

Λ⃗∣ΦL⟩=TENC(Λ⃗∣+L⟩⊗KΛ⃗∣0L⟩),(25)\vec{\Lambda}_{|\Phi_L\rangle}=T_{\mathrm{ENC}}\left(\vec{\Lambda}_{|+_L\rangle}\otimes_K\vec{\Lambda}_{|0_L\rangle}\right), \tag*{(25)}

where TENCT_{\mathrm{ENC}} is the overall transition matrix representing the encoding operation, and Λ⃗∣+L⟩\vec{\Lambda}_{|+_L\rangle} and Λ⃗∣0L⟩\vec{\Lambda}_{|0_L\rangle} denote the diagonal vectors for the noisy preparations of the data qubits in the upstream and downstream nodes, respectively. The values of these diagonal vectors are derived in Appendix B 1, while the transition matrix can be further decomposed into:

TENC:=TENC,err∏j=1nTENC,gj,(26)T_{\mathrm{ENC}}:=T_{\mathrm{ENC,err}}\prod_{j=1}^{n}T_{\mathrm{ENC},g_j}, \tag*{(26)}

where TENC,errT_{\mathrm{ENC,err}} is the transition matrix representing the errors in the CNOT gates and the measurements, while TENC,gjT_{\mathrm{ENC},g_j} denotes the transition matrix introducing the errors brought over by the noise in the jj-th pair of communication qubits that became entangled. Notably, these matrices take into account not only the initial infidelity of the Bell pairs, 1−Finit1-F_{\mathrm{init}}, but also the memory decoherence suffered by each pair of communication qubits between the time they became entangled to each other and the time the encoding operation was applied, that is, τ^gn−τ^gj\hat{\tau}_{g_n}-\hat{\tau}_{g_j} under the assumptions introduced before.

Finally, we derive the round completion probability, pendp_{\mathrm{end}}, as:

pend=pdcd∣Z∏i=1Nrphi,(27)p_{\mathrm{end}}=p_{\mathrm{dcd}|Z}\prod_{i=1}^{N_r}p_{h_i}, \tag*{(27)}

where we have assumed that the users selected the ZZ in most rounds in order to maximise the fraction of rounds contributing to the final key.

Results

In this section, we discuss three core aspects of the design of SEG-ED repeater chains. First, in Section IV A, we compare the performance of the system using different error detection codes. Next, in Section IV B, we examine the impact of the BSM module’s location and the separation between nodes. Lastly, we investigate in Section IV C how slow technological progress in one parameter can be compensated by improving other aspects of the system.

Comparison between error detection codes

Suppose the hardware of the repeater chain is fixed to the parameters in Table I, and the decoherence model of the quantum memories is known. Additionally, the nodes are placed L0=50L_0=50 km apart from each other and the BSM modules are used inside each of them, as in the RxTx layout in Figure 2(a). These are likely design constraints in early quantum networks, where the breadth of commercially available hardware is limited and deployments must be integrated with pre-existing infrastructure. In fact, the parameters in Table I are meant to offer a realistic view of the capabilities that may be available in the near-to-medium term, with some of them reflecting numbers that have already been achieved in some platforms [52, 53, 56, 57, 58, 59]. Our goal in this section is to select the error detection code that achieves the best performance within these constraints.

Consider first the case where memory decoherence introduces phase flips, according to the dephasing model in Eq. (12). Provided memory effects contribute to a significant portion of the overall noise of the system, as is often the case with sequential schemes, errors in the XX basis will dominate. Therefore, we focus on error detection codes that mitigate errors in that basis; namely, we focus on the family of rotated qubit repetition codes.

The rotated nn-qubit repetition code consists of the codewords ∣+⟩⊗n|+\rangle^{\otimes n} and ∣−⟩⊗n|-\rangle^{\otimes n}. That is, it is an [[n,1]][[n,1]] code, and it can be shown to be capable of detecting up to n−1n-1 phase-flips. This family of codes is valued for its simplicity as well as its practicality. Note that the codewords can be easily prepared through nn single qubit rotations, making the logical zero state ∣0L⟩|0_L\rangle reasonable to reproduce with high fidelity in many platforms. Additionally, the logical plus state, ∣+L⟩|+_L\rangle, corresponds to the rotation of an nn-qubit GHZ state [60], whose preparation methods are well-studied across different platforms [61, 62, 63].

From the family of repetition codes, the case n=3n=3 has often been used to benchmark systems based on encoded repeaters [17, 21, 24], as it corresponds to the smallest code capable of correcting any phase-flip on a single qubit. Nevertheless, here we are focusing on error detection, and thus the scheme with n=2n=2 is also potentially useful. In fact, the two-qubit repetition code has the advantage that the logical plus state corresponds to a Bell state, making its preparation practical even when considering short-term hardware. On the other hand, it is also of interest to explore whether using larger repetition codes, with n>3n>3, can provide any benefit to the performance. To find this out, we plot the secret key rate achieved using three repetition codes of different sizes as a function of the distance between users in Figure 4(a). For reference, we plot the rate of an unencoded solution alongside these, as well as the maximum rate of a repeaterless channel [64], i.e. the PLOB bound, which we calculate here as:

Figure 4. Secret key rate achieved against the distance between users, provided the repeater nodes are separated by 50 km. (a) Rate achieved using repetition codes when memory decoherence follows the dephasing model. (b) Rate achieved using different codes when memory decoherence follows the depolarizing model. In both figures, we also plot the performance of an unencoded repeater chain [24] under the parameters summarized in Table I, as well as the bound for a repeaterless channel, i.e. the PLOB bound [64], at a clock rate of 1 GHz.

PLOB:=−109log⁡2(1−10−Lαch/10),(28)\mathrm{PLOB}:=-10^{9}\log_{2}\left(1-10^{-L\alpha_{\mathrm{ch}}/10}\right), \tag*{(28)}

where we have considered a hypothetical clock rate of 1 GHz. Figure 4(a) reveals that, while the unencoded setup cannot reach distances far beyond 600 km, every encoded system enables positive key rates well above 1000 km. In particular, while all three of those setups manage to convincingly surpass the repeaterless bound, the two-qubit code (labelled ‘n=2n=2’ in the plot) achieves the best performance for most of the effective range of the systems. Specifically, this advantage can be observed up to around 2000 km, where the solution with n=3n=3 briefly becomes comparable before the rates of both solutions vanish. This is of significant practical importance, since the case n=2n=2 is the most feasible to implement with today’s technology, as we previously discussed. Indeed, this result shows that SEG-ED can enable long-distance, trust-free QKD by relying on very simple and practical codes.

On the other hand, while larger codes do slightly extend the theoretical range at which the secret key rate is positive, the actual values of KK dip below 0.1 bps well before the two-qubit code ceases to offer the strongest performance, at which point they likely become impractical. These results suggest that more precise equipment might be needed to take full advantage of larger codes.

Next, we consider the scenario where memory decoherence follows the depolarizing model in Eq. (13). In contrast to the previous case, errors now have comparable effects in both bases. Therefore, while achieving good protection in only one basis can still provide us with a decent performance, thanks to QKD’s robustness to errors in a single basis, it is possible that slightly more complex codes offering symmetric performance may be preferable.

We now introduce two new codes fitting such description. These are the [[4,1]][[4,1]] Leung-Nielsen-Chuang-Yamamoto (LNCY) code [35], and the [[4,2]][[4,2]] so-called “four-qubit code” [36, 65], which we will refer to as the Iceberg-2 code [66] for the sake of clarity. Both of these codes are capable of detecting arbitrary errors (bit-flips or phase-flips) on a single qubit, though they are not capable of correcting any errors.

The LNCY code consists of two codewords, ∣ϕ0000⟩\lvert\phi_{0000}\rangle and ∣ϕ0011⟩\lvert\phi_{0011}\rangle, where we define

∣ϕs⟩:=12(∣s⟩+∣sˉ⟩),(29)\lvert\phi_s\rangle:= \frac{1}{\sqrt{2}}\left(\lvert s\rangle+\lvert\bar{s}\rangle\right), \tag*{(29)}

with ss being a binary bit string. The Iceberg-2 code, on the other hand, consists of both of the LNCY codewords, in addition to ∣ϕ0101⟩\lvert\phi_{0101}\rangle and ∣ϕ0110⟩\lvert\phi_{0110}\rangle. Upon inspection of the codewords above, we notice that all of them may be prepared using a four-qubit GHZ state preparation method, plus potentially some single-qubit adjustments. However, the LNCY code proved to be more practical when looking at the logical plus state, which may be prepared as a product state of two Bell pairs. This contrasts with the Iceberg-2 code, for which the straightforward preparation is to rotate every qubit in a four-qubit GHZ state.

We plot the secret key rates of SEG-ED chains using these two codes, as well as the two-qubit repetition code, in Figure 4(b). The first thing we notice is that the two-qubit repetition code (labelled “Rep2” in the figure) still achieves rates over 1 bps up to distances of around 1400 km, despite its minimal error detection capabilities. In fact, similar to the previous scenario, this code achieves the highest rates for distances roughly between 500 km and 1400 km. Unlike before, however, both larger codes still achieve near-practical rates at longer distances. Specifically, the Iceberg-2 code (labelled “Ice2” in the figure) achieves K>0.1K>0.1 bps up to 2100 km, while the LNCY code does the same up to 1750 km. Furthermore, the rate of the setup using the Iceberg-2 code remains close to that of the repetition code for most of the plotted range, positioning this code as a strong contender for scenarios where memory errors are unbiased. In fact, as expected, it achieves approximately double the secret key rate of the LNCY code at all distances, since twice the logical qubits distributed in each round, although this comes at the cost of a slightly noisier initial state preparation.

Impact of the BSM location

Consider now the following scenario. We want to deploy a quantum network that will be integrated with existing optical fibre infrastructure, but we are not allowed to deploy new nodes. We may choose either the RxTx or MITM layouts but, in the latter case, the BSM module must be deployed at one of the existing nodes. That is, the effective separation between repeater nodes is double in the case of the MITM layout.

Such a scenario is interesting when we consider the potentially high initial cost of deploying new nodes. In fact, the hardware for the BSM is in principle simpler than for a full repeater node, since it does not need quantum memories. Thus, a system based on the MITM layout can be less costly if it allows the separation between repeater nodes (equipped with memories) to become longer, spreading the repeater nodes further apart while maintaining performance.

To investigate this, we plot in Figure 5 the practical range, i.e. the maximum distance at which K>1K>1 bps, as a function of the separation between network nodes, provided either the RxTx or the MITM layouts are used, and using either the two-qubit repetition code or the Iceberg-2 code. We assume that the hardware is the same in all cases, and that the quantum memories suffer depolarizing decoherence. Note that when refer here to network nodes, we refer to any device installed in the network connected to others through fibre. This is not to be confused with the repeater nodes, which are necessarily equipped with quantum memories and are the ones that apply the encoding and swapping operations. That is, the separation between network nodes in the RxTx and MITM layouts corresponds, respectively, to L0L_0 and to L0/2L_0/2.

Figure 5. Maximum distance at which a repeater chain can maintain K>1K > 1 bps against the separation between network nodes; that is, L0L_0 for the RxTx layout and L0/2L_0/2 for the MITM layout. Memory decoherence is depolarizing. The solid (dashed) lines represent repeater chains using the RxTx (MITM) BSM layout. The orange lines correspond to a repeater chain using the two-qubit repetition code (“Rep2”), while the blue lines correspond to a repeater chain using the Iceberg-2 code (“Ice2”).

The first thing that we notice in Figure 5 is that the range for MITM layouts at the optimal separation is longer than for the RxTx layouts. This is to be expected, since for the same separation between repeater nodes, the MITM layout performs strictly better than RxTx, thanks to its faster round trip times. This optimal range is, however, achieved at rather low distances between network nodes (below 30 km for both codes in Figure 5). We can see that, if we consider instead inter-node distances beyond 40 km, typical for long-distance fibre networks, the RxTx layout dominates.

Additionally, we notice that the larger Iceberg-2 code has a higher maximum range, but this maximum occurs at shorter inter-node separations when compared with the repetition code, in either layout. This makes sense, since for shorter hops, the errors in the swapping circuit become more impactful with respect to the effects of memory decoherence, and these errors are largely mitigated by the error-detecting capabilities of the code. That is, a stronger code may work best in denser networks, where nodes are closer together.

In contrast, the two-qubit repetition code outperforms the Iceberg-2 code for any node separation beyond 50 km. This is because, at those distances, the long time it takes to generate a higher number of entangled pairs per hop greatly increases memory decoherence. It is worth mentioning that the two-qubit code can distribute secret keys at a practical rate at a distance of 1000 km for inter-node separations up to slightly over 70 km; while the Iceberg-2 code can do the same when the node separation is below 60 km. This suggests that, when nodes are spread apart, smaller codes could be the best option to enable long-distance quantum key distribution.

Compensating for slow technological progress

So far, we have investigated the design choices that optimize performance within some constrained settings. Specifically, we have assumed that hardware with some desired parameters is available. In this section, we look instead at the scenario in which one of these parameters is worse than its expected value in Table 1, e.g. due to slow technological progress, and we improve a different parameter in an attempt to compensate it.

pcoup_{\mathrm{cou}}ηD\eta_Dαch  (dB/km)\alpha_{\mathrm{ch}}\;(\mathrm{dB}/\mathrm{km})FinitF_{\mathrm{init}}β\betaδ\deltaTcoh(s)T_{\mathrm{coh}}(\mathrm{s})NmuxN_{\mathrm{mux}}c  (km/s)c\;(\mathrm{km}/\mathrm{s})
0.40.90.150.990.0010.001112200000

Table 1. Configuration parameters.

We focus on the particular case in which the initial fidelity, FinitF_{\mathrm{init}}, is lower than previously expected. The reason is that improving this parameter in practical setups is considered particularly challenging. Moreover, when L0L_0 is in the order of tens of kilometres, techniques like link-level entanglement distillation [67, 68] suffer from diminishing returns, where distributing additional entanglement to increase the fidelity results in more memory decoherence, thus counteracting the improvement.

In contrast, we shall assume that the number of quantum channels, NmuxN_{\mathrm{mux}}, can be increased beyond 12. Crucially, this parameter mainly impacts the waiting time and memory decoherence at each hop, much like others such as pcoup_{\mathrm{cou}} or ηD\eta_D. As a consequence, we use it here as a proxy for any improvements on the entanglement distribution procedure, and avoid discussing practical considerations concerning NmuxN_{\mathrm{mux}} in particular.

We plot in Figure 6 the range at which a repeater chain can distribute more than 1 bit per second against NmuxN_{\mathrm{mux}} for different values of FinitF_{\mathrm{init}}, provided the Iceberg-2 code is used. We see that, naturally, the practical range increases along with the number of channels, and decreases as the initial fidelity goes down. More importantly, we see that key distribution can be achieved at practical rates for distances beyond 1000 km even for Finit=0.95F_{\mathrm{init}} = 0.95, provided the number of channels is increased to 30. We consider this a relatively moderate increase, as we have tripled the resources to deal with an infidelity five times as large as the one in Table I. For Finit=0.93F_{\mathrm{init}} = 0.93, however, it appears that no amount of independent quantum channels is enough to extend the range up to 1000 km. In fact, we generally observe in Figure 6 that the effect of increasing NmuxN_{\mathrm{mux}} diminishes for smaller values of FinitF_{\mathrm{init}}, as the errors derived from memory decoherence become less dominant.

Figure 6. Range against the number of quantum channels, NmuxN_{\mathrm{mux}}, for different values of FinitF_{\mathrm{init}} when using the Iceberg-2 code. Memory decoherence is depolarizing, the BSM layout is RxTx and L0=50L_0 = 50 km.

This observation motivates us to investigate the relationship between these two quantities further. Specifically, we want to check how many quantum channels are necessary to achieve a specific performance goal, given a value of FinitF_{\mathrm{init}}. To do so, we plot in Figure 7 the minimum number of channels NmuxN_{\mathrm{mux}} that enables practical quantum secret key distribution with K>1K > 1 bps at a distance of 1000 km, for both the Iceberg-2 and two-qubit repetition codes. This figure shows that the number of channels required to achieve the set goal initially grows slowly as the infidelity becomes larger for both codes. Then, as the errors in the initial entanglement become dominant over the effects of memory decoherence, the required number of channels quickly goes up.

Figure 7. Required number of quantum channels to achieve K>1K > 1 bps at L=1000L = 1000 km against the initial fidelity, for the two-qubit repetition (“Rep2”) and Iceberg-2 (“Ice2”) codes. Memory decoherence is depolarizing, the BSM layout is RxTx and L0=50L_0 = 50 km.

Figure 7 shows that the required number of channels remains relatively low (Nmux≤15N_{\mathrm{mux}} \le15) for fidelities above 97%, provided the Iceberg-2 code is used. In fact, this code can even enable practical key distribution at long distances when the initial fidelity is 94%, given that Nmux=45N_{\mathrm{mux}} = 45 independent channels are available. In contrast, the number of required channels for practical QKD using the two-qubit repetition code is above 50 if Finit=0.97F_{\mathrm{init}} = 0.97, though the same requirement is relaxed to less than 12 if fidelities above 98% can be guaranteed. The reason for the apparent vulnerability of the two-qubit repetition code to infidelity is our assumption of the Werner profile in the initial entanglement. Indeed, Werner states correspond to the ideal Bell pair undergoing a depolarizing channel, which may introduce bit-flips that are never detected, thus accumulating uncontrollably along the chain. Notably, depending on the physical setup used to generate entanglement, the errors in the initial entanglement may come in different profiles which are more easily dealt with by the repetition code.

Conclusion

We have investigated key design choices for sequential entanglement generation with error detection (SEG-ED), using quantum key distribution over a repeater chain as a benchmark under near-term hardware assumptions. To support this analysis, we have extended the framework introduced in [24] to enable the exact modelling of CSS-encoded repeater systems involving stabiliser circuits and Pauli-diagonal noise channels. We have applied this framework to systems using repetition codes, the LNCY code [35] and the four-qubit code introduced in [36, 65], which we refer to as the Iceberg-2 code. Our results highlight the remarkable performance of the two-qubit repetition code. Despite being unable to detect bit-flip errors, this code substantially outperforms unencoded strategies and, under many of the near-term operating conditions considered here, also outperforms larger codes with more general error-detection capabilities. This result is particularly relevant for early proof-of-principle demonstrations of encoded quantum repeaters, since implementing the two-qubit repetition code requires comparatively few physical qubits and relatively simple encoding, swapping, and decoding operations. Its favourable performance therefore suggests that useful demonstrations of SEG-ED may not need to wait for the development of larger codes or more sophisticated codes.

The suitability of this simple code is further supported by our analysis of the entanglement-generation architecture. When the available network sites are separated by approximately 50 km to 70 km, as may occur in typical long-distance fibre communications networks, integrating the optical Bell-state-measurement module into a memory-equipped repeater node is generally more favourable than deploying a separate module at the midpoint of each link. Under these deployment constraints, the two-qubit repetition code remains particularly competitive. The combination of a small code and an architecture that avoids additional intermediate devices could reduce both the hardware complexity and the infrastructure requirements of an initial SEG-ED implementation.

Nevertheless, the two-qubit repetition code is not optimal under all operating conditions. In particular, its performance is more sensitive to imperfections in the initial entanglement when the associated noise is modelled as Werner-depolarizing, since such noise includes error components that the code cannot detect. Instead, the LNCY or Iceberg-2 codes may become preferable in scenarios where the initial generation step is very noisy, as our analysis shows that these four-qubit codes can tolerate lower initial fidelities provided additional resources for generating entanglement in parallel are available.

Notably, the relative disadvantage of the repetition code may be less pronounced in physical platforms where the initial-entanglement noise is biased toward the type of error it detects. Consequently, the choice between the two-qubit and four-qubit codes should depend not only on an aggregate fidelity value, but also on the underlying error profile. This highlight the need for more in-depth platform specific investigations on this setup.

Overall, our results identify the two-qubit repetition code as a strong candidate for near-term SEG-ED implementations. They also show that code selection cannot be separated from the noise model, entanglement-generation architecture, and constraints of the available telecommunications infrastructure. Several effects remain to be incorporated into the analysis, including those related to multi-user traffic and resource sharing, queue buffering and previously mentioned platform-specific such as more detailed error models or restricted sets of operation. Accounting for these effects will be necessary to determine whether the advantages identified here persist in complete repeater networks and to establish the complete design guidelines for experimental implementations.

Acknowledgments

We thank Nicolò Lo Piparo, Bill Munro, Kae Nemoto, Rodney van Meter and Ahmed Lawey for insightful discussions. We acknowledge support from the European Union’s Horizon Europe Framework Programme under the Marie Sklodowska Curie Grant No. 101072637, Project Quantum-Safe Internet (QSI) and the UKRI EPSRC grant No. EP/X028313/1.

Data availability statement

All data that support the findings of this study are included within the article.

Diagonal representation of stabiliser states

In this appendix, we explain the analytical framework used in the paper, previously introduced in Section III B. We remark that, although we use this framework in the specific context of CSS-encoded repeaters, it can also be a valuable tool in the exact analysis of quantum setups composed of stabiliser circuits and Pauli-diagonal channels.

This appendix is structured as follows. First, we give some background on the stabiliser formalism [30, 31] and introduce relevant definitions in Appendix A 1. Then, Appendix A 2 describes how to derive the diagonal representation of a stabiliser state, as well as how to simulate stabiliser circuits, Pauli-diagonal channels and measurements acting on it. Lastly, we enumerate some common noise channels and express them as transition matrices in Appendix A 3.

Background

Let us first define the basics of the stabiliser formalism [30, 31].

Definition 1 An mm-qubit state, say ∣ϕS⟩\lvert\phi_S\rangle, is stabilised by a Pauli operator σ∈Pm\sigma\in\mathcal{P}_m if σ∣ϕS⟩=∣ϕS⟩\sigma\lvert\phi_S\rangle= \lvert\phi_S\rangle.

The set S\mathcal{S} of Pauli operators on mm qubits which stabilise an mm-qubit state is called the stabiliser group, or simply stabiliser. The stabiliser constitutes an Abelian subgroup of Pm\mathcal{P}_m, S⊂Pm\mathcal{S} \subset\mathcal{P}_m, that does not contain the operator −I-\mathcal{I}.

It is often useful to describe stabilisers, or other groups, using a generating set. In particular, for G\mathcal{G} any group with minimal generating set {g1,…,gr}\{g_1,\ldots,g_r\}, we may write G=⟨g1,…,gr⟩\mathcal{G} = \langle g_1,\ldots,g_r\rangle. We refer to the elements of the set as the generators of G\mathcal{G}.

Consider now a stabiliser group S=⟨s1,…,sr⟩\mathcal{S} = \langle s_1,\ldots,s_r\rangle on mm qubits, with rr (non-unique) independent generators. Then, the set of states stabilised by S\mathcal{S}, VS\mathcal{V}_{\mathcal{S}}, constitutes a subspace VS⊂Hm\mathcal{V}_{\mathcal{S}} \subset\mathcal{H}_m of dimension 2m−r2^{m-r}, with Hm\mathcal{H}_m denoting the Hilbert space on mm qubits. When r=mr=m, the stabiliser S\mathcal{S} uniquely identifies a single state, up to a global phase.

Definition 2 A stabiliser group on mm qubits is called “full” if it has mm independent generators.

An mm-qubit state is called a stabiliser state if its stabiliser group is full. That is, a stabiliser state is a state that can be uniquely determined by its stabiliser group.

There is an important subclass of quantum operations which can be efficiently simulated when acting on stabiliser states.

Definition 3 A unitary operation on mm qubits, UU, is a Clifford operation if it maps Pm\mathcal{P}_m to itself under conjugation. That is, if UσU†∈PmU\sigma U^\dagger\in\mathcal{P}_m for every σ∈Pm\sigma\in\mathcal{P}_m.

A circuit consisting exclusively of preparations in the computational basis, Clifford operations and Pauli measurements is a stabiliser circuit.

The fact that stabiliser circuits can be efficiently simulated is a conclusion often called the Gottesman-Knill theorem [30, 31]. Notably, the original proof of this theorem worked exclusively by keeping track of the generators of the state’s stabiliser. However, it was shown [31] that it is possible to improve the efficiency of this simulation by considering an additional list of generators, describing the so-called destabiliser group.

Definition 4 Let S=⟨s1,…,sr⟩\mathcal{S} = \langle s_1,\ldots,s_r\rangle denote a stabiliser group on mm qubits. A destabiliser group, D⊂Pm\mathcal{D} \subset\mathcal{P}_m, associated to S\mathcal{S} is a stabiliser group on mm qubits that can be generated as D:=⟨d1,…,dr⟩\mathcal{D} := \langle d_1,\ldots,d_r\rangle, such that did_i anti-commutes with sis_i and commutes with all other generators of S\mathcal{S}, for all i=1,…,ri=1,\ldots,r. The destabiliser group associated to a stabiliser is not unique.

If S\mathcal{S} is a full stabiliser, we also refer to D\mathcal{D} as full.

Importantly, it is possible to define an orthonormal basis for Hm\mathcal{H}_m with respect to any pair of full stabiliser and destabiliser groups [32].

Definition 5 Let S=⟨s1,…,sm⟩\mathcal{S} = \langle s_1,\ldots,s_m\rangle and D=⟨d1,…,dm⟩\mathcal{D} = \langle d_1,\ldots,d_m\rangle be a full stabiliser and an associated full destabiliser, respectively. Then, the stabiliser basis of Hm\mathcal{H}_m associated to the pair {S,D}\{\mathcal{S},\mathcal{D}\} is defined as BS,D:={∣d∣ϕS⟩∣d∈D}\mathcal{B}_{\mathcal{S},\mathcal{D}} := \{\lvert d\lvert\phi_S\rangle\mid d \in\mathcal{D}\}, where ∣ϕS⟩\lvert\phi_S\rangle is the stabiliser state uniquely determined by S\mathcal{S}.

Lastly, another property of full stabilisers and destabilisers is that they generate the Pauli group up to phase. In fact, given a pair {S,D}\{\mathcal{S},\mathcal{D}\} of associated stabiliser-destabiliser groups on mm qubits, it is possible to decompose any operator σ∈Pm\sigma\in\mathcal{P}_m as σ=αds\sigma= \alpha d s for some s∈Ss \in\mathcal{S} and d∈Dd \in\mathcal{D}, where α∈{±1,±i}\alpha\in\{\pm1,\pm i\}. We denote this by writing σ∈dS\sigma\in d\mathcal{S}, where dSd\mathcal{S} is the coset of S\mathcal{S} in Pm/{±1,±i}\mathcal{P}_m/\{\pm1,\pm i\} determined by dd.

Representation in the stabiliser basis

We now discuss the representation of quantum states as diagonal vectors in a stabiliser basis. Furthermore, we show how to represent their transformations under Pauli-diagonal channels and Clifford operations, and how to simulate the probability distribution when measuring them.

Consider a stabiliser state on mm qubits, ∣ϕS⟩\lvert\phi_S\rangle, associated to the stabiliser group S=⟨s1,…,sm⟩\mathcal{S} = \langle s_1,\ldots,s_m\rangle. Let D=⟨d1,…,dm⟩\mathcal{D} = \langle d_1,\ldots,d_m\rangle be a destabiliser group associated to S\mathcal{S}, and BS,D\mathcal{B}_{\mathcal{S},\mathcal{D}} the stabiliser basis associated to both groups. Suppose the state is transformed under an arbitrary Pauli-diagonal channel, E\mathcal{E}. Then, the resulting state is diagonal in BS,D\mathcal{B}_{\mathcal{S},\mathcal{D}}, and its density matrix can be written as:

E(∣ϕS⟩⟨ϕS∣)=∑σ∈Pmλσ∣ϕS⟩⟨ϕS∣σ†=∑d∈Dλd′∣dϕS⟩⟨ϕS∣d†,(30)\mathcal{E}(\lvert\phi_S\rangle\langle\phi_S\rvert) = \sum_{\sigma\in\mathcal{P}_m}\lambda_\sigma\lvert\phi_S\rangle\langle\phi_S\rvert\sigma^\dagger = \sum_{d\in\mathcal{D}}\lambda'_d\lvert d\phi_S\rangle\langle\phi_S\rvert d^\dagger, \tag*{(30)}

with λσ\lambda_\sigma denoting the weight of the channel E\mathcal{E} as defined in Eq. (20), and λd′\lambda'_d denoting the elements of the diagonal vector representing ρ\rho in BS,D\mathcal{B}_{\mathcal{S},\mathcal{D}}. These weights are defined as:

λd′=∑σ∈dSλσ.(31)\lambda'_d = \sum_{\sigma\in d\mathcal{S}}\lambda_\sigma. \tag*{(31)}

Suppose now that, instead of being in a pure stabiliser state, the mm-qubit system above was instead in an arbitrary mixture of states in BS,D\mathcal{B}_{S,D}, described by the diagonal vector Λ⃗\vec{\Lambda}. After undergoing the channel E\mathcal{E}, the state remains diagonal in the same basis. The reason is that applying a Pauli operator σ∈dS\sigma\in dS to the state results in a permutation of the vector Λ⃗\vec{\Lambda}. This is because each coset dSdS gets mapped, under multiplication by σ\sigma, to a different coset, σdS\sigma dS, and this mapping is the same for all operators in dSdS. That is, if σ′∈dS\sigma' \in dS, then σσ′∈σdS\sigma\sigma' \in\sigma dS. Therefore, it is possible to obtain the new diagonal vector, Λ⃗′\vec{\Lambda}', as:

Λ⃗′=∑d∈Dλd′Tperm(d)Λ⃗,(32)\vec{\Lambda}' = \sum_{d\in D} \lambda'_d T_{\mathrm{perm}(d)}\vec{\Lambda}, \tag*{(32)}

where the weights λd′\lambda'_d are defined as in (31) and Tperm(d)T_{\mathrm{perm}(d)} is the permutation matrix associated to dd. Equivalently, the action of the complete Pauli-diagonal channel E\mathcal{E} can be described by the transition matrix TET_{\mathcal{E}}, defined as:

TE=∑d∈Dλd′Tperm(d).(33)T_{\mathcal{E}} = \sum_{d\in D} \lambda'_d T_{\mathrm{perm}(d)}. \tag*{(33)}

Next, we explain the transformation of the diagonal state under a Clifford operation. Consider the same initial state as in the last step, Λ⃗\vec{\Lambda}, which is now subjected to a Clifford operation UU. It turns out that this operation can be simulated efficiently, as for pure stabiliser states, and it results in a state with the same diagonal vector but expressed in a different stabiliser basis. Specifically, the new stabiliser basis can be derived by conjugating the generators of the initial stabiliser and destabiliser groups by UU [32].

Finally, suppose all mm qubits of the system whose state is described by {Λ⃗,BS,D}\{\vec{\Lambda},\mathcal{B}_{S,D}\} are measured in the computational basis. We now explain how to obtain the probability of an outcome z∈{0,1}mz \in\{0,1\}^{m}, pzp_z. First, use standard tools from the stabiliser formalism to obtain the set, RR, of possible outcomes when measuring all qubits of ∣ϕS⟩|\phi_S\rangle in the computational basis. Note that, for any stabiliser state, there are 2t2^t such outcomes, for t≤mt \leq m, and these all occur with the same probability. Then, the probability of outcome zz can be obtained as:

pz=12t∑r∈RλXzXr,(34)p_z = \frac{1}{2^t}\sum_{r\in R}\lambda_{X_zX_r}, \tag*{(34)}

where XzX_z and XrX_r are the Pauli-X operators associated with the respective outcomes zz and rr (e.g. for m=3m=3, “000” is associated to I\mathrm{I}, “001” is associated to IIX\mathrm{IIX}, and so on) and λXzXr\lambda_{X_zX_r} is the element in Λ⃗\vec{\Lambda} corresponding to the coset of SS in Pm/{±1,±i}\mathcal{P}_m/\{\pm1,\pm i\} to which XzXrX_zX_r belongs. Equivalently, pz=P⃗zTΛ⃗p_z=\vec{P}_z^{\mathsf{T}}\vec{\Lambda}, where P⃗z\vec{P}_z is the measurement vector associated to outcome zz, which contains the value 2−t2^{-t} in the positions of the elements of Λ⃗\vec{\Lambda} which contribute to the sum above, and zeroes in all other positions. We remark that, although the procedure we have just explained is designed for measurements in the computational basis, any measurement which is equivalent to a

Clifford operation followed by this measurement can be simulated by using the other tools described in this section to simulate the Clifford operation.

Typical Pauli channels as transition matrices

Let us now illustrate the framework we have just introduced by discussing some common and very useful Pauli-diagonal channels. These will be useful later to express the effects of the error models defined in Section III A.

For any stabiliser basis BS,D\mathcal{B}_{S,D}, we define the transition matrices of the bit-flip and phase-flip channels with probability pp on qubit QQ, respectively, as:

TQbf(p)=(1−p)I+pTQX,TQpf(p)=(1−p)I+pTQZ.(35)\begin{aligned} T_Q^{\mathrm{bf}(p)} &= (1-p)\mathbb{I}+pT_Q^X,\\ T_Q^{\mathrm{pf}(p)} &= (1-p)\mathbb{I}+pT_Q^Z. \tag*{(35)} \end{aligned}

where I\mathbb{I} is the identity matrix associated to BS,D\mathcal{B}_{S,D}, while TQXT_Q^X and TQZT_Q^Z are the respective permutation matrices in BS,D\mathcal{B}_{S,D} for the XX and ZZ gates acting on qubit QQ. Similarly, we define the transition matrix of the depolarization channel with probability pp on qubit QQ as:

TQdp(p)=(1−3p4)I+p4(TQX+TQZ+TQXTQZ).(36)T_Q^{\mathrm{dp}(p)}=\left(1-\frac{3p}{4}\right)\mathbb{I}+\frac{p}{4}\left(T_Q^X+T_Q^Z+T_Q^XT_Q^Z\right). \tag*{(36)}

Encoded repeaters with CSS codes

In this section, we specify the operations involved in each step of the repeater chain based on CSS codes, and provide a convenient description of these operations within the framework introduced in Section III B. In particular, we first provide some common notation, and then discuss the encoding, swapping and decoding steps [17, 22] in Appendices B1, B2 and B3, respectively.

Besides the stabiliser basis Benc\mathcal{B}_{\mathrm{enc}}, which was already introduced in Section III C, we define two other stabiliser basis, Bzero\mathcal{B}_{\mathrm{zero}} and Bplus\mathcal{B}_{\mathrm{plus}}. These correspond, respectively, to the stabiliser groups for states ∣0L⟩|0_L\rangle and ∣+L⟩|+_L\rangle.

It is also useful to introduce here a shorthand to deal with both decoherence models at once. More precisely, we note that the memory dephasing operation defined in (12) corresponds to a phase-flip channel with probability [1−exp⁡(−τ/Tcoh)]/2[1-\exp(-\tau/T_{\mathrm{coh}})]/2, where τ\tau is the storage time. Meanwhile, the memory depolarizing operation corresponds to its homonymous channel with probability 1−exp⁡(−τ/Tcoh)1-\exp(-\tau/T_{\mathrm{coh}}). These channels can be conveniently expressed as transition matrices based on the matrices from Appendix A3. In general, we denote the transition matrix describing the decoherence of a qubit QQ stored for a duration τ\tau as TQst(τ)T_Q^{\mathrm{st}(\tau)}.

Encoding

Consider two arbitrary nodes, RiR_i and Ri+1R_{i+1}, about to execute the encoding operation. The data qubits in RiR_i, labelled C1C_1 through CnC_n in Figure 8(a), and those in Ri+1R_{i+1}, labelled D1D_1 through DnD_n, are prepared respectively in the diagonal states {Λ⃗∣+L⟩,Bplus}\{\vec{\Lambda}_{|+_L\rangle},\mathcal{B}_{\mathrm{plus}}\} and {Λ⃗∣0L⟩,Bzero}\{\vec{\Lambda}_{|0_L\rangle},\mathcal{B}_{\mathrm{zero}}\}, where the values of the diagonal vectors Λ⃗∣+L⟩\vec{\Lambda}_{|+_L\rangle} and Λ⃗∣0L⟩\vec{\Lambda}_{|0_L\rangle} are derived in Appendix C. Moreover, each pair of communication qubits is labelled c1c_1-d1d_1 through cnc_n-dnd_n in order of the time at which they were successfully entangled. The state of the jj-th pair is diagonal in the Bell basis, which we denote by BBell\mathcal{B}_{\mathrm{Bell}}, and we denote its diagonal vector by Λ⃗gj\vec{\Lambda}_{g_j}.

Figure 8. (a) Initial state before applying the encoding circuit between two repeater nodes. Here, squares (circles) denote data (communication) qubits and twisted lines denote entanglement. (b) Single row of the encoding circuit.

The encoding step consists of employing the entanglement resources in the communication qubits to execute nn remote CNOT gates, applied row-by-row as shown in Figure 8(b). That is, the input to the operation consists of 2n2n data qubits plus 2n2n communication qubits. Nevertheless, in order to minimise the dimension of the transition matrix representing the operation, we rearrange the elements of the operation so that we may first consider that nn ideal CNOT gates are applied between the data qubits, followed by matrices describing the noise within Benc\mathcal{B}_{\mathrm{enc}}. Specifically, we describe the operation in three steps: (1) apply an ideal logical CNOT, which leaves the diagonal vector of the input state as is (i.e. Λ⃗∣+L⟩⊗KΛ⃗∣0L⟩\vec{\Lambda}_{|+_L\rangle}\otimes_{\mathrm{K}}\vec{\Lambda}_{|0_L\rangle}) but updates the basis it is expressed in from Bplus⊗Bzero\mathcal{B}_{\mathrm{plus}}\otimes\mathcal{B}_{\mathrm{zero}} to Benc\mathcal{B}_{\mathrm{enc}}; (2) apply a series of transition matrices representing the effects of noise in each pair of communication qubits; and (3) apply a transition matrix representing the noise originating from the circuit, i.e. during the measurements or the CNOT gates (see Section III A). These steps are summarised in Eq. (26).

Let us first derive the values of TENC,gjT_{\mathrm{ENC},g_j}, for 1≤j≤n1\leq j\leq n, in Eq. (26). Each of these transition matrices can be derived from the diagonal vector of the state in each pair of communication qubits, Λ⃗gj\vec{\Lambda}_{g_j}, and how the destabilisers in the stabiliser basis BBell\mathcal{B}_{\mathrm{Bell}} transform when they are rearranged after the ideal circuit. In particular, suppose the diagonal vector for the jj-th pair of communication qubits is Λ⃗gj=[λIgj,λXcjgj,λZdjgj,λXcjZdjgj]T\vec{\Lambda}_{g_j}=[\lambda_{\mathbb{I}}^{g_j},\lambda_{X_{c_j}}^{g_j},\lambda_{Z_{d_j}}^{g_j},\lambda_{X_{c_j}Z_{d_j}}^{g_j}]^{\mathrm{T}}. Then, the corresponding matrix describing the effects of its noise on

TENC,gj=λIgjI+λXcjgjTDjX+λZdjgjTCjZ+λXcjZdjgjTDjXTCjZ.(37)T_{\mathrm{ENC},g_j}=\lambda_{\mathbb{I}}^{g_j}\mathbb{I}+\lambda_{X_{c_j}}^{g_j}T_{D_j}^{X}+\lambda_{Z_{d_j}}^{g_j}T_{C_j}^{Z}+\lambda_{X_{c_j}Z_{d_j}}^{g_j}T_{D_j}^{X}T_{C_j}^{Z}. \tag*{(37)}

The diagonal vectors Λ⃗gj\vec{\Lambda}_{g_j} can be computed as:

Λ⃗gj=TCjsto(τ^gn−τ^gj)TDjsto(τ^gn−τ^gj)[Finit1−Finit31−Finit31−Finit3].(38)\vec{\Lambda}_{g_j}=T_{C_j}^{\mathrm{sto}(\hat{\tau}_{g_n}-\hat{\tau}_{g_j})}T_{D_j}^{\mathrm{sto}(\hat{\tau}_{g_n}-\hat{\tau}_{g_j})} \begin{bmatrix} F_{\mathrm{init}}\\ \frac{1-F_{\mathrm{init}}}{3}\\ \frac{1-F_{\mathrm{init}}}{3}\\ \frac{1-F_{\mathrm{init}}}{3} \end{bmatrix}. \tag*{(38)}

Next, let us discuss circuit errors, that is, errors in the measurements and in the gates. It can be shown that an error during the measurement of cjc_j induces a bit-flip in DjD_j, due to the classically-controlled XX gate. Similarly, an error during the measurement of djd_j induces a phase-flip in CjC_j. Therefore, the effects of these errors can be described using, respectively, the bit-flip and phase-flip channels with probability δ\delta. Errors in the CNOT gates, on the other hand, may be described as depolarizing channels with probability β\beta. Since all of these are Pauli-diagonal channels, we can rearrange them so that they are applied after the ideal circuit. Doing this, we have that:

TENC,err=∏j=1nTCjpf(δ)TDjbf(δ)[(1−β)2I+(1−β)βTCjdp(1)TDjbf(1/2)+(1−β)βTCjpf(1/2)TDjdp(1)+β2TCjdp(1)TDjdp(1)].(39)T_{\mathrm{ENC,err}}=\prod_{j=1}^{n}T_{C_j}^{\mathrm{pf}(\delta)}T_{D_j}^{\mathrm{bf}(\delta)} \left[(1-\beta)^2\mathbb{I} +(1-\beta)\beta T_{C_j}^{\mathrm{dp}(1)}T_{D_j}^{\mathrm{bf}(1/2)} +(1-\beta)\beta T_{C_j}^{\mathrm{pf}(1/2)}T_{D_j}^{\mathrm{dp}(1)} +\beta^2T_{C_j}^{\mathrm{dp}(1)}T_{D_j}^{\mathrm{dp}(1)}\right]. \tag*{(39)}

Swapping

Let us focus now on the swapping operation in the virtual protocol. Consider the same two repeater nodes as in Appendix B.1, RiR_i and Ri+1R_{i+1}, whose data qubits store the state {Λ⃗∣ΦL⟩,Benc}\{\vec{\Lambda}_{|\Phi_L\rangle},\mathcal{B}_{\mathrm{enc}}\}, as described in that section. Additionally, suppose RiR_i has a second set of data qubits, labelled B1B_1 through BnB_n in Figure 9(a), which is logically entangled to nn data qubits in Alice, labelled A1A_1 through AnA_n in the picture. Specifically, suppose that the state shared between Alice and RiR_i is {TMEMΛ⃗h^i−1,Benc}\{T^{\mathrm{MEM}}\vec{\Lambda}_{\hat{h}_{i-1}},\mathcal{B}_{\mathrm{enc}}\}, where Λ⃗h^i−1\vec{\Lambda}_{\hat{h}_{i-1}} is derived recursively via Eq. (23), and:

Figure 9. (a) Initial state before swapping two logical entangled states at some repeater node. Here, squares denote data qubits and thick twisted lines denote logical entanglement. (b) Circuit of the logical BSM, provided the logical ZZ operators consist only of physical ZZ operators.

TMEM=∏j=1nTBjsto(τhop).(40)T^{\mathrm{MEM}}=\prod_{j=1}^{n}T_{B_j}^{\mathrm{sto}(\tau_{\mathrm{hop}})}. \tag*{(40)}

For convenience, we define Λ⃗SWP,i:=TMEMΛ⃗h^i−1⊗KΛ⃗∣ΦL⟩\vec{\Lambda}_{\mathrm{SWP},i}:=T^{\mathrm{MEM}}\vec{\Lambda}_{\hat{h}_{i-1}}\otimes_{\mathrm{K}}\vec{\Lambda}_{|\Phi_L\rangle} to denote the diagonal vector of the input to this stage, in the basis Benc⊗Benc\mathcal{B}_{\mathrm{enc}}\otimes\mathcal{B}_{\mathrm{enc}}.

In order to swap the two logical entangled states, a logical BSM is applied to the data qubits in RiR_i, as shown in Figure 9(b). Notably, the specific setup in Figure 9(b) is used when employing CSS codes whose logical ZZ operators consist exclusively of physical ZZ operators. However, in some “rotated” codes, such as the qubit-repetition code introduced in Section IV A, the logical ZZ and XX operators swap places, with the former consisting only of physical XX operators. In this case, the setup for the logical BSM can be simply adjusted by switching the basis in which we measure the qubits, that is, by applying a Hadamard rotation just before each measurement in Figure 9(b). Since we have assumed this can be applied without introducing errors (see Section III A), we ignore this possibility and focus on the “unrotated” setup.

To avoid considering all 4n4n qubits in the two logical entangled states while modelling the logical BSM, which acts exclusively on the 2n2n data qubits within RiR_i, we rearrange the input. Firstly, let D∣Φ⟩D_{\lvert\Phi\rangle} denote the destabiliser of the physical state ∣Φ⟩\lvert\Phi\rangle, defined in Eq. (1). We define D‾∣Φ⟩\overline{D}_{\lvert\Phi\rangle} as the counterpart of D∣Φ⟩D_{\lvert\Phi\rangle} when acting on encoded states; for instance, if D∣Φ⟩D_{\lvert\Phi\rangle} includes an XX gate in the first physical qubit of ∣Φ⟩\lvert\Phi\rangle, then, D‾∣Φ⟩\overline{D}_{\lvert\Phi\rangle} includes a logical XX operator acting on the first logical qubit of ∣ΦL⟩\lvert\Phi_L\rangle. Then, we have that:

∣ΦL⟩AB⊗∣ΦL⟩CD=1∣D‾∣Φ⟩∣∑σ∈D‾∣Φ⟩σAD∣ΦL⟩AD⊗σBC∗∣ΦL⟩BC,(41)\lvert\Phi_L\rangle_{AB} \otimes\lvert\Phi_L\rangle_{CD} = \frac{1}{\sqrt{\lvert\overline{D}_{\lvert\Phi\rangle}\rvert}} \sum_{\sigma\in\overline{D}_{\lvert\Phi\rangle}} \sigma_{AD}\lvert\Phi_L\rangle_{AD}\otimes\sigma_{BC}^{*}\lvert\Phi_L\rangle_{BC}, \tag*{(41)}

where we are using A:≡A1…AnA \mathrel{\vcentcolon\equiv} A_1\ldots A_n, B:≡B1…BnB \mathrel{\vcentcolon\equiv} B_1\ldots B_n, C:≡C1…CnC \mathrel{\vcentcolon\equiv} C_1\ldots C_n and D:≡D1…DnD \mathrel{\vcentcolon\equiv} D_1\ldots D_n for brevity.

Using Eq. (41), and taking into account the Pauli-diagonal nature of the errors in the setup, we can prove that the state in AD after the BSM and the adjustments, provided the outcome is rr, is diagonal in Benc\mathcal{B}_{\mathrm{enc}} with diagonal vector Λ⃗hi∣bsm=r\vec{\Lambda}_{\mathrm{hi}\mid\mathrm{bsm}=r}, given by:

Λ⃗hi∣bsm=r=1∣D‾∣Φ⟩∣Tadj,r∑σ∈D‾∣Φ⟩Tout,σdiag⁡{P⃗bsm=r∣in,σ}Λ⃗SWP,ipbsm=r,(42)\vec{\Lambda}_{\mathrm{hi}\mid\mathrm{bsm}=r} = \frac{1}{\lvert\overline{D}_{\lvert\Phi\rangle}\rvert} \frac{\mathrm{T}^{\mathrm{adj},r}\sum_{\sigma\in\overline{D}_{\lvert\Phi\rangle}}\mathrm{T}^{\mathrm{out},\sigma}\operatorname{diag}\{\vec{P}^{\mathrm{bsm}=r\mid\mathrm{in},\sigma}\}\vec{\Lambda}_{\mathrm{SWP},i}} {p_{\mathrm{bsm}=r}}, \tag*{(42)}

where Tadj,r\mathrm{T}^{\mathrm{adj},r} is the transition matrix denoting the adjustment conditioned on outcome rr; Tout,σ\mathrm{T}^{\mathrm{out},\sigma} and Tin,σ\mathrm{T}^{\mathrm{in},\sigma} are matrices that map dADdBC∣ΦL⟩AB∣ΦL⟩CDd_{AD}d_{BC}\lvert\Phi_L\rangle_{AB}\lvert\Phi_L\rangle_{CD} to dADσAD∣ΦL⟩ADd_{AD}\sigma_{AD}\lvert\Phi_L\rangle_{AD} and dBCσBC∗∣ΦL⟩BCd_{BC}\sigma_{BC}^{*}\lvert\Phi_L\rangle_{BC}, respectively, for every dADdBCd_{AD}d_{BC} in the destabiliser of ∣ΦL⟩⊗2\lvert\Phi_L\rangle^{\otimes2}; P⃗bsm=r∣in,σ\vec{P}^{\mathrm{bsm}=r\mid\mathrm{in},\sigma} is the measurement vector corresponding to the BSM outcome rr when the input is diagonal in Benc\mathcal{B}_{\mathrm{enc}}; diag⁡{v⃗}\operatorname{diag}\{\vec{v}\} denotes a diagonal matrix with v⃗\vec{v} as its main diagonal; and pbsm=rp_{\mathrm{bsm}=r} is the probability that the outcome of the BSM is rr, which is given by:

pbsm=r=1∣D‾∣Φ⟩∣∑σ∈D‾∣Φ⟩P⃗bsm=r∣in,σΛ⃗SWP,i.(43)p_{\mathrm{bsm}=r} = \frac{1}{\lvert\overline{D}_{\lvert\Phi\rangle}\rvert} \sum_{\sigma\in\overline{D}_{\lvert\Phi\rangle}} \vec{P}^{\mathrm{bsm}=r\mid\mathrm{in},\sigma}\vec{\Lambda}_{\mathrm{SWP},i}. \tag*{(43)}

Let 2tx2^{t_x} and 2tz2^{t_z} denote the number of outcomes identifying one particular codeword in the logical XX and ZZ bases, with tx≤n−kt_x\le n-k and tz≤n−kt_z\le n-k. There are ∣D‾∣Φ⟩∣=4k\lvert\overline{D}_{\lvert\Phi\rangle}\rvert=4^k possible legitimate adjustments, and each of these is identified by any one of 2tx+tz2^{t_x+t_z} equiprobable BSM outcomes, corresponding to a specific combination of codewords. Notably, we can show that Λ⃗hi∣bsm=r1=Λ⃗hi∣bsm=r2\vec{\Lambda}_{\mathrm{hi}\mid\mathrm{bsm}=r_1}=\vec{\Lambda}_{\mathrm{hi}\mid\mathrm{bsm}=r_2} and pbsm=r1=pbsm=r2p_{\mathrm{bsm}=r_1}=p_{\mathrm{bsm}=r_2} for any two outcomes r1,r2r_1,r_2 of the 22k+tx+tz2^{2k+t_x+t_z} corresponding to detecting no errors. Therefore, it suffices to select one of those as the reference outcome to derive Λ⃗hi\vec{\Lambda}_{\mathrm{hi}} and phip_{\mathrm{hi}}. For convenience, we assume that this reference outcome is selected such that no adjustment is required and derive the remaining objects in Eq. (23) as:

TSWP=1∣D‾∣Φ⟩∣∑σ∈D‾∣Φ⟩Tout,σdiag⁡{P⃗bsm=rref∣in,σ},(44)\mathrm{T}^{\mathrm{SWP}} = \frac{1}{\lvert\overline{D}_{\lvert\Phi\rangle}\rvert} \sum_{\sigma\in\overline{D}_{\lvert\Phi\rangle}} \mathrm{T}^{\mathrm{out},\sigma}\operatorname{diag}\{\vec{P}^{\mathrm{bsm}=r_{\mathrm{ref}}\mid\mathrm{in},\sigma}\}, \tag*{(44)}

and

P⃗SWP=2tx+tz∑σ∈D‾∣Φ⟩P⃗bsm=rref∣in,σ,(45)\vec{P}_{\mathrm{SWP}} = 2^{t_x+t_z} \sum_{\sigma\in\overline{D}_{\lvert\Phi\rangle}} \vec{P}^{\mathrm{bsm}=r_{\mathrm{ref}}\mid\mathrm{in},\sigma}, \tag*{(45)}

where rrefr_{\mathrm{ref}} is the reference outcome.

Finally, we derive P⃗bsm=rref\vec{P}^{\mathrm{bsm}=r_{\mathrm{ref}}} as:

P⃗bsm=rref=P⃗SWP,idealTSWP,err,(46)\vec{P}^{\mathrm{bsm}=r_{\mathrm{ref}}} = \vec{P}^{\mathrm{SWP},\mathrm{ideal}}\mathrm{T}^{\mathrm{SWP},\mathrm{err}}, \tag*{(46)}

where P⃗SWP,ideal\vec{P}^{\mathrm{SWP},\mathrm{ideal}} is the measurement vector corresponding to outcome rrefr_{\mathrm{ref}} in the ideal setup, and TSWP,err\mathrm{T}^{\mathrm{SWP},\mathrm{err}} is the transition matrix representing the gate and measurement errors in the logical BSM circuit. The value of P⃗SWP,ideal\vec{P}^{\mathrm{SWP},\mathrm{ideal}} can be derived using the techniques described in Appendix A 2, while that of TSWP,errT^{\mathrm{SWP},\mathrm{err}} is given by:

TSWP,err=∏j=1nTBjpf(δ)TCjbf(δ)[(1−β)I+βTBjdp(1)TCjdp(1)],(47)T^{\mathrm{SWP},\mathrm{err}} = \prod_{j=1}^{n} T_{B_j}^{\mathrm{pf}(\delta)} T_{C_j}^{\mathrm{bf}(\delta)} \left[(1-\beta)\mathbb{I} + \beta T_{B_j}^{\mathrm{dp}(1)} T_{C_j}^{\mathrm{dp}(1)}\right], \tag*{(47)}

Measurement-based decoding

In this section, we explain how to derive the vectors P⃗xor=j∣B\vec{P}_{\mathrm{xor}=j|B}, for j∈{0,1}kj \in\{0,1\}^{k} and B∈{Z,X}B \in\{Z,X\}, defined in Eq. (21). Firstly, we reiterate our previous point from Appendix B 2 regarding the measurements in “rotated” codes, in which applying a Hadamard rotation before the measurement of each qubit is required. Again, since this rotation can be applied without errors, we focus on the “unrotated” case. In the standard setup, errors in the measurements can be modelled as phase-flip or bit-flip channels with probability δ\delta. In particular, we compute:

P⃗xor=j∣X=∑ka,kb∈{0,1}kka⊕kb=jP⃗meas=(ka,kb)∣X∏Q∈SdataPQpf(δ),\vec{P}_{\mathrm{xor}=j|X} = \sum_{\substack{k_a,k_b \in\{0,1\}^{k} \\ k_a \oplus k_b = j}} \vec{P}^{\mathrm{meas}=(k_a,k_b)|X} \prod_{Q \in S_{\mathrm{data}}} P_Q^{\mathrm{pf}(\delta)},
P⃗xor=j∣Z=∑ka,kb∈{0,1}kka⊕kb=jP⃗meas=(ka,kb)∣Z∏Q∈SdataPQbf(δ),(48)\vec{P}_{\mathrm{xor}=j|Z} = \sum_{\substack{k_a,k_b \in\{0,1\}^{k} \\ k_a \oplus k_b = j}} \vec{P}^{\mathrm{meas}=(k_a,k_b)|Z} \prod_{Q \in S_{\mathrm{data}}} P_Q^{\mathrm{bf}(\delta)}, \tag*{(48)}

where P⃗meas=(ka,kb)∣B\vec{P}^{\mathrm{meas}=(k_a,k_b)|B} is the measurement vector in Benc\mathcal{B}_{\mathrm{enc}} corresponding to obtaining results kak_a and kbk_b in Alice and Bob, respectively, provided they both measure in basis BB; and SdataS_{\mathrm{data}} is the set of the data qubits in Alice and Bob involved in the measurement. The vectors P⃗meas=(ka,kb)∣B\vec{P}^{\mathrm{meas}=(k_a,k_b)|B} can be derived using the methods laid out in Appendix A 2.

Preparation of the data qubits

In this section, we describe the circuits we have considered for the preparation of ∣+L⟩|+_L\rangle and ∣0L⟩|0_L\rangle in the codes

introduced in Section IV. Remarkably, these states can be obtained by using a preparation based on the synthesis of an nn-qubit GHZ state [60] for all codes. The only exception is the logical zero state in the rotated repetition code, but this can be trivially prepared by initializing all data qubits to ∣0⟩|0\rangle and then applying single-qubit Hadamard rotations. To prove this, we first define the GHZ state and compare it against the states we aim to prepare in each code, and then detail the preparation circuit for the GHZ state.

The nn-qubit GHZ state is a genuinely multipartite entangled state defined as

∣GHZn⟩=12(∣0⟩⊗n+∣1⟩⊗n).(49)|\mathrm{GHZ}_n\rangle= \frac{1}{\sqrt{2}}\left(|0\rangle^{\otimes n} + |1\rangle^{\otimes n}\right). \tag*{(49)}

By comparison, we see that ∣GHZn⟩=∣ϕ0n⟩|\mathrm{GHZ}_n\rangle= |\phi_0^n\rangle as defined in Eq. (29), where 0n0^n denotes here an nn-bit string of all zeroes. This already reveals the relationship between the GHZ state and the codes considered in this paper. Specifically, we have that the logical plus state in the rotated repetition code can be obtained by preparing ∣GHZn⟩|\mathrm{GHZ}_n\rangle and then rotating it with nn Hadamard gates; the logical plus state in the Iceberg-2 code is prepared in the same way, for n=4n=4; the logical zero state for the LNCY and the Iceberg-2 codes, which is identical, is simply ∣GHZ4⟩|\mathrm{GHZ}_4\rangle; and, lastly, the logical plus state in the LNCY code corresponds to two Bell pairs in a product state, each of which is identical to ∣GHZ2⟩|\mathrm{GHZ}_2\rangle.

We next describe how to prepare this state. While there exist some methods to generate local copies of this state using probabilistic local operations, speaking to the practicality of the codes considered here, we assume that we employ a deterministic gate-based method. In particular, we consider the circuit in Figure 10, where we labelled the qubits Q1Q_1 through QnQ_n for convenience. This circuit consists only of a single Hadamard gate, followed by n−1n-1 CNOT gates, so we are well-equipped to analyse it using the tools in Appendix A.

Figure 10. Preparation circuit for an nn-qubit GHZ state.

We analyse the circuit by rearranging the CNOT errors to the start of the circuit. This way, before applying any ideal gate, we have the state ∣Λ⃗GHZ,n,Z⊗n⟩|\vec{\Lambda}_{\mathrm{GHZ},n,\mathcal{Z}^{\otimes n}}\rangle, with diagonal vector:

Λ⃗GHZ,n=∏j=2n[(1−β)I+βTQ1bf(1/2)TQj−1bf(1/2)TQjbf(1/2)]Λ⃗1,(50)\vec{\Lambda}_{\mathrm{GHZ},n} = \prod_{j=2}^{n} \left[(1-\beta)\mathbb{I} + \beta T_{Q_1}^{\mathrm{bf}(1/2)} T_{Q_{j-1}}^{\mathrm{bf}(1/2)} T_{Q_j}^{\mathrm{bf}(1/2)}\right]\vec{\Lambda}_1, \tag*{(50)}

where Λ⃗1\vec{\Lambda}_1 denotes the trivial diagonal vector, with a single one as the first element. To obtain the final state, it suffices to update the basis according to the rule in [32], while the diagonal vector remains unchanged.

References

References

  1. [1]E. Gibney, The quantum gold rush, Nature 574, 22 (2019).
  2. [2]M. Brooks, Beyond quantum supremacy: the hunt for useful quantum computers, Nature 574, 19 (2019).DOI
  3. [3]H. J. Kimble, The Quantum Internet, Nature 453, 1023 (2008).DOI
  4. [4]S. Wehner, D. Elkouss, and R. Hanson, Quantum internet: A vision for the road ahead, Science 362, eaam9288 (2018), https://www.science.org/doi/pdf/10.1126/science.aam9288.
  5. [5]J. Illiano, M. Caleffi, A. Manzalini, and A. S. Cacciapuoti, Quantum internet protocol stack: A comprehensive survey, Computer Networks 213, 109092 (2022).DOI
  6. [6]Y. Cao, Y. Zhao, Q. Wang, J. Zhang, S. X. Ng, and L. Hanzo, The evolution of quantum key distribution networks: On the road to the quantum internet, IEEE Communications Surveys & Tutorials 24, 839 (2022).DOI
  7. [7]K. Azuma, S. E. Economou, D. Elkouss, P. Hilaire, L. Jiang, H.-K. Lo, and I. Tzitrin, Quantum repeaters: From quantum networks to the quantum internet, Rev. Mod. Phys. 95, 045006 (2023).DOI
  8. [8]J. F. Dynes, A. Wonfor, W. W.-S. Tam, A. W. Sharpe, R. Takahashi, M. Lucamarini, A. Plews, Z. L. Yuan, A. R. Dixon, J. Cho, Y. Tanizawa, J.-P. Elbers, H. Greißer, I. H. White, R. V. Penty, and A. J. Shields, Cambridge quantum network, npj Quantum Information 5, 101 (2019).DOI
  9. [9]S. K. Joshi, D. Aktas, S. Wengrowsky, M. Lončarić, S. P. Neumann, B. Liu, T. Scheidl, G. C. Lorenzó, Željko Samec, L. Kling, A. Qiu, M. Razavi, M. Stipčević, J. G. Rarity, and R. Ursin, A trusted node-free eight-user metropolitan quantum communication network, Science Advances 6, eaba0959 (2020), https://www.science.org/doi/pdf/10.1126/sciadv.aba0959.
  10. [10]Y.-A. Chen, Q. Zhang, T.-Y. Chen, W.-Q. Cai, S.-K. Liao, J. Zhang, K. Chen, J. Yin, J.-G. Ren, Z. Chen, S.-L. Han, Q. Yu, K. Liang, F. Zhou, X. Yuan, M.-S. Zhao, T.-Y. Wang, X. Jiang, L. Zhang, W.-Y. Liu, Y. Li, Q. Shen, Y. Cao, C.-Y. Lu, R. Shu, J.-Y. Wang, L. Li, N.-L. Liu, F. Xu, X.-B. Wang, C.-Z. Peng, and J.-W. Pan, An integrated space-to-ground quantum communication network over 4,600 kilometres, Nature 589, 214 (2021).DOI
  11. [11]M. Alshowk, B. P. Williams, P. G. Evans, N. S. Rao, E. M. Simmerman, H.-H. Lu, N. B. Lingaraju, A. M. Weiner, C. E. Marvinnney, Y.-Y. Pai, B. J. Lawrie, N. A. Peters, and J. M. Lukens, Reconfigurable quantum local area network over deployed fiber, PRX Quantum 2, 040304 (2021).
  12. [12]H.-J. Briegel, W. Dür, J. I. Cirac, and P. Zoller, Quantum repeaters: The role of imperfect local operations in quantum communication, Phys. Rev. Lett. 81, 5932 (1998).DOI
  13. [13]W. J. Munro, K. Azuma, K. Tamaki, and K. Nemoto, Inside quantum repeaters, IEEE Journal of Selected Topics in Quantum Electronics 21, 78 (2015).DOI
  14. [14]S. Muralidharan, L. Li, J. Kim, N. Lütkenhaus, M. D. Lukin, and L. Jiang, Optimal architectures for long distance quantum communication, Scientific Reports 6, 20463 (2016).DOI
  15. [15]C. H. Bennett, D. P. DiVincenzo, J. A. Smolin, and W. K. Wootters, Mixed-state entanglement and quantum errorDOI
  16. [16]M. Razavi, Fiber-based quantum repeaters, in Photonic Quantum Technologies (John Wiley & Sons, Ltd, 2023) Chap. 24, pp. 675–691.DOI
  17. [17]L. Jiang, J. M. Taylor, K. Nemoto, W. J. Munro, R. Van Meter, and M. D. Lukin, Quantum repeater with encoding, Phys. Rev. A 79, 032325 (2009).DOI
  18. [18]L.-M. Duan, M. D. Lukin, J. I. Cirac, and P. Zoller, Long-distance quantum communication with atomic ensembles and linear optics, Nature 414, 413 (2001).DOI
  19. [19]W. J. Munro, A. M. Stephens, S. J. Devitt, K. A. Harrison, and K. Nemoto, Quantum communication without the necessity of quantum memories, Nature Photonics 6, 777 (2012).arxiv.org/abs/1306.4137
  20. [20]S. Muralidharan, J. Kim, N. Lütkenhaus, M. D. Lukin, and L. Jiang, Ultrafast and fault-tolerant quantum communication across long distances, Phys. Rev. Lett. 112, 250501 (2014).pubmed.ncbi.nlm.nih.gov/25014798
  21. [21]Y. Jing, D. Alsina, and M. Razavi, Quantum key distribution over quantum repeaters with encoding: Using error detection as an effective postselection tool, Phys. Rev. Appl. 14, 064037 (2020).DOI
  22. [22]Y. Jing and M. Razavi, Simple efficient decoders for quantum key distribution over quantum repeaters with encoding, Phys. Rev. Appl. 15, 044027 (2021).DOI
  23. [23]Y. Shi, A. Patil, and S. Guha, Measurement-based entanglement distillation and constant-rate quantum repeaters over arbitrary distances, Phys. Rev. Lett. 135, 130803 (2025).DOI
  24. [24]J. R. Rey-Domínguez and M. Razavi, Rethinking quantum repeaters: balancing scalability, feasibility, and interoperability, Quantum Science and Technology 11, 045016 (2026).
  25. [25]V. Scarani, H. Bechmann-Pasquinucci, N. J. Cerf, M. Dušek, N. Lütkenhaus, and M. Peev, The security of practical quantum key distribution, Rev. Mod. Phys. 81, 1301 (2009).DOI
  26. [26]H.-K. Lo, M. Curty, and K. Tamaki, Secure quantum key distribution, Nature Photonics 8, 595 (2014).DOI
  27. [27]F. Xu, X. Ma, Q. Zhang, H.-K. Lo, and J.-W. Pan, Secure quantum key distribution with realistic devices, Rev. Mod. Phys. 92, 025002 (2020).DOI
  28. [28]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. Tomamichel, V. C. Usenko, G. Vallone, P. Villoresi, and P. Wallden, Advances in quantum cryptography, Adv. Opt. Photon. 12, 1012 (2020).
  29. [29]M. Razavi, An Introduction to Quantum Communications Networks, 2053-2571 (Morgan & Claypool Publishers, 2018).
  30. [30]D. Gottesman, The heisenberg representation of quantum computers (1998), arXiv:quant-ph/9807006 [quant-ph].arxiv.org/abs/quant-ph/9807006
  31. [31]S. Aaronson and D. Gottesman, Improved simulation of stabilizer circuits, Phys. Rev. A 70, 052328 (2004).DOI
  32. [32]T. J. Yoder, A generalization of the stabilizer formalism for simulating arbitrary quantum circuits (2012).
  33. [33]A. R. Calderbank and P. W. Shor, Good quantum error-correcting codes exist, Phys. Rev. A 54, 1098 (1996).pubmed.ncbi.nlm.nih.gov/9913578
  34. [34]A. Steane, Multiple-particle interference and quantum er- ror correction, Proceedings of the Royal Society A 452, 2551 (1996).
  35. [35]D. W. Leung, M. A. Nielsen, I. L. Chuang, and Y. Yamamoto, Approximate quantum error correction can lead to better codes, Phys. Rev. A 56, 2567 (1997).DOI
  36. [36]L. Vaidman, L. Goldenberg, and S. Wiesner, Error prevention scheme with four particles, Phys. Rev. A 54, R1745(R) (1996).DOI
  37. [37]C. Simon and W. T. M. Irvine, Robust long-distance entanglement in a loophole-free bell test with ions and photons, Phys. Rev. Lett. 91, 140405 (2003).DOI
  38. [38]C. Simon, H. de Riedmatten, M. Afzelius, N. Sangouard, H. Zbinden, and N. Gisin, Quantum repeaters with photon pair sources and multimode memories, Phys. Rev. Lett. 98, 190503 (2007).pubmed.ncbi.nlm.nih.gov/17677612
  39. [39]D. L. Moehring, P. Maunz, S. Olmschenk, K. C. Young, D. N. Matsukevich, L.-M. Duan, and C. Monroe, Entanglement of single-atom quantum bits at a distance, Nature 449, 68 (2007).pubmed.ncbi.nlm.nih.gov/17805290
  40. [40]H. Bernien, L. Childress, L. Robledo, M. Markham, D. Twitchen, and R. Hanson, Two-photon quantum interference from separate nitrogen vacancy centers in diamond, Phys. Rev. Lett. 108, 043604 (2012).pubmed.ncbi.nlm.nih.gov/22400844
  41. [41]J. Calsamiglia and N. Lütkenhaus, Maximum efficiency of a linear-optical bell-state analyzer, Applied Physics B 72, 67 (2001).DOI
  42. [42]C. Jones, D. Kim, M. T. Rakher, P. G. Kwiat, and T. D. Ladd, Design and analysis of communication protocols for quantum repeater networks, New Journal of Physics 18, 083015 (2016).DOI
  43. [43]L. Bianchi, C. Marconi, and D. Bacco, Bell state measurements in quantum optics: a review of recent progress and open challenges, Quantum Science and Technology 11, 023001 (2026).DOI
  44. [44]N. J. Hazell and C. E. Little, 9 - submerged plant, in Undesrea Fiber Communication Systems (Elsevier Inc, 2002) pp. 343–376.
  45. [45]R. J. Feuerstein, Field measurements of deployed fiber, in Optical Fiber Communication Conference and Exposition and The National Fiber Optic Engineers Conference (Optica Publishing Group, 2005) p. NThC4.
  46. [46]C. H. Bennett and G. Brassard, Quantum cryptography: Public key distribution and coin tossing, Theoretical Computer Science 560, 7 (2014), theoretical Aspects of Quantum Cryptography – celebrating 30 years of BB84.DOI
  47. [47]L. Sheridan and V. Scarani, Security proof for quantum key distribution using qudit systems, Phys. Rev. A 82, 030301 (2010).DOI
  48. [48]K. Hesham, D. G. England, P. C. Humphreys, P. J. Bustard, V. M. Acosta, J. Nunn, and B. J. Sussman, Quantum memories: emerging applications and recent advances, Journal of Modern Optics 63, 2005 (2016), pMID: 27695198, https://doi.org/10.1080/09500340.2016.1148212.
  49. [49]Y. Lei, F. K. Asadi, T. Zhong, A. Kuzmich, C. Simon, and M. Hosseini, Quantum optical memory for entanglement distribution, Optica 10, 1511 (2023).arxiv.org/abs/2304.09397
  50. [50]J. Rey-Domínguez and M. Razavi, Quantum key distribution over an encoded repeater chain with sequential swapping, in 2025 International Conference on Quantum Communications, Networking, and Computing (QCNC) (2025) pp. 323–330.
  51. [51]K. R. Brown, A. C. Wilson, Y. Colombe, C. Ospelkaus, A. M. Meier, E. Knill, D. Leibfried, and D. J. Wineland, Single-qubit-gate error below 10−4 in a trapped ion, Phys. Rev. A 84, 030303 (2011).
  52. [52]T. P. Harty, D. T. C. Allcock, C. J. Ballance, L. Guidoni, H. A. Janacek, N. M. Linke, D. N. Stacey, and D. M. Lucas, High-fidelity preparation, gates, memory, and readout of a trapped-ion quantum bit, Phys. Rev. Lett. 113, 220501 (2014).DOI
  53. [53]T. P. Harty, M. A. Sepiol, D. T. C. Allcock, C. J. Ballance, J. E. Tarlton, and D. M. Lucas, High-fidelity trapped-ion quantum logic using near-field microwaves, Phys. Rev. Lett. 117, 140501 (2016).DOI
  54. [54]R. Cleve and D. Gottesman, Efficient computations of encodings for quantum error correction, Phys. Rev. A 56, 76 (1997).DOI
  55. [55]M. G. de Andrade, E. A. V. Milligen, L. Bacciottini, A. Chandra, S. Pouryousef, N. K. Panigrahy, G. Vardoyan, and D. Towsley, On the analysis of quantum repeater chains with sequential swaps (2024), 2405.18252.arxiv.org/abs/2405.18252
  56. [56]F. Marsili, V. B. Verma, J. A. Stern, S. Harrington, A. E. Lita, T. Gerrits, I. Vayshenker, B. Baek, M. D. Shaw, R. P. Mirin, and S. W. Nam, Detecting single infrared photons with 93% system efficiency, Nature Photonics 7, 210 (2013).
  57. [57]International Telecommunication Union, ITU-T G.654: Characteristics of a cut-off shifted single-mode optical fibre and cable, Standard (International Telecommunication Union, 2024).
  58. [58]C. R. Clark, H. N. Tinkey, B. C. Sawyer, A. M. Meier, K. A. Burkhardt, C. M. Seck, C. M. Shappert, N. D. Guise, C. E. Volin, S. D. Fallek, H. T. Hayden, W. G. Releasert, and K. R. Brown, High-fidelity bell-state preparation with 40ca+ optical qubits, Phys. Rev. Lett. 127, 130505 (2021).DOI
  59. [59]J. Nemirovsky and Y. Sagi, Fast universal two-qubit gate for neutral fermionic atoms in optical tweezers, Phys. Rev. Res. 3, 013113 (2021).DOI
  60. [60]D. M. Greenberger, M. A. Horne, and A. Zeilinger, Going beyond bell’s theorem, in Bell’s Theorem, Quantum Theory and Conceptions of the Universe, edited by M. Kafatos (Springer Netherlands, Dordrecht, 1989) pp. 69–72.arxiv.org/abs/0712.0921
  61. [61]Z.-y. Jin and J. Jing, Preparing greenberger-horne-zeilinger states on ground levels of neutral atoms, Phys. Rev. A 112, 022602 (2025).DOI
  62. [62]E. V. Anikin, A. Chukandin, O. Donchenko, O. Lakhmanskaya, and K. Lakhmanskiy, Lemniscate phase trajectories for high-fidelity preparation of ghz states in trapped-ion chains, Phys. Rev. Appl. 26, 024021 (2026).
  63. [63]J. D. Minnella, M. Ouellet, A. R. Klein, and L. C. Bassett, Single-gate, multipartite entanglement on a room-temperature quantum register, Nature Nanotechnology 21, 1383–1389 (2026).DOI
  64. [64]S. Pirandola, R. Laurenza, C. Ottaviani, and L. Banchi, Fundamental limits of repeaterless quantum communications, Nature Communications 8, 15043 (2017).DOI
  65. [65]M. Grassl, T. Beth, and T. Pellizzari, Codes for the quantum erasure channel, Phys. Rev. A 56, 33 (1997).DOI
  66. [66]C. N. Self, M. Benedetti, and D. Amaro, Parametrized expressive circuits with a quantum error detection code, Nature Physics 20, 219 (2024).DOI
  67. [67]C. H. Bennett, G. Brassard, S. Popescu, B. Schumacher, J. A. Smolin, and W. K. Wootters, Purification of noisy entanglement and faithful teleportation via noisy chan- nels. Phys. Rev. Lett. 76, 722 (1996).pubmed.ncbi.nlm.nih.gov/10061534
  68. [68]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 (1996).DOI

Paper details

vlnc:W_2hc3jqh4
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 9

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents