Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2006.13498 · Physical Review A

Quantum system compression: A Hamiltonian guided walk through Hilbert space

Robert L. Kosut, Tak‐San Ho, HERSCHEL A. RABITZ

Published Jan 12, 2021• 5 citations
arXivHTMLPDF

Abstract

We present a systematic study of quantum system compression for the evolution of generic many-body problems. The necessary numerical simulations of such systems are seriously hindered by the exponential growth of the Hilbert-space dimension with the number of particles. For a constant Hamiltonian system of Hilbert-space dimension $n$ with frequencies ranging from ${f}_{min}$ to ${f}_{max}$, we show via a proper orthogonal decomposition that for a run time $T$ the dominant dynamics are compressed in the neighborhood of a subspace whose dimension is the smallest integer larger than the time-bandwidth product $\mathrm{\ensuremath{\Delta}}=({f}_{max}\ensuremath{-}{f}_{min})T$. We also show how the distribution of initial states can further compress the system dimension. Under the stated conditions, the time-bandwidth estimate reveals the existence of an effective compressed model whose dimension is derived solely from system properties and not dependent on the particular implementation of a variational simulator, such as a machine learning system, or quantum device, or possibly even specially adapting traditional methods of solving the time-dependent Schr\"odinger equation. However, finding an efficient solution procedure $\mathit{is}$ dependent on the simulator implementation, which is not discussed in this paper. In addition, we show that the compression rendered by the proper orthogonal decomposition encoding method can be further strengthened via a multilayer autoencoder. Finally, we present numerical illustrations to affirm the compression behavior in time-varying Hamiltonian dynamics in the presence of external fields. The essential time-bandwidth product is also simply estimated for a wide class of physical systems, where typically localized high-frequency motion occurs at or around each of the many particles, and with low-frequency dynamics associated with globally distributed characteristic degrees of freedom. This estimate for the bandwidth has a generic character indicating the wide significance of expected quantum system dynamics compression. We also discuss the potential implications of the findings for machine learning tools to efficiently solve the many-body or other high-dimensional Schr\"odinger equations.

DOI
10.1103/physreva.103.012406

Related papers

PIQS: an efficient quantum subspace method for dynamical property estimation

Youle Wang, Wenbin Yu, Yanfeng Fan +1 more

Abstract Simulating quantum dynamics to extract time-evolving observables constitutes a central challenge in quantum computing, with both fundamental significance and broad practical applications. Classical approaches suffer from the exponential scaling of Hilbert space, while existing quantum algorithms face limitations from deep circuits and sequential error accumulation on near-term devices. This work introduces a physics-informed quantum subspace method for the efficient estimation of dynamical properties of quantum systems. The core innovation is a globally physics-informed loss function that incorporates the time-dependent Schrödinger equation as a physics-based penalty. This enforces quantum evolution constraints directly during optimization, thereby circumventing the error accumulation inherent in stepwise simulations. By strategically relaxing the normalization constraint, we obtain convexified loss functions whose optimization reduces to solving a linear system, guaranteeing global convergence and significantly mitigating the convergence issues and barren plateaus common in variational quantum algorithms. Theoretically, we prove that under suitable conditions the true dynamical solution can be approximated with high accuracy within a subspace whose dimension scales only as O ( T log ⁡ ( 1 / ε ) ) , thus breaking the curse of dimensionality in classical simulation. Numerical experiments demonstrate that the proposed method outperforms conventional Trotterization and variational quantum benchmarks in terms of computational cost, convergence speed, and robustness against measurement noise, offering a viable and efficient pathway for practical dynamical simulation on noisy intermediate-scale quantum hardware.

Quantum Science and Technology•Jan 29, 2026•0 citations

Classical simulation of quantum many-body systems

Yichen Huang

