Lower bounds on localizable genuine multiparty entanglement are computed for graph states and toric codes under single-qubit Pauli noise, revealing critical noise strengths beyond which post-measurement states are biseparable.
The graph transformation algorithm discussed in Appendix A ensures that the measure- ment on any of the qubits in S′ 2 can be either a σ3, or a σ1, i.e., αj = 1, 3 if j ∈ S′
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2022 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Localizing genuine multiparty entanglement in noisy stabilizer states
Lower bounds on localizable genuine multiparty entanglement are computed for graph states and toric codes under single-qubit Pauli noise, revealing critical noise strengths beyond which post-measurement states are biseparable.