Iterative optimization in quantum metrology and entanglement theory using semidefinite programming
Árpád Lukács, Róbert Trényi, Tamás Vértesi, Géza Tóth
TL;DR
The paper tackles the problem of achieving quantum-enhanced metrology in bipartite systems by optimizing over local Hamiltonians, introducing the metrological gain $g(\varrho)$ as a state-dependent benchmark relative to the best separable performance. It develops an efficient iterative see-saw method that recasts the quantum Fisher information as a bilinear form, enabling fast convergence via semidefinite programming, and pairs this with a moment-based SDP relaxation to certify global optimality on small systems. The authors demonstrate the approach on various states, including isotropic two-qudit states and bound-entangled PPT states, and extend the framework to a broader class of quadratic-optimization problems in quantum information, such as maximizing Wigner-Yanase skew information and CCNR-related trace norms. The work provides a practical, scalable toolkit for designing metrologically valuable quantum states and dynamics under experimentally affordable local Hamiltonians, with implications for resource theories and experimental quantum sensing. The methods offer a path toward reliably identifying quantum advantages in metrology and related informational tasks, while connecting optimization, entanglement structure, and measurement precision in a unified framework.
Abstract
We discuss efficient methods to optimize the metrological performance over local Hamiltonians in a bipartite quantum system. For a given quantum state, our methods find the best local Hamiltonian for which the state outperforms separable states the most from the point of view of quantum metrology. We show that this problem can be reduced to maximizing the quantum Fisher information over a certain set of Hamiltonians. We present the quantum Fisher information in a bilinear form and maximize it by an iterative see-saw (ISS) method, in which each step is based on semidefinite programming. We also solve the problem with the method of moments that works very well for smaller systems. Our approach is one of the efficient methods that can be applied for an optimization of the unitary dynamics in quantum metrology, the other methods being, for example, machine learning, variational quantum circuits, or neural networks. The advantage of our method is the fast and robust convergence due to the simple mathematical structure of the approach. We also consider a number of other problems in quantum information theory that can be solved in a similar manner. For instance, we determine the bound entangled quantum states that maximally violate the Computable Cross Norm-Realignment (CCNR) criterion.
