{
  "abstract": "The query-optimal algorithm of [CGWZ26] for general time-dependent Hamiltonian simulation uses $$ q = O\\left( αT + \\frac{\\log(1/\\varepsilon)}{\\log\\left(e + \\log(1/\\varepsilon)/(αT) \\right)} \\right) $$ queries to $\\mathrm{HAM\\mbox{-}T}$ within $\\varepsilon$ error for a Lipschitz-continuous time-dependent Hamiltonian $H(t)$ on $[0,T]$ satisfying $\\left\\lVert H(t)\\right\\rVert\\leqα$. However, its direct circuit implementation incurs a substantially larger gate overhead. In this note, we give an implementation of the same algorithm that retains its optimal query complexity and uses $$ O\\left[ q \\left( a + \\log\\left(1 + \\frac{T(α+ βT)}{\\varepsilon} \\right) \\right) \\right] $$ one- and two-qubit gates, where $a$ is the number of block-encoding ancilla qubits and $β$ is the Lipschitz constant of $H$. The main ingredient is an exact dyadic factorization of the ordered update product in the underlying one-query transducer.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2608.30629",
  "author_total": 6,
  "authors": [
    {
      "name": "Boyang Chen"
    },
    {
      "name": "Minbo Gao"
    },
    {
      "name": "Zhengfeng Ji"
    },
    {
      "name": "Tongyang Li"
    },
    {
      "name": "Xinzhao Wang"
    },
    {
      "name": "Shuo Zhou"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/brs400hpr3b4g.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2608.30629",
  "fulltext_url": null,
  "id": "brs400hpr3b4g",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2608.30629",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.DS"
    ],
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7204916633",
  "pdf_url": "https://arxiv.org/pdf/2608.30629",
  "pmcid": null,
  "pmid": null,
  "published": "2026-08-31",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/brs400hpr3b4g.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:17:41Z",
      "native_id": "2608.30629",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2608.30629"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Gate-Efficient Implementation of the Query-Optimal Time-Dependent Hamiltonian Simulation",
  "title_text": "Gate-Efficient Implementation of the Query-Optimal Time-Dependent Hamiltonian Simulation",
  "type": "preprint",
  "updated_at": "2026-10-30T12:17:41Z",
  "url": "https://research.draconitic.com/paper/brs400hpr3b4g",
  "venue": "arXiv",
  "versions": []
}