Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0904.1191 · Physical Review Letters

Open-System Dynamics of Graph-State Entanglement

Daniel Cavalcanti, Rafael Chaves, Leandro Aolita, L. Davidovich, Antonio Acín

Published Jul 15, 2009• 58 citations
arXivHTMLPDF

Abstract

We consider graph states of an arbitrary number of particles undergoing generic decoherence. We present methods to obtain lower and upper bounds for the system's entanglement in terms of that of considerably smaller subsystems. For an important class of noisy channels, namely, the Pauli maps, these bounds coincide and thus provide the exact analytical expression for the entanglement evolution. All of the results apply also to (mixed) graph-diagonal states and hold true for any convex entanglement monotone. Since any state can be locally depolarized to some graph-diagonal state, our method provides a lower bound for the entanglement decay of any arbitrary state. Finally, this formalism also allows for the direct identification of the robustness under size scaling of graph states in the presence of decoherence, merely by inspection of their connectivities.

DOI
10.1103/physrevlett.103.030502

Related papers

Noisy evolution of graph-state entanglement

Leandro Aolita, Daniel Cavalcanti, Rafael Chaves +3 more

A general method for the study of the entanglement evolution of graph states under the action of Pauli maps was recently proposed in Cavalcanti et al. [Phys. Rev. Lett. 103, 030502 (2009)]. This method is based on lower and upper bounds to the entanglement of the entire state as a function only of the state of a (typically) considerably smaller subsystem undergoing an effective noise process related to the original map. This provides a huge decrease in the size of the matrices involved in the calculation of entanglement in these systems. In the present paper we elaborate on this method in detail 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.

arXiv:1006.3152•Physical Review A•Sep 21, 2010•41 citations

Entanglement in the graph-state formalism

Chrirag Dhara

We investigate the decoherence dynamics of a class of multi-particle entangled states - graph states - when subjected to individual noise processes. Recent analytical results for Pauli noise channels are summarized here. The power of this technique is demonstrated by making numerical calculations of entanglement for a relatively large system, which would be extremely tedious by brute force techniques alone. The results are numerically extended to linear graph states subjected to the generalized amplitude damping noise channel, which is an important case of a non-pauli noise channel. For small system sizes of linear graph states, the exact entanglement together with the lower and upper bounds are plotted. It is shown that in the limit of an in¯nite heat bath all these bounds coincide to give the exact entanglement decay.

•Sep 9, 2009•1 citation

Entanglement properties of multipartite entangled states under the influence of decoherence

M. Hein, Wolfgang Dür, Hans J. Briegel

We investigate entanglement properties of multipartite states under the influence of decoherence. We show that the lifetime of (distillable) entanglement for Greenberger-Horne-Zeilinger (GHZ) -type superposition states decreases with the size of the system, while for a class of other states---namely, all graph states with constant degree---the lifetime is independent of the system size. We show that these results are largely independent of the specific decoherence model and are in particular valid for all models which deal with individual couplings of particles to independent environments, described by some quantum optical master equation of Lindblad form. For GHZ states, we derive analytic expressions for the lifetime of distillable entanglement and determine when the state becomes fully separable. For all graph states, we derive lower and upper bounds on the lifetime of entanglement. The lower bound is based on a specific distillation protocol, while upper bounds are obtained by showing that states resulting from decoherence in general become nondistillable or even separable after a finite time. This is done using different methods, namely, (i) the map describing the decoherence process (e.g., the action of a thermal bath on the system) becomes entanglement breaking, (ii) the resulting state becomes separable, and (iii) the partial transposition with respect to certain partitions becomes positive. To this aim, we establish a method to calculate the spectrum of the partial transposition for all mixed states which are diagonal in a graph-state basis. We also consider entanglement between different groups of particles and determine the corresponding lifetimes as well as the change of the kind of entanglement with time. This enables us to investigate the behavior of entanglement under rescaling and in the limit of large number of particles $N\ensuremath{\rightarrow}\mathrm{\ensuremath{\infty}}$. Finally we investigate the lifetime of encoded quantum superposition states and show that one can define an effective time in the encoded system which can be orders of magnitude smaller than the physical time. This provides an alternative view on quantum error correction and examples of states whose lifetime of entanglement (between groups of particles) in fact increases with the size of the system.

