Measurement based quantum communication with resource states generated by entanglement purification
Abstract
We investigate measurementbased quantum communication with noisy resource states that are generated by entanglement purification. We consider the transmission of encoded information via noisy quantum channels using a measurementbased implementation of encoding, error correction and decoding. We show that such an approach offers advantages over direct transmission, gatebased error correction and measurementbased schemes with direct generation of resource states. We analyze the noise structure of resource states generated by entanglement purification and show that a local error model, i.e. noise acting independently on all qubits of the resource state, is a good approximation in general, and provides an exact description for states. The latter are resources for a measurementbased implementation of error correction codes for bitflip or phase flip errors. This provides a first link between the recently found very high thresholds for faulttolerant measurementbased quantum information processing based on local error models for resource states, to error thresholds for gate based computational models.
pacs:
03.67.Hk, 03.67.Lk, 03.67.PpI Introduction
Quantum communication is a key aspect to make the tools of quantum information processing available for spatially separated parties. Quantum error correction Nielsen and Chuang (2010); Schlingemann and Werner (2001) and entanglement purification Bennett et al. (1996); Deutsch et al. (1996); Dür and Briegel (2007) are two approaches to combat the noise and imperfections one invariably encounters in any realistic setting, and it are these methods that make sharing entanglement over large distances feasible.
The measurement based approach to quantum computation Briegel et al. (2009); Raussendorf and Briegel (2001); Gottesman and Chuang (1999) is one way to implement the protocols used in quantum communication to establish long distance entanglement. Recent results Zwerger et al. (2012, 2013, 2014, 2016) show that a measurement based approach can be applied also in the context of entanglement purification, quantum error corrections, quantum communication and hybrid quantum computation, and offers high error thresholds. It was found that a measurement based implementation can tolerate more than 23% local depolarizing noise per qubit for bipartite entanglement purification Zwerger et al. (2013) and more than 13% for faulttolerant quantum computation using a hybrid model Zwerger et al. (2014). While these thresholds are the limits of these approaches, they highlight the application potential of small scale resource states and provide motivation to study them further. Elements of such a measurementbased approach to quantum error correction have already been experimentally demonstrated with trapped ions Lanyon et al. (2013) and photons Barz et al. (2014). Furthermore, for entanglement purification at the logical level Zhou and Sheng () a measurement based implementation would be especially suitable.
Here we investigate multipartite entanglement purification Dür et al. (2003); Aschauer et al. (2005); Kruszynska et al. (2006); Dür and Briegel (2007); Goyal et al. (2006); Glancy et al. (2006) as one specific approach to generate resource states for quantum error correction and quantum communication with a high fidelity. We analyze the performance of states generated in this way in quantum communication protocols that work via the transmission of encoded quantum information using an error correction code. Note that entanglement purification can both be used to generate entangled states between distant parties as well as at individual sites to generate resource states to locally implement a quantum task in a measurement based way. We also investigate the noise structure of the purified states, as the locality of the noise is one important assumption to obtain the thresholds mentioned above Zwerger et al. (2016). While it has been conjectured that the states resulting from imperfect entanglement purification should approximately be described by local noise Raussendorf et al. (2006), this has not been formally proven or investigated.
Our two main results are as follows:

A local noise model is a good approximation to describe resource states generated by imperfect entanglement purification. In general, this description is not exact, however the amount of nonlocal noise is very small. For certain resource states such as GreenbergerHorneZeilinger (GHZ) states, an exact description by a local noise model is possible by slightly reducing the fidelity.

