We study how well topological quantum codes can tolerate coherent noise caused by systematic unitary errors such as unwanted Z-rotations. Our main result is an efficient algorithm for simulating quantum error correction protocols based on the 2D surface code in the presence of coherent errors. The algorithm has runtime O(n 2 ), where n is the number of physical qubits. It allows us to simulate systems with more than one thousand qubits and obtain the first error threshold estimates for several toy models of coherent noise. Numerical results are reported for storage of logical states subject to Z-rotation errors and for logical state preparation with general SU (2) errors. We observe that for large code distances the effective logical-level noise is well-approximated by random Pauli errors even though the physical-level noise is coherent. Our algorithm works by mapping the surface code to a system of Majorana fermions.

Stabilizer states constitute a set of pure states which plays a dominant role in quantum error correction, measurement-based quantum computation, and quantum communication. Central in these applications are the local symmetries of these states. We characterize all local, invertible (unitary and nonunitary) symmetries of arbitrary stabilizer states and provide an algorithm which determines them. We demonstrate the usefulness of these results by showing that the additional local symmetries find applications in entanglement theory and quantum error correction. More precisely, we study a central problem in entanglement theory, which is concerned with the existence of transformations via local operations among pure states. We demonstrate that the identified symmetries enable additional transformations from a stabilizer state to some other multipartite pure state. Furthermore, we demonstrate how the identified symmetries can be used to construct stabilizer codes with diagonal transversal gates.

The characterization of transformations among entangled pure states via local operations assisted by classical communication (LOCC) is a crucial problem in quantum information theory for both theoretical and practical reasons. As LOCC has a highly intricate structure, sometimes the larger set of separable (SEP) maps is considered, which has a mathematically much simpler description. In the literature, mainly SEP maps consisting of invertible Kraus operators have been taken into account. In this paper we show that the consideration of those maps is not sufficient when deciding whether a state can be mapped to another via general SEP transformations. This is done by providing explicit examples of transformations among pure three- and five-qubit states, which are feasible via SEP maps containing singular Kraus operators, however, not possible via SEP maps containing solely regular Kraus operators. The key point that allows to construct the SEP maps is to introduce projective measurements that occur with probability zero on the input state. The fact that it is not sufficient to consider SEP maps composed out of regular Kraus operators even in the case of pure state transformations, also affects the results on LOCC transformations among pure states. However, we show that non-invertible Kraus operators do not help in state transformations under LOCC with finitely many rounds of classical communication, i.e. the necessary and sufficient condition for SEP transformations with invertible Kraus operators is still a necessary condition for convertibility under finite-round LOCC. Moreover, we show that the results on transformations via SEP that are not possible with LOCC (including infinitely many rounds of classical communication) presented in Hebenstreit et al 2016 Phys. Rev. A 93, 012339 are not affected.

Stabilizer states and graph states find application in quantum error correction, measurement-based quantum computation and various other concepts in quantum information theory. In this work, we study party-local Clifford (PLC) transformations among stabilizer states. These transformations arise as a physically motivated extension of local operations in quantum networks with access to bipartite entanglement between some of the nodes of the network. First, we show that PLC transformations among graph states are equivalent to a generalization of the well-known local complementation, which describes local Clifford transformations among graph states. Then, we introduce a mathematical framework to study PLC equivalence of stabilizer states, relating it to the classification of tuples of bilinear forms. This framework allows us to study decompositions of stabilizer states into tensor products of indecomposable ones, that is, decompositions into states from the entanglement generating set (EGS). While the EGS is finite up to 3 parties [Bravyi et al., J. Math. Phys. 47, 062106 (2006)], we show that for 4 and more parties it is an infinite set, even when considering party-local unitary transformations. Moreover, we explicitly compute the EGS for 4 parties up to 10 qubits. Finally, we generalize the framework to qudit stabilizer states in prime dimensions not equal to 2, which allows us to show that the decomposition of qudit stabilizer states into states from the EGS is unique.

No abstract

No abstract