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:0911.5145 · Physical Review E

Properties of quantum systems via diagonalization of transition amplitudes. I. Discretization effects

Ivana Vidanović, Aleksandar Bogojević, Aleksandar Belić

Published Dec 18, 2009• 10 citations
arXivHTMLPDF

Abstract

We analyze the method for calculation of properties of nonrelativistic quantum systems based on exact diagonalization of space-discretized short-time evolution operators. In this paper we present a detailed analysis of the errors associated with space discretization. Approaches using direct diagonalization of real-space discretized Hamiltonians lead to polynomial errors in discretization spacing Delta . Here we show that the method based on the diagonalization of the short-time evolution operators leads to substantially smaller discretization errors, vanishing exponentially with 1/Delta(2). As a result, the presented calculation scheme is particularly well suited for numerical studies of few-body quantum systems. The analytically derived discretization errors estimates are numerically shown to hold for several models. In the follow up paper [I. Vidanović, A. Bogojević, A. Balaz, and A. Belić, Phys. Rev. E 80, 066706 (2009)] we present and analyze substantial improvements that result from the merger of this approach with the recently introduced effective-action scheme for high-precision calculation of short-time propagation.

DOI
10.1103/physreve.80.066705

Related papers

Fast converging path integrals for time-dependent potentials: I. Recursive calculation of short-time expansion of the propagator

Antun Balaž, Ivana Vidanović, Aleksandar Bogojević +2 more

In this and the subsequent paper (Balaž et al 2011 J. Stat. Mech. P03005) we develop a recursive approach for calculating the short-time expansion of the propagator for a general quantum system in a time-dependent potential to orders that have not been accessible before. To this end the propagator is expressed in terms of a discretized effective potential, for which we derive and analytically solve a set of efficient recursion relations. Such a discretized effective potential can be used to substantially speed up numerical Monte Carlo simulations for path integrals, or to set up various analytic approximation techniques to study properties of quantum systems in time-dependent potentials. The analytically derived results are numerically verified by treating several simple models.

arXiv:0912.2743•Journal of Statistical Mechanics Theory and Experiment•Mar 4, 2011•12 citations

Fast converging path integrals for time-dependent potentials: II. Generalization to many-body systems and real-time formalism

Antun Balaž, Ivana Vidanović, Aleksandar Bogojević +2 more

Based on a previously developed recursive approach for calculating the short-time expansion of the propagator for systems with time-independent potentials and its time-dependent generalization for simple single-particle systems, in this paper we present a full extension of this formalism to a general quantum system with many degrees of freedom in a time-dependent potential. Furthermore, we also present a recursive approach for the velocity-independent part of the effective potential, which is necessary for calculating diagonal amplitudes and partition functions, as well as an extension from the imaginary-time formalism to the real-time one, which enables to study the dynamical properties of quantum systems. The recursive approach developed here allows an analytic derivation of the short-time expansion to orders that have not been accessible before, using the implemented SPEEDUP symbolic calculation code. The analytically derived results are extensively numerically verified by treating several models in both imaginary and real time.

arXiv:1011.5185•Journal of Statistical Mechanics Theory and Experiment•Mar 4, 2011•11 citations

Quantum simulation of real-space dynamics

Andrew M. Childs, Jiaqi Leng, Tongyang Li +2 more

Quantum simulation is a prominent application of quantum computers. While there is extensive previous work on simulating finite-dimensional systems, less is known about quantum algorithms for real-space dynamics. We conduct a systematic study of such algorithms. In particular, we show that the dynamics of a d -dimensional Schrödinger equation with η particles can be simulated with gate complexity O~(ηdFpoly(log⁡(g′/ϵ))) , where ϵ is the discretization error, g′ controls the higher-order derivatives of the wave function, and F measures the time-integrated strength of the potential. Compared to the best previous results, this exponentially improves the dependence on ϵ and g′ from poly(g′/ϵ) to poly(log⁡(g′/ϵ)) and polynomially improves the dependence on T and d , while maintaining best known performance with respect to η . For the case of Coulomb interactions, we give an algorithm using η3(d+η)Tpoly(log⁡(ηdTg′/(Δϵ)))/Δ one- and two-qubit gates, and another using η3(4d)d/2Tpoly(log⁡(ηdTg′/(Δϵ)))/Δ one- and two-qubit gates and QRAM operations, where T is the evolution time and the parameter Δ regulates the unbounded Coulomb interaction. We give applications to several computational problems, including faster real-space simulation of quantum chemistry, rigorous analysis of discretization error for simulation of a uniform electron gas, and a quadratic improvement to a quantum algorithm for escaping saddle points in nonconvex optimization.

arXiv:2203.17006•Quantum•Nov 17, 2022•55 citations

Exact Diagonalization Techniques for Quantum Spin Systems

