Computing Floquet Hamiltonians with Symmetries
Terry Loring, Fredy Vides

TL;DR
This paper develops numerical algorithms for computing Floquet Hamiltonians from unitary evolution operators, ensuring the resulting Hamiltonian respects system symmetries such as time reversal, with theoretical insights into symmetry preservation in eigenstates.
Contribution
It introduces practical algorithms for symmetry-preserving matrix logarithms to compute Floquet Hamiltonians, and proves how symmetries in the Floquet operator influence eigenstate symmetries.
Findings
Algorithms for symmetry-preserving matrix logarithms
Conditions under which symmetries in $U(T)$ lead to symmetric Floquet eigenstates
Enhanced ability to compute symmetric Floquet Hamiltonians in driven quantum systems
Abstract
Unitary matrices arise in many ways in physics, in particular as a time evolution operator. For a periodically driven system one frequently wishes to compute a Floquet Hamilonian that should be a Hermitian operator such that where is the time evolution operator at time corresponding the period of the system. That is, we want to be equal to times a matrix logarithm of . If the system has a symmetry, such as time reversal symmetry, one can expect to have a symmetry beyond being Hermitian. We discuss here practical numerical algorithms on computing matrix logarithms that have certain symmetries which can be used to compute Floquet Hamiltonians that have appropriate symmetries. Along the way, we prove some results on how a symmetry in the Floquet operator can lead to a symmetry in a basis of Floquet eigenstates.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
