arXiv:2610.21596
Time-optimal robust quantum control for partially known errors
Llorenç Balada Gaggioli
Abstract
Robust quantum control usually assumes one of two extremes: the error is of a known form and only its strength is unknown, or nothing at all is known about it. In practice one often sits in between. The size of a static error is unknown, but its class is known, for example, it only shifts energy levels, or it acts on each subsystem separately. We ask how fast a control can cancel, to first order, every error in such a class. A time-independent Hamiltonian can do this if and only if all errors in the class have zero diagonal in a common basis. In that case an equally spaced energy ladder in this basis does it after one period. A lower bound that holds for any time-dependent control with bounded drive power shows that this simple constant control is optimal for several natural classes, including unknown level shifts and unknown local errors on two subsystems. Completely unknown errors need a time-dependent control, and there, knowing the error class shortens the minimum time by a factor $\sqrt{d^2+1}$. So partial knowledge of the error changes not only how long an optimal robust control takes, but also its form.
AI Summary
The paper asks for the minimum duration of an identity operation that cancels, to first order, every static error in a specified linear operator space. Controls may be arbitrarily time dependent, subject to the total-power constraint $2\|H(t)\|_F^2\le\Omega^2$, and must return to the identity up to global phase. A constant robust control exists exactly when all errors have zero diagonal in a common orthonormal basis. An equally spaced energy ladder in that basis provides a construction. A lower bound for arbitrary controls follows by treating propagator matrix elements as temporal signals: robustness bounds their Gram-matrix eigenvalues, while Fourier-mode occupation bounds the integrated control energy. If $\Gamma\le gI$ and $L=d^2/g$ is integral, then $\Omega T\ge2\pi\sqrt{d(L^2-1)/6}$. For unknown level shifts, arbitrary local errors on two equal-dimensional subsystems, and qubit errors confined to a plane, constant ladders attain $\Omega T_{\min}=2\pi\sqrt{d(d^2-1)/6}$. For completely unknown errors, an existing continuous unitary-design construction attains $2\pi\sqrt{d(d^4-1)/6}$, establishing an exact duration ratio $\sqrt{d^2+1}$. For two qubits, a constant anisotropic $XX$–$ZZ$ coupling cancels local errors $\sqrt2$ faster than optimal local-only controls under the same power constraint. Results concern first-order cancellation of static errors and robust identities, not general gates. Numerical constants depend on the chosen norm and unrestricted coupling availability. General error classes, unequal subsystem dimensions, hardware-constrained controls, and higher-order time optima remain unresolved. Reversing a constant control after one period cancels second-order error, without an optimality claim.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 11 pages total, 7 pages main text, 2 figures