Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2102.05054 · SciPost Physics

Polynomial filter diagonalization of large Floquet unitary operators

David J. Luitz

Published Aug 3, 2021• 17 citations
arXivHTMLPDF

Abstract

Periodically driven quantum many-body systems play a central role for our understanding of nonequilibrium phenomena. For studies of quantum chaos, thermalization, many-body localization and time crystals, the properties of eigenvectors and eigenvalues of the unitary evolution operator, and their scaling with physical system size L L are of interest. While for static systems, powerful methods for the partial diagonalization of the Hamiltonian were developed, the unitary eigenproblem remains daunting. % In this paper, we introduce a Krylov space diagonalization method to obtain exact eigenpairs of the unitary Floquet operator with eigenvalue closest to a target on the unit circle. Our method is based on a complex polynomial spectral transformation given by the geometric sum, leading to rapid convergence of the Arnoldi algorithm. We demonstrate that our method is much more efficient than the shift invert method in terms of both runtime and memory requirements, pushing the accessible system sizes to the realm of 20 qubits, with Hilbert space dimensions \geq 10^6 ≥ 10 6 .

DOI
10.21468/scipostphys.11.2.021

Related papers

Krylov space dynamics of ergodic and dynamically frozen Floquet systems

Luke Staszewski, Asmi Haldar, Pieter W. Claeys +1 more

In isolated quantum many-body systems periodically driven in time, the asymptotic dynamics at late times can exhibit distinct behavior such as thermalization or dynamical freezing. Understanding the properties of and the convergence towards infinite-time (nonequilibrium) steady states, however, remains a challenging endeavor. We propose a physically motivated Krylov space perspective on Floquet thermalization which offers a natural framework to study rates of convergence towards steady states and, simultaneously, an efficient numerical algorithm to evaluate infinite-time averages of observables within the diagonal ensemble. The effectiveness of our algorithm is demonstrated by applying it to the periodically driven mixed-field Ising model, reaching system sizes of up to 30 spins. Our method successfully resolves the transition between the ergodic and dynamically frozen phases and provides insight into the nature of the Floquet eigenstates across the phase diagram. Furthermore, we show that the long-time behavior is encoded within the localization properties of the Ritz vectors under the Floquet evolution, providing an accurate diagnostic of ergodicity.

arXiv:2510.19824•Physical review. B./Physical review. B•Mar 26, 2026•6 citations

Arnoldi-Lindblad time evolution: Faster-than-the-clock algorithm for the spectrum of time-independent and Floquet open quantum systems

Fabrizio Minganti, Dolf Huybrechts

The characterization of open quantum systems is a central and recurring problem for the development of quantum technologies. For time-independent systems, an (often unique) steady state describes the average physics once all the transient processes have faded out, but interesting quantum properties can emerge at intermediate timescales. Given a Lindblad master equation, these properties are encoded in the spectrum of the Liouvillian whose diagonalization, however, is a challenge even for small-size quantum systems. Here, we propose a new method to efficiently provide the Liouvillian spectral decomposition. We call this method an Arnoldi-Lindblad time evolution, because it exploits the algebraic properties of the Liouvillian superoperator to efficiently construct a basis for the Arnoldi iteration problem. The advantage of our method is double: (i) It provides a faster-than-the-clock method to efficiently obtain the steady state, meaning that it produces the steady state through time evolution shorter than needed for the system to reach stationarity. (ii) It retrieves the low-lying spectral properties of the Liouvillian with a minimal overhead, allowing to determine both which quantum properties emerge and for how long they can be observed in a system. This method is general and model-independent , and lends itself to the study of large systems where the determination of the Liouvillian spectrum can be numerically demanding but the time evolution of the density matrix is still doable. Our results can be extended to time evolution with a time-dependent Liouvillian. In particular, our method works for Floquet (i.e., periodically driven) systems, where it allows not only to construct the Floquet map for the slow-decaying processes, but also to retrieve the stroboscopic steady state and the eigenspectrum of the Floquet map. Although the method can be applied to any Lindbladian evolution (spin, fermions, bosons, …), for the sake of simplicity we demonstrate the efficiency of our method on several examples of coupled bosonic resonators (as a particular example). Our method outperforms other diagonalization techniques and retrieves the Liouvillian low-lying spectrum even for system sizes for which it would be impossible to perform exact diagonalization.