Classical simulation of quantum many-body systems is in general a challenging problem for the simple reason that the dimension of the Hilbert space grows exponentially with the system size. In particular, merely encoding a generic quantum many-body state requires an exponential number of bits. However, condensed matter physicists are mostly interested in local Hamiltonians and especially their ground states, which are highly non-generic. Thus, we might hope that at least some physical systems allow efficient classical simulation.Starting with one-dimensional (1D) quantum systems (i.e., the simplest nontrivial case), the first basic question is: Which classes of states have efficient classical representations? It turns out that this question is quantitatively related to the amount of entanglement in the state, for states with ``little entanglement'' are well approximated by matrix product states (a data structure that can be manipulated efficiently on a classical computer). At a technical level, the mathematical notion for ``little entanglement'' is area law, which has been proved for unique ground states in 1D gapped systems. We establish an area law for constant-fold degenerate ground states in 1D gapped systems and thus explain the effectiveness of matrix-product-state methods in (e.g.) symmetry breaking phases. This result might not be intuitively trivial as degenerate ground states in gapped systems can be long-range correlated.Suppose an efficient classical representation exists. How can one find it efficiently? The density matrix renormalization group is the leading numerical method for computing ground states in 1D quantum systems. However, it is a heuristic algorithm and the possibility that it may fail in some cases cannot be completely ruled out. Recently, a provably efficient variant of the density matrix renormalization group has been developed for frustration-free 1D gapped systems. We generalize this algorithm to all (i.e., possibly frustrated) 1D gapped systems. Note that the ground-state energy of 1D gapless Hamiltonians is computationally intractable even in the presence of translational invariance.It is tempting to extend methods and tools in 1D to two and higher dimensions (2+D), e.g., matrix product states are generalized to tensor network states. Since an area law for entanglement (if formulated properly) implies efficient matrix product state representations in 1D, an interesting question is whether a similar implication holds in 2+D. Roughly speaking, we show that an area law for entanglement (in any reasonable formulation) does not always imply efficient tensor network representations of the ground states of 2+D local Hamiltonians even in the presence of translational invariance. It should be emphasized that this result does not contradict with the common sense that in practice quantum states with more entanglement usually require more space to be stored classically; rather, it demonstrates that the relationship between entanglement and efficient classical representations is still far from being well understood.Excited eigenstates participate in the dynamics of quantum systems and are particularly relevant to the phenomenon of many-body localization (absence of transport at finite temperature in strongly correlated systems). We study the entanglement of excited eigenstates in random spin chains and expect that its singularities coincide with dynamical quantum phase transitions. This expectation is confirmed in the disordered quantum Ising chain using both analytical and numerical methods.Finally, we study the problem of generating ground states (possibly with topological order) in 1D gapped systems using quantum circuits. This is an interesting problem both in theory and in practice. It not only characterizes the essential difference between the entanglement patterns that give rise to trivial and nontrivial topological order, but also quantifies the difficulty of preparing quantum states with a quantum computer (in experiments).

•Jan 1, 2015•19 citations

Dynamical Simulations of Schrödinger's Equation via Rank-Adaptive Tensor Decompositions

N. Anders Petersson, Chase Hodges-Heilmann, Stefanie Günther

We study low-rank tensor methods for the numerical solution of Schrödinger's equation with time-independent and explicitly time-dependent Hamiltonians, motivated by large-scale simulations of many-body quantum systems and quantum computing devices subject to time-dependent control pulses. We outline the recent application of the "basis update and Galerkin" (BUG) method for tensor trains, and describe the established TDVP and TDVP-2 algorithms based on the time-dependent variational principle. For comparison, we also consider the BUG method in the Tucker format. All these approaches enable memory efficient representations of partially entangled quantum states and thereby mitigate the exponential cost of conventional state-vector formulations. The rank-adaptivity relies on the truncated singular value decomposition, in which the rank of a matrix is reduced by setting its smallest singular values to zero, based on a threshold parameter that controls the truncation error. Numerical experiments on representative time-independent and time-dependent Hamiltonian models quantify the tradeoff between accuracy and compression across methods, with particular attention to the interplay between the time-step and the truncation threshold, and how the computational effort scales with the number of sub-systems in the quantum system.

quant-pharXiv:2603.13990•Mar 17, 2026•2 citations

Quantum particle in the wrong box (or: the perils of finite-dimensional approximations)

Felix Fischer, Daniel Klaus Burgarth, Davide Lonigro

When numerically simulating the unitary time evolution of an infinite-dimensional quantum system, one is usually led to treat the Hamiltonian H as an "infinite-dimensional matrix" by expressing it in some orthonormal basis of the Hilbert space, and then truncate it to some finite dimensions. However, the solutions of the Schrödinger equations generated by the truncated Hamiltonians need not converge, in general, to the solution of the Schrödinger equation corresponding to the actual Hamiltonian.In this paper we demonstrate that, under mild assumptions, they converge to the solution of the Schrödinger equation generated by a specific Hamiltonian which crucially depends on the particular choice of basis: the Friedrichs extension of the restriction of H to the space of finite linear combinations of elements of the basis. Importantly, this is generally different from H itself; in all such cases, numerical simulations will unavoidably reproduce the wrong dynamics in the limit, and yet there is no numerical test that can reveal this failure, unless one has the analytical solution to compare with.As a practical demonstration of such results, we consider the quantum particle in the box, and we show that, for a wide class of bases (which include associated Legendre polynomials as a concrete example) the dynamics generated by the truncated Hamiltonians will always converge to the one corresponding to the particle with Dirichlet boundary conditions, regardless the initial choice of boundary conditions. Other such examples are discussed.

