Skip to main content

Thank you for visiting nature.com. You are using a browser version with limited support for CSS. To obtain the best experience, we recommend you use a more up to date browser (or turn off compatibility mode in Internet Explorer). In the meantime, to ensure continued support, we are displaying the site without styles and JavaScript.

Capacity estimation and verification of quantum channels with arbitrarily correlated errors

Abstract

The central figure of merit for quantum memories and quantum communication devices is their capacity to store and transmit quantum information. Here, we present a protocol that estimates a lower bound on a channel’s quantum capacity, even when there are arbitrarily correlated errors. One application of these protocols is to test the performance of quantum repeaters for transmitting quantum information. Our protocol is easy to implement and comes in two versions. The first estimates the one-shot quantum capacity by preparing and measuring in two different bases, where all involved qubits are used as test qubits. The second verifies on-the-fly that a channel’s one-shot quantum capacity exceeds a minimal tolerated value while storing or communicating data. We discuss the performance using simple examples, such as the dephasing channel for which our method is asymptotically optimal. Finally, we apply our method to a superconducting qubit in experiment.

Introduction

One of the main obstacles on the way to quantum computers and quantum communication networks is the problem of noise due to imperfections in the devices. Noise is caused by uncontrolled interactions of the quantum information carriers with their environment. These interactions take place at all stages: when the carriers are processed, when they are transmitted, and when they are stored. Physicists and engineers spend large efforts in developing noise protection measures, and assessing their performance is crucial for the development of quantum information processing devices. In this article, we focus on the estimation of noise in the storage and transmission of the quantum information carriers, that is, we describe methods to assess quantum memory and quantum communication devices.

In the language of quantum information theory, memory and communication devices are described by a quantum channel, which is a function Λ that maps an input state ρ in of the device to its output state ρ out=Λ(ρ in). In this unified description, assessing the noise in a quantum device reduces to estimating the decoherence of a quantum channel. One way to achieve this is through quantum process tomography1, which aims at completely determining the channel from measurement data (see e.g., refs. 2,3 for more recent works on tomography, and, e.g., refs. 4,5 for surveys on specific types of tomography). This comes with two major disadvantages. First, process tomography typically only works for channels that behave the same way in every run of the experiment (formalized by the i.i.d. assumption—for independent and identically distributed), or under some symmetry assumptions. This assumption is violated for many devices that are used in practice, which typically show correlated errors. Second, since process tomography aims at a complete characterization of the channel, it requires the collection of large amounts of data for many combinations of input states and measurement settings. A complete characterization of a channel is certainly useful (as all properties of the channel can be inferred from it), but it is very costly if the task at hand is to simply estimate a figure of merit of the channel. For quantum storage and quantum communication devices, a central figure of merit is the quantum capacity of the channel, which quantifies the amount of quantum information that can be stored or transmitted by the device6. While the deployment of a suitable error-correcting code requires knowledge of the specifics of the channel, an estimate of the quantum capacity is of great use when assessing the usefulness of the tested device.

In this work, we present a method to estimate the one-shot quantum capacity Q ε(Λ) of a quantum channel Λ. While the quantum capacity Q only makes statements for devices that behave identically under many repeated uses, the one-shot quantum capacity Q ε applies to the more general case of devices with arbitrarily correlated errors. It quantifies the number of qubits that can be sent through the channel with a fidelity of at least 1 − ε in a single use of the device using the best possible error-correcting code (we will explain this in more detail in the next section). We present a protocol that allows to estimate Q ε(Λ) from data obtained from simple measurements. In addition to dealing with arbitrarily correlated errors, it has the advantage of requiring fewer measurement settings than quantum process tomography.

Our method can also be used to assess whether a possibly imperfect error-correction scheme forms an improvement. This is the case if the error-corrected channel has a higher capacity than what we would otherwise expect. Similarly, our protocols can be employed to test whether a quantum repeater actually forms an improvement for sending quantum information, that is, whether it yields a higher quantum capacity than a direct quantum communication link.

Results

The one-shot quantum capacity

Noise can be modeled as a channel Λ, which is given as a map

$$\Lambda :{\cal S}\left( {\cal H} \right) \to {\cal S}\left( {\cal H} \right),$$
(1)

where \({\cal S}\left( {\cal H} \right)\) denotes the set of quantum states on the Hilbert space of the system that is being stored or transmitted. For reasons of illustration, we will discuss channels of storage devices here, but mathematically, nothing is different for communication devices. In the realm of communication, it is convenient to think of a sender (Alice) who wants to relay qubits to a receiver (Bob). For memory device, Alice and Bob simply label the input and output.

Consider a quantum memory device designed for storing a quantum system with Hilbert space \({\cal H}\) for some time interval Δt. Ideally, it leaves the state of the system completely invariant over that time span, but real storage devices are always subject to noise. A measure for how well the channel Λ preserves the state of the system is obtained by minimizing the square of the fidelity between the input state \(\left| \phi \right\rangle \) and the output state Λ(ϕ),

$$F\left( {\left| \phi \right\rangle ,\Lambda \left( \phi \right)} \right) = \sqrt {\left\langle \phi \right|\Lambda \left( \phi \right)\left| \phi \right\rangle } ,$$
(2)

over all possible input states \(\left| \phi \right\rangle \in {\cal H}\),

$$\mathop {{\min }}\limits_{\left| \phi \right\rangle \in {\cal H}} {F^2}\left( {\left| \phi \right\rangle ,\Lambda (\phi )} \right) = \mathop {{\min }}\limits_{\left| \phi \right\rangle \in {\cal H}} \left\langle \phi \right|\Lambda \left( \phi \right)\left| \phi \right\rangle .$$
(3)

Low values of the quantity Eq. (3) imply that if the device is used without modification, then at least some states of the system are strongly affected by the channel, therefore introducing errors. However, this does not necessarily mean that the device is useless as a storage device, as this quantity does not account for the possibility that such errors can be corrected using quantum error correction (QEC).

An error-correcting code for a channel Λ consists of an encoding \({\cal E}\), which is applied before the channel, and a decoding \({\cal D}\), which is applied after the channel (see the explanations in Fig. 1). Together, these devices form an error-corrected quantum memory for a smaller system, implementing a channel

