Solving the $KP$ problem with the Global Cartan Decomposition
Abstract
Geometric methods have useful application for solving problems in a range of quantum information disciplines, including the synthesis of time-optimal unitaries in quantum control. In particular, the use of Cartan decompositions to solve problems in optimal control, especially lambda systems, has given rise to a range of techniques for solving the so-called -problem, where target unitaries belong to a semi-simple Lie group manifold whose Lie algebra admits a decomposition and time-optimal solutions are represented by subRiemannian geodesics synthesised via a distribution of generators in . In this paper, we propose a new method utilising global Cartan decompositions of symmetric spaces for generating time-optimal unitaries for targets with controls . Target unitaries are parametrised as where and with . We show that the assumption of equates to the corresponding time-optimal unitary control problem being able to be solved analytically using variational techniques. We identify how such control problems correspond to the holonomies of a compact globally Riemannian symmetric space, where local translations are generated by and local rotations are generated by .
Cite
@article{arxiv.2404.02358,
title = {Solving the $KP$ problem with the Global Cartan Decomposition},
author = {Elija Perrier and Christopher S. Jackson},
journal= {arXiv preprint arXiv:2404.02358},
year = {2024}
}
Comments
This article is a preliminary draft, put together by Elija. Chris is currently working with Elija on an updated revised draft for release in coming weeks (April 2024)