Krylov Spread Complexity of Quantum-Walks
arXiv:2401.00526 · doi:10.1103/PhysRevA.110.032206
Abstract
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 present 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. Moreover, using a graph optimization algorithm, quantum-walk graphs are constructed that have minimal and maximal long-time average Krylov -complexity. This reveals an empirical upper bound for the -complexity as a function of Hilbert space dimension and an exact lower bound.
v2: references added, typos corrected
References in corpus (33)
- Quantum Computing in the NISQ era and beyond
- Universal computation by quantum walk
- Complexity and Shock Wave Geometries
- Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
- Universal computation by multi-particle quantum walk
- Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays
- An example of the difference between quantum and classical random walks
- A Universal Operator Growth Hypothesis
- The Second Law of Quantum Complexity
- Quantum chaos and the complexity of spread of states
- Operator complexity: a journey to the edge of Krylov space
- A divide-and-conquer algorithm for quantum state preparation
- Optimal control, geometry, and quantum computing
- Krylov Localization and suppression of complexity
- Operator growth and Krylov construction in dissipative open quantum systems
- Fast Escape from Quantum Mazes in Integrated Photonics
- Ultimate Speed Limits to the Growth of Operator Complexity
- Quantum complexity and topological phases of matter
- The Complexity Geometry of a Single Qubit
- Probing quantum scars and weak ergodicity-breaking through quantum complexity
- Krylov Complexity in Open Quantum Systems
- Krylov complexity and orthogonal polynomials
- Krylov complexity and chaos in quantum mechanics
- Spread Complexity and Topological Transitions in the Kitaev Chain
- Operator dynamics in Lindbladian SYK: a Krylov complexity perspective
- Solving Graph Problems Using Gaussian Boson Sampling
- Spectral and Krylov Complexity in Billiard Systems
- Quantum simulation of Ising spins on Platonic graphs
- Spread complexity in saddle-dominated scrambling
- A relation between Krylov and Nielsen complexity
- Spread complexity for measurement-induced non-unitary dynamics and Zeno effect
- Quantum Programming of the Satisfiability Problem with Rydberg Atom Graphs
- Negative specific heat from non-planar interactions and small black holes in AdS/CFT