$${\cal D} \circ \Lambda \circ {\cal E}:{\cal S}\left( {\cal K} \right) \to {\cal S}\left( {\cal K} \right),$$
(4)

where \({\cal K}\) is the Hilbert space of the smaller system and where ο denotes the composition of maps. Instead of evaluating the quantity Eq. (3) for the channel Λ directly, it should be evaluated for such a corrected channel \({\cal D} \circ \Lambda \circ {\cal E}\). A figure of merit for the usefulness of the quantum memory is then given by the size of the largest system \({\cal K}\) that can be stored in the memory using such an error-correcting code. This is identical to the largest subspace \({\cal H}\prime \subseteq {\cal H}\) that is left approximately invariant by the memory, where the choice of encoding corresponds to the choice of subspace. This is quantified by the one-shot quantum capacity Q ε(Λ), defined by7,8

$${Q^\varepsilon }\left( \Lambda \right)\,{\rm{:}} \!= {\rm{max}}\left\{ {{\rm{lo}}{{\rm{g}}_{\rm{2}}}\,m|{F_{{\rm{min}}}}\left( {\Lambda ,m} \right) \ge 1 - \varepsilon } \right\},$$
(5)

where

$${F_{{\rm{min}}}}\left( {\Lambda ,m} \right): = \mathop {{max}}\limits_{\scriptstyle{\cal H}\prime \subseteq {\cal H}\hfill\atop\\ \scriptstyle\dim ({\cal H}\prime ) = m\hfill} \mathop {{min}}\limits_{\left| \phi \right\rangle \in {\cal H}\prime } \left\langle \phi \right|\left( {{\cal D} \circ \Lambda } \right)\left( \phi \right)\left| \phi \right\rangle $$
(6)

and where the inner maximum is taken over all possible decoders \({\cal D}:{\cal S}\left( {\cal H} \right) \to {\cal S}\left( {\cal H} \right)\). This way, the one-shot quantum capacity corresponds to the maximal number of qubits that can be stored and retrieved with a fidelity of at least 1 − ε using the best possible error-correcting code.

Fig. 1
figure1

Time diagram of an error-corrected quantum memory. An error-correcting code can turn a noisy quantum memory for some system with a Hilbert space \({\cal H}\) into an approximately noise-free memory for some smaller system with a lower-dimensional Hilbert space \({\cal K}\). Such a code consists of an encoder \({\cal E}\), which is applied before the quantum memory, and a decoder \({\cal D}\), which is applied after the quantum memory. The encoder maps the state space \({\cal K}\) of the smaller system into a subspace \({\cal H}\prime \subseteq {\cal H}\) of the larger system that is stored by the quantum memory, so it implements an encoding channel \({\cal E}:{\cal S}\left( {\cal K} \right) \to {\cal S}\left( {\cal H} \right)\). The goal is to design the encoder such that the image \({\cal E}\left( {{\cal S}\left( {\cal K} \right)} \right) = {\cal S}\left( {{\cal H}\prime } \right) \subseteq {\cal S}\left( {\cal H} \right)\) is a subspace that is left approximately intact by the quantum memory, up to an operation that may have mapped it elsehwere. Then, the decoder can be chosen such that it implements a channel \({\cal D}:{\cal S}\left( {\cal H} \right) \to {\cal S}\left( {\cal K} \right)\) which maps that subspace back to the state space of the smaller system. This leads to an error-corrected memory for the smaller system which implements the channel \({\cal D} \circ \Lambda \circ {\cal E}:{\cal S}\left( {\cal K} \right) \to {\cal S}\left( {\cal K} \right)\). Note that this figure shows a time diagram, so the three devices are not necessarily placed in the same spatial order as they appear in the figure

The one-shot quantum capacity tells us strictly more than the asymptotic quantum capacity, in the sense that the latter can be obtained from the former:

$$Q\left( \Lambda \right) = \mathop {{\lim }}\limits_{\varepsilon \to 0} \mathop {{\lim }}\limits_{N \to \infty } \frac{1}{N}{Q^\varepsilon }\left( {{\Lambda ^{ \otimes N}}} \right).$$
(7)

The asymptotic quantum capacity is the number of qubits that can be transmitted or stored per use of a device with asymptotically vanishing error, in the limit where it is used infinitely often under the i.i.d. assumption. Therefore, it is an asymptotic rate, while the one-shot quantum capacity is the total number of qubits that can be transmitted or stored in a single use of a (possibly non-tensor product) channel, allowing some error \(\varepsilon \ge 0\).

One-shot quantum capacity estimation

Now that the one-shot quantum capacity is identified as the relevant figure of merit for quantum memory and communication devices, the question is whether we can estimate this quantity for a given device. We answer this question in the affirmative for the case where Λ is a channel that stores or communicates (arbitrarily many) qubits.

We present a simple protocol (see Protocol 1 in Table 1) that estimates a lower bound on the one-shot quantum capacity Q ε(Λ) for an N-to-N-qubit channel Λ. Our protocol only requires the preparation and measurement of single qubit states in two bases. Specifically, even though it is known that the optimal encoder for a given channel Λ may require the creation of a highly entangled state, no entanglement is required to execute our test. For simplicity, we assume here that N is an even number (for more general cases, see Supplementary Notes 46). The protocol does not make any assumption on whether the qubits are processed sequentially, as in communication devices, or in parallel, as in storage devices (potentially with correlated errors in both cases). The data collection of the protocol is very simple. Alice and Bob agree on two qubit bases X and Z. These two bases should be chosen to be “incompatible”, in the sense that the preparation quality q, which is defined as

$$q = - {\rm{lo}}{{\rm{g}}_2}\mathop {{\max }}\limits_{i,j = 0,1} \left| {{{\left\langle {{i_X}\left| {{j_Z}} \right.} \right\rangle }}} \right|^2{\kern 1pt} ,$$
(8)

