Search NASA⌕ Search

SEARCH · Search NASA

Results for “Trotterization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Trotter Errors from Dynamical Structural Instabilities of Floquet Maps in Quantum Simulation

We study the behavior of errors in the quantum simulation of spin systems with long-range multibody interactions resulting from the Trotter-Suzuki decomposition of the time-evolution operator. We identify a regime where the Floquet operator underlying the Trotter decomposition undergoes sharp changes even for small variations in the simulation step size. This results in a time evolution operator that is very different from the dynamics generated by the targeted Hamiltonian, which leads to a proliferation of errors in the quantum simulation. These regions of sharp change in the Floquet operator, referred to as structural instability regions, appear typically at intermediate Trotter step sizes and in the weakly interacting regime, and are thus complementary to recently revealed quantum chaotic regimes of the Trotterized evolution [L. M. Sieberer et al. npj Quantum Inf. 5, 78 (2019); M. Heyl, P. Hauke, and P. Zoller, Sci. Adv. 5, eaau8342 (2019)]. We characterize these structural instability regimes in p-spin models, transverse-field Ising models with all-to-all p-body interactions, and analytically predict their occurrence based on unitary perturbation theory. We further show that the effective Hamiltonian associated with the Trotter decomposition of the unitary time-evolution operator, when the Trotter step size is chosen to be in the structural instability region, is very different from the target Hamiltonian, which explains the large errors that can occur in the simulation in the regions of instability. These results have implications for the reliability of near-term gate-based quantum simulators, and reveal an important interplay between errors and the physical properties of the system being simulated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Indexed improvements for real-time trotter evolution of a (1 + 1) field theory using NISQ quantum computers

Today's quantum computers offer the possibility of performing real-time calculations for quantum field theory scattering processes motivated by high energy physics. In order to follow the successful roadmap which has been established for the calculation of static properties at Euclidean time, it is crucial to develop new algorithmic methods to deal with the limitations of current noisy intermediate-scale quantum (NISQ) devices and to establish quantitative measures of the progress made with different devices. In this paper, we report recent progress in these directions. We show that nonlinear aspects of the trotter errors allow us to take much larger step then suggested by low-order analysis. This is crucial to reach physically relevant time scales with today's NISQ technology. We propose to use an index averaging absolute values of the difference between the accurately calculated trotter evolution of site occupations and their actual measurements on NISQ machines (G index) as a measure to compare results that have been obtained from different hardware platforms. Using the transverse Ising model in one spatial dimension with four sites we apply this metric across several hardware platforms. We study the results including readout mitigation and Richardson extrapolations and show that the mitigated measurements are very effective based on the analysis of the trotter step size modifications. Furthermore, we discuss how this advance in the trotter step size procedures can improve quantum computing physics scattering results and how this technical advance can be applied to other machines and noise mitigation methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Convergence and Quantum Advantage of Trotterized MERA for Strongly-Correlated Systems

Strongly-correlated quantum many-body systems are difficult to study and simulate classically. We recently proposed a variational quantum eigensolver (VQE) based on the multiscale entanglement renormalization ansatz (MERA) with tensors constrained to certain Trotter circuits. Here, we determine the scaling of computation costs for various critical spin chains which substantiates a polynomial quantum advantage in comparison to classical MERA simulations based on exact energy gradients or variational Monte Carlo. Algorithmic phase diagrams suggest an even greater separation for higher-dimensional systems. Hence, the Trotterized MERA VQE is a promising route for the efficient investigation of strongly-correlated quantum many-body systems on quantum computers. Furthermore, we show how the convergence can be substantially improved by building up the MERA layer by layer in the initialization stage and by scanning through the phase diagram during optimization. For the Trotter circuits being composed of single-qubit and two-qubit rotations, it is experimentally advantageous to have small rotation angles. We find that the average angle amplitude can be reduced considerably with negligible effect on the energy accuracy. Benchmark simulations suggest that the structure of the Trotter circuits for the TMERA tensors is not decisive; in particular, brick-wall circuits and parallel random-pair circuits yield very similar energy accuracies.

