Noisy entanglement evolution for graph states

TL;DR

This paper extends a method for analyzing entanglement evolution in graph states under noise, generalizing it beyond Pauli maps to thermal reservoirs, and provides explicit formulas and bounds for these scenarios.

Contribution

It generalizes an existing entanglement analysis method to include thermal reservoirs and non-Pauli noise, with explicit formulas and optimization strategies.

Findings

Method applicable to thermal reservoirs at arbitrary temperatures.

Explicit formulas for effective noise in Pauli maps.

Demonstrated with examples on different graph states.

Abstract

A general method for the study of the entanglement evolution of graph states under the action of Pauli was recently proposed in [Cavalcanti, et al., Phys. Rev. Lett. 103, 030502 (2009)]. This method is based on lower and upper bounds on the entanglement of the entire state as a function only of the state of a considerably-smaller subsystem, which undergoes an effective noise process. This provides a huge simplification on the size of the matrices involved in the calculation of entanglement in these systems. In the present paper we elaborate on this method in details and generalize it to other natural situations not described by Pauli maps. Specifically, for Pauli maps we introduce an explicit formula for the characterization of the resulting effective noise. Beyond Pauli maps, we show that the same ideas can be applied to the case of thermal reservoirs at arbitrary temperature. In the latter case, we discuss how to optimize the bounds as a function of the noise strength. We illustrate our ideas with explicit exemplary results for several different graphs and particular decoherence processes. The limitations of the method are also discussed.