is as high as possible, where \(\left| {{i_X}} \right\rangle \) and \(\left| {{j_Z}} \right\rangle \) are eigenstates of X and Z, respectively. In the ideal case, where the two bases X and Z are mutually unbiased bases, such as the Pauli-X and Z basis, it holds that q = 1. Our protocol can be seen as exploiting the idea that the ability to transmit information in two complementary bases relates to a channel’s ability to convey (quantum) information9,10, which we show holds even with correlated noise. We remark that Pauli-X and Z basis have also been used to estimate the process fidelity of a quantum operation11,12 in the i.i.d. case, which however we are precisely trying to avoid here.

Table 1 Protocol 1: The estimation protocol

The bound for the capacity estimate is a function of the number of qubits N, the preparation quality q, the maximally allowed decoding error probability ε of Q ε(Λ), the two measured error rates e x and e z , and some probability p that quantifies the typicality of the protocol run (we will discuss this parameter in the Discussion section). More precisely, the bound is given as follows.

Theorem 1

Let \(N \in {{\Bbb N}_ + }\) be an even number, let e x and e z be error rates determined in a run of Protocol 1 where the used bases X and Z had a preparation quality of q (see Eq. (8) above). Then, for every ε > 0 and for every \(p \in [0,1)\), it holds that

  • either, the probability that at least one error rate exceeds e x or e z , respectively, was higher than p,

  • or the one-shot quantum capacity of the N-qubit channel Λ is bounded by

$$ {Q^\varepsilon }\left( \Lambda \right) \ge \mathop {{\sup }}\limits_{\eta \in \left( {0,\sqrt {\varepsilon /2} } \right)} \\ \left[ {N\left( {q - h\left( {{e_x} + \mu } \right) - h\left( {{e_z} + \mu } \right)} \right) - 2\,{\rm{lo}}{{\rm{g}}_2}\left( \kappa \right) - 4\,{\rm{lo}}{{\rm{g}}_2}\left( {\frac{1}{\eta }} \right) - 2} \right],$$
(9)

where h is the binary entropy function

$$h\left( x \right): = - x\,{\rm{lo}}{{\rm{g}}_2}\left( x \right) - \left( {1 - x} \right){\rm{lo}}{{\rm{g}}_2}\left( {1 - x} \right)$$
(10)

and μ and κ are given by

$$\mu = \sqrt {\frac{{N + 2}}{{{N^2}}}{\rm{ln}}\left( {\frac{{3 + \frac{5}{{\sqrt {1 - p} }}}}{{\sqrt {\varepsilon {\rm{/}}2} - \eta }}} \right)} ,\quad \kappa = 2{\left( {\frac{{3 + \frac{5}{{\sqrt {1 - p} }}}}{{\sqrt {\varepsilon {\rm{/}}2} - \eta }}} \right)^2}.$$
(11)

In the asymptotic limit where N→∞, the bound on the right hand side of inequality9 converges to \(N\left( {q - h\left( {{e_x}} \right) - h\left( {{e_z}} \right)} \right)\). All the other terms can be seen as correction terms that account for finite-size effects. We will discuss this in more detail in the Discussion section below. One may wonder, why we do not also obtain an upper bound. First of all, there exist no way to distinguish noise in the rest of the experimental apparatus from the noise on the channel. Second and more significantly, however, fixing any estimation procedure, arbitrarily correlated noise can always conspire to defeat the procedure tricking us into believing the capacity is low, while actually it is quite high. An upper bound could be obtained under the assumption that the noise is i.i.d., but this is precisely what we wish to avoid here.

One-shot capacity verification

Protocol 1 above estimates how much quantum information can be stored in a quantum memory device. This is of great use when the task is to figure out whether a device is potentially useful as a quantum memory device. When eventually, an error-correcting code is implemented, the corrected memory might be used without further testing.

In some cases, however, one wants to implement the memory with a means to verify its quality while using it. For example, one may suspect the quality of the memory to diminish (say, due to damage or overuse). In that case, the capacity estimation that was made before the implementation of the error-correcting code may no longer be valid. A method to verify that the quality of the memory is good enough for the implemented code may be required whenever it is used. Protocol 2, as given in Table 2, shows such a verification protocol.

Table 2 Protocol 2: The verification protocol

The protocol assumes that Alice holds N data qubits that she wants to send to Bob in a way that allows her to verify the quality of the transmission. To this end, she uses a channel for 3N qubits and places her N data qubits in random slots of this channel. The other 2N slots are used for test qubits, half of which are prepared and measured in the X basis and half of which are prepared and measured in the Z basis (just as in the estimation protocol), while Alice and Bob leave the data qubits untouched. The error rates on the test bits allows to infer a bound on the capacity of the channel on the data qubits.

For this protocol, we denote the measured error rate in X by γ and the measured error rate in Z by λ. Bob checks whether these error rates exceed some tolerated values e x and e z , respectively, which has been specified before the protocol run. If one or both error rates exceed the tolerated value, the protocol aborts because the transmission quality is considered too low. If both error rates are below their tolerated value, Bob concludes that the transmission was of high quality, in the sense that the channel on the data qubits had a high one-shot quantum capacity. This is stated more precisely in the following theorem.

Theorem 2

Let \(N \in {{\Bbb N}_ + }\), let e x , \({e_z} \in [0,1]\). Assume that Protocol 2 is run successfully without abortion, where the used bases X and Z had a preparation quality of q. Then, for every ε > 0 and for every \(p \in [0,1)\), it holds that

  • either, the probability that the protocol aborts was higher than p,

  • or the one-shot quantum capacity of the channel Λ on the N data qubits is bounded by inequality Eq. (9), where κ is as in Eq. (11) and where μ is given by

$$\mu = \sqrt {\frac{{2\left( {N + 1} \right)}}{{{N^2}}}{\rm{ln}}\left( {\frac{{3 + \frac{5}{{\sqrt {1 - p} }}}}{{\sqrt {\varepsilon {\rm{/}}2} - \eta }}} \right)} {\kern 1pt} .$$
(12)

