Develops a calculation method for coherent information lower bounds on bipartite entanglement in graph states with pre-CZ depolarizing noise and identifies a family maintaining strictly positive coherent information for any non-maximal noise level.
Since either of the two subsystems can be of type one or two, there are four possible forms of rank 2 graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Lower bounds on bipartite entanglement in noisy graph states
Develops a calculation method for coherent information lower bounds on bipartite entanglement in graph states with pre-CZ depolarizing noise and identifies a family maintaining strictly positive coherent information for any non-maximal noise level.