arXiv:quant-ph/0408165•Physical Review A•Mar 30, 2005•195 citations

Lower bounds on bipartite entanglement in noisy graph states

Aqil Sajjad, Eneet Kaur, Kenneth Goodenough +2 more

Graph states are a key resource for a number of applications in quantum information theory. Due to the inherent noise in noisy intermediate-scale quantum (NISQ) era devices, it is important to understand the effects noise has on the usefulness of graph states. We consider a noise model where the initial qubits, prepared in | + ⟩ states, undergo depolarizing noise before the application of the CZ operations that generate edges between qubits situated at the nodes of the resulting graph state. For this model we develop a method for calculating the coherent information – a lower bound on the rate at which entanglement can be distilled, across a bipartition of the graph state. We also identify some patterns on how adding more nodes or edges affects the bipartite distillable entanglement. As an application, we find a family of graph states that maintain a strictly positive coherent information for any amount of (non-maximal) depolarizing noise.

arXiv:2404.09014•Quantum•May 21, 2026•2 citations

Estimating localizable entanglement from witnesses

David Amaro, Markus Müller, Amit Kumar Pal

Computing localizable entanglement for noisy many-particle quantum states is difficult due to the optimization over all possible sets of local projection measurements. Therefore, it is crucial to develop lower bounds, which can provide useful information about the behaviour of localizable entanglement, and which can be determined by measuring a limited number of operators, or by performing the least number of measurements on the state, preferably without performing a full state tomography. In this paper, we adopt two different yet related approaches to obtain a witness-based, and a measurement-based lower bounds for localizable entanglement. The former is determined by the minimal amount of entanglement that can be present in a subsystem of the multipartite quantum state, which is consistent with the expectation value of an entanglement witness. Determining this bound does not require any information about the state beyond the expectation value of the witness operator, which renders this approach highly practical in experiments. The latter bound of localizable entanglement is computed by restricting the local projection measurements over the qubits outside the subsystem of interest to a suitably chosen basis. We discuss the behaviour of both lower bounds against local physical noise on the qubits, and discuss their dependence on noise strength and system size. We also analytically determine the measurement-based lower bound in the case of graph states under local uncorrelated Pauli noise.

arXiv:1803.02753•New Journal of Physics•May 14, 2018•20 citations

Universality in open system entanglement dynamics

Markus Tiersch, Fernando de Melo, Andreas Buchleitner

We show that the entanglement evolution of an open quantum system is the same for the vast majority of initial pure states, in the limit of large Hilbert space dimensions. The analytical results are illustrated by a numerical study of the evolution of negativity for many-qubit systems undergoing a local decoherence process. In the limit of many subsystems, the arising mixed state entanglement between one subsystem and the rest grows more robust, whereas for two equally sized partitions it becomes more fragile.

