Related papers: Krylov Complexity of Optical Hamiltonians
We study information scrambling -- a spread of initially localized quantum information into the system's many degree of freedom -- in discrete-time quantum walks. We consider out-of-time-ordered correlators (OTOC) and K-complexity as a…
We investigate minimal two-body Hamiltonians with random interactions that generate spectra resembling those of Gaussian random matrices, a phenomenon we term quadratic quantum chaos. Unlike integrable two-body fermionic systems, the…
This paper presents a study of the inherent structural properties of Krylov subspaces, in particular for the self-adjoint class of operators, and how they relate with the important phenomenon of `Krylov solvability' of linear inverse…
The dynamics of quantum systems unfolds within a subspace of the state space or operator space, known as the Krylov space. This review presents the use of Krylov subspace methods to provide an efficient description of quantum evolution and…
We establish a direct correspondence between Krylov and Nielsen complexity by choosing the Krylov basis to be part of the elementary gate set of Nielsen geometry and selecting a Nielsen complexity metric compatible with the Krylov metric.…
Given the recent advances in quantum technology, the complexity of quantum states is an important notion. The idea of the Krylov spread complexity has come into focus recently with the goal of capturing this in a quantitative way. The…
Parity-time ($PT$) symmetric Hamiltonians are generally non-Hermitian and give rise to exotic behaviour in quantum systems at exceptional points, where eigenvectors coalesce. The recent realisation of $PT$-symmetric Hamiltonians in quantum…
An observer-based Hamiltonian identification algorithm for quantum systems is proposed. For the 2-level case an exponential convergence result based on averaging arguments and some relevant transformations is provided. The convergence for…
Quantum chaotic systems are conjectured to display a spectrum whose fine-grained features (gaps and correlations) are well described by Random Matrix Theory (RMT). We propose and develop a complementary version of this conjecture: quantum…
We study time-dependent coupled-cluster theory in the framework of nuclear physics. Based on Kvaal's bi-variational formulation of this method [S. Kvaal, arXiv:1201.5548], we explicitly demonstrate that observables that commute with the…
We investigate various aspects of the Lanczos coefficients in a family of free Lifshitz scalar theories, characterized by their integer dynamical exponent, at finite temperature. In this non-relativistic setup, we examine the effects of…
In this paper, we discuss the reduction of symplectic Hamiltonian systems by scaling and standard symmetries which commute. We prove that such a reduction process produces a so-called Kirillov Hamiltonian system. Moreover, we show that if…
We discuss a general and systematic method for obtaining effective Hamiltonians that describe different nonlinear optical processes. The method exploits the existence of a nonlinear deformation of the usual su(2) algebra that arises as the…
We establish a direct connection between spread complexity and quantum circuit complexity by demonstrating that spread complexity emerges as a limiting case of a circuit complexity framework built from two fundamental operations:…
We introduce an algorithm that is simultaneously memory-efficient and low-scaling for applying ab initio molecular Hamiltonians to matrix-product states (MPS) via the tensor-hypercontraction (THC) format. These gains carry over to Krylov…
We present a mapping of the nonlinear, electrostatic Vlasov equation with Krook-type collision operators, discretized on a (1+1) dimensional grid, onto a recent Carleman linearization-based quantum algorithm for solving ordinary…
We consider quantum systems consisting of a linear chain of n harmonic oscillators coupled by a nearest neighbour interaction of the form $-q_r q_{r+1}$ ($q_r$ refers to the position of the $r$th oscillator). In principle, such systems are…
Linear optical circuits with single-photon sources offer a promising platform for quantum chemistry and machine learning. However, current applications are all based on support vector machines or gradient-free optimization methods. This…
Krylov complexity is a novel approach to study how an operator spreads over a specific basis. Recently, it has been stated that this quantity has a long-time saturation that depends on the amount of chaos in the system. Since this quantity…
We examine the current state-of-the-art in nonperturbative calculations done with Hamiltonians constructed in light-front quantization of various field theories. The language of light-front quantization is introduced, and important…