We propose a new method to calculate expectation values of a delta function of the Hamiltonian, < Ψ\mid δ(\hat{H} - E)\mid Ψ>. Since the delta function can be replaced with a Gaussian function, we evaluate < Ψ\mid \sqrt{\fracβπ} e^{-β(\hat{H} - E)^2} \mid Ψ> with large βadopting the Suzuki-Trotter decomposition. Errors of the approximate calculations with the finite Trotter number N_t are estimated to be O(1/N_t^K) for the Kth-order decomposition. The distinct advantage of this method is that the convergence is guaranteed even when the state \mid Ψ> contains the eigenstates whose energies spread over the wide range. In this paper we give a full description of our method within the quantum mechanical physics and present the numerical results for the harmonic oscillator problems in one- and three-dimensional space.
We propose a new method to calculate expectation values of a delta function of the Hamiltonian, < Ψ\mid δ(\hat{H} - E)\mid Ψ>. Since the delta function can be replaced with a Gaussian function, we evaluate < Ψ\mid \sqrt{\fracβπ} e^{-β(\hat{H} - E)^2} \mid Ψ> with large βadopting the Suzuki-Trotter decomposition. Errors of the approximate calculations with the finite Trotter number N_t are estimated to be O(1/N_t^K) for the Kth-order decomposition. The distinct advantage of this method is that the convergence is guaranteed even when the state \mid Ψ> contains the eigenstates whose energies spread over the wide range. In this paper we give a full description of our method within the quantum mechanical physics and present the numerical results for the harmonic oscillator problems in one- and three-dimensional space.
Accurately simulating long-time dynamics of many-body systems is a challenge in both classical and quantum computing due to the accumulation of Trotter errors. While low-order Trotter-Suzuki decompositions are straightforward to implement, their rapidly growing error limits access to long-time observables. We present a framework for constructing efficient high-order Trotter-Suzuki schemes by identifying their structure and directly optimizing their parameters over a high-dimensional space. This method enables the discovery of new schemes with significantly improved efficiency compared to traditional constructions, such as those by Suzuki and Yoshida. Based on the theoretical efficiency and practical performance, we recommend two novel highly efficient schemes at 4th and 6th order. We also demonstrate the effectiveness of these decompositions on the Heisenberg model and the quantum harmonic oscillator, and find that for a fixed final time they perform better across the computational cost. Even when using large time steps, they surpass established low-order schemes like the Leapfrog. Finally, we investigate the in-practice performance of different Trotter schemes and find the decompositions with more uniform coefficients tend to feature improved error accumulation over long times. We have included this observation into our choice of recommended schemes.
We solve the solution of the Time-Dependent Schrodinger Equation (TDSE) using the higher-order Trotter-Suzuki Decomposition. We use The Gaussian function as a stationary state in a linear potential system. The TDSE solution using Baker - Campbell - Hausdorff was used to validate the results and to measure the accuracy of the Trotter - Suzuki decomposition. So that the difference between the Baker - Campbell - Hausdorff result and the Suzuki - Trotter decomposition is considered an error. The error of the TDSE solution by the Trotter - Suzuki second-order decomposition was lower than the first order. Meanwhile, the error of the TDSE solution by second-order hybrid will be lower than the second-order Trotter - Suzuki decomposition when the value of dx=0.1 and 0.05 with dt < 0.0001. The error comparison of these three methods is only valid when time t<1.
Trotterization is the most common and convenient approximation method for Hamiltonian simulations on digital quantum computers, but estimating its error accurately is computationally difficult for large quantum systems. Here, we develop a method for measuring the Trotter error without ancillary qubits on quantum circuits by combining the m th - and n th -order ( m < n ) Trotterizations rather than consulting with mathematical error bounds. Using this method, we make Trotterization precision guaranteed, developing an algorithm named Trotter ( m , n ) , in which the Trotter error at each time step is within an error tolerance ε preset for our purpose. Trotter ( m , n ) is applicable to both time-independent and -dependent Hamiltonians, and it adaptively chooses almost the largest step size δ t , which keeps quantum circuits shallowest, within the error tolerance. Benchmarking it in a quantum spin chain, we find the adaptively chosen δ t to be about 10 times larger than that inferred from known upper bounds of Trotter errors. Published by the American Physical Society 2024
Trotter–Suzuki decompositions are frequently used in the quantum simulation of quantum chemistry. They transform the evolution operator into a form implementable on a quantum device, while incurring an error—the Trotter error. The Trotter error can be made arbitrarily small by increasing the Trotter number. However, this increases the length of the quantum circuits required, which may be impractical. It is therefore desirable to find methods of reducing the Trotter error through alternate means. The Trotter error is dependent on the order in which individual term unitaries are applied. Due to the factorial growth in the number of possible orderings with respect to the number of terms, finding an optimal strategy for ordering Trotter sequences is difficult. In this paper, we propose three ordering strategies, and assess their impact on the Trotter error incurred. Initially, we exhaustively examine the possible orderings for molecular hydrogen in a STO-3G basis. We demonstrate how the optimal ordering scheme depends on the compatibility graph of the Hamiltonian, and show how it varies with increasing bond length. We then use 44 molecular Hamiltonians to evaluate two strategies based on coloring their incompatibility graphs, while considering the properties of the obtained colorings. We find that the Trotter error for most systems involving heavy atoms, using a reference magnitude ordering, is less than 1 kcal/mol. Relative to this, the difference between ordering schemes can be substantial, being approximately on the order of millihartrees. The coloring-based ordering schemes are reasonably promising—particularly for systems involving heavy atoms—however further work is required to increase dependence on the magnitude of terms. Finally, we consider ordering strategies based on the norm of the Trotter error operator, including an iterative method for generating the new error operator terms added upon insertion of a term into an ordered Hamiltonian.
(Suzuki-)Trotter decompositions, splitting methods, (Lie) product formulae... The most common numerical methods for the time evolution of quantum systems come with many names. And they are used practically everywhere with applications ranging from the solution of classical equations of motion and various Monte Carlo simulations to the real and imaginary time evolution on classical as well as quantum computers. Here we review the state of the art of said methods, focussing especially on the progress made over the last few years. We highlight recently discovered efficient time evolution algorithms and explain how best to use them in practice. A central part of this work is the estimation of error bounds that has improved greatly within the past decade. The relevance of time evolution methods for quantum computing is discussed with a focus on noisy hardware. Finally, a comprehensive overview of generalisations, related methods and alternatives to Trotterization is provided. This includes time-dependent Hamiltonian dynamics, processed methods, multi-product formulae, symplectic integrators, TDVP for tensor networks, quantum signal processing, Crouch-Grossman methods and more. The overall perspective in this work is that of a theoretical physicist. All mathematical proofs as well as some technical details are omitted for easier readability. Instead, this review serves as a hands-on guide and, of course, as a starting point for references that provide further details.
Abstract The potential of employing higher orders of the Trotter-Suzuki decomposition of the evolution operator for more effective simulations of quantum systems on a noisy quantum computer is explored. By examining the transverse-field Ising model and the XY model, it is demonstrated that when the gate error is decreased by approximately an order of magnitude relative to typical modern values, higher-order Trotterization becomes advantageous. This form of Trotterization yields a global minimum of the overall simulation error, comprising both the mathematical error of Trotterization and the physical error arising from gate execution.