Unitary Gate Synthesis via Polynomial Optimization
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912763460190208 |
|---|---|
| author | Gaggioli, Llorenç Balada Bondar, Denys I. Vala, Jiri Ovsiannikov, Roman Mareček, Jakub |
| author_facet | Gaggioli, Llorenç Balada Bondar, Denys I. Vala, Jiri Ovsiannikov, Roman Mareček, Jakub |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_01356 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Unitary Gate Synthesis via Polynomial Optimization Gaggioli, Llorenç Balada Bondar, Denys I. Vala, Jiri Ovsiannikov, Roman Mareček, Jakub Quantum Physics 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. |
| title | Unitary Gate Synthesis via Polynomial Optimization |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2508.01356 |