{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreia3gfq35kfiqaaphbovnqvvha3qo7kklcwagdskuy7vkqrklr3nm4",
    "uri": "at://did:plc:cx57fsir6oyzywdd4jafsdsw/app.bsky.feed.post/3mmex5lheeuv2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreic5nv4ailn5wtohtrxvfre72vqyjczy6vvcqbi34gqwokm5mhz73a"
    },
    "mimeType": "image/png",
    "size": 107580
  },
  "path": "/papers/q-2026-05-21-2111/",
  "publishedAt": "2026-05-21T10:54:48.000Z",
  "site": "https://quantum-journal.org",
  "tags": [
    "Paper",
    "https://doi.org/10.22331/q-2026-05-21-2111"
  ],
  "textContent": "Quantum 10, 2111 (2026).\n\nhttps://doi.org/10.22331/q-2026-05-21-2111\n\nGraph 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 $|+\\rangle$ 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.",
  "title": "Lower bounds on bipartite entanglement in noisy graph states"
}