arXiv:2109.01648•Quantum•Feb 10, 2022•21 citations

Dual applications of Chebyshev polynomials method: Efficiently finding thousands of central eigenvalues for many-spin systems

Haoyu Guan, Wenxian Zhang

Computation of a large group of interior eigenvalues at the middle spectrum is an important problem for quantum many-body systems, where the level statistics provides characteristic signatures of quantum chaos. We propose an exact numerical method, dual applications of Chebyshev polynomials (DACP), to simultaneously find thousands of central eigenvalues, where the level space decreases exponentially with the system size. To disentangle the near-degenerate problem, we employ twice the Chebyshev polynomials, to construct an exponential semicircle filter as a preconditioning step and to generate a large set of proper basis states in the desired subspace. Numerical calculations on Ising spin chain and spin glass shards confirm the correctness and efficiency of DACP. As numerical results demonstrate, DACP is 30 times faster than the state-of-the-art shift-invert method for the Ising spin chain while 8 times faster for the spin glass shards. In contrast to the shift-invert method, the computation time of DACP is only weakly influenced by the required number of eigenvalues, which renders it a powerful tool for large scale eigenvalues computations. Moreover, the consumed memory also remains a small constant (5.6 GB) for spin-1/2 systems consisting of up to 20 spins, making it desirable for parallel computing.

arXiv:2011.02107•SciPost Physics•Dec 8, 2021•6 citations

Floquet operator dynamics and orthogonal polynomials on the unit circle

Hsiu-Chung Yeh, Aditi Mitra

Operator spreading under stroboscopic time evolution due to a unitary is studied. An operator Krylov space is constructed and related to orthogonal polynomials on a unit circle (OPUC), as well as to the Krylov space of the edge operator of the Floquet transverse field Ising model with inhomogeneous couplings (ITFIM). The Verblunsky coefficients in the OPUC representation are related to the Krylov angles parameterizing the ITFIM. The relations between the OPUC and spectral functions are summarized and several applications are presented. These include derivation of analytic expressions for the OPUC for persistent $m$-periodic dynamics, and the numerical construction of the OPUC for autocorrelations of the homogeneous Floquet-Ising model as well as the $Z_3$ clock model. The numerically obtained Krylov angles of the $Z_3$ clock model with long-lived period tripled autocorrelations show a spatial periodicity of six, and this observation is used to develop an analytically solvable model for the ITFIM that mimics this behavior.

arXiv:2506.20611•Physical review. B./Physical review. B•Dec 15, 2025•1 citation

Krylov construction and complexity for driven quantum systems

Amin A. Nizami, Ankit W. Shrestha

Krylov complexity is an important dynamical quantity with relevance to the study of operator growth and quantum chaos and has recently been much studied for various time-independent systems. We initiate the study of K complexity in time-dependent (driven) quantum systems. For periodic time-dependent (Floquet) systems, we develop a natural method for doing the Krylov construction and then define (state and operator) K complexity for such systems. Focusing on kicked systems, in particular the quantum kicked rotor on a torus, we provide a detailed numerical study of the time dependence of Arnoldi coefficients as well as of the K complexity with the system coupling constant interpolating between the weak and strong coupling regimes. We also study the growth of the Krylov subspace dimension as a function of the system coupling constant.

arXiv:2305.00256•Physical review. E•Nov 28, 2023•50 citations

Floquet-informed learning of time-periodic Hamiltonians

Anonymous

