Spectral Filtering for Learning Quantum Dynamics

• URL: http://arxiv.org/abs/2601.22400v1
• Date: Thu, 29 Jan 2026 23:11:57 GMT
• Title: Spectral Filtering for Learning Quantum Dynamics
• Abstract summary: Learning high-dimensional quantum systems is a fundamental challenge that notoriously suffers from the curse of dimensionality.<n>We formulate the task of predicting quantum evolution in the linear response regime as a specific instance of learning a Complex-Valued Linear Dynamical System.<n>We prove that the learnability of such systems is governed strictly by an effective quantum dimension $k*$, determined by the spectral bandwidth and memory horizon.
• Score: 15.021303911702121
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Learning high-dimensional quantum systems is a fundamental challenge that notoriously suffers from the curse of dimensionality. We formulate the task of predicting quantum evolution in the linear response regime as a specific instance of learning a Complex-Valued Linear Dynamical System (CLDS) with sector-bounded eigenvalues -- a setting that also encompasses modern Structured State Space Models (SSMs). While traditional system identification attempts to reconstruct full system matrices (incurring exponential cost in the Hilbert dimension), we propose Quantum Spectral Filtering, a method that shifts the goal to improper dynamic learning. Leveraging the optimal concentration properties of the Slepian basis, we prove that the learnability of such systems is governed strictly by an effective quantum dimension $k^*$, determined by the spectral bandwidth and memory horizon. This result establishes that complex-valued LDSs can be learned with sample and computational complexity independent of the ambient state dimension, provided their spectrum is bounded.

Related papers

• Breaking the Curse of Dimensionality in Quantum PDE Solvers via Gevrey Regularity [4.219859693008517]
  We use the Gevrey hierarchy to stratifies the space between smooth and analytic functions.<n>We show how our Fourier methods do so efficiently at varying target precisions on a quantum computer.<n>As an application, we introduce a hierarchy of many-body quantum simulation pipelines.
  arXiv  Detail & Related papers  (2026-08-08T03:40:25Z)
• 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)
• Quantum computing-based solver for interacting power grids [0.0]
  We propose a novel quantum-classical hybrid methodology to map the transmission grid's admittance matrix onto a Quantum Processing Unit (QPU)<n>Because the grid's matrix is non-Hermitian, standard quantum eigensolvers are insufficient; thus, we employ the Real Variance-based Variational Quantum Eigensolver (RVVQE) algorithm to accurately extract the complex eigenvalues that represent the system's modes.<n>The RVVQE framework not only bridges the mathematical topologies of dissipative electrical grids and open quantum systems but also provides a profoundly scalable architecture capable of diagnosing resonance in
  arXiv  Detail & Related papers  (2026-07-31T16:07:07Z)
• Towards Quantum Enhanced Adversarial Robustness with Rydberg Reservoir Learning [45.92935470813908]
  Quantum computing reservoir (QRC) leverages the high-dimensional, nonlinear dynamics inherent in quantum many-body systems.<n>Recent studies indicate that perturbation quantums based on variational circuits remain susceptible to adversarials.<n>We investigate the first systematic evaluation of adversarial robustness in a QR based learning model.
  arXiv  Detail & Related papers  (2025-10-15T12:17:23Z)
• Quantum Filtering and Stabilization of Dissipative Quantum Systems via Augmented Neural Ordinary Differential Equations [5.819937157229223]
  AQNODE is a framework that learns quantum trajectories and dissipation parameters directly from measurement data.<n>Our approach integrates weak measurement data to reconstruct qubit states and time-dependent decoherence rates.<n> AQNODE is a scalable, differentiable, and experimentally compatible framework for real-time modeling and control of dissipative quantum systems.
  arXiv  Detail & Related papers  (2025-09-08T20:23:45Z)
• Entanglement and Classical Simulability in Quantum Extreme Learning Machines [0.0]
  We investigate Quantum Extreme Learning Machines (QELMs), a quantum analogue of classical Extreme Learning Machines.<n>Our architecture combines dimensionality reduction (via PCA or Autoencoders), quantum state encoding, evolution under an XX Hamiltonian, and projective measurement.<n>We show that this performance enhancement correlates with the onset of entanglement, which improves the embedding of classical data.
  arXiv  Detail & Related papers  (2025-09-08T16:43:37Z)
• Characterizing Non-Markovian Dynamics of Open Quantum Systems [0.0]
  We develop a structure-preserving approach to characterizing non-Markovian evolution using the time-convolutionless (TCL) master equation.<n>We demonstrate our methodology using experimental data from a superconducting qubit at the Quantum Device Integration Testbed (QuDIT) at Lawrence Livermore National Laboratory.<n>These findings provide valuable insights into efficient modeling strategies for open quantum systems, with implications for quantum control and error mitigation in near-term quantum processors.
  arXiv  Detail & Related papers  (2025-03-28T04:43:24Z)
• Quantum Linear Time-Translation-Invariant Systems: Conjugate Symplectic Structure, Uncertainty Bounds, and Tomography [0.0]
  We develop a general quantization scheme for multimode classical LTI systems that reveals their fundamental quantum noise. We show that such systems can be synthesized using frequency-dependent interferometers and squeezers. These results establish a complete and systematic framework for the analysis, synthesis, and measurement of arbitrary quantum LTI systems.
  arXiv  Detail & Related papers  (2024-10-13T19:34:35Z)
• 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)
• ShadowNet for Data-Centric Quantum System Learning [188.683909185536]
  We propose a data-centric learning paradigm combining the strength of neural-network protocols and classical shadows. Capitalizing on the generalization power of neural networks, this paradigm can be trained offline and excel at predicting previously unseen systems. We present the instantiation of our paradigm in quantum state tomography and direct fidelity estimation tasks and conduct numerical analysis up to 60 qubits.
  arXiv  Detail & Related papers  (2023-08-22T09:11:53Z)
• The Quantum Path Kernel: a Generalized Quantum Neural Tangent Kernel for Deep Quantum Machine Learning [52.77024349608834]
  Building a quantum analog of classical deep neural networks represents a fundamental challenge in quantum computing. Key issue is how to address the inherent non-linearity of classical deep learning. We introduce the Quantum Path Kernel, a formulation of quantum machine learning capable of replicating those aspects of deep machine learning.
  arXiv  Detail & Related papers  (2022-12-22T16:06:24Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Moment dynamics and observer design for a class of quasilinear quantum stochastic systems [2.0508733018954843]
  This paper is concerned with a class of open quantum systems whose dynamic variables have an algebraic structure. The system interacts with external bosonic fields, and its Hamiltonian and coupling operators depend linearly on the system variables. The tractability of the moment dynamics is also used for mean square optimal Luenberger observer design in a measurement-based filtering problem for a quasilinear quantum plant.
  arXiv  Detail & Related papers  (2020-12-15T11:01:53Z)
• Entanglement transfer, accumulation and retrieval via quantum-walk-based qubit-qudit dynamics [50.591267188664666]
  Generation and control of quantum correlations in high-dimensional systems is a major challenge in the present landscape of quantum technologies. We propose a protocol that is able to attain entangled states of $d$-dimensional systems through a quantum-walk-based it transfer & accumulate mechanism. In particular, we illustrate a possible photonic implementation where the information is encoded in the orbital angular momentum and polarization degrees of freedom of single photons.
  arXiv  Detail & Related papers  (2020-10-14T14:33:34Z)

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.