{
  "abstract": "In modular quantum computing architectures, communication between hardware modules is mediated by traveling qumodes sent through transmission lines. Each output qumode interacts with the emitting module only once through a beam-splitter-type interaction and becomes inaccessible to that module after emission. Information required for subsequent outputs must therefore remain in long-lived memory qumodes. For a prescribed multimode Gaussian transformation on $N$ qumodes, this work determines the minimum memory cost for any given emission order, constructs an explicit sequential protocol attaining this minimum, and develops a greedy method for identifying memory-efficient emission orders. The transformation is represented by a symplectic matrix $S$, specified either directly or through a Gaussian gate sequence. The exact minimum memory cost is obtained from the ranks of submatrices of $S$ and further reduces to a support-based counting rule whose computational cost is linear in the size of the support data. When $S$ is specified directly, a matrix-based protocol attains the minimum memory cost. If instead $S$ is specified through a gate sequence, the original gates can be reused without additional synthesis, although the resulting memory usage need not be minimal. Gaussian transformations with local support on a $D$-dimensional cubic lattice can be realized sequentially with $O(N^{(D-1)/D})$ memory qumodes. The protocols also apply to non-Gaussian inputs, including GKP and cat states, and thereby provide an explicit, resource-efficient scheme for intermodule communication in modular architectures for universal continuous-variable quantum computation.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.05250",
  "author_total": 3,
  "authors": [
    {
      "name": "Fucheng Guo"
    },
    {
      "name": "Frank Mueller"
    },
    {
      "name": "Yuan Liu"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/derwnbwftnqey.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.05250",
  "fulltext_url": null,
  "id": "derwnbwftnqey",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.05250",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7211894726",
  "pdf_url": "https://arxiv.org/pdf/2609.05250",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-04",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/derwnbwftnqey.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:19:14Z",
      "native_id": "2609.05250",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.05250"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Memory-Optimal Sequential Synthesis of Multimode Gaussian Transformations",
  "title_text": "Memory-Optimal Sequential Synthesis of Multimode Gaussian Transformations",
  "type": "preprint",
  "updated_at": "2026-10-30T12:19:14Z",
  "url": "https://research.draconitic.com/paper/derwnbwftnqey",
  "venue": "arXiv",
  "versions": []
}