Metraipolis › archive › dc_df767480dbdf

Iterative linear quadratic regulator on SU(N) for multi-qubit gate synthesis — arXiv:2608.03656

Source: arXiv (en)
Original: https://arxiv.org/abs/2608.03656
License (as archived): CC0-1.0
Archived: 2026-10-31T13:11:41.509Z
SHA-256 of the archived text: f712519a6156e67192fb53f08afbebb9ed8d5e3cb9f7bc6e6e9e1ce18fedea1b
Stable URL of this page: https://metraipolis.com/documento/dc_df767480dbdf

How to cite

Iterative linear quadratic regulator on SU(N) for multi-qubit gate synthesis — arXiv:2608.03656 — arXiv (en), https://arxiv.org/abs/2608.03656 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_df767480dbdf (Metraipolis archive dc_df767480dbdf, sha256 f712519a6156e67192fb53f08afbebb9ed8d5e3cb9f7bc6e6e9e1ce18fedea1b)

BibTeX

@misc{dcdf767480dbdf,
  title = {Iterative linear quadratic regulator on SU(N) for multi-qubit gate synthesis — arXiv:2608.03656},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.03656},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_df767480dbdf; sha256 f712519a6156e67192fb53f08afbebb9ed8d5e3cb9f7bc6e6e9e1ce18fedea1b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.03656. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In quantum optimal control theory, gradient-based trajectory optimization techniques have proven versatile in designing multi-qubit quantum gates. Furthermore, incorporating the underlying Lie-group structure can accelerate the optimization process. In this work, we adapt the Lie-group formulation of the iterative linear quadratic regulator (iLQR) to the special unitary group SU(N) and apply it to quantum gate synthesis, systematically comparing it against the standard Euclidean iLQR formulation across multiple two- to five-qubit gates. We find that in the idealized, unconstrained setting, where all Lie-algebra basis elements are available as drive Hamiltonian terms, the Lie-group formulation converges faster than the Euclidean iLQR formulation. If drive terms are constrained to 2-local Hamiltonian terms, the Lie-group variant converges faster in early optimization iterations, but exhibits greater sensitivity to initialization and a stronger tendency towards local minima. These results demonstrate that incorporating Lie-group geometry into iLQR substantially improves convergence and highlight important next steps for improvements in constrained control settings.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-08-05 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2608.03656 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-31T13:00:19.531Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-08-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).