arXiv:2412.15889•Quantum•Jan 27, 2026•7 citations

Efficient time-evolution of matrix product states using average Hamiltonians

Belal Abouraya, Jirawat Saiphet, Fedor Jelezko +1 more

Simulating quantum many-body systems (QMBS) is one of the long-standing, highly non-trivial challenges in condensed matter physics and quantum information due to the exponentially growing size of the system's Hilbert space. To date, tensor networks have been an essential tool for studying such quantum systems, owing to their ability to efficiently capture the entanglement properties of the systems they represent. One of the well-known tensor network architectures, namely matrix product states (MPS), is the standard method for simulating one-dimensional QMBS. Here, we propose a simple, yet efficient, method to augment the already available MPS algorithms to simulate the dynamics of time-dependent Hamiltonians with better accuracy and a faster convergence rate, giving a second-order convergence compared to the first-order convergence of the standard method. We apply our proposed method to simulate the dynamics of a chain of single spins associated with nitrogen-vacancy color centers in diamonds, which has potential applications for practical and scalable quantum technologies, and find that our method improves the average error for a system of few NV centers by a factor of about 1000 for moderate step sizes. Our work paves the way for efficient simulation of QMBS under the influence of time-dependent Hamiltonians.

quant-pharXiv:2602.04955•Physical Review Research•Feb 6, 2026•0 citations

Classical Algorithms for Hamiltonian Dynamics Mean Value and Guided Local Hamiltonian Problem

Yusen Wu, Yukun Zhang, Wang, Chuan +1 more

The efficient simulation of quantum dynamics and ground states is a central challenge in physics and a key frontier for quantum advantage. While short-time evolution in one-dimensional systems can often be simulated classically, extending this to higher dimensions remains difficult. Here, we introduce an efficient classical algorithm for simulating the short-time dynamics of arbitrary local quantum systems. For any local Hamiltonian $H$ and constant evolution time $t$, our method estimates expectation values of the form $\langleψ|e^{iHt}Oe^{-iHt}|ψ\rangle$ for global Pauli observables $O$ and stabilizer states $|ψ\rangle$, with high precision and exponentially small failure probability. Furthermore, we present a classical dequantization of a tailored quantum algorithm that efficiently solves the guided local Hamiltonian (GLH) problem to constant additive error - previously considered classically hard and hence a promising candidate for quantum computational advantage. These results reveal unexpected classical tractability in constant-time quantum dynamics and fundamental connections between Hamiltonian dynamics mean value and the GLH problem. Our work refines the boundary between classical and quantum computational power, identifying sharper criteria for regimes where quantum advantage may genuinely emerge.

