{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreichqds3r7oynuoxd3cikb43mq6wujwyrfi3necs4toz7cyeap7fuy",
    "uri": "at://did:plc:cx57fsir6oyzywdd4jafsdsw/app.bsky.feed.post/3mk2qkvpykrr2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreidwo55gfkbrwbp4sgig3az2ehjatega6ezxwrc6sdzq22wd6aj5r4"
    },
    "mimeType": "image/png",
    "size": 87018
  },
  "path": "/papers/q-2026-04-21-2079/",
  "publishedAt": "2026-04-21T12:04:45.000Z",
  "site": "https://quantum-journal.org",
  "tags": [
    "Paper",
    "https://doi.org/10.22331/q-2026-04-21-2079"
  ],
  "textContent": "Quantum 10, 2079 (2026).\n\nhttps://doi.org/10.22331/q-2026-04-21-2079\n\nWe introduce parallel-sequential (PS) circuits, a family of quantum circuit layouts that interpolate between brickwall and sequential circuits, which introduces control parameters governing a trade-off between the amount of entanglement and the maximum correlation range they can express. We provide numerical evidence that PS circuits can efficiently prepare many-body ground states in one dimension. On noisy devices, characterized through both idling errors and two-qubit gate errors, we show that in a wide parameter regime, PS circuits outperform brickwall, sequential, and the log-depth circuits from [Malz, Styliaris, Wei, Cirac, PRL 132, 040404 (2024)]. Additionally, we demonstrate that properly chosen noisy random PS circuits suppress error proliferation and, when employed as a variational ansatz, exhibit superior trainability.",
  "title": "State preparation with parallel-sequential circuits"
}