arXiv:0810.2506•Journal of Physics A Mathematical and Theoretical•Feb 6, 2013•16 citations
We consider graph states of an arbitrary number of particles undergoing generic decoherence. We present methods to obtain lower and upper bounds for the system's entanglement in terms of that of considerably smaller subsystems. For an important class of noisy channels, namely, the Pauli maps, these bounds coincide and thus provide the exact analytical expression for the entanglement evolution. All of the results apply also to (mixed) graph-diagonal states and hold true for any convex entanglement monotone. Since any state can be locally depolarized to some graph-diagonal state, our method provides a lower bound for the entanglement decay of any arbitrary state. Finally, this formalism also allows for the direct identification of the robustness under size scaling of graph states in the presence of decoherence, merely by inspection of their connectivities.
A general method for the study of the entanglement evolution of graph states under the action of Pauli maps was recently proposed in Cavalcanti et al. [Phys. Rev. Lett. 103, 030502 (2009)]. This method is based on lower and upper bounds to the entanglement of the entire state as a function only of the state of a (typically) considerably smaller subsystem undergoing an effective noise process related to the original map. This provides a huge decrease in the size of the matrices involved in the calculation of entanglement in these systems. In the present paper we elaborate on this method in detail 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.
We investigate the decoherence dynamics of a class of multi-particle entangled states - graph states - when subjected to individual noise processes. Recent analytical results for Pauli noise channels are summarized here. The power of this technique is demonstrated by making numerical calculations of entanglement for a relatively large system, which would be extremely tedious by brute force techniques alone. The results are numerically extended to linear graph states subjected to the generalized amplitude damping noise channel, which is an important case of a non-pauli noise channel. For small system sizes of linear graph states, the exact entanglement together with the lower and upper bounds are plotted. It is shown that in the limit of an in¯nite heat bath all these bounds coincide to give the exact entanglement decay.
We investigate entanglement properties of multipartite states under the influence of decoherence. We show that the lifetime of (distillable) entanglement for Greenberger-Horne-Zeilinger (GHZ) -type superposition states decreases with the size of the system, while for a class of other states---namely, all graph states with constant degree---the lifetime is independent of the system size. We show that these results are largely independent of the specific decoherence model and are in particular valid for all models which deal with individual couplings of particles to independent environments, described by some quantum optical master equation of Lindblad form. For GHZ states, we derive analytic expressions for the lifetime of distillable entanglement and determine when the state becomes fully separable. For all graph states, we derive lower and upper bounds on the lifetime of entanglement. The lower bound is based on a specific distillation protocol, while upper bounds are obtained by showing that states resulting from decoherence in general become nondistillable or even separable after a finite time. This is done using different methods, namely, (i) the map describing the decoherence process (e.g., the action of a thermal bath on the system) becomes entanglement breaking, (ii) the resulting state becomes separable, and (iii) the partial transposition with respect to certain partitions becomes positive. To this aim, we establish a method to calculate the spectrum of the partial transposition for all mixed states which are diagonal in a graph-state basis. We also consider entanglement between different groups of particles and determine the corresponding lifetimes as well as the change of the kind of entanglement with time. This enables us to investigate the behavior of entanglement under rescaling and in the limit of large number of particles $N\ensuremath{\rightarrow}\mathrm{\ensuremath{\infty}}$. Finally we investigate the lifetime of encoded quantum superposition states and show that one can define an effective time in the encoded system which can be orders of magnitude smaller than the physical time. This provides an alternative view on quantum error correction and examples of states whose lifetime of entanglement (between groups of particles) in fact increases with the size of the system.
Graph states are a key resource for a number of applications in quantum information theory. Due to the inherent noise in noisy intermediate-scale quantum (NISQ) era devices, it is important to understand the effects noise has on the usefulness of graph states. We consider a noise model where the initial qubits, prepared in | + ⟩ states, undergo depolarizing noise before the application of the CZ operations that generate edges between qubits situated at the nodes of the resulting graph state. For this model we develop a method for calculating the coherent information – a lower bound on the rate at which entanglement can be distilled, across a bipartition of the graph state. We also identify some patterns on how adding more nodes or edges affects the bipartite distillable entanglement. As an application, we find a family of graph states that maintain a strictly positive coherent information for any amount of (non-maximal) depolarizing noise.
Computing localizable entanglement for noisy many-particle quantum states is difficult due to the optimization over all possible sets of local projection measurements. Therefore, it is crucial to develop lower bounds, which can provide useful information about the behaviour of localizable entanglement, and which can be determined by measuring a limited number of operators, or by performing the least number of measurements on the state, preferably without performing a full state tomography. In this paper, we adopt two different yet related approaches to obtain a witness-based, and a measurement-based lower bounds for localizable entanglement. The former is determined by the minimal amount of entanglement that can be present in a subsystem of the multipartite quantum state, which is consistent with the expectation value of an entanglement witness. Determining this bound does not require any information about the state beyond the expectation value of the witness operator, which renders this approach highly practical in experiments. The latter bound of localizable entanglement is computed by restricting the local projection measurements over the qubits outside the subsystem of interest to a suitably chosen basis. We discuss the behaviour of both lower bounds against local physical noise on the qubits, and discuss their dependence on noise strength and system size. We also analytically determine the measurement-based lower bound in the case of graph states under local uncorrelated Pauli noise.
We show that the entanglement evolution of an open quantum system is the same for the vast majority of initial pure states, in the limit of large Hilbert space dimensions. The analytical results are illustrated by a numerical study of the evolution of negativity for many-qubit systems undergoing a local decoherence process. In the limit of many subsystems, the arising mixed state entanglement between one subsystem and the rest grows more robust, whereas for two equally sized partitions it becomes more fragile.