Gradient descent reliably finds depth- and gate-optimal circuits for generic unitaries

Excerpt

arXiv:2601.03123v2 Announce Type: replace-cross Abstract: When the gate set has continuous parameters, synthesizing a unitary operator as a quantum circuit is, in principle, always possible using exact methods. However, efficiently finding depth- and gate-minimal circuits remains a major challenge. The landscape is very different for compiled unitaries, which arise from programming and typically have short circuits, as compared with generic unitaries, which use all parameters and typically requi