Encoded quantum communication over noisy channels where encoding, decoding and error correction is implemented in a measurement based way with resource states generated by entanglement purification outperforms direct transmission of quantum information, schemes making use of gatebased implementation of error correction as well as measurementbased schemes where resource states are generated directly via gates.
Furthermore, for a specific, restricted noise process and task, we provide a connection between error models for measurementbased implementation of quantum error correction (where one considers noisy resource states) on the one hand, and gatebased error models on the other hand. This link is of particular interest as the error thresholds for measurementbased approaches have been shown to be an order of magnitude higher than for gatebased approaches Zwerger et al. (2012, 2013, 2014, 2016), but the underlying error models are not directly comparable.
The paper is organized as follows: In section II we give an overview of the concepts and notations used. Reader familiar with graph states, error correction, measurementbased quantum information processing or multipartite entanglement purification may skip the corresponding sections. In section III we investigate whether the noise of the state generated by an entanglement purification protocol (EPP) can be described by local noise for GHZ states and the resource state for the clusterring code. We also show that noise can always be localized for GHZ states. In section IV we analyze the performance of the resource states generated by entanglement purification in a quantum communication setting. In section V we provide a connection between measurementbased and gatebased error models for a simplified error model. To this aim we investigate the scaling behavior with the number of encoding qubits for the measurement based repetition code.
Ii Background
Here we review the concepts used in this work as well as introducing some notation. We explain the errors model used for our analysis and review graph states, a special class of multipartite quantum states that we use in the context of measurement based quantum error correction. Multipartite entanglement purification is one way to generate high fidelity graph states that is also discussed here.
ii.1 Error model
Noise channels are modeled by completely positive maps. We consider local Pauli diagonal noise channels acting on the th qubit, described by
(1) 
with the error parameters that have to satisfy: . Some special channels of this kind include the local bitflip channel ( noise) with , the local phaseflip channel ( noise) with and the local depolarizing (white noise channel with .
For the gate based protocols we assume that local Clifford operations can be done perfectly, but that the twoqubit entangling gates like the CNOT gate are noisy. The CNOT gate is then described by the map which is modeled by local noise channels acting on the source and the target qubit followed by the perfect operation
(2) 
For the measurement based implementations we assume that the imperfections arise from only having access to imperfect resource states and external sources but the Bell measurements for the readin can be done perfectly. One may also consider imperfect Bell measurements that can be modelled by local depolarizing noise, followed by a perfect measurement. In this case, noise of Bell measurements can be included in the external error parameter.
Occasionally we will also refer to the 2qubit depolarizing noise
(3) 
and the global depolarizing noise channel
(4) 
ii.2 Graph states
A simple, unweighted and undirected graph with vertices is described by the pair . is the set of vertices and is the set of edges, where is the set of subsets of containing elements.
Graph states Raussendorf et al. (2003); Hein et al. (2004, 2006) are a special class of states which can be represented by a graph in such a way that each vertex corresponds to a qubit and every edge indicates a twobody interaction between the qubits it connects. The graph state corresponding to the graph is given by
(5) 
where is the controlled gate acting on qubits and , and is the eigenstate of with eigenvalue .
The orthogonal graph state basis is defined as
(6) 
with . The subscript acts as a reminder that these states are defined with respect to a particular graph and to distinguish them from product states in the computational basis.
These states can be uniquely identified by the eigenvalues of the correlation operators for
(7) 
A graph is called colorable if the vertices of the graph can be colored in using colors in such a way that no two vertices with the same color are connected by an edge.
The graphs in figure 1 are examples of useful graph states.
ii.3 Quantum error correction
Quantum error correction is one approach to deal with the imperfections and noise effects that invariably occur in any realistic setting for quantum information processing tasks. It relies on encoding information in a higher dimensional Hilbert space in a way that errors map the logical state on orthogonal subspaces, such that errors can be detected and corrected. We will consider the following two error correction codes:
The repetition code is a simple way to encode information. The simplest example is given by the three qubit bitflip code (see e.g. Nielsen and Chuang (2010)). The state of a qubit is encoded as using three qubits. This allows one to detect if a error occurs on one of the qubits and apply an appropriate correction operation. The code is easily generalized to protect against bitflip errors by using qubits.
The five qubit cluster ring code Schlingemann and Werner (2001) is an example of an optimal code to correct arbitrary singlequbit errors. Its logical zero state is given by the graph state corresponding to a closed linear cluster with five qubits (as depicted in figure (b)b without the readin qubit on the left)
(8) 
Each type of singlequbit noise produces a distinct pattern, which means that each error operator map the initial logical subspace to a distinct, orthogonal subspace. This can be seen by using the rules for Pauli noise acting on graph states Hein et al. (2004, 2006).
When discussing quantum error correction codes, the parameter ranges of the noise channels for which it is beneficial to use error correction are of central importance. The error channels acting on the physical qubits that are used to encode a state translate to some error probability on the logical level after correction Kesting et al. (2013). As long as the error rate on the logical level is smaller than on the physical level, using the error correction code is beneficial as compared to no encoding. For the three qubit bitflip code with acting on each of the encoded qubits the threshold is , while the 5qubit code described above tolerates local white noise up to p=0.8250 Hein et al. (2005).
ii.4 Measurement based quantum computation
In contrast to other models of quantum computation, the central idea of measurement based quantum computation Briegel et al. (2009); Raussendorf and Briegel (2001) is to use entangled states as a resource to process quantum information. This can be accomplished by measurements on the resource states only. The particular approach used in this work can either be understood as application of oneway quantum computation to particular task Raussendorf et al. (2003), or as teleportationbased computation Bennett et al. (1993); Gottesman and Chuang (1999).
The key notion is to use a modified teleportation protocol which instead of Bell pairs uses a different resource state in order to implement a quantum operation on the input pairs. The resource state implementing a desired map acting on qubits can be found using the ChoiJamiolkowski isomorphism Jamiołkowski (1972). The mixed state that can be used to implement this map probabilistically is given by copies of the pure state with the map acting on one of the halves for each of the copies
(9) 
Additional qubits in the Jamiolkowski state that correspond to fixed inputs or auxiliary qubits being measured can be treated as virtual particles that are useful to understand the construction of the resource state but do not need to be prepared physically.
Similar as in the teleportation protocol, Pauli correction operations depending on the outcome of Bell measurements are applied to the input state prior to the application of the map. For example consider a one qubit unitary operation that is supposed to be applied on a input state using the resource state . If the outcome of the Bell measurement on and is one obtains
(10) 
so is implemented instead of the desired unitary .
In general these Pauli byproduct operators cannot be undone, yielding a probabilistic implementation of the desired map. A Clifford circuit can however be implemented deterministically with a resource state of minimal size, that is with only input and output qubits, because the byproduct Pauli operators that appear from the random outcomes of the Bell measurements can be permuted with the map and it is always possible to correct them Raussendorf et al. (2003); Zwerger et al. (2014, 2012). So in the example above, if is a Clifford operation we know that with , so we can simply apply to the output state and obtain the desired result .
Additional qubits in the Jamiolkowski state that correspond to fixed inputs or auxiliary qubits being measured can be treated as virtual particles that are useful to understand the construction of the resource state but do not need to be prepared physically.
For nonClifford operations the Pauli operators cannot be permuted with the map. Hence one either has to be content with a probabilistic implementation of the operation, or one has to give up the requirement of minimal size as additional auxiliary particles allow one to make the process deterministic by using sequential measurements Raussendorf and Briegel (2001). That means one uses resource states that have additional qubits, which are measured only after the readin with Bell measurements has been performed since the measurement directions have to be adjusted depending on the outcomes.
Both, entanglement purification and quantum error correction, the protocols considered here, use only Clifford operations and can therefore be implemented deterministically with resource states of minimal size Zwerger et al. (2016).
The overall setting of a measurementbased implementation of different quantum information processing tasks is shown in figure 2. The quantum information in one qubit can be encoded using the appropriate resource state and performing the readin using a Bell measurement. Depending on the outcome one also has to apply local Pauli operations as correction similar to the correction for the byproduct operators in a teleportation protocol. The decoding can also be done using the same state, but switching the roles of input and output qubits, as depicted in the right part of figure 2. The outcomes of the Bell measurements in this case do not only include information about the byproduct operators inherent to the measurement based approach but also the error syndrom revealed by the error correction code and can therefore be used to derive the appropriate correction operator (see Appendix G for details).
ii.5 Multipartite entanglement purification
Entanglement purification Bennett et al. (1996); Deutsch et al. (1996); Aschauer et al. (2005); Kruszynska et al. (2006); Dür and Briegel (2007); Dür et al. (2003); Goyal et al. (2006); Glancy et al. (2006) is a method to counteract the negative effects of noise on entangled states. The key idea is to use several copies of a noisy entangled state and apply a protocol that produces fewer, but less noisy copies, using only local operations and classical communication (LOCC).
We briefly discuss a (multipartite) entanglement purification protocol (EPP) that works on twocolorable graph states Dür et al. (2003); Aschauer et al. (2005). We start from a density operator diagonal in the graph state basis corresponding to the desired graph state
(11) 
with the binary vector index split in two parts and to emphasize the two sets of qubits corresponding to different colors. It suffices to consider states diagonal in this basis as every state can be brought to this form via depolarization Aschauer et al. (2005). This protocol consists of two subprotocols P1 and P2. Protocol P1 starts with applying CNOT operations on two copies and of the same state. For qubits in set A the second copy is used as the source and the first copy as the target of the CNOTs while for qubits in set B the CNOTs are applied the other way around. This multilateral CNOT operation has the effect
(12) 
Then all correlation operators belonging to set A are measured on the second copy. This can be accomplished by local, singlequbit measurements. The protocol is successful only if all measurement outcomes are , otherwise it failed and the states have to be discarded. If this purification step is succesful the coefficients of the density operator of the first copy have been updated
(13) 
where the denominator is a normalization constant and the probability of success. Generally the effect of P1 is to amplify coefficients with .
Subprotocol P2 works just like protocol P1 but the role of sets A and B are switched. Applying both protocols in an alternating way allows us to amplify only the desired coefficient .
Iii Noise structure of states generated by entanglement purification
We are interested in the noise structure of the state at the fixed point of an EPP, especially whether that state can be described by a local noise model. This is of particular interest because local noise on the resource state has been used as a model for analysing measurement based setups Zwerger et al. (2016), where locality of noise is crucial for the derivation of error thresholds in this context. The fixed point of the EPP is independent of the initial state –provided the fidelity is sufficiently high–, and only depends on noise of the CNOT operations used in the purification. Since the CNOT gates at each step in the EPP only act locally it is plausible that the fixed point could be described by local noise as well. For similar reasons it is conjectured in Raussendorf et al. (2006) that the errors introduced by the purification procedure are approximately local. Here we systematically investigate if this is indeed the case.
iii.1 General procedure
We start by describing the general procedure we use to perform this investigation. First the entanglement purification protocol with imperfect CNOTs is applied until the fixed point is reached. The imperfections are considered to come from the noisy CNOT operations used in the protocol. This also assumes that the initial state has a sufficiently high fidelity so that the protocol can be successful for a given error parameter. Notice that the specific form of the initial state is irrelevant, as the fixed point of the EPP solely depends on noise in the CNOT gates.
In order to see if the resulting state can be described by a local noise model, we proceed as follows. The resulting state is compared to one that is obtained by applying local Paulidiagonal noise channels on the desired graph state:
(14) 
Now we optimize these noise parameters in order to maximize the fidelity with respect to and
(15) 
If can be reached, the noise at the fixed point of the EPP can be described by a local noise model. Since is a distance measure Nielsen and Chuang (2010) it describes the distance to the closest locally noisy state.
The number of coefficients to be optimized can be reduced by using symmetries and instead of optimizing all coefficients at the same time, only optimize the ones belonging to one set of qubits while keeping the others fixed. The optimization itself is done using an algorithm for sequential least square programming.
iii.2 GHZ states
We start by considering GHZ states that are local unitary equivalent to graph states where one particle is connected to others, see figure (a)a. This can easily be checked by using equation (5) for this particular graph. GHZ states are of particular interest since they are resource states for a measurementbased implementation of encoding, decoding and error syndrome readout for a repetition code that can correct bitflip or phaseflip errors.
iii.2.1 Binarylike mixtures
We first consider the graph state version of the GHZ state with qubits (figure (a)a) and a simplified noise model. The binarylike mixture is a toy model that describes a hypothetical situation for twocolorable graph states in which one color (all qubits in set ) is only affected by noise while the other color (all qubits in set ) is only affected by noise Aschauer et al. (2005). Notice that the different kinds for noise for sets and are a consequence of using the graph state formalism. If one considers GHZ states in the standard basis, this corresponds to noise acting on all particles. Using the graph state formalism, the density operator can then be written as
(16) 
The CNOT operations used in the EPP are adjusted to fit this model by choosing either or as the local error channel in (2) as appropriate. Note that only one subprotocol is necessary for this special model and its effect is given by simply squaring the coefficients and then renormalizing the density matrix.
Using the rules for Paulinoise on graph states Hein et al. (2006) it is easy to see that with noise on set and noise on set as well as only noise on set can always be described by a local noise model. In all these cases, one can always find Pauli noise channels acting on the graph state that describe the corresponding density operators.
Less obvious is the case where only noise is acting on the qubits in set . However, our numerical simulation shows that this can also be described using a local noise model. However, for the case where both, errors on set as well as errors on set , occur, we find that for the resulting state at the fixed point of the EPP, this is no longer the case for . In figure 3 this deviation from the closest local noise model is shown. We can easily obtain the results even for high as it is sufficient to consider coefficients for the binarylike mixture (see Appendix A). This is due to the permutation symmetry of the problem among all qubits in set , which allows one to reduce the number of parameters to describe the density operator from exponentially to lineary many.
While it is interesting to note that the absolute deviation is small, a more meaningful measure is the relative deviation where is the distance between the fixed point state and the perfect resource state. It measures how big of a mistake we would make in the worst case if we were to replace the fixed point state by the closest locally noisy state compared to the error we get by not having the perfect state available. This measure can be understood as an estimate of the fraction of noise that cannot be attributed to local noise processes. The according results in figure 4 clearly demonstrate that the deviation from a local noise model is very small.
This restricted noise model does not only lend itself particularly well to analyse for a high number of qubits because of the reduced number of coefficients, but also because the threshold for the gates used for the EPP does not get increasingly restrictive with the size of the GHZ state. In figure 5 the error parameter for the local noise model closest to the fixed point of the EPP is shown. This indicates that the noise per qubit stays constant for high number of qubits.
iii.2.2 Depolarizing noise
Next we consider the situation of general noise. Even though the error correction code is not suited to deal with this kind of noise, as only bitflip or phaseflip errors can be corrected, it is nevertheless interesting to consider such a situation to assess the performance of the measurementbased approach. We take a look at local depolarizing noise as the noise model of the imperfect CNOT operations in the EPP. Again we look at the GHZ state of various sizes. Similar to the simplified model a local noise model is not able to describe the state at the fixed point of the EPP (see figure 6).
We find that the deviation is rather small for both of these cases. This implies that a local noise model is a good approximation if these resource states are generated by gatebased entanglement purification, however the noise is not exactly local but in general also contains some nonlocal component.
iii.2.3 Alternative noise model for noisy gates
To verify that the description by a local noise model of the states resulting from entanglement purification is a feature of entanglement purification as such, and not of the particular (local) error model used to describe noisy gates, we have also investigated different error models for CNOT operations. We considered a model where noise in the twoqubit CNOT operation is fully correlated, which we describe by twoqubit depolarizing noise with error parameter that acts on the two qubits prior to the application of a perfect CNOT operation. In figure 7 the results for this model is depicted and we see that the deviation also remains small in this case. However, it is much more challenging to investigate states with a higher number of qubits in this case. Because of the correlated noise pattern we need to treat the whole dimensional system instead of the tensor product of two copies with qubits.
iii.2.4 Localizing noise for GHZ states
For GHZ states it is possible to bring the state to a form that can be exactly described by local noise. This is done by further manipulating the resulting state after the EPP by means of stochastic local operations, thereby making it compatible with a local error model at the cost of reducing the fidelity of the state slightly.
We make use of a standard form for GHZ states Dür et al. (1999); Dür and Cirac (2000) which can be written using the graph state basis as
(17)  
with , and as well as . Every state can be brought to this form without changing the fidelity by the probabilistic application of local Clifford operations (see Dür and Cirac (2000) and Appendix E ).
The key ingredient in the localization scheme is that is a separable state that can be easily generated and it is possible to manipulate the coefficients directly by adding to the ensemble with certain weights : with . We can choose the and in such a way that the resulting state is compatible with a local noise model and do so in a way that the fidelity is decreased as little as possible (see Appendix E for full protocol). We only remark here that the choice of Pauli noise channel with equal and noise in set , and equal and noise in set leads to states of above standard form, with certain restrictions on the . One hence only needs to adjust the coefficients in such a way that they are compatible with such a local noise process, which can always be done.
In figure 8 examples for the relative reduction in fidelity of this localization procedure for GHZ states that had been purified using noisy gates with a white noise error model are shown. One sees that since the deviation from a local noise description is small to start with, the localization procedure for noise results in only a very small reduction of the fidelity. Hence noisy GHZ states resulting from EPP can always be brought to a form that they can be described by a local noise model.
iii.3 Clusterring code
We now consider the clusterring code for measurement based error correction and study the corresponding resource state (figure (b)b) for encoding and decoding. This code is capable of correcting one arbitrary error occurring on one of the qubits, and we will now consider depolarizing noise. For the EPP it is beneficial to consider a different graph state (see figure 9), which is local unitary equivalent to the desired state and can be obtained by applying the local complementation rule Hein et al. (2006) on the red qubit in the middle in figure 9. This state has the advantage that it is threecolorable rather than fourcolorable, which makes it more efficient to purify as fewer different subprotocols are needed (see Appendix C).
The relative deviation from a local noise description of the state resulting after EPP is shown in figure 10. While this relative distance is not quite as small as for the GHZ state, the error we would make when using this locally noisy state instead of the fixed point state is still nearly two orders of magnitude smaller than the error from not having access to the perfect graph state. In particular, for small noise, i.e. close to one, the description by a local noise process becomes better.
We have also investigated EPP of other states, e.g. a linear cluster state of five qubits (see Appendix D). Also in this case we find that a local error model provides a good approximation, though the precision is slightly worse as compared to GHZ states or resource state for clusterring code.
Iv Encoded measurement based quantum communication with purified states
The techniques used to obtain high error thresholds for measurement based quantum computation Zwerger et al. (2013, 2014) made a key assumption that the imperfect preparation of the resource states results in a state which can be describe as local noise channels on the perfect state.
Here we investigate how the specific noise pattern that arises when preparing resource states using EPPs with noisy gates influences the performance of measurementbased quantum error correction when using these states as resources instead. In section III we have shown that the local noise model is a good approximation, however, in general the noise cannot be described that way. This difference prevents using the elegant method used in Zwerger et al. (2014, 2016) for the case of local noise, where noise acting on resource states can simply by shifted to the input particles when performing a Bell measurement. For correlated noise, we can not simply do this ^{1}^{1}1For correlated noise with correlation only among input particles or output particles, this approach is still possible. However, for correlated noise between input and output particles, one can no longer use such a simplified analysis., but have to do a full analysis of the overall process. We implemented the actual error correction codes numerically for this discussion (See Appendix G for details.)
The two error correction codes we analyzed are the measurement based variants of a simple repetition code and the fivequbit clusterring code, where the resource states for measurementbased encoding and decoding are shown in figures (a)a and (b)b. To analyze their performance we use the Jamiolkowski fidelity Gilchrist et al. (2005), which is the fidelity of the Jamiolkowski state Eq. 9 of the effective map compared to the ideal case and is also linearly related to the average teleported fidelity Nielsen (2002); Horodecki et al. (1999). We consider three different (elements of) communication scenarios (see figure 11): (i) Decoding of a perfect encoded state; (ii) Decoding after the state was transmitted through a noisy quantum channel; (iii) Encoding, transmission through a noisy quantum channel and decoding.
In all three scenarios, we consider a measurementbased implementation of encoding and decoding, where the latter is with builtin error correction. The resource states are generated by means of noisy EPP. We compare this measurementbased approach with purified states to a direct transmission of the information without encoding, where the effective map for calculating the Jamiolkowski state is simply the external noise channel. We also evaluate the performance of alternative schemes, namely a naive generation of the graph state by directly applying a CZ operation for each edge in the graph and a completely gate based implementation (Appendix F) of the decoding procedure. The error parameters for the CNOT and CZ gates are assumed to be the same for all these approaches. Furthermore, for some cases we also investigate additional variants of how resource states for the measurementbased implementation are prepared (assuming a certain abstract noise model or different variants of EPP).
iv.1 Decoding only
We first consider scenario (i) and investigate the errors that the imperfect resource states introduce when they are used to decode a perfect encoded state. Here we will only show a selection of results that lead to interesting insights about this approach.
One important discovery is apparent from the results concerning the GHZ state with qubits when the CNOT gates are modelled with local white noise, a noise model this code is not suited to correct. In figure 12 one can see that whether the alternating EPP is ended with subprotocol P1 or P2 makes a huge difference for the performance of the resource state. In this particular case it can be easily understood that ending with subprotocol P1 is preferable as it purifies the coefficients belonging to the single qubit in set , which is not protected by the error correction code. From this we conclude, that the details of the preparation procedure is of central importance to the suitability of the resulting resource state. It is possible that further optimization of preparation (e.g. considering other sequences of P1 and P2 than the alternating one) could improve the performance even further.
Next we analyse the influence of the shape of the noise for resource states on the performance for measurementbased decoding. We compare the performance to the state that is actually generated by entanglement purification with resource states that suffer from global (correlated) or local depolarizing noise. We compare resource states with the same fidelity to each other, as error parameters for different models are not directly related. The results are shown in figure 13 for the clusterring code. It appears that correlated noise is rather bad for the performance, however EPP produces states that are close to a local noise model. Interestingly, for a range of fidelities the resource state generated by multiparty entanglement purification outperforms the state with a completely local noise model, if properly optimized (Appendix C). Hence, the locality of the noise does not appear to be the key feature when considering measurement based quantum error correction. It is more important that the resulting noise structure can be efficiently corrected by the chosen error correction code and the most suitable state of those that can be obtained with a certain method is not even necessarily the one with the highest fidelity.
iv.2 Encoding and Decoding with external noise
A more realistic setting in which one has a motivation to make use of error correction is in the presence of external noise, scenario (ii) and (iii). So unlike the case discussed before, the imperfections in the system do not only arise from imperfect resource state preparation. We consider a scenario where a purified resource state is used to decode the encoded qubits sent through a noisy channel (scenario (ii), see figure 11). To evaluate this approach we compare it with simply sending the information without encoding, as well as preparing the resource state directly with gates without EPP and a fully gatebased approach. We also consider the full communication scheme, scenario (iii), where encoding is also done using the same method. So in a measurement based implementation another copy of the resource state is used.
iv.2.1 Binarylike mixture GHZ state
First let us consider a purified binarylike mixture GHZ state with an external error which this code is suited to correct, that is a error channel acting on each of the physical qubits that carry the encoded information.
Figure 14 shows the results for examples of external noise parameter and gate error parameter . When examining that figure it is apparent that even with noisy resource states this approach can be useful, but if the error rate of the channel is very low ( close to 1) the imperfect resource state introduces more errors than it corrects. Furthermore, we see that the measurementbased approach for using states prepared via EPP is superior to a direct preparation of resource states and to a gatebased implementation. From these results one can infer that there is a certain range of parameters for which each of these approaches offer an advantage over nonencoded transmission. These parameter ranges are shown in figure (a)a. If encoding is no longer done perfectly and both encoding and decoding is performed using the same method (scenario (iii)), the ranges found are a bit smaller, but using purified resource states is still very useful and superior to the alternatives considered. (see figure (b)b).
iv.2.2 Clusterring code
We also performed the same comparisons for the clusterring code, but with a local white noise channel as the external noise acting on each encoded qubit. We consider the gate errors to also be described by local white noise. The results in figure 16 for some example values look similar to those for the GHZ state with a restricted error. Again, we find that for scenario (ii) the measurement based approach is beneficial for a wide range of parameters. Using purified resource states again allows for a bigger range than the alternative implementations.
In figure 17 the parameter ranges for which each of the approaches remains useful are shown for scenarios (ii) and (iii). The results look very similar but lack the sudden cutoff at a specific external noise level observed for the restricted noise model. Most importantly, we observe that using the purified resource states allows to use error correction in parameter regimes where the other approaches fail.
V Faulttolerance and scaling for a restricted error model
While very high error thresholds have been found for measurement based setups, these thresholds cannot be directly compared to previous results concerning faulttolerance in a gatebased approach because the underlying error models are completely different. In the measurement based case one usually considers an abstract error model where local noise is acting on the perfect resource state while for the gate based implementation the error parameters specifically describe the individual gates used in the circuit. The approach of using states generated by gate based entanglement purification in measurement based quantum computation tasks could be a promising avenue to find a relation between these two computational models.
The hybrid model of quantum computation Zwerger et al. (2014) is a natural starting point for this investigation as it uses relatively smallscale resource states. In the hybrid model one makes use of the modular nature found in the circuit model (only singlequbit operations and an entangling gate are needed for universal quantum computation), but one implements these elementary building blocks in a measurement based way. However, even for this manageable class of states the analysis is not straightforward. The results presented here should be understood as a first step towards bridging the gap between different error models for different quantum computation architectures and we would like to point out some of the challenges involved in this process.
For a full analysis of fault tolerance in the hybrid model, one would need to investigate resource states for all encoded Clifford gates. Furthermore, it would also require the implementation of nonClifford gates, e.g. via code switchers and transversal gates or via magic state distillation Bravyi and Kitaev (2005). Here we restrict ourselves to one qubit Clifford operations that are implemented in an encoded way, so in particular we are interested in resource states that implement decoding, error detection and encoding at once as these are of central importance to determine the thresholds for the hybrid approach.
However, to actually obtain the faulttolerance thresholds we would have to consider concatenated error correction codes and their scaling with an increasing number of encoding qubits, which poses obvious problems for a numeric analysis. We thus restrict ourselves even further to a scenario with an error model, where only bitflip errors occur. For this type of noise it is sufficient to use the simple bitflip code for error correction. Because both the resource states for encoding and decoding are given by qubit GHZ states one obtains that the combined resource state for decoding and encoding with builtin error correction is simply a qubit GHZ state with input and output qubits (Zwerger et al. (2014) describes how such resource states are constructed in general).
This again leads to the toy model of binarylike mixture GHZ states, where we can obtain results for a large number of qubits and investigate the scaling behavior of the underlying error correction code. We consider a situation where the resource state is generated using an EPP and is then purified to the fixed point of the protocol. The error threshold for which it is still beneficial to use a measurementbased implementation of this error correction code is determined by the smaller one of the following two thresholds: (i) Threshold for EPP, i.e. noise of CNOT gates such that EPP for producing the required resource states (in this case GHZ states of size ) works; (ii) Threshold for measurementbased error correction itself, i.e. of the resulting resource state such that error correction leads to a smaller, in the asymptotic limit vanishing noise at the logical level.
Both thresholds are determined by the gate noise: In case of (i), the acceptable gate noise directly provides the error threshold for the EPP. In case of (ii), the noisy gates determine the achievable fixedpoint of the EPP, and hence the noise of the resource state. This noise, in turn, determines if a successful error correction is possible ^{2}^{2}2Notice that we assume perfect Bell measurements here, as discussed in Sec. II.1.. Regarding (i), error thresholds for noisy EPP have been studied in detail in Aschauer et al. (2005); Kruszynska et al. (2006); Dür and Briegel (2007). These results already provide a bound for the applicability of the approach. For the case studied here if the entanglement purification fails, the error correction also proves to be insufficient, so we concentrate on (ii) in the following.
In addition, the initial states which are used as inputs for the EPP need to be prepared. If one would do this via entangling gates, one needs to make sure that the resulting states are distillable by the noisy EPP. While this limit is no issue for the analysis in the previous sections, it is very relevant when investigating the scaling behavior with many qubits. We generate the initial qubit GHZ states with the gate sequence
(18) 
and then completely symmetrise the resulting state ^{3}^{3}3The symmetrisation can be done locally by randomly reenumerating the qubits.. When considering that for the binarylike mixture the effect of the EPP is simply squaring the coefficients and renormalizing it is apparent that the second highest coefficient is the limiting factor for whether a state is still distillable. The symmetrisation is essential to obtain a good threshold as it equalises multiple coefficients without changing the fidelity and therefore reduces the second highest coefficient. In figure 18 the threshold for the gate noise such that the state prepared this way is still distillable is shown. While this threshold is quite restrictive, keep in mind that for certain physical setups there exist better ways to create a GHZ state such as the MølmerSørensen gate Sørensen and Mølmer (1999) for trapped ions. Hence we continue our analysis below by assuming that the the fixed point states of the EPP for a given gate error parameter can be reached and do not explicitly take the initial state preparation into account.
However, even with all these restrictions placed on the scenario there are still some obstacles to obtaining the threshold value. In order to relate the error threshold of our approach to the known faulttolerance threshold of the error correction code obtained by using the techniques of Zwerger et al. (2014), the noise on the resource state needs to be local so it can be moved from the input qubits of the resource state to the input state. As shown in section III.2.1 the state at the fixed point of the EPP cannot be described by a local noise model and therefore even for the simple noise model in the binarylike mixture case, the threshold is not easily analysed. It should be noted that the protocol to localize the noise for GHZ states in section III.2.4 is not applicable here, as we would leave the subspace in which the binarylike mixture states are located (and thus introduce errors the code is unable to correct). We take a look several different approximations in order to estimate the threshold for the noise of the CNOT gates used in the EPP:

Scenario A: A state with the closest local noise model found by the optimization procedure described in section III.1 is considered instead of the fixed point state.

Scenario B: We consider a GHZ state with one additional qubit and the qubit in set is not affected by noise and later measured out. In this case the noise can be described by local noise (section III.2.1) and while such a noisefree virtual particle is clearly unphysical, it stands to reason that with the symmetry of the GHZ state an additional qubit should not affect the overall scaling.

Scenario C: We only consider the decoding part and the threshold in this case is the value where there remains an interval of external noise for which it is advantageous to encode the information sent. This basically extends the approach of section IV.2.1 to a higher number of encoding qubits.
In figure 19 the scaling of the thresholds is depicted for these scenarios and we find that all of those tend towards a value of . That is, these results indicate that a quantum memory that allows one to protect quantum information against bitflip or phaseflip errors can be obtained with such a measurementbased approach up to this error threshold.
Vi Summary and Outlook
We have shown that using a local noise model for resource states in measurement based quantum information processing is justified. While not exact, such a description serves as a good approximation if the resource states are generated by entanglement purification. For certain resource states, such as GHZ states that are of importance for encoded computations using repetition codes, we have shown that an exact description by a local noise model is possible. This is done by further processing the resulting state locally and slightly adding noise thereby reducing the fidelity of the state by a small amount. It would be interesting to see if such a result can be generalized to other relevant resource states.
Furthermore, we found that the resource states generated via EPP perform well when used for quantum error correction for a large range of parameters, and the locality of the noise does not appear to be a central property for this application. The details of the preparation procedure can influence the performance of the resource states significantly, so it is worthwhile to optimize it for specific applications.
Finally, we have started to relate error models for measurementbased implementation to gatebased error models for specific tasks and a simplified error model. It would be interesting to generalize this analysis to faulttolerant quantum computation with full noise, however it seems that novel techniques and methods are required in this case.
Acknowledgements
This work was supported by the Austrian Science Fund (FWF): P24273N16, P28000N27.
References
 Nielsen and Chuang (2010) M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, 10th ed. (Cambridge University Press, 2010).
 Schlingemann and Werner (2001) D. Schlingemann and R. F. Werner, Phys. Rev. A 65, 012308 (2001).
 Bennett et al. (1996) C. H. Bennett, G. Brassard, S. Popescu, B. Schumacher, J. A. Smolin, and W. K. Wootters, Phys. Rev. Lett. 76, 722 (1996).
 Deutsch et al. (1996) D. Deutsch, A. Ekert, R. Jozsa, C. Macchiavello, S. Popescu, and A. Sanpera, Phys. Rev. Lett. 77, 2818 (1996).
 Dür and Briegel (2007) W. Dür and H. J. Briegel, Rep. Prog. Phys. 70, 1381 (2007).
 Briegel et al. (2009) H. J. Briegel, D. E. Browne, W. Dür, R. Raussendorf, and M. Van den Nest, Nat Phys , 19 (2009), 10.1038/nphys1157.
 Raussendorf and Briegel (2001) R. Raussendorf and H. J. Briegel, Phys. Rev. Lett. 86, 5188 (2001).
 Gottesman and Chuang (1999) D. Gottesman and I. L. Chuang, Nature 402, 390 (1999), 10.1038/46503.
 Zwerger et al. (2012) M. Zwerger, W. Dür, and H. J. Briegel, Phys. Rev. A 85, 062326 (2012).
 Zwerger et al. (2013) M. Zwerger, H. J. Briegel, and W. Dür, Phys. Rev. Lett. 110, 260503 (2013).
 Zwerger et al. (2014) M. Zwerger, H. J. Briegel, and W. Dür, Scientific Reports 4, 5364 (2014).
 Zwerger et al. (2016) M. Zwerger, H. J. Briegel, and W. Dür, Applied Physics B 122, 1 (2016).
 Lanyon et al. (2013) B. P. Lanyon, P. Jurcevic, M. Zwerger, C. Hempel, E. A. Martinez, W. Dür, H. J. Briegel, R. Blatt, and C. F. Roos, Phys. Rev. Lett. 111, 210501 (2013).
 Barz et al. (2014) S. Barz, R. Vasconcelos, C. Greganti, M. Zwerger, W. Dür, H. J. Briegel, and P. Walther, Phys. Rev. A 90, 042302 (2014).
 (15) L. Zhou and Y.B. Sheng, “Purification of LogicQubit Entanglement,” Eprint: arXiv:1511.02344 [quantph] .
 Dür et al. (2003) W. Dür, H. Aschauer, and H.J. Briegel, Phys. Rev. Lett. 91, 107903 (2003).
 Aschauer et al. (2005) H. Aschauer, W. Dür, and H.J. Briegel, Phys. Rev. A 71, 012319 (2005).
 Kruszynska et al. (2006) C. Kruszynska, A. Miyake, H. J. Briegel, and W. Dür, Phys. Rev. A 74, 052316 (2006).
 Goyal et al. (2006) K. Goyal, A. McCauley, and R. Raussendorf, Phys. Rev. A 74, 032318 (2006).
 Glancy et al. (2006) S. Glancy, E. Knill, and H. M. Vasconcelos, Phys. Rev. A 74, 032319 (2006).
 Raussendorf et al. (2006) R. Raussendorf, J. Harrington, and K. Goyal, Annals of Physics 321, 2242 (2006).
 Raussendorf et al. (2003) R. Raussendorf, D. E. Browne, and H. J. Briegel, Phys. Rev. A 68, 022312 (2003).
 Hein et al. (2004) M. Hein, J. Eisert, and H. J. Briegel, Phys. Rev. A 69, 062311 (2004).
 Hein et al. (2006) M. Hein, W. Dür, J. Eisert, R. Raussendorf, M. van den Nest, and H.J. Briegel, in Quantum Computers, Algorithms and Chaos, Proceedings of the International School of Physics ”Enrico Fermi”, Vol. 162 (2006) pp. 115–218.
 Kesting et al. (2013) F. Kesting, F. Fröwis, and W. Dür, Phys. Rev. A 88, 042305 (2013).
 Hein et al. (2005) M. Hein, W. Dür, and H.J. Briegel, Phys. Rev. A 71, 032350 (2005).
 Bennett et al. (1993) C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. K. Wootters, Phys. Rev. Lett. 70, 1895 (1993).
 Jamiołkowski (1972) A. Jamiołkowski, Rep. Math. Phys. 3, 275 (1972).
 Dür et al. (1999) W. Dür, J. I. Cirac, and R. Tarrach, Phys. Rev. Lett. 83, 3562 (1999).
 Dür and Cirac (2000) W. Dür and J. I. Cirac, Phys. Rev. A 61, 042314 (2000).
 (31) For correlated noise with correlation only among input particles or output particles, this approach is still possible. However, for correlated noise between input and output particles, one can no longer use such a simplified analysis.
 Gilchrist et al. (2005) A. Gilchrist, N. K. Langford, and M. A. Nielsen, Phys. Rev. A 71, 062310 (2005).
 Nielsen (2002) M. A. Nielsen, Phys. Lett. A 303, 249 (2002).
 Horodecki et al. (1999) M. Horodecki, P. Horodecki, and R. Horodecki, Phys. Rev. A 60, 1888 (1999).
 Bravyi and Kitaev (2005) S. Bravyi and A. Kitaev, Phys. Rev. A 71, 022316 (2005).
 (36) Notice that we assume perfect Bell measurements here, as discussed in Sec. II.1.
 (37) The symmetrisation can be done locally by randomly reenumerating the qubits.
 Sørensen and Mølmer (1999) A. Sørensen and K. Mølmer, Phys. Rev. Lett. 82, 1971 (1999).
Appendix A Linear number of coefficients for binarylike mixture GHZ states
The type of density matrices one has to consider for the specific variant of binarylike mixtures of GHZ states as described in the main text are given by
(19) 
where is the number of qubits in set .
We now use symmetries to further reduce the number of parameters. The initial state one starts out with is expected to be symmetric with respect to permutation of particles in set because the underlying graph is symmetric in this regard. That means that for all binary strings with the same number of ones , so only different coefficients have to be tracked. All operations used will preserve this symmetry, but to actually benefit from this computationally it is necessary to reformulate everything with respect to these coefficients.
Applying a local noise channel on every qubit in set can be written as
(20) 
with . After some calculation we find for the updated coefficients
(21) 
The effect of the noise on set is easier to formulate:
(22) 
For the entanglement purification only one of the two subprotocol is needed for the binary like mixture and its effect is given by squaring the coefficients and renormalizing. Putting this into this framework leads to
(23) 
In this way, one can treat such symmetric binarylike mixtures up to much larger particle numbers, and investigate the performance of multiparty EPP, locality of noise and the usage of resulting states for measurementbased communication.
Appendix B Local complementation and graph state basis transformation
Two graphs and are called local unitary (LU) equivalent if there exists a local unitary such that . One special way how two graphs can be shown to be LUequivalent is the local complementation rule Hein et al. (2006). The local complementation of a graph with respect to vertex is obtained by inverting the subgraph of all vertices in the neighborhood of :
(24) 
where
(25) 
and denotes the symmetric difference .
The graph state associated with the graph can be obtained from by applying local Clifford operations
(26)  
From this rule we can calculate how the coefficients given in the graph state basis with respect to transform to the graph state basis with respect to . That is to say we look for that fulfil
(27) 
with being the correlation operator around corresponding to the new graph and with as the neighborhood of with respect to .
To calculate we apply on and pay attention to the eigenvalue
(28) 
For the two operators and commute and we simply obtain: . The more interesting case can be solved by using the relations
(29)  
We obtain
(30)  
To summarize, it holds that
(31) 
which means that some of the coefficients in the density matrix are simply exchanged.
Appendix C Purification procedure for the clusterring code
As explained in the main text the details for generating the resource states influence their performance dramatically. For the clusterring code there are also more variables that have to be adjusted than for the GHZ states.
It is necessary to use the EPP that works for all graph states Kruszynska et al. (2006) since the resource state is not twocolorable and needs four colors instead. The protocol is very similar to the twocolorable protocol Aschauer et al. (2005) described in the main part, however, a separate subprotocol is used for each color. Furthermore, it does not use two copies of the same state at each step but needs auxiliary twocolorable graph states for each of the subprotocols. We consider these auxiliary states to have been purified by the EPP for twocolorable graph states using CNOT games with the same error parameter. It should be noted that alternatively these auxiliary states can also be prepared from the main graph state Kruszynska et al. (2006). The protocol works better for fewer colors, therefore we use a threecolorable state that is LUequivalent to the resource state for the clusterring code (see figures 9 and 20 ). This state is already mentioned in Schlingemann and Werner (2001) but we do not use it for error correction directly as the clusterring is more intuitive. It is important to consider that some coefficients are exchanged when switching from one graph state basis to one based on another graph as described in Appendix B.
To optimize the preparation procedure not only do we have to optimize where to stop in the cycle of …for the main graph state, but also whether to end the EPPs for the auxiliary (twocolorable) states with P1 or P2. As for the GHZ states this procedure could likely be optimized further.
Appendix D Linear Cluster state
Here we investigate the noise structure of other graph states at their fixed point of the EPP. Linear cluster states have less symmetry that can be used to lower the amount of parameters one has to consider for the minimization process than for GHZ states. We first and foremost investigate the linear cluster state with qubits because it has a known application in a measurement based EPP Zwerger et al. (2013, 2012) for bipartite entangled states.
For local white noise as gate error model we find a similar behavior for the deviation from a local noise model as for the GHZ states. While the deviation is bigger than for GHZ states of similar size, the local noise model still serves as a good approximation, especially for close to (figure 21).
Appendix E Localizing noise for GHZ states
In Dür and Cirac (2000) it is shown that every state can be brought to the standard form of equation (17) in the main text by the random application of local unitaries. One particular way to achieve this with local Clifford operations is to apply with probability each for all . This is the case because the application of exchanges graph state basis states as follows: with where denotes the addition mod 2. This results in making and equal for and leaving unchanged.
In the main part it is already stated that the central trick in making the noise follow a local noise pattern is to probabilistically add separable states to the ensemble
(32)  
with and . These states can easily be prepared and directly change the coefficients of the updated state
(33) 
with appropriate weights , which have to satisfy: .
Next we identify the type of local noise that results in states in the standard form as noise channels with equal coefficients for and noise on set A and equal coefficients for and noise on set B. Symmetries in the GHZ state and the resulting state from entanglement purification make assigning equal weights to the noise on sets A and B optimal.
Furthermore, the ratio of and can be freely chosen with either noise on set A or noise on set B so this ratio does not affect whether the noise can be described by a local noise model and it is enough to consider and for .
With the noise channels for set A and for set B we get
(34) 
where is the Hamming weight of .
Because we want the fidelity to stay as high as possible while matching the coefficients given by the local noise model with parameter and it is only possible to modify and together, the challenge lies in picking as large as possible and use the according . This is achieved by
(35) 
where are the coefficients of . The outcome of this process is that we obtain a function .
So far everything can be done analytically, but in the final step we numerically maximize which results in the fidelity of being as high as possible.
Appendix F Circuits for gatebased error correction
In the main text we compare different implementations of quantum error correction codes. For the gatebased implementation of the wellknown bitflip code we use the standard circuit found e.g. in Nielsen and Chuang (2010).
In figure 22 the circuit we use for encoding the clusterring code is shown. The circuit is not unique and most likely not optimal. For decoding the circuit is performed in reverse order and the last four qubits are measured in the basis to obtain the error syndrom and make appropriate corrections.
Appendix G Measurement based decoding patterns
In order to analyze the performance of resource states for error correction codes in the measurement based approach it is necessary to formulate the full protocol with all correction operations because with an error model that cannot be described by local noise it is not possible to simply look at a noise channel acting on the input followed by the perfect protocol. We will discuss this process in detail for the bitflip variant of the repetition code, but it can easily be extended to more involved codes like the clusterring code or slightly reformulated to fit the phaseflip variant (for which the resource state is given directly by the graph state in figure (a)a in the main text).
When decoding an encoded quantum state with a resource state the measurement outcomes of the Bell measurements contain all the information to identify a potential error that has occurred. One way to understand what correction operations the different outcome patterns imply is to simply consider the way the resource state is calculated using the Jamiolkowski isomorphism Jamiołkowski (1972) for the circuit that implements the decoding. The qubits that are measured in the circuit model can be interpreted as virtual qubits that are disconnected from the resource state by the measurement. Then, one can calculate what effect the byproduct operators from the different Bell measurement outcomes have on the measurement outcomes on these virtual qubits and simply use the correction operators one would use for the circuit implementation.
Alternatively, it is possible to understand the patterns without referring to a circuit. A projection on the Bell state can be understood as applying on the input followed by projecting on for which we know it implements the decoding without any additional byproduct operators, so the measurement outcomes can be interpreted as modifying the input only. In case no error happened, only combinations of that leave the subspace spanned by and invariant will have a nonzero probability of occurring. In table 1 all combinations that can occur if no error happened are listed together with the resulting output state and the necessary correction operations if the input state is . Similarly, the outcomes which indicate that an error occurred are the ones that map it to the subspace corresponding to that error.
correction  

The same intuition can also be applied for more complex codes  the patterns corresponding to no error occuring are those combinations of Pauli operators that leave the subspace spanned by and invariant. These select tensor products of Pauli operators form a subgroup of the stabilizer of . The patterns of certain error are then obtained by simply multiplying the error operator with the elements of this group.
Furthermore, it should be stressed that the error codes are not only able to correct errors on the input but also noise on the resource states without any modifications to the decoding procedure. Because the patterns for an error are the same as if they occurred on the input.
For practical purposes (at least for small resource states) these patterns can be found numerically in a straightforward way. Simply apply an error on the input, for which we know that the code can correct it, and perform the readin to a perfect resource state. Then, one can see which of the outcome patterns occur for this type of error and immediately obtain the correction operation by checking what the output state is. Doing the same for all the errors the code can detect, one obtains a table with all of the patterns and the corresponding correction operations.