SCIENCE@home

Unitary Gate Synthesis via Polynomial Optimization

Llorencc Balada Gaggioli,Denys I. Bondar,Jiří Vala,Roman Ovsiannikov,Jakub Marevcek

Published 2025 in Unknown venue

ABSTRACT

Quantum optimal control plays a crucial role in the development of quantum technologies, particularly in the design and implementation of fast and accurate gates for quantum computing. Here, we present a method to synthesize gates using the Magnus expansion. In particular, we formulate a polynomial optimization problem that allows us to find the global solution without resorting to approximations of the exponential. The global method we use provides a certificate of globality and lets us do single-shot optimization, which implies it is generally faster than local methods. By optimizing over Hermitian matrices generating the unitaries, instead of the unitaries themselves, we can reduce the size of the polynomial to optimize, leading to fast convergence and scalability. Numerical experiments comparing our results with CRAB and GRAPE show that we maintain high accuracy while providing globality certificates.

PUBLICATION RECORD

  • Publication year

    2025

  • Venue

    Unknown venue

  • Publication date

    2025-08-02

  • Fields of study

    Physics, Computer Science

  • Identifiers
    arXiv 2508.01356
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-27 of 27 references · Page 1 of 1

CITED BY