Related papers: Towards a Refinement of Krylov Complexity: Scrambl…
We study Krylov complexity in BMN Plane Wave Matrix Model at large mass deformation. We consider various consistent reductions of the matrix model that allow us to perform a Hamiltonian analysis which leads to different notions of the…
We present an iterative generalisation of the quantum subspace expansion algorithm used with a Krylov basis. The iterative construction connects a sequence of subspaces via their lowest energy states. Diagonalising a Hamiltonian in a given…
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…
Krylov methods rely on iterated matrix-vector products $A^k u_j$ for an $n\times n$ matrix $A$ and vectors $u_1,\ldots,u_m$. The space spanned by all iterates $A^k u_j$ admits a particular basis -- the \emph{maximal Krylov basis} -- which…
The $\mathcal{H}_2$ model reduction problem for high-dimensional linear quantum systems is studied under the constraint of physical realizability (PR). This constraint requires preservation of the canonical commutation relations and the…
The Krylov subspace method is a standard approach to approximate quantum evolution, allowing to treat systems with large Hilbert spaces. Although its application is general, and suitable for many-body systems, estimation of the committed…
In this paper we present a novel extended Krylov subspace reduced-order modeling technique to efficiently simulate time- and frequency-domain wavefields in open complex structures. To simulate the extension to infinity, we use an optimal…
Dynamical quantum phase transitions, encompassing phenomena like many-body localization transitions and measurement-induced phase transitions, are often characterized and identified through the analysis of quantum entanglement. Here, we…
Information scrambling refers to the phenomenon in which local quantum information in a many-body system becomes dispersed throughout the entire system under unitary evolution. It has been extensively studied in closed quantum systems,…
We introduce a systematic protocol for constructing quantum Hilbert-space-fragmented Hamiltonians, whose Krylov-sector structure, unlike in classically fragmented models, can be fully resolved only in an entangled basis. The protocol takes…
We systematically investigate scrambling (or delocalizing) processes of quantum information encoded in quantum many-body systems by using numerical exact diagonalization. As a measure of scrambling, we adopt the tripartite mutual…
The IP matrix model is a simple large $N$ quantum mechanical model made up of an adjoint harmonic oscillator plus a fundamental harmonic oscillator. It is a model introduced previously as a toy model of the gauge theory dual of an AdS black…
Since being analyzed by Rokhlin, Szlam, and Tygert and popularized by Halko, Martinsson, and Tropp, randomized Simultaneous Power Iteration has become the method of choice for approximate singular value decomposition. It is more accurate…
We propose a high order adaptive-rank implicit integrators for stiff time-dependent PDEs, leveraging extended Krylov subspaces to efficiently and adaptively populate low-rank solution bases. This allows for the accurate representation of…
We consider the statistics of the results of a measurement of the spreading operator in the Krylov basis generated by the Hamiltonian of a quantum system starting from a specified initial pure state. We first obtain the probability…
The emergence of the arrow of time in quantum many-body systems stems from the inherent tendency of Hamiltonian evolution to scramble quantum information and increase entanglement. While, in principle, one might counteract this temporal…
Quantum scrambling describes the spreading of local information into many degrees of freedom in quantum systems. This provides the conceptual connection among diverse phenomena ranging from thermalizing quantum dynamics to models of black…
Scrambling of quantum information is the process by which information initially stored in the local degrees of freedom of a quantum many-body system spreads over its many-body degrees of freedom, becoming inaccessible to local probes and…
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…
We introduce a new family of quantum circuits for which the scrambling of a subspace of non-local operators is classically simulable. We call these circuits `super-Clifford circuits', since the Heisenberg time evolution of these operators…