Blind topological measurement-based quantum computation.

Blind quantum computation is a novel secure quantum-computing protocol that enables Alice, who does not have sufficient quantum technology at her disposal, to delegate her quantum computation to Bob, who has a fully fledged quantum computer, in such a way that Bob cannot learn anything about Alice's input, output and algorithm. A recent proof-of-principle experiment demonstrating blind quantum computation in an optical system has raised new challenges regarding the scalability of blind quantum computation in realistic noisy conditions. Here we show that fault-tolerant blind quantum computation is possible in a topologically protected manner using the Raussendorf-Harrington-Goyal scheme. The error threshold of our scheme is 4.3 × 10(-3), which is comparable to that (7.5 × 10(-3)) of non-blind topological quantum computation. As the error per gate of the order 10(-3) was already achieved in some experimental systems, our result implies that secure cloud quantum computation is within reach.

In classical computing, the problem of ensuring secure communication between a server and a client is highly non-trivial. For example, Abadi et al.1 showed that no NP-hard function can be computed with encrypted data if unconditional security is required, unless the polynomial hierarchy collapses at the third level. Even restricting the security condition to be only computational, the question of the possibility of a fully homomorphic encryption has been a long-standing open question for 30 years2, and no practical method has been found still. An unconditionally secure fully homomorphic encryption is still an open problem.

On the other hand, in the quantum world, the situation is drastically different. Broadbent et al.3 proposed a quantum protocol, the so-called blind quantum computation345678, which uses measurement-based quantum computation (MBQC)9. In their protocol, Alice has a classical computer and a quantum device that emits randomly rotated qubits. She does not have any quantum memory. On the other hand, Bob has a fully fledged quantum technology. Alice and Bob share a classical channel and a quantum channel. Their protocol runs as follows. First, Alice sends Bob many randomly rotated qubits and Bob creates a graph state by applying CZ gates among these qubits. Second, Alice instructs Bob how to measure a qubit of the graph state. Third, Bob measures the qubit according to Alice's instruction and he returns the measurement result to Alice. They repeat this classical two-way communication (that is, the second and third steps) until the computation is finished. It was shown3 that if Bob is honest, Alice can obtain the correct answer of her desired quantum computation (correctness), and that whatever evil Bob does, he cannot learn anything about Alice's input, output and algorithm (blindness). Recently, this protocol has been experimentally demonstrated in an optical system4.

Secure delegated computation is already in the practical phase for classical computing, including smart phones, encrypted data retrieval10 and wireless sensor networks11. When scalable quantum computers are realized, the need for delegated secure computation must be emphasized, as home-based quantum computers are arguably much more difficult to build than their classical counterparts. To implement blind quantum computation in a scalable manner, it is crucial to protect quantum computation from environmental noise. In this paper, we show that a fault-tolerant blind quantum computation is possible in a topologically protected manner. We also calculate the error threshold, 4.3×10−3, for erroneous preparation of the initial states, erroneous CZ gates, and erroneous local measurements. This is the first time that a concrete fault-tolerant scheme is proposed for blind quantum computation, and that the error threshold is explicitly calculated. Furthermore, this threshold is not so different from that (7.5×10−3) of non-blind topological quantum computation1213. In other words, blind quantum computation is possible with almost the same error threshold as that of the non-blind version. As the error threshold of the order 10−3 was already achieved in some experimental systems14, our result means that secure cloud quantum computation is within our reach. We further show that our protocol is also fault-tolerant against the detectable qubit loss, such as a photon loss and an escape from the qubit energy level.

Results

Topologically protected MBQC

The topologically protected MBQC (TMBQC)121315 is one of the most promising models of quantum computation. In this model, we first prepare the graph state on the three-dimensional cubic lattice whose elementary cell is given in Fig. 1a. We call this lattice the Raussendorf–Harrington–Goyal (RHG) lattice. We next measure each qubit of this lattice in , or Y basis. These four types of measurements are sufficient for the universal TMBQC as is shown in refs 12,13. More precisely, measurements in the X and Z basis can simulate the topological braidings of defects in the surface code16, which can implement the fault-tolerant Clifford gates, and measurements in T basis and Y basis can simulate the preparations of magic states17, which can implement the non-Clifford gates. These magic states are distilled17 by topologically protected fault-tolerant Clifford gates, which are simulated by the X and Z basis measurements. A small-size TMBQC has recently been experimentally demonstrated in an optical system15.