The bound for the verification protocol looks formally almost identical to the one for the estimation protocol, but there are three differences. First, the function μ has a different dependence on N, which is a consequence of the different structure of the protocol as explained in Fig. 2. Second, the error rates e x and e z are preset accepted error rates instead of calculated error rates from data, and the bound holds when the measured rates are below those preset values. Third, the probability p in the bound is the abort probability of the protocol. Hence, another way to read the statement of the theorem is that either the protocol succeeds (does not abort) with a probability at most 1 − p, or the capacity is indeed high. This again quantifies what we consider to be typical data: even if the channel is competely noisy and useless, there might be a tiny probability 1 − p that the observed error rates are nevertheless small. In this case, we saw highly atypical data. We will say more about this probability in the Discussion section. Recall, that in the verification protocol we use 3N rounds, hence there is no factor of 1/3 on N (see also Fig. 2).

Fig. 2
figure2

Comparison of the inference structures of the two protocols. a In the estimation protocol, all qubits are test qubits, and the goal is to estimate the capacity for the channel on all qubits. b In the verification protocol, one third of the qubits are data qubits that are left untouched. The remaining 2N qubits are test qubits, whose error rates allow to bound the capacity of the channel on the N data qubits

Experiment

We demonstrate the use of this protocol by implementing it on a Transmon qubit. The experiment is performed on qubit A T previously reported in ref. 13. We measure a relaxation time of T 1 = 18.5 ± 0.6 μs and a Ramsey dephasing time of \(T_2^ \star = 3.8 \pm 0.3\) μs before performing the experiment. Readout of the qubit state is performed by probing the readout resonator with a microwave tone. The resulting transients are amplified using a traveling-wave parametric amplifier (TWPA)14 at the front end of the amplification chain. This results in a readout fidelity F RO = 11 − (p 01 + p 10)/2 = 98.0%, where p 01 (p 10) is the probability of declaring state 1 (0) when the input state was \(\left| 0 \right\rangle \) \(\left( {\left| 1 \right\rangle } \right)\) respectively. The qubit state is controlled using resonant microwave pulses.

The experiment implements Protocol 01 to estimate the capacity of the idling operation It). We do this by generating 8000 pairs of random numbers corresponding to the bases \(b \in \left\{ {X,Z} \right\}\) and states \(s \in \left\{ {0,1} \right\}\). These are then used to generate pulse sequences that rotate \(\left| 0 \right\rangle \) to the required state, and wait for a time Δt before measuring the qubit in the Z basis and declaring a state. If the required state was in the X basis, a recovery pulse is applied that rotates the state to the Z basis before it is read out. This protocol is repeated 130 times, with a distinct randomization for each repetition, yielding a total of N = 1.04 × 106 measurement outcomes in approximately one and a half hours. Results are reported in Fig. 3, which illustrates the estimate using the totality of the N outcomes for different values of ε. In Fig. 4 we furthermore plot variations in the error rate over time, as well as a bound for partial measurement sequences which highlight the (likely) non i.i.d. nature of the actual noise process affecting the qubits. We estimate q = 0.985 ± 0.047 (see Supplementary Note 7) before taking the data, but use q = 0.9 as a conservative estimate to account for a potential drift during the experimental run.

Fig. 3
figure3

Bound on the rate for the experimental data as a function of ε. This figure shows the bound on the one-shot quantum capacity rate for the data gained in the transmon qubit. We pick p = 1/2, and use q = 0.9 as preparation quality to account for the experimental imperfections (see Supplementary Note 7 for details). a The experiment was carried out three times with different storage times Δt, for each of which we plotted the bound resulting from the estimation protocol as a function of the decoding error probability ε. Since the number of qubit preparations and measurements was high (N = 1.04 × 106), the dependence on ε is rather small. b For a better visibility of the ε-dependence, we show the plot for the shortest storage time separately and more zoomed-in in the direction of the bound

Fig. 4
figure4

Error fluctuations across the measurements. Here we visualize the statistical fluctuations in the measurement outcomes over the course of the transmon qubit experiment. a For the experiment with Δt = 300 ns, we split up the N=1.04 × 106 sequential measurement outcomes into equally large and chronologically ordered segments and calculate the error rates e x and e z on each segment. For a meaningful and comparable quantity for comparison, we calculate the asymptotic bound \(q - h\left( {{e_x}} \right) - h\left( {{e_z}} \right)\) for each of segment with q = 0.9, that is, the bound on the capacity rate that would be obtained if infinitely many measurements with the error rates as on the respective segments would be measured. As expected, the fluctuations decrease with the number of segments, or in other words, the larger the segments, the smaller the differences between them. Note that in contrast to all other plots, this is a linear plot. b For a glimpse on the cumulative effect of the fluctuations, we set 1000 logarithmically distributed “break points” and calculate the bound as if the experiment ended at each of those points where q = 0.9, ε = 10−6, and we pick p = 1/2. The resulting plot is to be compared with the plots in Fig. 5. The fluctuations that make the curve deviate from a smooth curve come from the fact that the measured error rates are not constant throughout the experiment, indicating that the noise affecting the transmon qubit is indeed unlikely to correspond to an i.i.d. process

Discussion

In this section, we shall discuss our bound as a bound on the rate \(\frac{1}{N}{Q^\varepsilon }\left( \Lambda \right)\), which quantifies the amount of quantum information that can be sent per qubit. This has the advantage that it makes comparisons easier. To discuss our bound on the capacity rate, we have plotted its value as a function of N in Fig. 5. We plotted the bound for the estimation protocol, but qualitatively, the bound for the verification protocol behaves identically, so our discussion applies to both protocols.

Fig. 5
figure5

