A constructive algorithm for the Cartan decomposition of SU(2N)
From MaRDI portal
Abstract: We present an explicit numerical method to obtain the Cartan-Khaneja-Glaser decomposition of a general element G of SU(2^N) in terms of its `Cartan' and `non-Cartan' components. This effectively factors G in terms of group elements that belong in SU(2^n) with n<N, a procedure that can be iterated down to n=2. We show that every step reduces to solving the zeros of a matrix polynomial, obtained by truncation of the Baker-Campbell-Hausdorff formula, numerically. All computational tasks involved are straightforward and the overall truncation errors are well under control.
Recommendations
Cites work
Cited in
(8)- Note on the Khaneja Glaser decomposition
- Constructive quantum Shannon decomposition from Cartan involutions
- Hamiltonian Engineering for Quantum Systems
- On construction of finite averaging sets for SL(2,C) via its Cartan decomposition
- Quantum error correction: noise-adapted techniques and applications
- Spontaneously interacting qubits from Gauss-Bonnet
- Preparing Hamiltonians for quantum simulation: A computational framework for Cartan decomposition via Lax dynamics
- On the refinement of Cartan decomposition: an implicit commutative substructure in \(\mathfrak{su}(2^n)\)
This page was built for publication: A constructive algorithm for the Cartan decomposition of SU(2N)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3438548)