collaborators

7 papers

quant-ph2026

Reachability and optimal-time certificates for quantum control

Younes Naceur, Llorenç Balada Gaggioli

Finite-time control is central to quantum technologies, yet rigorous limits on reachable targets and optimal control times remain largely unknown. We develop a framework for finite…

math.OC2026

Composition and tensor train structure in polynomial optimization

Llorenç Balada Gaggioli, Didier Henrion, Milan Korda

We study polynomial optimization problems whose objective has a composition or tensor train structure. These polynomials can be evaluated as a sequence of maps, giving rise to inte…

quant-ph2026

Low-rank geometry of two-qubit gates

Llorenç Balada Gaggioli

We present a framework based on the determinantal geometry of two-qubit gates. Combining the Weyl chamber representation with operator Schmidt theory, we interpret gate synthesis a…

quant-ph2026

Geometric quantum control and the random Schrödinger equation

Rufus Lawrence, Aleš Wodecki, Johannes Aspman +2

Understanding and mitigating noise in quantum systems is a fundamental challenge in achieving scalable and fault-tolerant quantum computation. Error modeling for quantum systems ca…

quant-ph2025

Unitary Gate Synthesis via Polynomial Optimization

Llorenç Balada Gaggioli, Denys I. Bondar, Jiri Vala +2

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 comput…

math.OC2025

Global optimization of low-rank polynomials

Llorenç Balada Gaggioli, Didier Henrion, Milan Korda

This work considers polynomial optimization problems where the objective admits a low-rank canonical polyadic tensor decomposition. We introduce LRPOP (low-rank polynomial optimiza…