Jürgen Schnack

The essence of quantum magnetism lies in correlated many-body states. They determine the physical properties beyond paramagnetism. Even constructions as simple as singlets or triplets cannot be understood without the mathematical concept of superpositions. This is even more evident if time evolution of quantum states and phenomena such as quantum coherenceQuantum coherence are considered. The major approach to assess correlated many-body states in quantum magnetism of molecules is exact diagonalizationDiagonalization of the many-body Hamiltonian describing the physical system. Symmetries are of great help when tackling the numerical task of matrix diagonalization since they allow to decompose a problem of large Hilbert spaceHilbert space dimension into a number of smaller problems. This approach will be presented first. It rests on the identification of the available symmetries—e.g., U(1), SU(2), as well as point groupsPoint group—and their application. However, the applicability of exact diagonalizationDiagonalization is limited by the exponential growth of the Hilbert spaceHilbert space of the spin system with the number of spins: $$\dim \left( {\mathcal{H}} \right) = \mathop \prod \nolimits_{i} \left( {2 s_{i} + 1} \right)$$ . Nowadays, complex Hermitian matricesHermitian matrices of a linear dimension of about 100,000 can be completely diagonalized on supercomputers which limits the number of spins depending on their size $$s_{i}$$ to just a few. I will therefore present a very accurate approximation to exact diagonalization that rests on Lanczos procedures and the concept of typicality. The most popular version, the finite-temperature Lanczos methodFinite-Temperature Lanczos Method (FTLM), allows to evaluate low-energy spectroscopic data, thermal averages as well as time evolutions for systems with Hilbert space dimensions of up to about 1011. Hands-on experience and examples will be provided.

Challenges and advances in computational chemistry and physics•Jan 1, 2023•3 citations

Recursive Schrödinger equation approach to faster converging path integrals

Antun Balaž, Aleksandar Bogojević, Ivana Vidanović +1 more

By recursively solving the underlying Schrödinger equation, we set up an efficient systematic approach for deriving analytic expressions for discretized effective actions. With this, we obtain discrete short-time propagators for both one and many particles in arbitrary dimension to orders that have not been accessible before. They can be used to substantially speed up numerical Monte Carlo calculations of path integrals, as well as for setting up an alternative analytical approximation scheme for energy spectra, density of states, and other statistical properties of quantum systems.

arXiv:0806.4774•Physical Review E•Mar 9, 2009•23 citations

SPEEDUP Code for Calculation of Transition Amplitudes via the Effective Action Approach

Antun Balaž, Ivana Vasić, Danica Stojiljković +3 more

We present Path Integral Monte Carlo C code for calculation of quantum mechanical transition amplitudes for 1D models. The SPEEDUP C code is based on the use of higher-order short-time effective actions and implemented to the maximal order $p$=18 in the time of propagation (Monte Carlo time step), which substantially improves the convergence of discretized amplitudes to their exact continuum values. Symbolic derivation of higher-order effective actions is implemented in SPEEDUP Mathematica codes, using the recursive Schrödinger equation approach. In addition to the general 1D quantum theory, developed Mathematica codes are capable of calculating effective actions for specific models, for general 2D and 3D potentials, as well as for a general many-body theory in arbitrary number of spatial dimensions.

