Bridging Krylov Complexity and Universal Analog Quantum Simulator

• URL: http://arxiv.org/abs/2605.07668v1
• Date: Fri, 08 May 2026 12:39:43 GMT
• Title: Bridging Krylov Complexity and Universal Analog Quantum Simulator
• Abstract summary: We introduce generalized Krylov complexity, a concept originating from operator growth dynamics, as a direct diagnosis for this synthesis complexity.<n>By analyzing representative systems including Rydberg atom arrays, we demonstrate that the generalized Krylov complexity of a target operation serves as a strong predictor of the minimum time required for its realization.<n>Our results establish Krylov complexity as an intuitive and predictive tool for designing efficient control protocols in analog quantum simulators.
• Score: 11.570003197315259
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum simulation of complex many-body systems beyond classical computational capabilities provides a promising route toward understanding novel quantum phases and their transitions. In particular, analog quantum simulators with global control fields have attracted considerable attention due to their potential to simulate arbitrary Hamiltonians and perform quantum computing tasks. However, a clear, quantitative measure for the complexity of implementing specific quantum operations in such systems is still lacking. In this Letter, we address this challenge by introducing generalized Krylov complexity, a concept originating from operator growth dynamics, as a direct diagnosis for this synthesis complexity. We construct the block Krylov basis generated by a set of Hamiltonians, which naturally organizes the operator space achievable through the simulator's native interactions and their nested commutators. By analyzing representative systems including Rydberg atom arrays, we demonstrate that the generalized Krylov complexity of a target operation serves as a strong predictor of the minimum time required for its realization. Our results establish Krylov complexity as an intuitive and predictive tool for designing efficient control protocols in analog quantum simulators.

Related papers

• Learnable yet not simulable: a quantum resource theory of learning models [57.695822250391906]
  It remains unclear which quantum resource governs the classical learnability of quantum circuits.<n>We study the expectation-value functions of families of tunable quantum circuits.<n>These results establish a quantitative resource-theoretic framework for delineating the boundary between classical simulation and learning.
  arXiv  Detail & Related papers  (2026-08-03T14:48:03Z)
• Computational and physical complexity of synthesizing random multi-qudit quantum states and unitary operators [0.0]
  We show that the computational complexity of random states or unitary operators scales exponentially with the number of qudits.<n>Our numerical results suggest that the physical complexity of preparing random quantum states and unitary operators scales more slowly than the computational complexity.
  arXiv  Detail & Related papers  (2026-05-08T07:30:21Z)
• Quantum Chaos Diagnostics for Open Quantum Systems from Bi-Lanczos Krylov Dynamics [2.0603431589684518]
  In Hermitian systems, Krylov complexity has emerged as a powerful diagnostic of quantum dynamics.<n>Here, we demonstrate that Krylov complexity, computed via the bi-Lanczos algorithm, effectively identifies chaotic and integrable phases in open quantum systems.
  arXiv  Detail & Related papers  (2025-08-19T15:49:09Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum Walks on Simplicial Complexes and Harmonic Homology: Application to Topological Data Analysis with Superpolynomial Speedups [9.538251541300028]
  We introduce a novel quantum walk that encodes the Laplacian, a key mathematical object whose spectral properties reflect the underlying simplicial complex. Our results achieve superpolynomial quantum speedup with quantum walks without relying on quantum oracles for large datasets.
  arXiv  Detail & Related papers  (2024-04-23T18:00:17Z)
• Solving reaction dynamics with quantum computing algorithms [42.408991654684876]
  We study quantum algorithms for response functions, relevant for describing different reactions governed by linear response.<n>We focus on nuclear-physics applications and consider a qubit-efficient mapping on the lattice, which can efficiently represent the large volumes required for realistic scattering simulations.
  arXiv  Detail & Related papers  (2024-03-30T00:21:46Z)
• Predicting Arbitrary State Properties from Single Hamiltonian Quench Dynamics [0.8639941465436463]
  We introduce the Hamiltonian shadow protocol, which estimates arbitrary state properties on analog quantum simulators. The protocol does not require sophisticated control and can be applied to a wide range of analog quantum simulators.
  arXiv  Detail & Related papers  (2023-11-01T17:52:23Z)
• Resource-Dependent Complexity of Quantum Channels [5.633571140534384]
  We introduce a new framework for quantifying the complexity of quantum channels.<n>This class of convex functions is designed to analyze the complexity of both open and closed quantum systems.
  arXiv  Detail & Related papers  (2023-03-20T17:44:57Z)
• The Basis of Design Tools for Quantum Computing: Arrays, Decision Diagrams, Tensor Networks, and ZX-Calculus [55.58528469973086]
  Quantum computers promise to efficiently solve important problems classical computers never will. A fully automated quantum software stack needs to be developed. This work provides a look "under the hood" of today's tools and showcases how these means are utilized in them, e.g., for simulation, compilation, and verification of quantum circuits.
  arXiv  Detail & Related papers  (2023-01-10T19:00:00Z)
• Detailed Account of Complexity for Implementation of Some Gate-Based Quantum Algorithms [55.41644538483948]
  In particular, some steps of the implementation, as state preparation and readout processes, can surpass the complexity aspects of the algorithm itself. We present the complexity involved in the full implementation of quantum algorithms for solving linear systems of equations and linear system of differential equations.
  arXiv  Detail & Related papers  (2021-06-23T16:33:33Z)
• Quantum Markov Chain Monte Carlo with Digital Dissipative Dynamics on Quantum Computers [52.77024349608834]
  We develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits. We evaluate the algorithm by simulating thermal states of the transverse Ising model.
  arXiv  Detail & Related papers  (2021-03-04T18:21: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.