## Abstract

In the framework of quantum computational tensor network, which is a general framework of measurement-based quantum computation, the resource many-body state is represented in a tensor-network form (or a matrix-product form) and universal quantum computation is performed in a virtual linear space, which is called a correlation space, where tensors live. Since any unitary operation, state preparation and the projection measurement in the computational basis can be simulated in a correlation space, it is natural to expect that fault-tolerant quantum circuits can also be simulated in a correlation space. However, we point out that not all physical errors on physical qudits appear as linear completely-positive trace-preserving errors in a correlation space. Since the theories of fault-tolerant quantum circuits known so far assume such noises, this means that the simulation of fault-tolerant quantum circuits in a correlation space is not so straightforward for general resource states.

## Introduction

Quantum many-body states, which have long been central research objects in condensed matter physics, statistical physics and quantum chemistry, are now attracting the renewed interest in quantum information science as fundamental resources for quantum information processing. One of the most celebrated examples is one-way quantum computation^{1,2,3}. Once the highly-entangled many-body state which is called the cluster state is prepared, universal quantum computation is possible with adaptive local measurements on each qubit. Recently, the concept of quantum computational tensor network (QCTN)^{4,5,6}, which is the general framework of measurement-based quantum computation on quantum many-body states, was proposed. This novel framework has enabled us to understand how general measurement-based quantum computation is performed on many other resource states beyond the cluster state. The most innovative feature of QCTN is that the resource state is represented in a tensor-network form (or a matrix-product form)^{7,8,9} and universal quantum computation is performed in the virtual linear space where tensors live. For example, let us consider the one-dimensional open-boundary chain of *N* qudits in the matrix-product form

where {|0〉, …, |*d* − 1〉} is a certain basis in the *d*-dimensional Hilbert space (2 ≤ *d* < ∞), |*L*〉 and |*R*〉 are *D*-dimensional complex vectors and {*A*[0], …, *A*[*d* − 1]} are *D* × *D* complex matrices. Let us also define the projection measurement on a single physical qudit by

where

0 < θ < π and 0 ≤ φ < 2π. If we do the measurement on the first physical qudit of Eq. (1) and if the first physical qudit is projected onto, for example, |α_{θ,φ}〉 as a result of this measurement, the state Eq. (1) becomes

where

Now we can imagine a virtual linear space where *A*’s, |*R*〉 and |*L*〉 live. This virtual linear space is called the correlation space^{4,5,6,10,11,12}. Then, the above equation can be interpreted that the “gate operation” is implemented on the “quantum state” |*R*〉 in the correlation space. In particular, if *A*[0], *A*[1], θ and φ are appropriately chosen in such a way that *A*[α_{θ,φ}] is proportional to a unitary, we can “simulate” the unitary evolution of the vector |*R*〉 in the correlation space. The core of QCTN is this “virtual quantum computation” in the correlation space. If the correlation space has a sufficient structure and if *A*’s, |*L*〉 and |*R*〉 are appropriately chosen, we can “simulate” universal quantum circuit in the correlation space^{4,5,6,10,11,12}.

For the realization of a scalable quantum computer, a theory of fault-tolerant (FT) quantum computation^{13,14,15,16,17} is necessary. In fact, several researches have been performed on FT quantum computation in the one-way model^{3,18,19,20,21,22}. However, there has been no result about a theory of FT quantum computation on general QCTN. (See the recent progress to this direction^{23,24,25,26}.) In particular, there is severe lack of knowledge about FT quantum computation on resource states with *d* ≥ 3. It is necessary to consider resource states with *d* ≥ 3 if we want to enjoy the cooling preparation of a resource state and the energy-gap protection of measurement-based quantum computation with a physically natural Hamiltonian, since no genuinely entangled qubit state can be the unique ground state of a two-body frustration-free Hamiltonian^{27}.

One straightforward way of implementing FT quantum computation on QCTN is to encode physical qudits with a quantum error correcting code:

where (*i* = 1, …, *N*) is the encoded version of |*k*_{i}〉 (such as and , etc.) In fact, this strategy was taken in Refs.^{21,22} for the one-way model (*d* = 2) and it was shown there that a FT construction of the encoded cluster state is possible. For *d* ≥ 3, however, such a strategy is difficult, since theories of quantum error correcting codes and FT preparations of the encoded resource state are less developed for *d* ≥ 3. Furthermore, if we encode physical qudits with a quantum error correcting code, the parent Hamiltonian should no longer be two-body interacting one.

The other way of implementing FT quantum computation on QCTN is to simulate FT quantum circuits in the correlation space. Since any unitary operation, state preparation and the projective measurement in the computational basis can be simulated in a correlation space (for a precise discussion about the possibility of the measurement, see Ref.^{12}), it is natural to expect that FT quantum circuits can also be simulated in a correlation space. An advantage of this strategy is that theories of FT quantum circuits for qubit systems are well developed^{13,14,15,16,17}. In fact, this strategy was taken in Refs.^{18,19} for the one-way model (*d* = 2). They introduced a method (which we call “the ensemble method” since the ensemble of all measurement results are considered) of simulating quantum circuits in the correlation space of the cluster state and showed that all physical errors on physical qubits can be linear completely-positive trace-preserving (CPTP) maps in the correlation space of the cluster state. (For details, see Sec. I of the supplementary material.) This means that FT quantum circuits can be simulated in the correlation space of the cluster state.

In this paper, however, we point out that it is not so straightforward to simulate FT quantum circuits in the correlation space of a general resource state. In order to see it, we consider two standard methods of simulating quantum circuits in the correlation space. First, we directly apply the ensemble method of Refs.^{18,19} to the one-dimensional Affleck-Kennedy-Lieb-Tasaki (AKLT) state^{28,29}, as an example and see that not all physical errors on physical qutrits can be linear CPTP maps in the correlation space of the AKLT state. Since all theories of FT quantum circuits known so far assume such noises^{13,14,15,16,17}, this means that it is not so straightforward to apply these FT theories to quantum circuits simulated in the correlation space of general resource states. (Note that quantum error correction is not equivalent to fault-tolerant quantum computation: non-CPTP errors can be corrected by quantum error-correcting codes, but that does not necessarily mean the possibility of fault-tolerant quantum computation.) We give some intuitive explanations of reasons why the cluster state is so special and why not all resource states work as the cluster state. Second, we consider another natural method of simulating quantum circuits in the correlation space, which we call “the trajectory method” (since only a specific history of measurement results, i.e., a specific trajectory, is considered). This method is another standard way of simulating quantum circuits in the correlation space when the system is assumed to be error-free^{4,5,6,10,28}. We show a general theorem which says that if *d* ≥ 3 not all physical errors on physical qudits can be linear CPTP maps in the correlation space if we consider the trajectory method. This means that the trajectory method does neither work in general.

In short, we show in this paper that it is not so straightforward to simulate FT quantum circuits in the correlation space of a general resource state. Since all errors behave nicely in the correlation space of the cluster state^{18,19}, less attention has been paid to the difference between a real physical space and a correlation space of a general resource state. Our results here suggest that these two spaces can be different and because of the difference, simulations of FT quantum circuits can be difficult in a general correlation space. To our knowledge, there is so far no other methods than those two methods, i.e., the ensemble method and the trajectory method. However, of course there is a possibility that a new method will be developed in a future. Therefore, what we show here is not the impossibility of making QCTN fault-tolerant. Such a new method might be able to make all QCTN fault-tolerant. We hope that our results here will help to tackle such a challenging subject of a future study.

## Results

### Assumption

Throughout this paper, we make the following assumptions: Since the MPS , Eq. (1), is a resource state for measurement-based quantum computation, we can assume without loss of generality that *A*[α_{θ,φ}], *A*[β_{θ,φ}], *A*[2], *A*[3], …, *A*[*d* − 1] are unitary up to constants:

where *c*_{α}, *c*_{β}, *c*_{2}, … *c*_{d}_{−1} are real positive numbers, *U*_{α}, *U*_{β}, *U*_{2}, …, *U*_{d}_{−1} are unitary operators and