Figure 1

Elementary cells.

(a) The elementary cell of the RHG lattice . (b) The elementary cell of the decorated RHG lattice .

Blind TMBQC

Can we use TMBQC for the blind quantum computation? Obviously, if Bob knows on what basis (X, Z, T or Y) he is doing the measurement on each qubit, he can know Alice's algorithm. However, if Alice can have Bob do the measurements in such a way that Bob cannot know on what basis (X, Z, T, or Y) he is doing the measurement on each qubit, he cannot know Alice's algorithm. How can Alice do that? In fact, such a blind quantum computation is possible if we consider the three-dimensional lattice whose elementary cell is given in Fig. 1b, where two extra qubits are added to each qubit of Fig. 1a. We call this lattice the decorated RHG lattice. The intuitive explanation of our idea is as follows: First, it was shown3 that Alice can have Bob do the measurement in {|0〉±e|1〉} basis for any on any qubit of a graph state that Bob has in such a way that Bob cannot learn anything about φ. Second, it is easy to confirm that a single-qubit measurement in X, Y, T or Z basis can be simulated on the linear three-qubit cluster state with only {|0〉±e|1〉} basis measurements (Fig. 2). By combining these two facts, we notice that if we decorate the RHG lattice as is shown in Fig. 1b, Bob can simulate the measurement in X, Y, T and Z basis only with {|0〉±e|1〉} basis measurements, and he cannot know which type of measurements (X, Y, T or Z) he is simulating.

Figure 2

How the decorated lattice works.

If we prepare the three-qubit cluster state and measure each qubit in the numerical order in the basis with (φ1,φ2,φ3)=(0,0,0), (0,0,π/2), (0,0,π/4), and (π/2,π/2,π/2), we can simulate single-qubit measurements in X, Y, T and Z basis, respectively. Each corresponds to (a–d).

More precisely, our protocol runs as follows (Fig. 3):

Figure 3

Topological blind protocol.

(a) Alice sends Bob randomly rotated qubits. (b) Bob creates the decorated RHG lattice. (c) Alice sends Bob a classical message. (d) Bob does the measurement and returns the result to Alice. (e) Alice can hide her topological quantum computation from Bob.

Step 1. Alice sends N randomly rotated single-qubit states to Bob through the quantum channel, where and (j=1,2,...,N) are random numbers. N is the total number of qubits used in the decorated RHG lattice . Alice remembers all random numbers , and they are kept secret to Bob.

Step 2. Now Bob has . He places |θ〉 on the jth vertex of the decorated RHG lattice for all j (j=1,...,N). He then applies the CZ gate on each red edge of the decorated RHG lattice . Let us denote thus created N-qubit state by . As is nothing but a rotated graph state on the decorated RHG lattice . Here CZ is the CZ gate between kth and lth qubits.

Step 3. If Alice wants Bob to measure the jth qubit of in basis, she calculates on her classical computer. Here, r∈{0,1} is a random number, (mod 2π), and are determined by the previous measurement results (this is the usual feed-forwarding in the one-way model9). Then Alice sends δ to Bob through the classical channel.

Step 4. Bob measures the jth qubit in the basis and returns the result of the measurement to Alice through the classical channel.

Step 5. They repeat steps 3 and 4 with increasing j until they finish the computation. Note that Alice does the classical processing for the error correction by using Bob's measurement results.

Correctness