Bound on the rate for the capacity estimation protocol as a function of the number of qubits. This figure shows the bound on the one-shot quantum capacity for the estimation protocol expressed as a rate, that is, the right hand side of inequality9 divided by the number of qubits N. The plots show the bound as a function of N with the parameters as q = 1, and p = 1/2. a We plotted the bound for fixed error rates e x  = e z  = 5% for a few different values of ε in order to visualize the dependence on the decoding error probability. The lower the allowed decoding error probability ε is set, the higher the number of qubits needs to be in order to get a positive bound on the rate (note that the N-axis is logarithmic). In the asymptotic limit N→∞, the bound converges to \(q - h\left( {{e_x}} \right) - h\left( {{e_z}} \right)\). If q = 1, this coincides exactly with the (asymptotic) capacity for some important classes of channels, such as depolarizing channels. This shows that our bound is asymptotically optimal, and therefore, improvements are only possible in the finite-size correction terms. b To see the dependence on the error rates, we plotted our bound for a fixed value of ε = 10−6 for a few different values of e x and e z . The higher the error rate, the higher the number of qubits needs to be in order to achieve a positive rate. For every pair of error rates e x and e z , the bound is monotonically increasing in N and converges to \(q - h\left( {{e_x}} \right) - h\left( {{e_z}} \right)\). Therefore, the bound can only be positive when \(q - h\left( {{e_x}} \right) - h\left( {{e_z}} \right)\) is positive, which yields an easy criterion for the potential usefulness of a channel with known error rates (although the full version of the bound with the correction terms is not hard to evaluate either)

Example dephasing channel

In order to assess the strength of our bound, it is helpful to consider some example channels. A particularly insightful example is the case where the channel Λ is given by N independent copies of a dephasing channel of strength \(\alpha \in \left[ {0,1} \right]\), that is,

$$\Lambda = \Lambda _D^{ \otimes N},\quad {\Lambda _D}\left( \rho \right):\rho \; \mapsto \,\left( {1 - \frac{\alpha }{2}} \right)\rho + \frac{\alpha }{2}\sigma \,\rho \sigma ,$$
(13)

where σ denotes one of the qubit Pauli operators with respect to some basis. Of particular interest is the case where the dephasing happens with respect to one of the two bases X or Z in which Alice and Bob prepare and measure the test qubits. Let us assume that σ = σ Z . In order to see what happens when our estimation protocol is used in this case, we could simulate a protocol run and see what bound on the one-shot quantum capacity would be obtained. However, the estimation protocol does essentially nothing but determine the two error rates e x and e z . The expected values of these rates can be readily obtained from Eq. (13). The error rate e z vanishes, because dephasing in the Z basis leaves the Z-diagonal invariant. In the X basis the bits are left invariant with probability 1 − α/2, and flipped with probability α/2, so asymptotically e x  = α/2. Hence, for the dephasing channel, the estimation protocol is expected to yield the bound in inequality Eq. (9) with e z  = 0 and e x  = α/2.

Asymptotic tightness of the bound

As one can see in Fig. 5, the bound on the one-shot quantum capacity, expressed as a rate, converges to \(q - h\left( {{e_x}} \right) - h\left( {{e_z}} \right)\), which in the case of the dephasing channel is given by q − h(α/2). If we additionally assume that the bases X and Z are mutually unbiased (as are Pauli-X and Z), this is equal to 1 − h(α/2). This is precisely the (asymptotic) quantum capacity of the dephasing channel. This means that our bound on the one-shot quantum capacity is asymptotically tight; if our bound can be improved, then only in the finite-size correction terms. In particular, our bound cannot be improved by a constant factor. Since most estimates that enter the derivation of the bound are of the same type as the estimates used in modern security proofs of quantum key distribution (QKD)15, any possible improvements of the QKD security bounds would also lead to an improvement of our bound on the one-shot quantum capacity (if there is any). In this sense, our bound is essentially as tight as the corresponding security bounds for QKD in the finite regime.

Measurement calibration

Above, we have assumed that Alice and Bob were very lucky: they set up their bases X and Z such that one of them is exactly aligned with the dephasing basis, and therefore optimally exploited the asymmetry of the channel. In general, since they do not know the channel whose capacity they estimate, they do not know about the direction of the asymmetry. Instead, they have to calibrate their devices by trying out several pairs of bases until they find one with low error rates. Otherwise, the bound on the one-shot quantum capacity that they infer is suboptimal. It is an interesting open question how such a calibration can be optimized.

Example fully depolarizing channel

Another insightful example is the case where Λ is given by the channel which outputs the fully mixed state of N qubits, independently of the input state. The capacity of this channel is zero, yet with probability 2N, Alice and Bob measure error rates e x  = e z  = 0. One may think that these vanishing error rates lead to a highly positive bound on the capacity, but this is not the case. As one can read in Theorem 1 and Theorem 2, the bound depends on a probability p, and the term 1−p corresponds precisely to the probability of such an unlikely case. In fact, for 1 − p = 2N, the bound is never positive. This example shows that in the one-shot regime, a meaningful capacity estimation can only be made under the assumption that the observed data is not extremely atypical for the channel. However, this is only a problem for very low values of N: thanks to the natural logarithm in μ (see Eq. (11) above), the concern reduces to atypical events with an exponentially (in N) small probability. For reasonable numbers of N, the influence of p on the bound is negligible, except for extremely low values of 1 − p.

Quantifying typicality

We remark that p is a parameter to choose before executing the estimation protocol, which essentially just defines what we consider atypical. The statement of the estimation theorem can then be understood as simply stating that either the observed data is highly atypical (as defined by the choice of p), or the capacity is indeed high. From a practical point of view, note that for any constant p, the bound is essentially independent of p for even relatively small values of N and μ→0 in (Eq. (11)) as N→∞. For this reason, we simply choose p = 1/2 in our plots as an illustration. Similarly, the maximally tolerated error rates e x and e z can be chosen freely when conducting the verification protocol. It is merely that the conclusions of the test depend on it, since we choose to abort—that is, draw no conclusion—if the observered error rates are higher than e x and e z . The probability p pass that we do not abort then corresponds to p pass = 1 − p. So p also arises here, and corresponds to the probability of aborting, namely to the probability that data is produced which we do not regard as typical. Aborting may still seem like a different approach to the one taken during the verification protocol where we always draw a conclusion, but we can see that it is in fact exactly analogous: In the estimation protocol, Alice and Bob essentially decide to make a test in which e x and e z correspond exactly to the measured error rates instead of setting a maximum error rate ahead of time. Clearly, they will never abort in this case. Nevertheless, one can consider the probability that in any run, the measured error rates would stay below the rates that have been measured in this particular run of the test. This probability can be seen as a measure of typicality of the protocol, and corresponds precisely to p pass if we were to execute the test again, but now fixing the error rates to what we observed. Hence, again p = 1 − p pass which corresponds precisely to a quantification of such typicality.