Characterizing time-periodic Hamiltonians is pivotal for validating and controlling driven quantum platforms, yet prevailing and unadjusted reconstruction methods demand dense time-domain sampling and heavy post-processing. We introduce a scalable Floquet-informed learning algorithm that represents the Hamiltonian as a truncated Fourier series and recasts parameter estimation as a compact linear inverse problem in the Floquet band picture. The algorithm is well-suited to problems satisfying mild smoothness/band-limiting. In this regime, its sample and runtime complexities scale polynomially with the Fourier cutoff, time resolution, and the number of unknown coefficients. For local Hamiltonian models, the coefficients grows polynomially with system size, yielding at most polylogarithmic dependence on the Hilbert-space dimension. Furthermore, numerical experiments on one- and two-dimensional Ising and Heisenberg lattices show fast convergence to time resolution and robustness to higher-order perturbations. An adaptive rule learns the cutoff of Fourier series, removing the need to set known truncation \textit{a priori}. These features enable practical certification and benchmarking of periodically driven platforms with rapidly decaying higher-order content, and extend naturally to near-periodic drives.

arXiv:2509.02331•Physical Review A•Jul 13, 2026•1 citation
Periodically driven quantum many-body systems play a central role for our understanding of nonequilibrium phenomena. For studies of quantum chaos, thermalization, many-body localization and time crystals, the properties of eigenvectors and eigenvalues of the unitary evolution operator, and their scaling with physical system size L L are of interest. While for static systems, powerful methods for the partial diagonalization of the Hamiltonian were developed, the unitary eigenproblem remains daunting. % In this paper, we introduce a Krylov space diagonalization method to obtain exact eigenpairs of the unitary Floquet operator with eigenvalue closest to a target on the unit circle. Our method is based on a complex polynomial spectral transformation given by the geometric sum, leading to rapid convergence of the Arnoldi algorithm. We demonstrate that our method is much more efficient than the shift invert method in terms of both runtime and memory requirements, pushing the accessible system sizes to the realm of 20 qubits, with Hilbert space dimensions \geq 10^6 ≥ 10 6 .
In isolated quantum many-body systems periodically driven in time, the asymptotic dynamics at late times can exhibit distinct behavior such as thermalization or dynamical freezing. Understanding the properties of and the convergence towards infinite-time (nonequilibrium) steady states, however, remains a challenging endeavor. We propose a physically motivated Krylov space perspective on Floquet thermalization which offers a natural framework to study rates of convergence towards steady states and, simultaneously, an efficient numerical algorithm to evaluate infinite-time averages of observables within the diagonal ensemble. The effectiveness of our algorithm is demonstrated by applying it to the periodically driven mixed-field Ising model, reaching system sizes of up to 30 spins. Our method successfully resolves the transition between the ergodic and dynamically frozen phases and provides insight into the nature of the Floquet eigenstates across the phase diagram. Furthermore, we show that the long-time behavior is encoded within the localization properties of the Ritz vectors under the Floquet evolution, providing an accurate diagnostic of ergodicity.
The characterization of open quantum systems is a central and recurring problem for the development of quantum technologies. For time-independent systems, an (often unique) steady state describes the average physics once all the transient processes have faded out, but interesting quantum properties can emerge at intermediate timescales. Given a Lindblad master equation, these properties are encoded in the spectrum of the Liouvillian whose diagonalization, however, is a challenge even for small-size quantum systems. Here, we propose a new method to efficiently provide the Liouvillian spectral decomposition. We call this method an Arnoldi-Lindblad time evolution, because it exploits the algebraic properties of the Liouvillian superoperator to efficiently construct a basis for the Arnoldi iteration problem. The advantage of our method is double: (i) It provides a faster-than-the-clock method to efficiently obtain the steady state, meaning that it produces the steady state through time evolution shorter than needed for the system to reach stationarity. (ii) It retrieves the low-lying spectral properties of the Liouvillian with a minimal overhead, allowing to determine both which quantum properties emerge and for how long they can be observed in a system. This method is general and model-independent , and lends itself to the study of large systems where the determination of the Liouvillian spectrum can be numerically demanding but the time evolution of the density matrix is still doable. Our results can be extended to time evolution with a time-dependent Liouvillian. In particular, our method works for Floquet (i.e., periodically driven) systems, where it allows not only to construct the Floquet map for the slow-decaying processes, but also to retrieve the stroboscopic steady state and the eigenspectrum of the Floquet map. Although the method can be applied to any Lindbladian evolution (spin, fermions, bosons, …), for the sake of simplicity we demonstrate the efficiency of our method on several examples of coupled bosonic resonators (as a particular example). Our method outperforms other diagonalization techniques and retrieves the Liouvillian low-lying spectrum even for system sizes for which it would be impossible to perform exact diagonalization.
Computation of a large group of interior eigenvalues at the middle spectrum is an important problem for quantum many-body systems, where the level statistics provides characteristic signatures of quantum chaos. We propose an exact numerical method, dual applications of Chebyshev polynomials (DACP), to simultaneously find thousands of central eigenvalues, where the level space decreases exponentially with the system size. To disentangle the near-degenerate problem, we employ twice the Chebyshev polynomials, to construct an exponential semicircle filter as a preconditioning step and to generate a large set of proper basis states in the desired subspace. Numerical calculations on Ising spin chain and spin glass shards confirm the correctness and efficiency of DACP. As numerical results demonstrate, DACP is 30 times faster than the state-of-the-art shift-invert method for the Ising spin chain while 8 times faster for the spin glass shards. In contrast to the shift-invert method, the computation time of DACP is only weakly influenced by the required number of eigenvalues, which renders it a powerful tool for large scale eigenvalues computations. Moreover, the consumed memory also remains a small constant (5.6 GB) for spin-1/2 systems consisting of up to 20 spins, making it desirable for parallel computing.
Operator spreading under stroboscopic time evolution due to a unitary is studied. An operator Krylov space is constructed and related to orthogonal polynomials on a unit circle (OPUC), as well as to the Krylov space of the edge operator of the Floquet transverse field Ising model with inhomogeneous couplings (ITFIM). The Verblunsky coefficients in the OPUC representation are related to the Krylov angles parameterizing the ITFIM. The relations between the OPUC and spectral functions are summarized and several applications are presented. These include derivation of analytic expressions for the OPUC for persistent mmm-periodic dynamics, and the numerical construction of the OPUC for autocorrelations of the homogeneous Floquet-Ising model as well as the Z3Z_3Z3​ clock model. The numerically obtained Krylov angles of the Z3Z_3Z3​ clock model with long-lived period tripled autocorrelations show a spatial periodicity of six, and this observation is used to develop an analytically solvable model for the ITFIM that mimics this behavior.
Krylov complexity is an important dynamical quantity with relevance to the study of operator growth and quantum chaos and has recently been much studied for various time-independent systems. We initiate the study of K complexity in time-dependent (driven) quantum systems. For periodic time-dependent (Floquet) systems, we develop a natural method for doing the Krylov construction and then define (state and operator) K complexity for such systems. Focusing on kicked systems, in particular the quantum kicked rotor on a torus, we provide a detailed numerical study of the time dependence of Arnoldi coefficients as well as of the K complexity with the system coupling constant interpolating between the weak and strong coupling regimes. We also study the growth of the Krylov subspace dimension as a function of the system coupling constant.
Characterizing time-periodic Hamiltonians is pivotal for validating and controlling driven quantum platforms, yet prevailing and unadjusted reconstruction methods demand dense time-domain sampling and heavy post-processing. We introduce a scalable Floquet-informed learning algorithm that represents the Hamiltonian as a truncated Fourier series and recasts parameter estimation as a compact linear inverse problem in the Floquet band picture. The algorithm is well-suited to problems satisfying mild smoothness/band-limiting. In this regime, its sample and runtime complexities scale polynomially with the Fourier cutoff, time resolution, and the number of unknown coefficients. For local Hamiltonian models, the coefficients grows polynomially with system size, yielding at most polylogarithmic dependence on the Hilbert-space dimension. Furthermore, numerical experiments on one- and two-dimensional Ising and Heisenberg lattices show fast convergence to time resolution and robustness to higher-order perturbations. An adaptive rule learns the cutoff of Fourier series, removing the need to set known truncation \textit{a priori}. These features enable practical certification and benchmarking of periodically driven platforms with rapidly decaying higher-order content, and extend naturally to near-periodic drives.