Let us show that this protocol is correct. In other words, Alice and Bob can simulate the original TMBQC1213 on the decorated RHG lattice with only {|0〉±e|1〉} basis measurements if Bob is honest. Let us consider three qubits labelled with 1, 2 and 3, in Fig. 1b. Let us assume that Bob measures these three qubits in the numerical order (that is, from the bottom one to the top one) in the basis (j=1,2,3) with (φ1,φ2,φ3)=(0,0,0). By a straightforward calculation, it is easy to show that such a sequence of measurement on the three qubits is equivalent to the measurement in the X basis on the qubit labelled with 1 in Fig. 1a (also Fig. 2a). Note that θ in Bob's measurement basis is cancelled, as jth qubit is pre-rotated by θ by Alice. Furthermore, rπ causes just the flip of the measurement result. Therefore, Bob effectively does basis measurement, although he is doing basis measurement. In other words, our lattice can simulate the X basis measurements on . In a similar way, if Bob does measurements on the three qubits labelled with 1, 2 and 3 in Fig. 1b in other angles, (φ1,φ2,φ3)=(0,0,π/2), (0,0,π/4) and (π/2,π/2,π/2), they are equivalent to the Y, T and Z basis measurements on the qubit labelled with 1 in Fig. 1a, respectively, (Fig. 2b–d). In this way, our lattice can simulate the X, Z, T and Y basis measurements on . In short, we have shown that on the decorated RHG lattice can simulate the original TMBQC1213 on the RHG lattice solely with {|0〉±e|1〉} basis measurements.

Blindness

How about the blindness? In our protocol, what Alice sends to Bob are randomly rotated single-qubit states and measurement angles . Without loss of generality, we can assume that the preparation of the input is included in the algorithm. Therefore, what Alice wants to hide are the algorithm and the output. We can show that the conditional probability distribution of Alice's computational angles, given all the classical information Bob can obtain during the protocol, and given the measurement results of any positive-operator valued measures (POVMs) that Bob may perform on his system at any stage of the protocol, is equal to the a priori probability distribution of Alice's computational angles. We can also show that the final classical output is one-time padded to Bob. (For a proof, see Methods.)

Threshold

Finally, let us calculate the fault-tolerant threshold. As in refs 12,13, we assume that errors occur during the preparation of initial states , the applications of CZ gates and the local measurements. The erroneous preparation of an initial state is modelled by the perfect preparation followed by the partially depolarizing noise with the probability , where [•] indicates the super operator. The erroneous local measurement is modelled by the perfect local measurement preceded by the partially depolarizing noise with the probability p. The erroneous CZ gate is modelled by the perfect CZ gate followed by the two qubit partially depolarizing noise with the probability . Because of the rotational symmetry of the depolarizing noise, we can replace [A] with when it acts on the jth qubit, and [A B] with when it acts on the jth and kth qubits. Here, A, B=I, X, Y or Z. These replacements just correspond to the rotation of the local reference frame of each qubit. Then, if the measurement basis on the jth qubit (j=1,...,N) is rotated by , the factor is cancelled. Therefore, when we calculate the fault-tolerant threshold of our protocol, we can assume that all θ=0 without loss of generality. As in ref. 18, we assume that is created in the stepwise manner (Fig. 4). In our case, however, the additional fifth step is introduced as is shown in Fig. 4e. First, let us calculate the single-qubit Z error probability λ (j=1,2,3) on each of the three qubits labelled with 1,2,3 in Fig. 1b after creating . By a straightforward calculation, we obtain λ1=32p2/15+8p2/15+2p/3; λ2=16p2/15+2p/3; and λ3=8p2/15+2p/3 up to the first order of p and p2. Once an erroneous is created, we start local measurements. As is shown in Fig. 5, the three qubits are sequentially measured in numerical order. Such a sequential measurement propagates all pre-existing errors on qubits labelled with 1 and 2 to the qubit labelled with 3. By a straightforward calculation, the accumulated error probability on the qubit labelled with 3 by such a propagation is λtotal≡λ1+λ3+2×2p/3 for (φ1,φ2,φ3)=(0,0,0). We have only to consider the measurement pattern that corresponds to the effective X measurement on the qubit labelled with 1 in Fig. 1a, because we are now interested in the topological error-correction of the bulk qubits. The value λtotal corresponds to the quantity q1, which was studied in ref. 18, of the qubit labelled with 1 in Fig. 1a. The correlated two-qubit error probability18 in our protocol is the same as that in ref. 18. If we assume p=p=p2=p, we obtain the bulk topological error threshold as p=4.3×10−3 from Fig. 10 of ref. 18, where the threshold curve of (q1,q2) is numerically calculated by using the minimum-weight-perfect-matching algorithm.