arXiv:2409.04161•Sep 6, 2024•8 citations
We present a systematic study of quantum system compression for the evolution of generic many-body problems. The necessary numerical simulations of such systems are seriously hindered by the exponential growth of the Hilbert-space dimension with the number of particles. For a constant Hamiltonian system of Hilbert-space dimension nnn with frequencies ranging from fmin{f}_{min}fmin​ to fmax{f}_{max}fmax​, we show via a proper orthogonal decomposition that for a run time TTT the dominant dynamics are compressed in the neighborhood of a subspace whose dimension is the smallest integer larger than the time-bandwidth product \ensuremathΔ=(fmax\ensuremath−fmin)T\mathrm{\ensuremath{\Delta}}=({f}_{max}\ensuremath{-}{f}_{min})T\ensuremathΔ=(fmax​\ensuremath−fmin​)T. We also show how the distribution of initial states can further compress the system dimension. Under the stated conditions, the time-bandwidth estimate reveals the existence of an effective compressed model whose dimension is derived solely from system properties and not dependent on the particular implementation of a variational simulator, such as a machine learning system, or quantum device, or possibly even specially adapting traditional methods of solving the time-dependent Schr"odinger equation. However, finding an efficient solution procedure is\mathit{is}is dependent on the simulator implementation, which is not discussed in this paper. In addition, we show that the compression rendered by the proper orthogonal decomposition encoding method can be further strengthened via a multilayer autoencoder. Finally, we present numerical illustrations to affirm the compression behavior in time-varying Hamiltonian dynamics in the presence of external fields. The essential time-bandwidth product is also simply estimated for a wide class of physical systems, where typically localized high-frequency motion occurs at or around each of the many particles, and with low-frequency dynamics associated with globally distributed characteristic degrees of freedom. This estimate for the bandwidth has a generic character indicating the wide significance of expected quantum system dynamics compression. We also discuss the potential implications of the findings for machine learning tools to efficiently solve the many-body or other high-dimensional Schr"odinger equations.
Abstract Simulating quantum dynamics to extract time-evolving observables constitutes a central challenge in quantum computing, with both fundamental significance and broad practical applications. Classical approaches suffer from the exponential scaling of Hilbert space, while existing quantum algorithms face limitations from deep circuits and sequential error accumulation on near-term devices. This work introduces a physics-informed quantum subspace method for the efficient estimation of dynamical properties of quantum systems. The core innovation is a globally physics-informed loss function that incorporates the time-dependent Schrödinger equation as a physics-based penalty. This enforces quantum evolution constraints directly during optimization, thereby circumventing the error accumulation inherent in stepwise simulations. By strategically relaxing the normalization constraint, we obtain convexified loss functions whose optimization reduces to solving a linear system, guaranteeing global convergence and significantly mitigating the convergence issues and barren plateaus common in variational quantum algorithms. Theoretically, we prove that under suitable conditions the true dynamical solution can be approximated with high accuracy within a subspace whose dimension scales only as O ( T log ⁡ ( 1 / ε ) ) , thus breaking the curse of dimensionality in classical simulation. Numerical experiments demonstrate that the proposed method outperforms conventional Trotterization and variational quantum benchmarks in terms of computational cost, convergence speed, and robustness against measurement noise, offering a viable and efficient pathway for practical dynamical simulation on noisy intermediate-scale quantum hardware.
Classical simulation of quantum many-body systems is in general a challenging problem for the simple reason that the dimension of the Hilbert space grows exponentially with the system size. In particular, merely encoding a generic quantum many-body state requires an exponential number of bits. However, condensed matter physicists are mostly interested in local Hamiltonians and especially their ground states, which are highly non-generic. Thus, we might hope that at least some physical systems allow efficient classical simulation.Starting with one-dimensional (1D) quantum systems (i.e., the simplest nontrivial case), the first basic question is: Which classes of states have efficient classical representations? It turns out that this question is quantitatively related to the amount of entanglement in the state, for states with ``little entanglement'' are well approximated by matrix product states (a data structure that can be manipulated efficiently on a classical computer). At a technical level, the mathematical notion for ``little entanglement'' is area law, which has been proved for unique ground states in 1D gapped systems. We establish an area law for constant-fold degenerate ground states in 1D gapped systems and thus explain the effectiveness of matrix-product-state methods in (e.g.) symmetry breaking phases. This result might not be intuitively trivial as degenerate ground states in gapped systems can be long-range correlated.Suppose an efficient classical representation exists. How can one find it efficiently? The density matrix renormalization group is the leading numerical method for computing ground states in 1D quantum systems. However, it is a heuristic algorithm and the possibility that it may fail in some cases cannot be completely ruled out. Recently, a provably efficient variant of the density matrix renormalization group has been developed for frustration-free 1D gapped systems. We generalize this algorithm to all (i.e., possibly frustrated) 1D gapped systems. Note that the ground-state energy of 1D gapless Hamiltonians is computationally intractable even in the presence of translational invariance.It is tempting to extend methods and tools in 1D to two and higher dimensions (2+D), e.g., matrix product states are generalized to tensor network states. Since an area law for entanglement (if formulated properly) implies efficient matrix product state representations in 1D, an interesting question is whether a similar implication holds in 2+D. Roughly speaking, we show that an area law for entanglement (in any reasonable formulation) does not always imply efficient tensor network representations of the ground states of 2+D local Hamiltonians even in the presence of translational invariance. It should be emphasized that this result does not contradict with the common sense that in practice quantum states with more entanglement usually require more space to be stored classically; rather, it demonstrates that the relationship between entanglement and efficient classical representations is still far from being well understood.Excited eigenstates participate in the dynamics of quantum systems and are particularly relevant to the phenomenon of many-body localization (absence of transport at finite temperature in strongly correlated systems). We study the entanglement of excited eigenstates in random spin chains and expect that its singularities coincide with dynamical quantum phase transitions. This expectation is confirmed in the disordered quantum Ising chain using both analytical and numerical methods.Finally, we study the problem of generating ground states (possibly with topological order) in 1D gapped systems using quantum circuits. This is an interesting problem both in theory and in practice. It not only characterizes the essential difference between the entanglement patterns that give rise to trivial and nontrivial topological order, but also quantifies the difficulty of preparing quantum states with a quantum computer (in experiments).
We study low-rank tensor methods for the numerical solution of Schrödinger's equation with time-independent and explicitly time-dependent Hamiltonians, motivated by large-scale simulations of many-body quantum systems and quantum computing devices subject to time-dependent control pulses. We outline the recent application of the "basis update and Galerkin" (BUG) method for tensor trains, and describe the established TDVP and TDVP-2 algorithms based on the time-dependent variational principle. For comparison, we also consider the BUG method in the Tucker format. All these approaches enable memory efficient representations of partially entangled quantum states and thereby mitigate the exponential cost of conventional state-vector formulations. The rank-adaptivity relies on the truncated singular value decomposition, in which the rank of a matrix is reduced by setting its smallest singular values to zero, based on a threshold parameter that controls the truncation error. Numerical experiments on representative time-independent and time-dependent Hamiltonian models quantify the tradeoff between accuracy and compression across methods, with particular attention to the interplay between the time-step and the truncation threshold, and how the computational effort scales with the number of sub-systems in the quantum system.
When numerically simulating the unitary time evolution of an infinite-dimensional quantum system, one is usually led to treat the Hamiltonian H as an "infinite-dimensional matrix" by expressing it in some orthonormal basis of the Hilbert space, and then truncate it to some finite dimensions. However, the solutions of the Schrödinger equations generated by the truncated Hamiltonians need not converge, in general, to the solution of the Schrödinger equation corresponding to the actual Hamiltonian.In this paper we demonstrate that, under mild assumptions, they converge to the solution of the Schrödinger equation generated by a specific Hamiltonian which crucially depends on the particular choice of basis: the Friedrichs extension of the restriction of H to the space of finite linear combinations of elements of the basis. Importantly, this is generally different from H itself; in all such cases, numerical simulations will unavoidably reproduce the wrong dynamics in the limit, and yet there is no numerical test that can reveal this failure, unless one has the analytical solution to compare with.As a practical demonstration of such results, we consider the quantum particle in the box, and we show that, for a wide class of bases (which include associated Legendre polynomials as a concrete example) the dynamics generated by the truncated Hamiltonians will always converge to the one corresponding to the particle with Dirichlet boundary conditions, regardless the initial choice of boundary conditions. Other such examples are discussed.
Simulating quantum many-body systems (QMBS) is one of the long-standing, highly non-trivial challenges in condensed matter physics and quantum information due to the exponentially growing size of the system's Hilbert space. To date, tensor networks have been an essential tool for studying such quantum systems, owing to their ability to efficiently capture the entanglement properties of the systems they represent. One of the well-known tensor network architectures, namely matrix product states (MPS), is the standard method for simulating one-dimensional QMBS. Here, we propose a simple, yet efficient, method to augment the already available MPS algorithms to simulate the dynamics of time-dependent Hamiltonians with better accuracy and a faster convergence rate, giving a second-order convergence compared to the first-order convergence of the standard method. We apply our proposed method to simulate the dynamics of a chain of single spins associated with nitrogen-vacancy color centers in diamonds, which has potential applications for practical and scalable quantum technologies, and find that our method improves the average error for a system of few NV centers by a factor of about 1000 for moderate step sizes. Our work paves the way for efficient simulation of QMBS under the influence of time-dependent Hamiltonians.
The efficient simulation of quantum dynamics and ground states is a central challenge in physics and a key frontier for quantum advantage. While short-time evolution in one-dimensional systems can often be simulated classically, extending this to higher dimensions remains difficult. Here, we introduce an efficient classical algorithm for simulating the short-time dynamics of arbitrary local quantum systems. For any local Hamiltonian HHH and constant evolution time ttt, our method estimates expectation values of the form ⟨ψ∣eiHtOe−iHt∣ψ⟩\langleψ|e^{iHt}Oe^{-iHt}|ψ\rangle⟨ψ∣eiHtOe−iHt∣ψ⟩ for global Pauli observables OOO and stabilizer states ∣ψ⟩|ψ\rangle∣ψ⟩, with high precision and exponentially small failure probability. Furthermore, we present a classical dequantization of a tailored quantum algorithm that efficiently solves the guided local Hamiltonian (GLH) problem to constant additive error - previously considered classically hard and hence a promising candidate for quantum computational advantage. These results reveal unexpected classical tractability in constant-time quantum dynamics and fundamental connections between Hamiltonian dynamics mean value and the GLH problem. Our work refines the boundary between classical and quantum computational power, identifying sharper criteria for regimes where quantum advantage may genuinely emerge.