This means that any operation implemented in the correlation space by the measurement on a single physical qudit of is unitary. Note that this assumption is reasonable, since otherwise does not seem to be useful as a resource for measurement-based quantum computation. In fact, all known resource states so far including the cluster state and the AKLT state, satisfy this assumption by appropriately rotating each local physical basis. Furthermore, we can take *c*_{α}, *c*_{β}, *c*_{2}, …, *c*_{d}_{−1} such that

since

and we can redefine .

### Simulation on the AKLT state with the ensemble method

Let us first consider the direct application of the ensemble method of Refs.^{18,19}, which was used for the cluster state, to the AKLT state. As is shown in Refs.^{18,19}, all physical errors can be linear CPTP maps in the correlation space of the cluster state. (This is also the case for the tricluster state^{30}. See Sec. III and IV of the supplementary material.) However, here we show that if we directly apply the ensemble method to the AKLT state, not all physical errors can be linear CPTP maps in the correlation space of the AKLT state.

Roughly speaking, in the ensemble method, we consider the mixture of all measurement results (measurement histories) during the feed-forwarding stage. For the cluster state, it works well, since the desired gate operation can be implemented deterministically because of the feed-forwarding and if we trace out states which registered each measurement results after the feed-forwarding, the entire state again becomes pure. (For details, see Ref.^{19} and the Supplementary Material.)

The one-dimensional AKLT state is the matrix-product state defined by *d* = 3, *A*[0] = *X*, *A*[1] = *XZ* and *A*[2] = *Z*. Let us assume that a CPTP error , where , occurs on a physical qutrit of the AKLT state. If we simulate quantum circuits in the correlation space of the AKLT state after this error with the ensemble method, the map

is implemented in the correlation space, where Ξ_{j}’s are certain operators which depend on {*F*_{j}}. (For details, see Sec. II of the supplementary material.) For example, let us consider the error with . Then, we can show that

where δ is a certain positive number. This means that the map _{AKLT} is not linear CPTP.

### Intuitive explanations

We have seen that the ensemble method of Refs.^{18,19} for the cluster state cannot be directly applied to other resource states, such as the one-dimensional AKLT state. Why the cluster state is so special? And why it does not work for other resource states? Although the complete answer to these questions is beyond the scope of the present paper, since the study of QCTN itself has not been fully developed (for example, no one knows the necessary and sufficient condition for tensor-network states to be universal resource states), let us try to give some intuitive explanations here.

Figure 1 illustrates the reason why all physical errors become CPTP maps in the correlation space of the one-dimensional cluster state. Let us first consider the ideal case (a) where there is no error. The actual protocol (a-1) is mathematically equivalent to the “input-output” picture (a-2) where the physical input state |ψ〉 is teleported into the left-edge of the short-length cluster chain (indicated in yellow) and finally the physical output state |ψ′〉 is extracted from the right-edge of the short-length cluster chain (indicated in yellow). Since both |ψ〉 and |ψ′〉 are physical states, what is going on in the correlation space which maps the input state |ψ〉 to the output state |ψ′〉 can be described by a linear CPTP operation. In other words, if we can describe measurement-based quantum computation with this “input-output” picture^{19}, the map implemented in the correlation space is guaranteed to be a linear CPTP operation^{19}.

For the cluster state, this “input-output” picture also holds even if there is an error^{19}: In the imperfect case, Fig. 1 (b), let us assume that the input state is degraded by an error and becomes a mixed state ρ. We also assume that measurements are imperfect. However, we can still consider a similar “input-output” picture (b-2)^{19}, which corresponds to the actual protocol (b-1) and again the physical state ρ is mapped into another physical state ρ′, which means that what is going on in the correlation space which maps ρ to ρ′ can be described by a linear CPTP operation.

Note that two special properties of the cluster state enable such an “input-output” picture. First, the one-dimensional cluster state can be decomposed into small pieces of one-dimensional cluster states by applying nearest-neighbour two-body unitary operations (i.e., C*Z* gates). As we can see from Fig. 1 (a-2) and (b-2), this property is necessary for allowing the “input-output” picture. Second, the number of qubits that are measured in order to implement a specific gate does not depend on the measurement results. In other words, for the cluster state, a specific gate can be implemented up to Pauli byproducts at a *fixed* site irrespective of measurement results. Such a deterministic implementation of a gate at a fixed site is necessary for the deterministic (i.e., trace-preserving) “output” in the “input-output” picture, since in the ensemble method, the ensemble (mixture) of all measurement results are considered: If the site where the desired gate operation is completed depends on the measurement results, we cannot extract *the same* output state at a *fixed* site irrespective of measurement results as is shown in Fig. 1 (a-2) and (b-2).

