Globally optimal control of quantum dynamics

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F25%3A00387104" target="_blank" >RIV/68407700:21230/25:00387104 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.1103/g4fb-xm13" target="_blank" >https://doi.org/10.1103/g4fb-xm13</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1103/g4fb-xm13" target="_blank" >10.1103/g4fb-xm13</a>

Result language

angličtina

Original language name

Globally optimal control of quantum dynamics

Original language description

Optimization of constrained quantum control problems powers quantum technologies. This task becomes very difficult when these control problems are nonconvex and plagued with dense local extrema. For such problems, current optimization methods must be repeated many times to find good solutions, each time requiring many simulations of the system. Here, we present quantum control via polynomial optimization (QCPOP), a method that eliminates this problem by directly finding globally optimal solutions. The resulting increase in speed, which can be a thousandfold or more, makes it possible to solve problems that were previously intractable. This remarkable advance is due to global optimization methods recently developed for polynomial functions. We demonstrate the power of this method by showing that it obtains an optimal solution in a single run for a problem in which local extrema are so dense that gradient methods require thousands of runs to reach a similar fidelity. Since QCPOP is able to find the global optimum for quantum control, we expect that it will not only enhance the utility of quantum control by making it much easier to find the necessary protocols, but also provide a key tool for understanding the precise limits of quantum technologies. Finally, we note that the ability to cast quantum control as polynomial optimization resolves an open question regarding the computability of exact solutions to quantum control problems.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/GA23-07947S" target="_blank" >GA23-07947S: Learning Models of Quantum Systems as a Non-Commutative Polynomial Optimization Problem</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2025

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Physical Review Research

ISSN

2643-1564

e-ISSN

2643-1564

Volume of the periodical

7

Issue of the periodical within the volume

4

Country of publishing house

US - UNITED STATES

Number of pages

11

Pages from-to

—

UT code for WoS article

001625364600010

EID of the result in the Scopus database

2-s2.0-105022495798