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.
For this, first obtain the number of 1 entries in ai as ν− = νA−1X i=0 ai (A2) Then the probability of the configuration d is Pd = P νA−ν− (1 − P)ν− (A3)
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.