For more information on the probability p and e x and e z , see Supplementary Notes 5 and 6. Note that the need to characterize typicality of the data observed is not only given in our context of capacity estimation, but arises in all statistical tests on a finite sample, including quantum key distribution where security statements are formulated in an analogous fashion.

Usage to assess quantum repeaters

An important challenge in the experimental realization of quantum repeaters is to demonstrate that they improve our ability to communicate compared to a direct fiber connection without a repeater. To demonstrate that they improve our ability to produce key, one proceeds by calculating the private capacity P of the direct communication channel without a repeater, followed by the implementation of a QKD protocol using the quantum repeater. If the rate R of generating key in the QKD protocol with the repeater satisfies R > P, then the quantum repeater improved our ability to produce encryption keys (see e.g., refs. 16,17,18). It turns out that it is in general harder to send qubits, then it is to produce key19. That is, the quantum capacity Q satisfies \(Q \le P\), where the inequality is in general strict. Demonstrating that a repeater improves our ability to produce key thus does not allow us to draw conclusions on whether the repeater improves our ability for sending qubits without further analysis.

Our result now precisely allows one to perform such a demonstration, even in the regime of arbitrarily correlated noise while in fact being no more difficult than performing BB84 QKD20. Crucially, this means that in order to demonstrate a quantum repeaters ability to send qubits it is thus not necessary to perform quantum error correction (QEC) or entanglement distillation. First, one needs to calculate the quantum capacity \(Q_{DF}^\varepsilon \left( N \right)\) of the direct fiber (DF) connection, or a bound \(Q_{DF}^\varepsilon \left( N \right) \le B_{DF}^\varepsilon \left( N \right)\). We note that theoretical bounds \(B_{DF}^\varepsilon \left( N \right)\) on the one-shot capacity \(Q_{DF}^\varepsilon \left( N \right)\) are known for finite number of channel uses N and error ε, which are much tighter than employing the asymptotic capacity for N→∞ and ε→08,21. We can now run our capacity estimation protocol over the quantum repeater link which yields a lower bound \(L\left( N \right) \le Q_{WR}^\varepsilon \left( N \right)\) for the capacity with repeater (WR). If we find that \(L\left( N \right) >B_{DF}^\varepsilon \left( N \right)\), then we have successfully demonstrated that the quantum repeater improves our ability to transmit qubits over a direct transmission line.

Usage to assess quantum error-correcting schemes

We note that in a similar way we can make statements about the performance of a QEC scheme for storing qubits with arbitrarily correlated errors. Suppose that we wish to compare how well an error-correcting scheme encoding one logical qubit using multiple physical qubits compares to using just one of the physical qubits directly. We can again employ the result of8 to first derive (a bound on) the one-shot quantum capacity \(B_P^\varepsilon \left( N \right)\) if we used the physical qubit (P) N times with error ε. We then execute the capacity estimation protocol to estimate the capacity of the logical (LO) qubit channel \(L\left( N \right) < Q_{{\rm{LO}}}^\varepsilon \left( N \right)\). If we find that \(L\left( N \right) >B_P^\varepsilon \left( N \right)\), then we can conclude that the logical qubit is an improvement for storing quantum information over one physical qubit.

Other open questions

Our result assumes that the system on which the channel acts is composed of qubits. An interesting open question is whether this restriction can be removed and an analogous bound can be derived for channels of arbitrary dimension and composition.

It would also be interesting to see our bound extended to continuous variable systems. There are many tools already available22,23,24,25 that may be useful to perform such an analysis, but it remains to be determined how exactly they can be applied to such systems.

Methods

To prove the bound on the one-shot quantum capacity, we combine several results. First, as we recapitulate in more detail in the Supplementary Note 1 through 4, it has been shown that the one-shot quantum capacity is bounded by the one-shot capacity of entanglement transmission \(Q_{{\rm{ent}}}^\varepsilon \left( \Lambda \right)\) 26. More precisely, it holds that for every channel Λ and for every ε > 07,

$${Q^\varepsilon }\left( \Lambda \right) \ge Q_{{\rm{ent}}}^{\varepsilon /2}\left( \Lambda \right) - 1.$$
(14)

The one-shot capacity of entanglement transmission, in turn, has been proved to be bounded by the smooth min-entropy \(H_{{\rm{min}}}^\varepsilon {\left( {A{\rm{|}}E} \right)_\rho }\), which is defined by

$$H_{{\rm{min}}}^\varepsilon {\left( {A\left| B \right.} \right)_\rho }: = \mathop {{\max }}\limits_{\rho ' \in {B^\varepsilon }\left( \rho \right)} {H_{{\rm{min}}}}{\left( {A\left| B \right.} \right)_{\rho '}},$$
(15)

where

$${H_{{\rm{min}}}}{\left( {A\left| B \right.} \right)_\rho }: = \mathop {{\max }}\limits_{{\sigma _B}} \,{\rm{sup}}\left\{ {\lambda \in {\Bbb R}\left| {{\rho _{AB}}} \right. \le {2^{ - \lambda }}{I_A} \otimes {\sigma _B}} \right\}.$$
(16)

It has been shown that7,8,27

$$Q_{{\rm{ent}}}^\varepsilon \left( \Lambda \right) \ge \mathop {{\sup }}\limits_{\eta \in \left( {0,\sqrt \varepsilon } \right)} \left( {H_{{\rm{min}}}^{\sqrt \varepsilon - \eta }{{\left( {A\left| E \right.} \right)}_\rho } - 4{\rm{lo}}{{\rm{g}}_2}\frac{1}{\eta } - 1} \right),$$
(17)

Here, the smooth min-entropy is evaluated for the state

$${\rho _{AE}} = \left( {{I_A} \otimes \Lambda _{A' \to E}^c} \right)\left( {{\Phi _{AA'}}} \right),$$
(18)

