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.
Thus the family of graphs with purely positive coherent information (for non-maximal noise) is larger than just star graphs or rank 2 type one graphs with nB = 2
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.