On the other hand, such an “input-output” picture seems to be impossible for the one-dimensional AKLT state, because of the following two reasons: First, as is shown in Fig. 2 left, no nearest-neighbour two-body unitary operation can decompose the one-dimensional AKLT chain into two chains due to the existence of the non-vanishing two-point correlation in the AKLT state. (If the one-dimensional AKLT chain can be decomposed into two chains by such a unitary, it contradicts to the well-known fact that the two-point correlation is non-vanishing in the AKLT state.) Second, we cannot deterministically implement a specific gate at a *fixed* site of the AKLT chain irrespective of measurement results^{4,5,28}. In short, the “input-output” picture seems to be impossible for the AKLT state. If we can no longer use the “input-output” picture, it is not unreasonable that we have some anomalous maps in the correlation space since the correlation space is not a physical space but an abstract mathematical space.

### Simulating quantum circuits with the trajectory method

As we have seen, it is not always possible for general resource states to implement a specific gate at a fixed site irrespective of measurement results. This fact prohibits a general resource state from allowing the “input-output” picture. One might think that if we abandon such a deterministic “output” at a fixed site for all measurement results and if we just consider a specific history (trajectory) of measurement results, we might be able to avoid the emergence of non-CPTP errors, such as _{AKLT}. (Physically, this means that we project the system onto a pure state at every measurement step:

with the corresponding projector *P*. Note that considering a specific trajectory of certain measurement results does not mean that if we obtain other trajectories, such events are discarded as done in, for example, linear optical quantum computation. Rather, it means that we describe measurement-based quantum computation with respect to each trajectory instead of the ensemble of all trajectories.) If the system is assumed to be error-free, this “trajectory method” is another standard way of simulating quantum circuits in the correlation space^{4,5,6,10,28}. (Note that in this trajectory method, correct unitary operators can be implemented in the correlation space if there is no error, although what we are physically doing are projections, i.e., non-trace-preserving operations).

However, we here show that such a natural another way of simulating quantum circuits does neither work if *d* ≥ 3. In other words, we can show the following theorem. (For a proof, see Methods.)

**Theorem:** If *d* ≥ 3, there exists a single-qudit CPTP error which has the following property: assume that is applied on a single physical qudit of Eq. (1). If the measurement is performed on that affected qudit and if the entire system is projected onto a pure state as a result, a non-TP operation is implemented in the correlation space.

## Discussion

In order to gain an intuitive understanding of the above theorem, let us finally consider the tensor-network state proposed in Ref.^{31} as an example. The state is defined by the following tensor network^{31}:

(see Fig. 2 right). *A*_{⊥}’s are defined in the same way. Each horizontal line works as a single-qubit wire. Two nearestneighbour horizontal chains are decoupled by measuring sites B in the *z*-basis. Before starting the computation, the filtering operation {*F*, *F*′}, where and , is applied on each site A. Let us assume that the filtering is succeeded (i.e., *F* is realized) and a site B is projected onto . Then, the measurement

implements *ZXe*^{iZφ}^{/2}, *Xe*^{iZφ}^{/2}, or *Z*, respectively. (The result does not occur.) Let us assume that the singlequdit error

where *E* is the error which exchanges and , occurs and that thus affected particle is measured in . If the measurement result is , we obtain the map

which is not linear CPTP, is implemented in the correlation space.

## Methods

**Proof:** In order to show Theorem, let us assume that

We will see that this assumption leads to the contradiction that *d* ≤ 2. First, let us consider the state

where is the unitary error which exchanges |*a*〉 and |*b*〉 and *I* is the identity operator on a single qudit. In Eq. (4), the error is applied on the first physical qudit of . If we do the measurement on the first physical qudit of Eq. (4) and if the measurement result is |2〉, Eq. (4) becomes