where \({\Phi _{AA'}}\) is a maximally entangled state over the input system \(A'\) and a copy A of it, and where \(\Lambda _{A' \to E}^c\) is the complementary channel of the channel \({\Lambda _{A' \to B}}\). The system E is the environment of the channel (see refs. 8,28 and Supplementary Note 2 for more details). Taking together the results Eqs. (14) and (17), we get that for all ε > 0,

$${Q^\varepsilon }\left( \Lambda \right) \ge \mathop {{\sup }}\limits_{\eta \in \left( {0,\sqrt {\varepsilon /2} } \right)} \left( {H_{{\rm{min}}}^{\sqrt {\varepsilon /2} - \eta }{{\left( {A|E} \right)}_\rho } - 4\mathop {{\log }}\nolimits_2 \frac{1}{\eta } - 2} \right).$$
(19)

Therefore, the min-entropy bounds the one-shot quantum capacity.

Estimating the min-entropy has been a subject of intense research in quantum key distribution (QKD). However, min-entropy estimation protocols in QKD cannot be directly applied here, because they estimate the min-entropy \(H_{{\rm{min}}}^\varepsilon \left( {X\left| E \right.} \right)\) for classical information X, while in the bound Eq. (17), the system A holds quantum information. We bridge this gap: as our main technical contribution, we show in the Supplementary Note 3 that for a system A that is composed of qubits, it holds that for every ε > 0 and every \(\varepsilon ',\varepsilon '' \ge 0\),

$$H_{{\rm{min}}}^{3\varepsilon + \varepsilon ' + 4\varepsilon ''}{\left( {A\left| E \right.} \right)_\rho } \ge Nq - \left( {H_{{\rm{max}}}^{\varepsilon ''}{{\left( {X\left| B \right.} \right)}_\rho } + H_{{\rm{max}}}^{\varepsilon '}{{\left( {Z\left| B \right.} \right)}_\rho }} \right) - 2\,{\rm{lo}}{{\rm{g}}_2}\frac{2}{{{\varepsilon ^2}}}{\kern 1pt} .$$
(20)

Inequality Eq. (20) reduces estimating the min-entropy of quantum information A to estimating the max-entropy of measurement outcomes X and Z on the system A.

We prove inequality Eq. (20) using three main ingredients. First, we use an uncertainty relation for the smooth min- and max-entropies29. Second, we use a duality relation for the smooth min- and max-entropies30,31. These two ingredients were also used in modern security proofs of quantum key distribution15. We combine these two tools with a third tool, namely a chain rule theorem for the smooth max-entropy32 to arrive at the bound in inequality Eq. (20).

Given inequalities Eqs. (17) and (20), all we are left to do is to devise a protocol that estimates the max-entropies of X and Z given Bob’s quantum information B. Here we can make use of protocols in quantum key distribution that estimate exactly such a quantity. We show in the Supplementary Notes 46 how two such protocols (one for the max-entropy of X and one for the max-entropy of Z) can be combined into one protocol, which estimates both quantities simultaneously. The resulting protocol, which we presented in two versions, is given by Protocol 1 and Protocol 2 in the Results section. Our bound on the one-shot quantum capacity of the channel, inequality Eq. (9), is obtained by combining inequalities Eqs. (14) and (17) with these max-entropy estimation techniques.

Data availability

The authors declare that all data supporting this study are contained within the article and its supplementary files.

