Related papers: Operator growth and Krylov construction in dissipa…
It is shown that the operator sum representation for non-Markovian dynamics and the Lindblad master equation in Markovian limit can be derived from a formal solution to quantum Liouville equation for a qubit system in the presence of…
The overlap Dirac operator at nonzero quark chemical potential involves the computation of the sign function of a non-Hermitian matrix. In this talk we present iterative Krylov subspace approximations, with deflation of critical…
In the thesis we present an analytic approach towards exact description for steady state density operators of nonequilibrium quantum dynamics in the framework of open systems. We employ the so-called quantum Markovian semi-group evolution,…
We study a stability preserved Arnoldi algorithm for matrix exponential in the time domain simulation of large-scale power delivery networks (PDN), which are formulated as semi-explicit differential algebraic equations (DAEs). The solution…
We present a quantum algorithm for simulating a family of Markovian master equations that can be realized through a probabilistic application of unitary channels and state preparation. Our approach employs a second-order product formula for…
We consider Arnoldi like processes to obtain symplectic subspaces for Hamiltonian systems. Large systems are locally approximated by ones living in low dimensional subspaces; we especially consider Krylov subspaces and some extensions. This…
The need for large-scale electronic structure calculations arises recently in the field of material physics and efficient and accurate algebraic methods for large simultaneous linear equations become greatly important. We investigate the…
We study the statistical properties of the spread complexity in the Krylov space of quantum systems driven across a quantum phase transition. Using the diabatic Magnus expansion, we map the evolution to an effective one-dimensional hopping…
We present an efficient quantum algorithm for simulating the dynamics of Markovian open quantum systems. The performance of our algorithm is similar to the previous state-of-the-art quantum algorithm, i.e., it scales linearly in evolution…
In this study, we analyze Krylov Complexity in two-dimensional conformal field theories subjected to deformed SL$(2,\mathbb{R})$ Hamiltonians. In the vacuum state, we find that the K-complexity exhibits a universal phase structure. The…
Reliable adaptive beamforming is critical for large microphone arrays operating in highly dynamic acoustic environments. In scenarios characterized by fast-moving talkers and interferers, the available sample support for estimating the…
In recent years, a great deal of attention has been focused on numerically solving exponential integrators. The important ingredient to the implementation of exponential integrators is the efficient and accurate evaluation of the so called…
We study Krylov complexity in Schr\"odinger field theory in the grand canonical ensemble with chemical potential $\mu$, with an emphasis on the qualitatively new features that arise for $\mu>0$. In this regime the fermionic Wightman power…
We introduce and review a new complexity measure, called `Krylov complexity', which takes its origins in the field of quantum-chaotic dynamics, serving as a canonical measure of operator growth and spreading. Krylov complexity, underpinned…
Markovian reservoir engineering, in which time evolution of a quantum system is governed by a Lindblad master equation, is a powerful technique in studies of quantum phases of matter and quantum information. It can be used to drive a…
We derive a semiclassical approximation for the evolution generated by the Lindblad equation as a generalization of complex WKB theory. Linear coupling to the environment is assumed, but the Hamiltonian can be a general function of…
Krylov complexity measures operator growth with respect to a basis, which is adapted to the Heisenberg time evolution. The construction of that basis relies on the Lanczos algorithm, also known as the recursion method. The mathematics of…
Krylov complexity provides a powerful framework for characterizing the dynamical evolution of quantum systems through the spreading of states in Krylov space. The motivation for this is rooted in the optimality of the Krylov basis for the…
The Lanczos algorithm, introduced by Cornelius Lanczos, has been known for a long time and is widely used in computational physics. While often employed to approximate extreme eigenvalues and eigenvectores of an operator, recently interest…
It was recently conjectured that in generic quantum many-body systems, the spectral density of local operators has the slowest high-frequency decay as permitted by locality. We show that the infinite-temperature version of this "universal…