2008/08/23 by Mile Gu, Andrew C. Doherty, Andrew Doherty +2
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph
paper · pdf · doi:10.1103/physreva.78.032327
6 pages, 2 figures. accepted into PRA
arxiv created 2008/08/23 · openalex publication_date 2008/09/23 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We explicitly compute the optimal cost for a class of example problems in geometric quantum control. These problems are defined by a Cartan decomposition of su(2n) into orthogonal subspaces \mathfrakl and \mathfrakp such that [\mathfrakl,\mathfrakl]\ensuremath⊆\mathfrakp,[\mathfrakp,\mathfrakl]=\mathfrakp,[\mathfrakp,\mathfrakp]\ensuremath⊆\mathfrakl. Motion in the \mathfrakl direction is assumed to have negligible cost, where motion in the \mathfrakp direction does not. In the special case of two qubits, our results correspond to the minimal interaction cost of a given unitary.