References

  1. 1.

    Chuang, I. L. & Nielsen, M. A. Prescription for experimental determination of the dynamics of a quantum black box. J. Mod. Opt. 44, 2455–2467 (1997).

    ADS  Article  Google Scholar 

  2. 2.

    Faist, P. & Renner, R. Practical and reliable error bars in quantum tomography. Phys. Rev. Lett. 117, 010404 (2016).

    ADS  Article  PubMed  Google Scholar 

  3. 3.

    Ferrie, C. & Blume-Kohout, R. Minimax quantum tomography: estimators and relative entropy bounds. Phys. Rev. Lett. 116, 090407 (2016).

    ADS  MathSciNet  Article  PubMed  Google Scholar 

  4. 4.

    Greenbaum, D. Introduction to quantum gate set tomography. ArXiv 1509, 02921 (2015).

    Google Scholar 

  5. 5.

    D’Ariano, G. M. in Quantum State Estimation 1st edn, Vol. 649 (eds Paris, M. & Rehacek, J.) Ch. 8 (Springer-Verlag, Berlin, 2004).

  6. 6.

    Nielsen, M. A. & Chuang, I. L. Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, 2000).

  7. 7.

    Buscemi, F. & Datta, N. The quantum capacity of channels with arbitrarily correlated noise. IEEE Trans. Inf. Theory 56, 1447–1460 (2010).

    MathSciNet  Article  MATH  Google Scholar 

  8. 8.

    Tomamichel, M., Berta, M. & Renes, J. M. Quantum coding with finite resources. Nat. Commun. 7, 11419 (2016).

    ADS  CAS  Article  PubMed  PubMed Central  Google Scholar 

  9. 9.

    Renes, J. M. & Boileau, J.-C. Conjectured strong complementary information tradeoff. Phys. Rev. Lett. 103, 020402 (2009).

    ADS  Article  PubMed  Google Scholar 

  10. 10.

    Christandl, M. & Winter, A. Uncertainty, monogamy, and locking of quantum correlations. IEEE Trans. Inf. Theory 51, 3159–3165 (2005).

    MathSciNet  Article  MATH  Google Scholar 

  11. 11.

    Hofmann, H. F. Complementary classical fidelities as an efficient criterion for the evaluation of experimentally realized quantum operations. Phys. Rev. Lett. 94, 160504 (2005).

    ADS  MathSciNet  Article  PubMed  Google Scholar 

  12. 12.

    Sedlák, M. & Fiurášek, J. Generalized hofmann quantum process fidelity bounds for quantum filters. Phys. Rev. A 93, 042316 (2016).

    ADS  Article  Google Scholar 

  13. 13.

    Ristè, D. et al. Detecting bit-flip errors in a logical qubit using stabilizer measurements. Nat. Commun. 6, 6983 (2015).

    Article  PubMed  PubMed Central  Google Scholar 

  14. 14.

    Macklin, C. et al. A near-quantum-limited Josephson traveling-wave parametric amplifier. Science 350, 307–310 (2015).

    ADS  CAS  Article  PubMed  Google Scholar 

  15. 15.

    Tomamichel, M., Lim, C., Gisin, N. & Renner, R. Tight finite-key analysis for quantum cryptography. Nat. Commun. 3, 634 (2012).

    ADS  Article  PubMed  PubMed Central  Google Scholar 

  16. 16.

    Takeoka, M., Guha, S. & Wilde, M. M. Fundamental rate-loss tradeoff for optical quantum key distribution. Nat. Commun. 5, 5235 (2014).

    ADS  CAS  Article  PubMed  Google Scholar 

  17. 17.

    Pirandola, S., Laurenza, R., Ottaviani, C. & Banchi, L. Fundamental limits of repeaterless quantum communications. Nat. Commun. 8, 15043 (2017).

    ADS  Article  PubMed  PubMed Central  Google Scholar 

  18. 18.

    Goodenough, K., Elkouss, D. & Wehner, S. Assessing the performance of quantum re-peaters for all phase-insensitive gaussian bosonic channels. New J. Phys. 18, 063005 (2016).

    ADS  Article  Google Scholar 

  19. 19.

    Horodecki, K., Horodecki, M., Horodecki, P., Leung, D. & Oppenheim, J. Unconditional privacy over channels which cannot convey quantum information. Phys. Rev. Lett. 100, 110502 (2008).

    ADS  CAS  Article  PubMed  MATH  Google Scholar 

  20. 20.

    Bennett, C. H. & Brassard, G. Quantum cryptography: public key distribution and coin tossing. In Proceedings of IEEE International Conference on Computers, Systems and Signal Processing, vol. 175, 8 (1984).

  21. 21.

    Kaur, E. & Wilde, M. M. Upper bounds on secret key agreement over lossy thermal bosonic channels. Preprint at https://arxiv.org/abs/1706.04590 (2017).

  22. 22.

    Furrer, F. et al. Continuous variable quantum key distribution: finite-key analysis of composable security against coherent attacks. Phys. Rev. Lett. 109, 100502 (2012).

    ADS  CAS  Article  PubMed  Google Scholar 

  23. 23.

    Furrer, F., Aberg, J. & Renner, R. Min- and max-entropy in infinite dimensions. Commun. Math. Phys. 306, 165–186 (2011).

    ADS  MathSciNet  Article  MATH  Google Scholar 

  24. 24.

    Berta, M., Furrer, F. & Scholz, V. B. The smooth entropy formalism for von neumann algebras. J. Math. Phys. 57, 015213 (2016).

    ADS  MathSciNet  Article  MATH  Google Scholar 

  25. 25.

    Furrer, F., Berta, M., Tomamichel, M., Scholz, V. B. & Christandl, M. Position-momentum uncertainty relations in the presence of quantum memory. Preprint at https://arxiv.org/abs/1308.4527 (2014).

  26. 26.

    Barnum, H., Knill, E. & Nielsen, M. A. On quantum fidelities and channel capacities. IEEE Trans. Inf. Theory 46, 1317–1329 (2000).

    MathSciNet  Article  MATH  Google Scholar 

  27. 27.

    Morgan, C. & Winter, A. Pretty strong converse for the quantum capacity of degradable channels. IEEE Trans. Inf. Theory 60, 317–333 (2014).

    MathSciNet  Article  MATH  Google Scholar 

  28. 28.

    Wilde, M. Quantum Information Theory (Cambridge University Press, Cambridge, 2013).

  29. 29.

    Tomamichel, M. & Renner, R. Uncertainty relation for smooth entropies. Phys. Rev. Lett. 106, 110506 (2011).

    ADS  Article  PubMed  Google Scholar 

  30. 30.

    König, R., Renner, R. & Schaffner, C. The operational meaning of min- and max-entropy. IEEE Trans. Inf. Theory 55, 4337–4347 (2009).

    MathSciNet  Article  MATH  Google Scholar 

  31. 31.

    Tomamichel, M., Colbeck, R. & Renner, R. Duality between smooth min- and max-entropies. IEEE Trans. Inf. Theory 56, 4674–4681 (2010).

    MathSciNet  Article  MATH  Google Scholar 

  32. 32.

    Vitanov, A., Dupuis, F., Tomamichel, M. & Renner, R. Chain rules for smooth min- and max-entropies. IEEE Trans. Inf. Theory 59, 2603–2612 (2013).

    MathSciNet  Article  MATH  Google Scholar 

Download references

Acknowledgements

We thank the Leo DiCarlo group at QuTech for the experimental infrastructure necessary for MAR to conduct the experiment to collect the test data for a superconducting qubit. We also thank Mario Berta, Thinh Le Phuc, and Jeremy Ribeiro for insightful discussions, and Julia Cramer for helpful comments on an earlier version of this manuscript. C.P., A.M., and M.T. were supported by MOE Tier 3A grant “Randomness from quantum processes”, NRF CRP “Space-based QKD”. S.W. was supported by STW, Netherlands, an NWO VIDI Grant, and an ERC Starting Grant. M.A.R. was supported by an ERC Synergy grant.

Author information

Affiliations

Authors

Contributions

S.W. devised the project, and the main conceptual and proof ideas. C.P. worked out the theoretical details with help from A.M. and M.T.; M.A.R. performed the experiment. C.P. and M.A.R. analyzed the data with help from S.W.; C.P., M.A.R. and S.W. wrote the manuscript.

Corresponding author

Correspondence to Stephanie Wehner.

Ethics declarations

Competing interests

The authors declare no competing financial interests.

Additional information

Publisher's note: Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Electronic supplementary material

Rights and permissions

Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/.

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Pfister, C., Rol, M., Mantri, A. et al. Capacity estimation and verification of quantum channels with arbitrarily correlated errors. Nat Commun 9, 27 (2018). https://doi.org/10.1038/s41467-017-00961-2

Download citation

Further reading

Comments

By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.

Search

Quick links

Nature Briefing

Sign up for the Nature Briefing newsletter — what matters in science, free to your inbox daily.

Get the most important science stories of the day, free in your inbox. Sign up for Nature Briefing