Related papers: Krylov Complexity for Jacobi Coherent States
This paper presents a new algorithm KIOPS for computing linear combinations of $\varphi$-functions that appear in exponential integrators. This algorithm is suitable for large-scale problems in computational physics where little or no…
This paper investigates a Hamilton-Jacobi (HJ) analysis to solve finite-horizon optimal control problems for high-dimensional systems. Although grid-based methods, such as the level-set method [1], numerically solve a general class of HJ…
We study a class of weakly coupled systems of Hamilton{Jacobi equations at the critical level. We associate to it a family of scalar discounted equation. Using control{theoretic tech- niques we construct an algorithm which allows obtaining…
Within the generalized definition of coherent states as group orbits we study the orbit spaces and the orbit manifolds in the projective spaces constructed from linear representations. Invariant functions are suggested for arbitrary groups.…
We introduce new families of pure quantum states that are constructed on top of the well-known Gilmore-Perelomov group-theoretic coherent states. We do this by constructing unitaries as the exponential of operators quadratic in Cartan…
We initiate an investigation into a notion of state complexity for discrete-variable quantum systems. Specifically, we propose an information-theoretic quantifier for the complexity of quantum states within the stabilizer formalism of…
Krylov space methods provide an efficient framework for analyzing the dynamical aspects of quantum systems, with tridiagonal matrices playing a key role. Despite their importance, the behavior of such matrices from chaotic to integrable…
Krylov methods have reappeared recently, connecting physically sensible notions of complexity with quantum chaos and quantum gravity. In these developments, the Hamiltonian and the Liouvillian are tridiagonalized so that…
We calculate Nielsen's circuit complexity of coherent spin state operators. An expression for the complexity is obtained by using the small angle approximation of the Euler angle parametrisation of a general $SO(3)$ rotation. This is then…
Many scientific applications require the solution of large initial-value problems, such as those produced by the method of lines after semi-discretization in space of partial differential equations. The computational cost of implicit time…
The zero-temperature single-particle Green's function of correlated fermion models with moderately large Hilbert-space dimensions can be calculated by means of Krylov-space techniques. The conventional Lanczos approach consists of finding…
Jacobian and Hessian regularization aim to reduce the magnitude of the first and second-order partial derivatives with respect to neural network inputs, and they are predominantly used to ensure the adversarial robustness of image…
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…
In this work, we propose a quantum-mechanically measurable basis for the computation of spread complexity. Current literature focuses on computing different powers of the Hamiltonian to construct a basis for the Krylov state space and 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…
Hybrid dynamical systems with nonlinear dynamics are one of the most general modeling tools for representing robotic systems, especially contact-rich systems. However, providing guarantees regarding the safety or performance of nonlinear…
Krylov complexity has emerged as a new probe of operator growth in a wide range of non-equilibrium quantum dynamics. However, a fundamental issue remains in such studies: the definition of the distance between basis states in Krylov space…
This work is on a user-friendly reduced basis method for solving a family of parametric PDEs by preconditioned Krylov subspace methods including the conjugate gradient method, generalized minimum residual method, and bi-conjugate gradient…
Reachability analysis is important for studying optimal control problems and differential games, which are powerful theoretical tools for analyzing and modeling many practical problems in robotics, aircraft control, among other application…
We construct a class of generalized phase coherent states indexed by points of the unit circle and depending on three positive parameters "gamma","alpha" and "epsilon" by replacing the labelling coefficients of the canonical coherent states…