Miao, Qiang [Duke Quantum Center, Duke University,↗
DOE OSTI2023

Suzuki type estimates for exponentiated sums and generalized Lie-Trotter formulas in JB-algebras

Lie-Trotter-Suzuki product formulas are ubiquitous in quantum mechanics, computing, and simulations. Approximating exponentiated sums with such formulas are investigated in the JB-algebraic setting. We show that the Suzuki type approximation for exponentiated sums holds in JB-algebras, we give explicit estimation formulas, and we deduce three generalizations of Lie-Trotter formulas for arbitrary number elements in such algebras. In conclusion, we also extended the Lie-Trotter formulas in a Jordan Banach algebra from three elements to an arbitrary number of elements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Exponentially Reduced Circuit Depths Using Trotter Error Mitigation

Product formulas are a popular class of digital quantum simulation algorithms due to their conceptual simplicity, low overhead, and performance, which often exceeds theoretical expectations. Recently, Richardson extrapolation and polynomial interpolation have been proposed to mitigate the Trotter error incurred by the use of these formulas. This work provides a rigorous, general analysis of these techniques for computing time-evolved observables, simplifying the interpolation algorithm in the process, and shows that extrapolation generically improves the performance of product formulas for this task. We demonstrate that, to achieve error 𝜖 in a simulation of time 𝑇 using a 𝑝 ⁢th-order product formula with extrapolation, circuit depths of 𝑂⁡(𝑇 1+1/𝑝 ⁢polylog (1/𝜖)) are sufficient—an exponential improvement in the precision over product formulas alone. Furthermore, we prove that these algorithms achieve commutator scaling, and improve the 𝑇 complexity for the interpolation algorithm. By relaxing the requirement of performing exact Chebyshev interpolation, our simplified algorithm eliminates the need for fractional implementations of Trotter steps, reducing computational overhead. Finally, we show these techniques can be combined with the classical shadows method to estimate many time-evolved local observables. Taken together, our findings provide the strongest evidence yet for the utility of Trotter error-mitigation techniques in algorithmic applications.

quantum algorithms & computation↗
DOE OSTI2024

Improved Accuracy for Trotter Simulations Using Chebyshev Interpolation

Quantum metrology allows for measuring properties of a quantum system at the optimal Heisenberg limit. However, when the relevant quantum states are prepared using digital Hamiltonian simulation, the accrued algorithmic errors will cause deviations from this fundamental limit. In this work, we show how algorithmic errors due to Trotterized time evolution can be mitigated through the use of standard polynomial interpolation techniques. Our approach is to extrapolate to zero Trotter step size, akin to zero-noise extrapolation techniques for mitigating hardware errors. We perform a rigorous error analysis of the interpolation approach for estimating eigenvalues and time-evolved expectation values, and show that the Heisenberg limit is achieved up to polylogarithmic factors in the error. Our work suggests that accuracies approaching those of state-of-the-art simulation algorithms may be achieved using Trotter and classical resources alone for a number of relevant algorithmic tasks.

Rendon, Gumaro↗
DOE OSTI2026

On the Trotter Error in Many-body Quantum Dynamics with Coulomb Potentials

Efficient simulation of many-body quantum systems is central to advances in physics, chemistry, and quantum computing, with a key question being whether the simulation cost scales polynomially with the system size. Here, in this work, we analyze many-body quantum systems with Coulomb interactions, which are fundamental to electronic and molecular systems. We prove that Trotterization for such unbounded Hamiltonians achieves a 1/4-order convergence rate, with explicit polynomial dependence on the number of particles. The result holds for all initial wavefunctions in the domain of the Hamiltonian, and the 1/4-order convergence rate is optimal, as previous work has numerically demonstrated that it can be saturated by a specific initial ground state. The main challenges arise from the many-body structure and the singular nature of the Coulomb potential. Our proof strategy differs from prior state-of-the-art Trotter analyses, addressing both difficulties in a unified framework. Our analysis treats the Coulomb potential as an unbounded operator without modification or regularization, and does not rely on spatial discretization, making it compatible with both first- and second-quantized circuit constructions.

Fang, Di [Duke Univ., Durham, NC (United States)]↗
DOE OSTI2021

Success of digital adiabatic simulation with large Trotter step

The simulation of adiabatic evolution has deep connections with adiabatic quantum computation, the quantum approximate optimization algorithm, and adiabatic state preparation. Here we address the error analysis problem in quantum simulation of adiabatic process using Trotter formulas. Here we show that with additional conditions, the circuit depth can be linear in simulation time T. The improvement comes from the observation that the fidelity error here can't be estimated by the norm distance between evolution operators. This phenomenon is termed the robustness of discretization in digital adiabatic simulation. It can be explained in three steps, from analytical and numerical evidence: (1) The fidelity error should be estimated by applying adiabatic theorem on the effective Hamiltonian instead. (2) Because of the specialty of Riemann-Lebesgue lemma, most adiabatic process is naturally robust against discretization. (3) As the Trotter step gets larger, the spectral gap of effective Hamiltonian tends to close, which results in the failure of digital adiabatic simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Shearing approach to gauge-invariant Trotterization

Universal quantum simulations of gauge field theories are exposed to the risk of gauge symmetry violations when it is not known how to compile the desired operations exactly using the available gate set. In this article, we show how time evolution can be compiled in an Abelian gauge theory—if only approximately—without compromising gauge invariance, by graphically motivating a block-diagonalization procedure. When gauge-invariant interactions are associated with a “spatial network” in the space of discrete quantum numbers, it is seen that cyclically shearing the spatial network converts simultaneous updates to many quantum numbers into conditional updates of a single quantum number; ultimately, this eliminates any need to pass through (and acquire overlap onto) unphysical intermediate configurations. Shearing is explicitly applied to gauge-matter and magnetic interactions of lattice quantum electrodynamics. The features that make shearing successful at preserving Abelian gauge symmetry may also be found in non-Abelian theories, bringing one closer to gauge-invariant simulations of quantum chromodynamics.

Gauge theories↗
DOE OSTI2026

Quantum utility in simulating the real-time dynamics of the Fermi–Hubbard model using superconducting quantum computers

The Fermi–Hubbard model is a fundamental model in condensed matter physics that describes strongly correlated electrons. On the other hand, quantum computers are emerging as powerful tools for exploring the complex dynamics of these quantum many-body systems. In this work, we demonstrate the quantum simulation of the one-dimensional Fermi–Hubbard model using IBM's superconducting quantum computers, employing over 100 qubits. We introduce a first-order Trotterization scheme and extend it to an optimized second-order Trotterization for the time evolution in the Fermi–Hubbard model, specifically tailored for the limited qubit connectivity of quantum architectures, such as IBM's platforms. Notably, both Trotterization approaches are scalable and maintain a constant circuit depth at each Trotter step, regardless of the qubit count, enabling us to precisely investigate the relaxation dynamics in the Fermi–Hubbard model by measuring the expectation value of the Néel observable (staggered magnetization) for time-evolved quantum states. Lastly, our successful measurement of expectation values in such large-scale quantum many-body systems, especially at longer time scales with larger entanglement, highlights the quantum utility of superconducting quantum platforms over conventional classical approximation methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Implicit-explicit Runge-Kutta for radiation hydrodynamics I: Gray diffusion

Radiation hydrodynamics are a challenging multiscale and multiphysics set of equations. To capture the relevant physics of interest, one typically must time step on the hydrodynamics timescale, making explicit integration the obvious choice. On the other hand, the coupled radiation equations have a scaling such that implicit integration is effectively necessary in non-relativistic regimes. A first-order Lie-Trotter-like operator split is the most common time integration scheme used in practice, alternating between an explicit hydrodynamics step and an implicit radiation solve and energy deposition step. However, such a scheme is limited to first-order accuracy, and nonlinear coupling between the radiation and hydrodynamics equations makes a more general additive partitioning of the equations non-trivial. Here, we develop a new formulation and partitioning of radiation hydrodynamics with gray diffusion that allows us to apply (linearly) implicit-explicit Runge-Kutta time integration schemes. In conclusion, we prove conservation of total energy in the new framework, and demonstrate 2nd-order convergence in time on multiple radiative shock problems, achieving error 3–5 orders of magnitude smaller than the first-order Lie-Trotter operator split at the hydrodynamic CFL, even when Lie-Trotter applies a 3rd-order TVD Runge-Kutta scheme to the hydrodynamics equations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Quantum dynamics simulation of the advection-diffusion equation

The advection-diffusion equation is simulated via several quantum algorithms. Three formulations are considered: (1) Trotterization, (2) variational quantum time evolution (VarQTE), and (3) adaptive variational quantum dynamics simulation (AVQDS). These schemes were originally developed for the Hamiltonian simulation of many-body quantum systems. The finite-difference discretized operator of the transport equation is formulated as a Hamiltonian and solved without the need for ancillary qubits. Computations are conducted on a quantum simulator (IBM Qiskit Aer) and a superconducting quantum hardware (IBM Fez). The former emulates the latter without the noise. The actual hardware implementation experiences significant noise. The results of the quantum simulator are compared with data from direct numerical simulation (DNS) with infidelities of the order 10 −5 . In the quantum simulator, Trotterization is observed to have the lowest infidelity and is suitable for fault-tolerant computation. The AVQDS algorithm requires the lowest gate count and circuit depth. The VarQTE algorithm is the next best in terms of gate counts, but the number of its optimization variables is directly proportional to the number of qubits. Due to current hardware limitations, Trotterization cannot be implemented, as it has an overwhelmingly large number of operations. Meanwhile, AVQDS and VarQTE can be executed at the hardware level. These algorithms present a new paradigm for computational transport phenomena on quantum computers.

Alipanah, Hirad [Univ. of Pittsburgh, PA (United S↗
DOE OSTI2024

Enhancing quantum utility: Simulating large-scale quantum spin chains on superconducting quantum computers

We present the quantum simulation of the frustrated quantum spin- 1 2 antiferromagnetic Heisenberg spin chain with competing nearest-neighbor ( J 1 ) and next-nearest-neighbor ( J 2 ) exchange interactions in the real superconducting quantum computer with qubits ranging up to 100. In particular, we implement the Hamiltonian with the next-nearest neighbor exchange interaction in conjunction with the nearest-neighbor interaction on IBM's superconducting quantum computer and carry out the time evolution of the spin chain by employing the first-order Trotterization. Furthermore, our implementation of the second-order Trotterization for the isotropic Heisenberg spin chain, involving only nearest-neighbor exchange interaction, enables precise measurement of the expectation values of staggered magnetization observable across a range of up to 100 qubits. Notably, in both cases, our approach results in a constant circuit depth in each Trotter step, independent of the number of qubits. Our demonstration of the accurate measurement of expectation values for the large-scale quantum system using superconducting quantum computers designates the quantum utility of these devices for investigating various properties of many-body quantum systems. This will be a stepping stone to achieving the quantum advantage over classical ones in simulating quantum systems before the fault tolerance quantum era. Published by the American Physical Society 2024

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Exponential Improvements in the Simulation of Lattice Gauge Theories Using Near-Optimal Techniques

We report a first-of-its-kind analysis on post-Trotter simulation of U(1), SU(2), and SU(3) lattice gauge theories including fermions in arbitrary spatial dimension. We provide explicit circuit constructions as well as T-gate counts and logical qubit counts for Hamiltonian simulation. We find a reduction of up to 25 orders of magnitude in space-time volume over Trotter methods for simulations of non-Abelian lattice gauge theories relevant to the standard model. This improvement results from our algorithm having polynomial scaling with the number of colors in the gauge theory, achieved by utilizing oracle constructions relying on the sparsity of physical operators, in contrast to the exponential scaling seen in state-of-the-art Trotter methods, which employ explicit mappings onto Pauli operators. Our work demonstrates that the use of advanced algorithmic techniques leads to dramatic reductions in the cost of simulating fundamental interactions, bringing it in step with resources required for first-principles quantum simulation of chemistry.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Stout Smearing on a Quantum Computer

Smearing of gauge-field configurations in lattice field theory improves the results of lattice simulations by suppressing high energy modes from correlation functions. In quantum simulations, high kinetic energy eigenstates are introduced when the time evolution operator is approximated such as Trotterization. While improved Trotter product formulae exist to reduce the errors, they have diminishing accuracy returns with respect to resource costs. Therefore having an algorithm that has fewer resources than an improved Trotter formula is desirable. In this work I develop a representation agnostic method for quantum smearing and show that it reduces the coupling to high energy modes in the discrete nonabelian gauge theory $D_4$

Gustafson, Erik J.↗
DOE OSTI2022

Spectral analysis of product formulas for quantum simulation

We consider the time-independent Hamiltonian simulation using the first order Lie–Trotter–Suzuki product formula under the assumption that the initial state is supported on a low-dimension subspace. By comparing the spectral decomposition of the original Hamiltonian and the effective Hamiltonian, we obtain better upper bounds for various conditions. Especially, we show that the Trotter step size needed to estimate an energy eigenvalue within precision ϵ using quantum phase estimation can be improved in scaling from ϵ to ϵ 1/2 for a large class of systems. Our results also depend on the gap condition of the simulated Hamiltonian.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