Search NASASearch

SEARCH · Search NASA

Results for “Trajectory-Based Operations”

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.

Polariton spectra under the collective coupling regime. I. Efficient simulation of linear spectra and quantum dynamics

We outline two general theoretical techniques to simulate polariton quantum dynamics and optical spectra under the collective coupling regimes described by a Holstein–Tavis–Cummings (HTC) model Hamiltonian. The first one takes advantage of sparsity of the HTC Hamiltonian, which allows one to reduce the cost of acting polariton Hamiltonian onto a state vector to the linear order of the number of states, instead of the quadratic order. The second one is applying the well-known Chebyshev series expansion approach for quantum dynamics propagation and to simulate the polariton dynamics in the HTC system; this approach allows us to use a much larger time step for propagation and only requires a few recursive operations of the polariton Hamiltonian acting on state vectors. These two theoretical approaches are general and can be applied to any trajectory-based non-adiabatic quantum dynamics methods. We apply these two techniques with our previously developed Lindblad-partially linearized density matrix approach to simulate the linear absorption spectra of the HTC model system, with both inhomogeneous site energy disorders and dipolar orientational disorders. Our numerical results agree well with the previous analytic and numerical work.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH

Dissipative ground state preparation in ab initio electronic structure theory

Dissipative engineering is a powerful tool for quantum state preparation, and has drawn significant attention in quantum algorithms and quantum many-body physics in recent years. In this work, we introduce a novel approach using the Lindblad dynamics to efficiently prepare the ground state for general ab initio electronic structure problems on quantum computers, without variational parameters. These problems often involve Hamiltonians that lack geometric locality or sparsity structures, which we address by proposing two generic types of jump operators for the Lindblad dynamics. Type-I jump operators break the particle number symmetry and should be simulated in the Fock space. Type-II jump operators preserves the particle number symmetry and can be simulated more efficiently in the full configuration interaction space. For both types of jump operators, we prove that in a simplified Hartree-Fock framework, the spectral gap of our Lindbladian is lower bounded by a universal constant. For physical observables such as energy and reduced density matrices, the convergence rate of our Lindblad dynamics with Type-I jump operators remains universal, while the convergence rate with Type-II jump operators only depends on coarse grained information such as the number of orbitals and the number of electrons. To validate our approach, we employ a Monte Carlo trajectory-based algorithm for simulating the Lindblad dynamics for full ab initio Hamiltonians, demonstrating its effectiveness on molecular systems amenable to exact wavefunction treatment.

Quantum chemistry

Parallel-in-Time Solution of Allen-Cahn Equations by Integrating Operator Learning into the Parareal Method

While recent advances in deep learning have shown promising efficiency gains in solving time-dependent partial differential equations (PDEs), matching the accuracy of conventional numerical solvers still remains a challenge. One strategy to improve the accuracy of deep learning-based solutions for time-dependent PDEs is to use the learned model as the coarse propagator in the Parareal method and a traditional numerical method as the fine solver. However, successful integration of deep learning into the Parareal method requires consistency between the coarse and fine solvers, particularly for PDEs exhibiting rapid changes such as sharp transitions. Here, to ensure this consistency, we propose using convolutional neural networks (CNNs) to learn the fully discrete time-stepping operator defined by the same numerical scheme employed as the fine solver. We demonstrate the effectiveness of the proposed method in solving the classical and mass-conservative Allen–Cahn (AC) equations. Through iterative updates in the Parareal algorithm, our approach achieves a significant computational speedup compared to traditional fine solvers while converging to high-accuracy solutions. Our results highlight that the proposed hybrid Parareal algorithm effectively accelerates simulations, particularly when implemented on multiple GPUs, and converges to the desired accuracy in only a few iterations. Another advantage of our method is that the CNN model is trained on trajectory-based data generated from random initial conditions, such that the trained model can be used to solve the AC equations with various initial conditions without retraining. This work demonstrates the potential of integrating neural network methods into parallel-in-time frameworks for efficient and accurate simulations of time-dependent PDEs.

97 MATHEMATICS AND COMPUTING