In other words, the operation is implemented in the correlation space. By the assumption Eq. (3), this operation should work as a TP operation in the correlation space. Therefore,

By taking η ≡ ||*A*[1]||^{2},

Second, let us consider the measurement on the first physical qudit of , where is a unitary phase error and ω ≡ 2π/*d*. If the measurement result is |α_{θ,φ}〉,

is implemented in the correlation space, where . By the assumption Eq. (3), this should work as a TP operation in the correlation space. Therefore,

By the assumption Eq. (2), *A*^{†}[2]*A*[2] = *ξI*, where ξ ≡ ||*A*[2]||^{2}. Furthermore, as we have shown, *A*^{†}[1]*A*[1] = *ηI* (Eq. (7)). Therefore,

where . Finally, let us consider the measurement on the first physical qudit of , where *t* ∈ {0, 1, …, *d* – 1}. If the measurement result is |α_{θ,φ}〉,

is implemented in the correlation space, where . By the assumption Eq. (3), this should also work as a TP operation in the correlation space. Therefore,

where . From Eqs. (8) and (9), , where . Let us assume that . Then, , where . If , which means *A*[1] = 0 since *A*[2] is unitary up to a constant (assumption Eq. (2)). Therefore, . In this case, for certain , since *A*[2] is unitary up to a constant. Hence . This means

where *r*_{s,t} ∈ {0, 1, 2, 3, …}. Let us take *t* = *s* = 0. Then, Eq. (10) gives . Let us take *s* = 1, *t* = 0. Then, Eq. (10) gives . In order to satisfy these two equations at the same time, there must exist *r*_{0,0} and *r*_{1,0} such that . If *r*_{0,0} = *r*_{1,0}, then 0 = 1/*d* which means *d* = ∞. Therefore *r*_{0,0} ≠ *r*_{1,0}. Then we have , which is the contradiction.

One might think that if we rewrite the post-measurement state Eq. (5) as

and redefine the operation implemented in the correlation space as , the TP-ness is recovered in the correlation space. However, in this case, the non-lineally appears unless *A*^{†}[1]*A*[1] ∝ *I* and therefore if we require the linearity in the correlation space, we obtain the same contradiction.

In short, if *d* ≥ 3 not all physical errors on physical qudits appear as linear CPTP errors in the correlation space of pure matrix product states.

## References

Raussendorf, R. & Briegel, H. J. A one-way quantum computer. Phys. Rev. Lett. 86, 5188 (2001).

Raussendorf, R., Browne, D. E. & Briegel, H. J. Measurement-based quantum computation on cluster states. Phys. Rev. A 68, 022312 (2003).

Raussendorf, R. Ph.D. thesis, Ludwig-Maximillians Universität München, 2003.

Gross, D. & Eisert, J. Novel schemes for measurement-based quantum computation. Phys. Rev. Lett. 98, 220503 (2007).

Gross, D., Eisert, J., Schuch, N. & Perez-Garcia, D. Measurement-based quantum computation beyond the one-way model. Phys. Rev. A 76, 052315 (2007).

Gross, D. & Eisert, J. Quantum computational webs.

*Phys. Rev. A*82, 040303(R) (2010).Fannes, M., Nachtergaele, B. & Werner, R. F. Valence bond states on quantum spin chains as ground states with spectral gap. J. Phys. A 24, L185 (1991).

Verstraete, F., Cirac, J. I. & Murg, V. Matrix product states, projected entangled pair states and variational renormalization group methods for quantum spin systems. Adv. Phys. 57, 143 (2008).

Cirac, J. I. & Verstraete, F. Renormalization and tensor product states in spin chains and lattices. J. Phys. A: Math. Theor. 42, 504004 (2009).

Cai, J. M., Dür, W., Van den Nest, M., Miyake, A. & Briegel, H. J. Quantum computation in correlation space and extremal entanglement. Phys. Rev. Lett. 103, 050503 (2009).

Morimae, T. How to upload a physical quantum state into correlation space. Phys. Rev. A 83, 042337 (2011).

Fujii, K. & Morimae, T. Computational power and correlation in a quantum computational tensor network. Phys. Rev. A 85, 032338 (2012).

Shor, P. W. Proc. of the 37th Symposium on Foundations of Computing, p.56 (IEEE Computer Society Press, 1996).

Aharonov, D. & Ben-Or, M. Proc. of the 29th Annual ACM Symposium on Theory of Computing, p. 176 (ACM Press, New York, 1998).

Kitaev, A. Yu. Russian Math. Surveys 52, 1191 (1997).

Knill, E., Laflamme, R. & Zurek, W. H. Resilient quantum computation: error models and thresholds. Proc. Roy. Soc. London, Ser A 454, 365 (1998).

Terhal, B. M. & Burkard, G. Fault-tolerant quantum computation for local non-Markovian noise. Phys. Rev. A 71, 012336 (2005).

Nielsen, M. A. & Dawson, C. M. Fault-tolerant quantum computation with cluster states. Phys. Rev. A 71, 042323 (2005).

Aliferis, P. & Leung, D. W. Simple proof of fault tolerance in the graph-state model. Phys. Rev. A 73, 032308 (2006).

Silva, M., Danos, V., Kashefi, E. & Ollivier, H. A direct approach to fault-tolerance in measurement-based quantum computation via teleportation. New. J. Phys. 9, 192 (2007).

Fujii, K. & Yamamoto, K. Topological one-way quantum computation on verified logical cluster states. Phys. Rev. A. 82, 060301(R) (2010).

Fujii, K. & Yamamoto, K. Cluster-based architecture for fault-tolerant quantum computation. Phys. Rev. A 81, 042324 (2010).

Raussendorf, R. & Harrington, J. Fault-tolerant quantum computation with high threshold in two dimensions. Phys. Rev. Lett. 98, 190504 (2007).

Raussendorf, R., Harrington, J. & Goyal, K. Topological fault-tolerance in cluster state quantum computation. New J. Phys. 9, 199 (2007).

Li, Y., Browne, D. E., Kwek, L. C., Raussendorf, R. & Wei, T. C. Thermal states as universal resources for quantum computation with always-on interactions. Phys. Rev. Lett. 107, 060501 (2011).

Fujii, K. & Morimae, T. Topologically protected measurement-based quantum computation on the thermal state of a nearest-neighbor two-body Hamiltonian with spin-3/2 particles. .Phys. Rev. A 85, 010304(R) (2012

Chen, J., Chen, X., Duan, R., Ji, Z. & Zeng, B. No-go theorem for one-way quantum computing on naturally occurring two-level systems. Phys. Rev. A 83, 050301(R) (2011).

Brennen, G. K. & Miyake, A. Measurement-based quantum computer in the gapped ground state of a two-body Hamiltonian. Phys. Rev. Lett. 101, 010502 (2008).

Affleck, I., Kennedy, T., Lieb, E. H. & Tasaki, H. Valence bond group states in isotropic quantum antiferromagnets. Comm. Math. Phys. 115, 477 (1988).

Chen, X., Zeng, B., Gu, Z., Yoshida, B. & Chuang, I. L. Gapped two-body Hamiltonian whose unique ground state is universal for one-way quantum computation. Phys. Rev. Lett. 102, 220501 (2009).

Cai, J. M., Miyake, A., Dür, W. & Briegel, H. J. Universal quantum computer from a quantum magnet. Phys. Rev. A 82, 052309 (2010).

## Acknowledgements

TM acknowledges supports by ANR (StatQuant, JC07 07205763) and JSPS. KF acknowledges support by MEXT (Grant-in-Aid for Scientific Research on Innovative Areas 20104003).

## Author information

### Authors and Affiliations

### Contributions

All results are obtained through the discussion between TM and KF. Mainly TM wrote the manuscript. All authors reviewed the manuscript.

## Ethics declarations

### Competing interests

The authors declare no competing financial interests.

## Electronic supplementary material

### Supplementary Information

Supplementary material

## Rights and permissions

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareALike 3.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-sa/3.0/

## About this article

### Cite this article

Morimae, T., Fujii, K. Not all physical errors can be linear CPTP maps in a correlation space.
*Sci Rep* **2**, 508 (2012). https://doi.org/10.1038/srep00508

Received:

Accepted:

Published:

DOI: https://doi.org/10.1038/srep00508

## 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.