Figure 4

The stepwise creation of the resource state.

is created from a to e.

Figure 5

The measuring pattern.

Three qubits are measured in the numerical order from a to c.

The primal defects are created by measuring the edge qubits inside the defect region in the Z basis. At the boundary of the defect region (surface of the defects), these measurements introduce additional Z errors on the face qubits (that is, dual qubits), which has an effect of decreasing the threshold value. At the same time, the existence of the defects changes the boundary condition of the bulk region; at the surface of the primal defects, the dual lattice has a smooth boundary. Thus, there is excess syndrome available at the defect surface, which has an effect of increasing the threshold value. In ref. 18, they have performed numerical simulation for lattices of size L×L×2L, where half of the lattice belongs to the bulk region V and the other half to the defect region D. In their calculations, the error probability of the dual qubits of the surface of the defect is doubled to investigate the surface effect. Their numerical result indicates that although the surface effect due to the smooth boundary (that is, increasing the threshold value) is noticeable, the intersection point of fidelity curves is slowly converging to the threshold value of the bulk region in the increasing number of the lattice size. This indicates that the Z basis measurements for the defect creations do not lower the threshold for TMBQC. In the present case, the error probability of the Z basis measurement is increased by λ=2(2p/3)+2(2p/3)+p2 because of the additional qubits for the blind Z-basis measurement. However, when p=p=p2=4.3×10−3, the error probability λ=1.6×10−2 is still smaller than the situation that has been considered in ref. 18. Thus, the defect creations do not lower the threshold in the blind setup again, and hence the threshold value is determined by that for the bulk region.

Topological error correction breaks down near the singular qubits, and it results in an effective error on the singular qubits1213. This effective error is local because singular qubits are well separated from each other. Magic state distillation17 can tolerate a rather large amount of noise, and therefore the overall threshold is determined by that for the bulk topological region1213. In fact, the recursion relations of the distillations of Y and basis states are given by and , where and indicate the probability of errors introduced by the Clifford gates for the magic state distillation13. To optimize their overheads, the scale factor and defect thickness at each distillation level are chosen so that and are balanced. As and can be reduced rapidly by increasing the scale factor and the thickness of the defect, the threshold values for the magic state distillation can be determined as ɛ=0.38 and ɛ=0.17 for Y- and T-state distillations, respectively. In the present decorated case, the error probability of the injected magic state is at most ɛ=4p2+2p2+3(2p/3)+3(2p/3), where the first, second, third and fourth terms indicate four CZ gates for generating the RHG lattice, two CZ gates for the decoration, three measurements and three state preparations. With p=p=p2=4.3×10−3, ɛ=10p2=0.043, which is sufficiently smaller than the threshold values for the magic state distillations.

In the above arguments, we have assumed p=p=p2 for simplicity. However, p might be much larger than p and p2, as Alice's quantum technology is assumed to be much weaker than that of Bob and the randomly rotated qubits are sent from Alice to Bob through a probably noisy quantum channel. In addition, Alice cannot distill her qubits, as she cannot use any two-qubit gate. Hence, let us consider another representative scenario, p=10p and p=p2=p. Interestingly, the direct calculation shows that the error threshold is p=1.6×10−3 (that is, still of the order of 10−3). This suggests the nice robustness on Alice's side in the topological fault-tolerant protocol. Note that this result is reasonable because the preparation error behaves as an independent error, and independent errors are known to be easy to correct. In fact, if there is no correlated error, TMBQC can tolerate the independent error up to 2.9%.

Discussion

