{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreid3o7dxy2irst45di5mqrxdenl7oqlidwttiv73cdkgb6hcxpeyja",
    "uri": "at://did:plc:cx57fsir6oyzywdd4jafsdsw/app.bsky.feed.post/3mhqqfskzmwk2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiej5mrgc5tfwvsp2ndxde75w7xvnhmhsfylrrzluufkemxgrv5bv4"
    },
    "mimeType": "image/png",
    "size": 37873
  },
  "path": "/papers/q-2026-03-23-2038/",
  "publishedAt": "2026-03-23T08:28:08.000Z",
  "site": "https://quantum-journal.org",
  "tags": [
    "Paper",
    "https://doi.org/10.22331/q-2026-03-23-2038"
  ],
  "textContent": "Quantum 10, 2038 (2026).\n\nhttps://doi.org/10.22331/q-2026-03-23-2038\n\nQuantum walks in general graphs, or more specifically scattering on graphs, encompass enough complexity to perform universal quantum computation. Any given quantum circuit can be broken down into single- and two-qubit gates, which can then be translated into subgraphs – gadgets – that implement such unitaries on the logical qubits, simulated by particles traveling along a sparse graph. In this work, we start to develop a full theory of multi-particle scattering on graphs and give initial applications to build multi-particle gadgets with different properties.",
  "title": "Two-particle scattering on general graphs"
}