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 KP-problem, where target unitaries belong to a semi-simple Lie group manifold G whose Lie algebra admits a g=k p decomposition and time-optimal solutions are represented by subRiemannian geodesics synthesised via a distribution of generators in p. In this paper, we propose a new method utilising global Cartan decompositions G=KAK of symmetric spaces G/K for generating time-optimal unitaries for targets -iX ∈ [p,p] ⊂ k with controls -iH(t) ∈ p. Target unitaries are parametrised as U=kac where k,c ∈ K and a = ei with ∈ a. We show that the assumption of d=0 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 p and local rotations are generated by [p,p].

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…