Quantum Dynamics in Krylov Space: Methods and Applications
- URL: http://arxiv.org/abs/2405.09628v2
- Date: Wed, 5 Jun 2024 17:53:01 GMT
- Title: Quantum Dynamics in Krylov Space: Methods and Applications
- Authors: Pratik Nandy, Apollonas S. Matsoukas-Roubeas, Pablo MartÃnez-Azcona, Anatoly Dymarsky, Adolfo del Campo,
- Abstract summary: 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 a compact and computationally efficient description of quantum evolution.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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 a compact and computationally efficient description of quantum evolution, with emphasis on nonequilibrium phenomena of many-body systems with a large Hilbert space. It provides a comprehensive update of recent developments, focused on the quantum evolution of operators in the Heisenberg picture as well as pure and mixed states. It further explores the notion of Krylov complexity and associated metrics as tools for quantifying operator growth, their bounds by generalized quantum speed limits, the universal operator growth hypothesis, and its relation to quantum chaos, scrambling, and generalized coherent states. A comparison of several generalizations of the Krylov construction for open quantum systems is presented. A closing discussion addresses the application of Krylov subspace methods in quantum field theory, holography, integrability, quantum control, and quantum computing, as well as current open problems.
Related papers
- Quantum ergodicity and scrambling in quantum annealers [0.0]
We show that the unitary evolution operator describing the complete dynamics of quantum annealers is typically highly quantum chaotic.
We observe that the Heisenberg dynamics of a quantum annealer leads to extensive operator spreading, a hallmark of quantum information scrambling.
arXiv Detail & Related papers (2024-11-19T16:34:35Z) - Quantum and classical coarsening and their interplay with the
Kibble-Zurek mechanism [0.0]
Out-of-equilibrium dynamics of a quantum system driven across a quantum phase transition is an important problem.
We develop a universal description of such coarsening dynamics and their interplay with the Kibble-Zurek mechanism.
We highlight how such coarsening dynamics can be directly studied in today's "synthetic" quantum many-body systems.
arXiv Detail & Related papers (2024-01-26T19:00:00Z) - Krylov Spread Complexity of Quantum-Walks [0.0]
The paper sheds new light on the Krylov complexity measure by exploring it in the context of continuous-time quantum-walks on graphs.
A close relationship between Krylov spread complexity and the concept of limiting-distributions for quantum-walks is established.
Using a graph optimization algorithm, quantum-walk graphs are constructed that have minimal and maximal long-time average Krylov $bar C$-complexity.
arXiv Detail & Related papers (2023-12-31T16:06:35Z) - Hyperfine Structure of Quantum Entanglement [8.203995433574182]
We introduce the textithyperfine structure of entanglement, which dissects entanglement contours known as the fine structure into particle-number cumulants.
Our findings suggest experimental accessibility, offering fresh insights into quantum entanglement across physical systems.
arXiv Detail & Related papers (2023-11-03T15:49:56Z) - No-Regret Learning and Equilibrium Computation in Quantum Games [32.52039978254151]
This paper delves into the dynamics of quantum-enabled agents within decentralized systems.
We show that no-regret algorithms converge to separable quantum Nash equilibria in time-average.
In the case of general multi-player quantum games, our work leads to a novel solution concept, (separable) quantum coarse correlated equilibria (QCCE)
arXiv Detail & Related papers (2023-10-12T16:29:56Z) - Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
The anticipated applications of quantum computers span across science and industry.
We present a survey of several potential application areas of quantum algorithms.
We outline the challenges and opportunities in each area in an "end-to-end" fashion.
arXiv Detail & Related papers (2023-10-04T17:53:55Z) - Operator Growth in Open Quantum Systems [0.4351216340655199]
We provide a universal framework that describes the scrambling of quantum information in open systems.
We show that open quantum systems exhibit universal classes of information dynamics that fundamentally differ from their unitary counterparts.
arXiv Detail & Related papers (2022-08-25T18:00:00Z) - Quantum Davidson Algorithm for Excited States [42.666709382892265]
We introduce the quantum Krylov subspace (QKS) method to address both ground and excited states.
By using the residues of eigenstates to expand the Krylov subspace, we formulate a compact subspace that aligns closely with the exact solutions.
Using quantum simulators, we employ the novel QDavidson algorithm to delve into the excited state properties of various systems.
arXiv Detail & Related papers (2022-04-22T15:03:03Z) - Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics.
The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system.
Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
arXiv Detail & Related papers (2021-03-05T08:32:43Z) - Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems.
We propose an algorithm to implement imaginary time propagation on a quantum computer.
arXiv Detail & Related papers (2021-02-24T12:48:00Z) - Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor.
We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
arXiv Detail & Related papers (2021-01-21T22:18:49Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.