Related papers: Polynomial filter diagonalization of large Floquet…
Quantum subspace diagonalization and quantum Krylov algorithms offer a feasible, pre- or early-fault tolerant alternative to quantum phase estimation for using quantum computers to estimate the low-lying spectra of quantum systems. However,…
In this paper, we develop algorithms for computing the recurrence coefficients corresponding to multiple orthogonal polynomials on the step-line. We reformulate the problem as an inverse eigenvalue problem, which can be solved using…
Exact diagonalization is a powerful numerical method to study isolated quantum many-body systems. This paper provides a review of numerical algorithms to diagonalize the Hamiltonian matrix. Symmetry and the conservation law help us perform…
An approximate diagonalization method is proposed that combines exact diagonalization and perturbation expansion to calculate low energy eigenvalues and eigenfunctions of a Hamiltonian. The method involves deriving an effective Hamiltonian…
We introduce a new diagonalization method called quasi-sparse eigenvector diagonalization which finds the most important basis vectors of the low energy eigenstates of a quantum Hamiltonian. It can operate using any basis, either orthogonal…
We investigate many-body dynamics where the evolution is governed by unitary circuits through the lens of `Krylov complexity', a recently proposed measure of complexity and quantum chaos. We extend the formalism of Krylov complexity to…
Periodic eigendecomposition, to be formulated in this paper, is a numerical method to compute Floquet spectrum and Floquet vectors along periodic orbits in a dynamical system. It is rooted in numerical algorithms advances in computation of…
We consider a random time evolution operator composed of a circuit of random unitaries coupling even and odd neighboring spins on a chain in turn. In spirit of Floquet evolution, the circuit is time-periodic; each timestep is repeated with…
Quantum Krylov subspace methods can extract ground and excited states by diagonalizing the Hamiltonian in a compact variational space. In practice, these spaces are almost always generated by real or imaginary time evolution, forcing a…
Quantum subspace diagonalization (QSD) algorithms have emerged as a competitive family of algorithms that avoid many of the optimization pitfalls associated with parameterized quantum circuit algorithms. While the vast majority of the QSD…
Within the realm of early fault-tolerant quantum computing (EFTQC), quantum Krylov subspace diagonalization (QKSD) has emerged as a promising quantum algorithm for the approximate Hamiltonian diagonalization via projection onto the quantum…
We introduce a unitary matrix-product operator (UMPO) based variational method that approximately finds all the eigenstates of fully many-body localized (fMBL) one-dimensional Hamiltonians. The computational cost of the variational…
In this paper, building on a previous analysis [1] of exact diagonalization of the space-discretized evolution operator for the study of properties of non-relativistic quantum systems, we present a substantial improvement to this method. We…
The Krylov subspace methods, being one category of the most important classical numerical methods for linear algebra problems, can be much more powerful when generalised to quantum computing. However, quantum Krylov subspace algorithms are…
In this paper, we propose a decomposition approach for eigenvalue problems with spatial symmetries, including the formulation, discretization as well as implementation. This approach can handle eigenvalue problems with either Abelian or…
The complexity of quantum many-body problems scales exponentially with the size of the system, rendering any finite size scaling analysis a formidable challenge. This is particularly true for methods based on the full representation of the…
We derive a systematic high-frequency expansion for the effective Hamiltonian and the micromotion operator of periodically driven quantum systems. Our approach is based on the block diagonalization of the quasienergy operator in the…
It is significant and challenging to solve eigenvalue problems of partial differential operators when many highly accurate eigenpair approximations are required. The adaptive finite element discretization based parallel orbital-updating…
We construct a dynamical decoupling protocol for accurately generating local and global symmetries in general many-body systems. Multiple commuting and non-commuting symmetries can be created by means of a self-similar-in-time…
Krylov subspace methods are among the most extensively studied early fault-tolerant quantum algorithms for estimating ground-state energies of quantum systems. However, the rapid onset of ill-conditioning might make accurate energies…