In addition to the probabilistic depolarizing noise, which we have considered, there are many possibilities of errors. For example, quantum computation can suffer from the detectable qubit loss, such as photon loss, atoms or ions escaping from traps, or more generally, the leakage of a qubit out of the computational basis in a multilevel system. In ref. 19, the threshold of the TMBQC for the qubit loss was studied. Here, let us briefly explain that we can obtain a similar threshold for the qubit loss in our blind protocol. As in ref. 19, let us assume that losses are independent and identically distributed events with the probability ploss. If one of the three qubits labelled with 1, 2 and 3 in Fig. 1b is lost, then we just consider the entire three-qubit chain is lost. Then, we can use the result of ref. 19, and our threshold for the qubit loss is obtained by replacing their ploss with 3ploss. Note that if we also use the post-selected scheme of ref. 19, then the overhead is , which is still independent of the size of the algorithm, and hence ensuring scalability. Another possible error, the non-determinism of CZ gates, was considered in refs 20,21 for TMBQC. For example, in ref. 20, the three-dimensional resource state is created by fusing the 'puffer ball' states. If the one-dimensional chain of two qubits is added to the root qubit of each puffer ball state, can be created by a similar fusion strategy and the threshold can also be calculated in a similar way.

Although the simulation of fault-tolerant quantum circuits in the blind MBQC on the brickwork state was mentioned in ref. 3, it is only the existence proof. Neither a concrete scheme nor an explicit calculation of the threshold was given. Furthermore, on the two-dimensional brickwork state, we should use the fault-tolerant scheme of the one-dimensional nearest-neighbour circuit model architecture. For the circuit model, the threshold of this scheme is of the order of 10−5 (refs 22,23). If we implement this scheme on MBQC, the threshold should be ∼10−6 due to the extra qubits2425. As is mentioned in ref. 3, the threshold should be increased if the three-dimensional brickwork state is considered. However, the explicit calculation of the threshold for the scheme of ref. 26 is not known and should be smaller than that of TMBQC.

In the protocol, Alice performs the decoding operation (error correction) by using the classical data from Bob1213. We have calculated the threshold value for the present blind protocol by following the result in ref. 18, where the minimum-weight-perfect-matching algorithm is used for the decoding problem. Although the minimum-weight-perfect-matching is an efficient algorithm in the sense that it scales polynomially, it might cost large classical computational resources when the lattice size is large. However, more efficient classical algorithms for the decoding problem have also been developed272829, one of which27 achieves the decoding of the lattice of four million qubits within a few seconds by using a today's typical classical computer, whereas the resultant threshold 0.9% is higher than that 0.75% in ref. 18. In this sense, Alice's classical processing does not present any problem here.

Methods

Definition of the blindness

Here we show the blindness of our protocol. Intuitively, a protocol is blind if Bob, given all the classical and quantum information during the protocol, cannot learn anything about Alice's computational angles, input and output356. A formal definition we adopt here is as follows (see also refs 3,5,6).

A protocol is blind if: (B1) the conditional probability distribution of Alice's computational angles, given all the classical information Bob can obtain during the protocol, and given the measurement results of any POVMs that Bob may perform on his system at any stage of the protocol, is equal to the a priori probability distribution of Alice's computational angles; and (B2) the final classical output is one-time padded to Bob.

Our protocol satisfies B1

Let us define Δ≡(Δ1,.....,Δ), Φ≡(Φ1,......,Φ), Θ≡(Θ1,......,Θ), R≡(R1,.....,R), where and R ε {0,1} are random variables, corresponding to the angles sent by Alice to Bob, random prerotations, Alice's secret computational angles and the hidden binary parameters, respectively. From the construction of the protocol, the relation Δ=Φ+Θ+Rπ (mod 2π) is satisfied. Let be a POVM, which Bob may perform on his . Let O ε {1,...,m} be the random variable corresponding to the result of the POVM. Bob's knowledge about Alice's computational angles is given by the conditional probability distribution of Φ=(φ1,.....,φ) given O=j and Δ=(δ1,.....,δ): P(Φ=(φ1,.....,φ)|O=j, Δ=(δ1,.....,δ)).

From Bayes' theorem, we have

Our protocol satisfies B2

It is easy to confirm that when Bob measures the qubit labelled with 3 in Fig. 1b, the state is one-time padded with , where s1 (s2) is the measurement result of the qubit labelled with 1 (2) in Fig. 1b. The values of s1 and s2 are unknown to Bob, as are unknown to Bob. We can show that are unknown to Bob as follows.

Additional information

How to cite this article: Morimae, T. & Fujii, K. Blind topological measurement-based quantum computation. Nat. Commun. 3:1036 doi: 10.1038/ncomms2043 (2012).