arXiv:1105.0542•Communications in Computational Physics•May 22, 2012•6 citations
We analyze the method for calculation of properties of nonrelativistic quantum systems based on exact diagonalization of space-discretized short-time evolution operators. In this paper we present a detailed analysis of the errors associated with space discretization. Approaches using direct diagonalization of real-space discretized Hamiltonians lead to polynomial errors in discretization spacing Delta . Here we show that the method based on the diagonalization of the short-time evolution operators leads to substantially smaller discretization errors, vanishing exponentially with 1/Delta(2). As a result, the presented calculation scheme is particularly well suited for numerical studies of few-body quantum systems. The analytically derived discretization errors estimates are numerically shown to hold for several models. In the follow up paper [I. Vidanović, A. Bogojević, A. Balaz, and A. Belić, Phys. Rev. E 80, 066706 (2009)] we present and analyze substantial improvements that result from the merger of this approach with the recently introduced effective-action scheme for high-precision calculation of short-time propagation.
In this and the subsequent paper (Balaž et al 2011 J. Stat. Mech. P03005) we develop a recursive approach for calculating the short-time expansion of the propagator for a general quantum system in a time-dependent potential to orders that have not been accessible before. To this end the propagator is expressed in terms of a discretized effective potential, for which we derive and analytically solve a set of efficient recursion relations. Such a discretized effective potential can be used to substantially speed up numerical Monte Carlo simulations for path integrals, or to set up various analytic approximation techniques to study properties of quantum systems in time-dependent potentials. The analytically derived results are numerically verified by treating several simple models.
Based on a previously developed recursive approach for calculating the short-time expansion of the propagator for systems with time-independent potentials and its time-dependent generalization for simple single-particle systems, in this paper we present a full extension of this formalism to a general quantum system with many degrees of freedom in a time-dependent potential. Furthermore, we also present a recursive approach for the velocity-independent part of the effective potential, which is necessary for calculating diagonal amplitudes and partition functions, as well as an extension from the imaginary-time formalism to the real-time one, which enables to study the dynamical properties of quantum systems. The recursive approach developed here allows an analytic derivation of the short-time expansion to orders that have not been accessible before, using the implemented SPEEDUP symbolic calculation code. The analytically derived results are extensively numerically verified by treating several models in both imaginary and real time.
Quantum simulation is a prominent application of quantum computers. While there is extensive previous work on simulating finite-dimensional systems, less is known about quantum algorithms for real-space dynamics. We conduct a systematic study of such algorithms. In particular, we show that the dynamics of a d -dimensional Schrödinger equation with η particles can be simulated with gate complexity O~(ηdFpoly(log⁡(g′/ϵ))) , where ϵ is the discretization error, g′ controls the higher-order derivatives of the wave function, and F measures the time-integrated strength of the potential. Compared to the best previous results, this exponentially improves the dependence on ϵ and g′ from poly(g′/ϵ) to poly(log⁡(g′/ϵ)) and polynomially improves the dependence on T and d , while maintaining best known performance with respect to η . For the case of Coulomb interactions, we give an algorithm using η3(d+η)Tpoly(log⁡(ηdTg′/(Δϵ)))/Δ one- and two-qubit gates, and another using η3(4d)d/2Tpoly(log⁡(ηdTg′/(Δϵ)))/Δ one- and two-qubit gates and QRAM operations, where T is the evolution time and the parameter Δ regulates the unbounded Coulomb interaction. We give applications to several computational problems, including faster real-space simulation of quantum chemistry, rigorous analysis of discretization error for simulation of a uniform electron gas, and a quadratic improvement to a quantum algorithm for escaping saddle points in nonconvex optimization.
The essence of quantum magnetism lies in correlated many-body states. They determine the physical properties beyond paramagnetism. Even constructions as simple as singlets or triplets cannot be understood without the mathematical concept of superpositions. This is even more evident if time evolution of quantum states and phenomena such as quantum coherenceQuantum coherence are considered. The major approach to assess correlated many-body states in quantum magnetism of molecules is exact diagonalizationDiagonalization of the many-body Hamiltonian describing the physical system. Symmetries are of great help when tackling the numerical task of matrix diagonalization since they allow to decompose a problem of large Hilbert spaceHilbert space dimension into a number of smaller problems. This approach will be presented first. It rests on the identification of the available symmetries—e.g., U(1), SU(2), as well as point groupsPoint group—and their application. However, the applicability of exact diagonalizationDiagonalization is limited by the exponential growth of the Hilbert spaceHilbert space of the spin system with the number of spins: $$\dim \left( {\mathcal{H}} \right) = \mathop \prod \nolimits_{i} \left( {2 s_{i} + 1} \right)$$ . Nowadays, complex Hermitian matricesHermitian matrices of a linear dimension of about 100,000 can be completely diagonalized on supercomputers which limits the number of spins depending on their size sis_{i}si​ to just a few. I will therefore present a very accurate approximation to exact diagonalization that rests on Lanczos procedures and the concept of typicality. The most popular version, the finite-temperature Lanczos methodFinite-Temperature Lanczos Method (FTLM), allows to evaluate low-energy spectroscopic data, thermal averages as well as time evolutions for systems with Hilbert space dimensions of up to about 1011. Hands-on experience and examples will be provided.
By recursively solving the underlying Schrödinger equation, we set up an efficient systematic approach for deriving analytic expressions for discretized effective actions. With this, we obtain discrete short-time propagators for both one and many particles in arbitrary dimension to orders that have not been accessible before. They can be used to substantially speed up numerical Monte Carlo calculations of path integrals, as well as for setting up an alternative analytical approximation scheme for energy spectra, density of states, and other statistical properties of quantum systems.
We present Path Integral Monte Carlo C code for calculation of quantum mechanical transition amplitudes for 1D models. The SPEEDUP C code is based on the use of higher-order short-time effective actions and implemented to the maximal order ppp=18 in the time of propagation (Monte Carlo time step), which substantially improves the convergence of discretized amplitudes to their exact continuum values. Symbolic derivation of higher-order effective actions is implemented in SPEEDUP Mathematica codes, using the recursive Schrödinger equation approach. In addition to the general 1D quantum theory, developed Mathematica codes are capable of calculating effective actions for specific models, for general 2D and 3D potentials, as well as for a general many-body theory in arbitrary number of spatial dimensions.