Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Hamiltonian”

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 685 records · Page 38
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Theory of ab initio downfolding with arbitrary-range electron-phonon coupling

Ab initio downfolding describes the electronic structure of materials within a low-energy subspace, often around the Fermi level. Typically starting from mean-field calculations, this framework allows for the calculation of one- and two-electron interactions, and the parametrization of a many-body Hamiltonian representing the active space of interest. The subsequent solution of such Hamiltonians can provide insights into the physics of strongly correlated materials. While phonons can substantially screen electron-electron interactions, electron-phonon coupling has been commonly ignored within ab initio downfolding, and when considered, this is done only for short-range coupling. Here we propose a theory of ab initio downfolding that accounts for short- and long-range electron-phonon coupling on equal footing. Our practical computational implementation is readily compatible with current downfolding approaches. We apply our approach to polar materials MgO and GeTe, and we reveal the importance of both short-range and long-range electron-phonon coupling in determining the magnitude of electron-electron interactions. Our results show that in the static limit, phonons reduce the on-site repulsion between electrons by 40% for MgO and by 79% for GeTe. Our framework also predicts that overall attractive nearest-neighbor interactions arise between electrons in GeTe, consistent with superconductivity in this material.

Tubman, Norm M↗
DOE OSTI2025

Emulators for Scarce and Noisy Data: Application to Auxiliary-Field Diffusion Monte Carlo for Neutron Matter

Understanding the equation of state (EOS) of pure neutron matter is necessary for interpreting multimessenger observations of neutron stars. Reliable data analyses of these observations require well-quantified uncertainties for the EOS input, ideally propagating uncertainties from nuclear interactions directly to the EOS. This, however, requires calculations of the EOS for a prohibitively larger number of nuclear Hamiltonians, solving the nuclear many-body problem for each one. Quantum Monte Carlo methods, such as auxiliary-field diffusion Monte Carlo (AFDMC), provide precise and accurate results for the neutron matter EOS, but they are very computationally expensive, making them unsuitable for the fast evaluations necessary for uncertainty propagation. Here, we employ parametric matrix models to develop fast emulators for AFDMC calculations of neutron matter and use them to directly propagate uncertainties of coupling constants in the Hamiltonian to the EOS. As these uncertainties include estimates of the effective field theory truncation uncertainty, this approach provides robust uncertainty estimates for use in astrophysical data analyses. In conclusion, this Letter will enable novel applications such as using astrophysical observations to put constraints on coupling constants for nuclear interactions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Symplectic machine learning model for fast simulation of space-charge effects

Symplectic simulation of space-charge effects is crucial for the design and operation of high-intensity particle accelerators. Traditional methods for simulating these effects are often computationally expensive, resulting in significant overhead. In this work, we introduce a generative model based on a U-Net architecture within a generative adversarial network framework to efficiently simulate space-charge effects. The model is trained to predict the transverse multiparticle space-charge Hamiltonian, which can be physically computed using a gridless spectral method. The one-step symplectic transverse transfer map for the particles is then obtained by differentiating the predicted Hamiltonian. Benchmarking results demonstrate that this generative model achieves an order of magnitude higher computational efficiency compared to the spectral method, providing a highly efficient alternative for simulating space-charge effects with a large number of particles. By maintaining symplecticity, the model effectively preserves the phase-space structure and mitigates nonphysical errors in long-term simulations. This model has been integrated into jutrack, a novel autodifferentiable accelerator modeling code developed in the julia programming language.

Beam code development & simulation techniques↗
DOE OSTI2026

Noise-canceling quantum feedback: Non-Hermitian dynamics with applications to state preparation and magic state distillation

Time-continuous quantum measurement allows for the tracking of a quantum system in real time via sequences of short, and individually weak, measurement intervals. Such measurements are necessarily invasive, imparting backaction to the system, and allowing the observer to update their state estimate based on stochastic measurement outcomes. Feedback control then involves real-time interventions by an observer, conditioned on the time-continuous measurement signal that they receive. Here, we consider here diffusive quantum trajectories and focus on the “noise-canceling” subset of feedback protocols that aim to minimize the degree of stochasticity in the dynamics. We derive such a class of feedback operations, showing that under the idealized assumptions of pure states, unit measurement efficiency, and zero time delay in implementing feedback operations, perfectly noise-canceling feedback always exists. We consider the resulting noise-canceled dynamics generated by an effective non-Hermitian Hamiltonian; while non-Hermitian Hamiltonians from continuous monitoring generally describe rare dynamics (accessible by costly postselection), the use of noise-canceling feedback here leads to non-Hermitian dynamics that occur deterministically. We demonstrate this via examples of entangled state preparation and stabilization. We then illustrate the potential for the application of noise cancellation to boost success rates in magic state distillation protocols. We show that adding feedback based on noise cancellation into a time-continuous five-to-one distillation protocol leads to higher probabilities of successful distillation across a range of input errors and increases the threshold on input errors for which the protocol is effective. Our results highlight the efficacy of noise-canceling feedback-aided protocols for quantum state preparation and stabilization tasks.

Karmakar, Tathagata [University of California, Ber↗
DOE OSTI2025

Ising spin ladders of orthopyroxene CoGeO 3

Here, we present thermodynamic and spectroscopic measurements for an orthopyroxene CoGeO 3 with magnetic Co 2+ ions that form quasi-one-dimensional ladders. We show that noncollinear magnetic order below 𝑇 𝑁 = 32 K can be stabilized by a strong local easy-axis anisotropy of 𝑗 eff = 1/2 moments, which is induced by ligand octahedra distortions. Extraction of a magnetic Hamiltonian from inelastic neutron scattering measurements supports this interpretation and allows us to establish an effective magnetic model. The resulting exchange Hamiltonian justifies CoGeO 3 as a realization of an Ising spin ladder compound.

Maksimov, Pavel A. [Joint Inst. for Nuclear Resear↗
DOE OSTI2025

Classical optimization with imaginary-time block encoding on quantum computers: The MaxCut problem

Optimization problems in finance, physics, and computer science are typically very hard to tackle in classical computing; quantum computing could help speed up computations and provide efficient methods for tackling large problems. Typically, to treat a problem with a quantum computer, the optimal solution is cast as the ground state of a diagonal Hamiltonian. Here, we develop a method, called imaginary-time evolution block encoding (ITE-BE), based on a recent imaginary-time algorithm, which requires no variational parameter optimization, as all parameters can be derived analytically from the target Hamiltonian. We also demonstrate that our method can be successfully combined with other quantum algorithms such as the quantum approximate optimization algorithm (QAOA). For illustration, here we study the MaxCut problem. We find that the QAOA ansatz increases the postselection success of ITE-BE, and shallow QAOA circuits, when boosted with ITE-BE, achieve better performance than deeper QAOA circuits. For the special case of the transverse initial state, we adapt our block-encoding scheme to allow for a deterministic application of the first layer of the circuit.

Zhong, Dawei [University of Southern California, L↗
DOE OSTI2026

Reshaping the Quantum Arrow of Time

While the microscopic laws of physics are often symmetric under time reversal, most natural processes that we observe are not. The emergent asymmetry between typical and time-reversed processes is referred to as the arrow of time. In quantum physics, an arrow of time emerges when a sequence of measurements is performed on a system. We introduce quantum control tools that can yield dynamics more consistent with time flowing backward than forward. The control tools are based on the explicit construction of a Hamiltonian that can replicate the stochastic trajectories of a monitored quantum system. Such a Hamiltonian can reverse the effect of monitoring and, via a feedback process, generate trajectories consistent with a reversed arrow of time. It can also be used to simulate the backward-in-time dynamics of an open quantum system. Finally, we design a feedback-driven continuous measurement engine powered by the energy pumped into the system by the monitoring process. We show that the engine can operate under experimentally realizable conditions with feedback delay and finite-efficiency measurements.

Entropy production↗
DOE OSTI2026

Diagonal state designs with reconfigurable real-time circuits

Unitary designs are widely used in quantum computation, but in many practical settings it suffices to construct a diagonal state design generated with unitary gates diagonal in the computational basis. In this work, we introduce a simple and efficient diagonal state 3-design based on real-time evolutions under 2-local Hamiltonians. Our construction is inspired by the classical Girard-Hutchinson trace estimator in that it involves the stochastic preparation of many random-phase states. Though the exact Girard-Hutchinson states are not tractably implementable on a quantum computer, we can construct states that match the statistical moments of the Girard-Hutchinson states with real-time evolution. Importantly, our random states are all generated using the same Hamiltonians for real-time evolution, with the randomness arising solely from stochastic variations in the durations of the evolutions. In this sense, the circuit is fully reconfigurable and thus suited for near-term realizations on both digital and analog platforms. Moreover, we show how to extend our construction to achieve diagonal state designs of arbitrarily high order.

Shen, Yizhi [LBL, Berkeley] (ORCID:000000024160548↗
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 OSTI2020

Signaling and scrambling with strongly long-range interactions

Strongly long-range interacting quantum systems—those with interactions decaying as a power law 1/$r^α$ in the distance $\textit{r}$ on a $\textit{D}$-dimensional lattice for $\textit{α ≤ D}$—have received significant interest in recent years. They are present in leading experimental platforms for quantum computation and simulation, as well as in theoretical models of quantum-information scrambling and fast entanglement creation. Since no notion of locality is expected in such systems, a general understanding of their dynamics is lacking. In a step towards rectifying this problem, we prove two Lieb-Robinson-type bounds that constrain the time for signaling and scrambling in strongly long-range interacting systems, for which no tight bounds were previously known. In this work, our first bound applies to systems mappable to free-particle Hamiltonians with long-range hopping, and is saturable for $\textit{α ≤ D/2}$. Our second bound pertains to generic long-range interacting spin Hamiltonians and gives a tight lower bound for the signaling time to extensive subsets of the system for all $\textit{α < D}$. This many-site signaling time lower bounds the scrambling time in strongly long-range interacting systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Symmetric Bloch oscillations of matter waves

Cold atoms in an optical lattice provide an ideal platform for studying Bloch oscillations. Here we extend Bloch oscillations to two superposed optical lattices that are accelerated away from one another, and show that these symmetric Bloch oscillations can split, reflect, and recombine matter waves coherently. Using the momentum parity symmetry of the Hamiltonian, we map out the energy band structure of the process and show that superpositions of momentum states are created by adiabatically following the ground state of the Hamiltonian. The relative phase and velocity of the two lattices completely determines the trajectories of different branches of the matter wave. Experimentally we demonstrate symmetric Bloch oscillations using cold cesium atoms where we form interferometers with up to 240ℏk momentum splitting, one of the largest coherent momentum splittings achieved to date. This work has applications in macroscopic tests of quantum mechanics, measurements of fundamental constants, and searches for new physics.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Efficient phase-factor evaluation in quantum signal processing

Quantum signal processing (QSP) is a powerful quantum algorithm to exactly implement matrix polynomials on quantum computers. Asymptotic analysis of quantum algorithms based on QSP has shown that asymptotically optimal results can in principle be obtained for a range of tasks, such as Hamiltonian simulation and the quantum linear system problem. A further benefit of QSP is that it uses a minimal number of ancilla qubits, which facilitates its implementation on near-to-intermediate term quantum architectures. However, there is so far no classically stable algorithm allowing computation of the phase factors that are needed to build QSP circuits. Existing methods require the use of variable precision arithmetic and can only be applied to polynomials of a relatively low degree. We present here an optimization-based method that can accurately compute the phase factors using standard double precision arithmetic operations. We demonstrate the performance of this approach with applications to Hamiltonian simulation, eigenvalue filtering, and quantum linear system problems. Furthermore, our numerical results show that the optimization algorithm can find phase factors to accurately approximate polynomials of a degree larger than 10000 with errors below 10 -12 .

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Fast inversion, preconditioned quantum linear system solvers, fast Green's-function computation, and fast evaluation of matrix functions

Preconditioning is the most widely used and effective way for treating ill-conditioned linear systems in the context of classical iterative linear system solvers. We introduce a quantum primitive called fast inversion, which can be used as a preconditioner for solving quantum linear systems. The key idea of fast inversion is to directly block encode a matrix inverse through a quantum circuit implementing the inversion of eigenvalues via classical arithmetics. We demonstrate the application of preconditioned linear system solvers for computing single-particle Green's functions of quantum many-body systems, which are widely used in quantum physics, chemistry, and materials science. We analyze the complexities in three scenarios: the Hubbard model, the quantum many-body Hamiltonian in the plane-wave-dual basis, and the Schwinger model. We also provide a method for performing Green's function calculation in second quantization within a fixed-particle manifold and note that this approach may be valuable for simulation more broadly. Aside from solving linear systems, fast inversion also allows us to develop fast algorithms for computing matrix functions, such as the efficient preparation of Gibbs states. Furthermore, we introduce two efficient approaches for such a task, based on the contour-integral formulation and the inverse transform, respectively.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Quantum algorithms for open lattice field theory

Certain aspects of some unitary quantum systems are well described by evolution via a non-Hermitian effective Hamiltonian, as in the Wigner-Weisskopf theory for spontaneous decay. Conversely, any non-Hermitian Hamiltonian evolution can be accommodated in a corresponding unitary system + environment model via a generalization of Wigner-Weisskopf theory. This demonstrates the physical relevance of novel features such as exceptional points in quantum dynamics, and opens up avenues for studying many-body systems in the complex plane of coupling constants. In the case of lattice field theory, sparsity lends these channels the promise of efficient simulation on standardized quantum hardware. We thus consider quantum operations that correspond to Suzuki-Lie-Trotter approximation of lattice field theories undergoing nonunitary time evolution, with potential applicability to studies of spin or gauge models at finite chemical potential, with topological terms, to quantum phase transitions—a range of models with sign problems. We develop non-Hermitian quantum circuits and explore their promise on a benchmark, the quantum one-dimensional Ising model with complex longitudinal magnetic field, showing that observables can probe the Lee-Yang edge singularity. The development of attractors past critical points in the space of complex couplings indicates a potential for study on near-term noisy hardware.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
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 OSTI2022

Dynamical preparation of an atomic condensate in a Hofstadter band

The creation of a Hamiltonian in the quantum regime which has nontrivial topological features is a central goal of the cold-atom community, enabling widespread exploration of novel phases of quantum matter. A general scheme to synthesize such Hamiltonians is based on dynamical modulation of optical lattices which thereby generate vector potentials. At the same time, the modulation can lead to heating and serious difficulties with equilibration. Here we show that these challenges can be overcome by demonstrating how a Hofstadter Bose-Einstein condensate (BEC) can be dynamically realized, using experimental protocols. From Gross-Pitaevskii simulations our study reveals a complex, multistage evolution; this includes a chaotic intermediate "heating" stage followed by a spontaneous reentrance to the BEC. The observed behavior is reminiscent of evolution in cosmological models.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2022

Quantum signal processing for simulating cold plasma waves

Numerical modeling of radio-frequency waves in plasma with sufficiently high spatial and temporal resolution remains challenging even with modern computers. However, such simulations can be sped up using quantum computers in the future. In this work, we propose how to do such modeling for cold plasma waves, in particular, for an X wave propagating in an inhomogeneous one-dimensional plasma. The wave system is represented in the form of a vector Schrödinger equation with a Hermitian Hamiltonian. Block encoding is used to represent the Hamiltonian through unitary operations that can be implemented on a quantum computer. To perform the modeling, we apply the so-called quantum signal processing algorithm and construct the corresponding circuit. Quantum simulations with this circuit are emulated on a classical computer, and the results show agreement with traditional classical calculations. We also discuss how our quantum circuit scales with the resolution.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Implementation of a Frenkel exciton-based controlled phase shifter

Frenkel excitons are of interest for ultrafast switching applications due to the femtosecond timescale at which coherent exciton transfer between chromophores takes place. The Frenkel Hamiltonian, which governs the dynamics of Frenkel excitons, belongs to a class of Hamiltonians that enable universal quantum computation. It is thus of interest to determine how a complete set of exciton-based gates for quantum computing could be constructed as aggregates of chromophores. Here, we demonstrate that a controlled phase shifter can be constructed as a pair of exciton transmission lines that employ two types of chromophores and that are cross coupled by a two-exciton interaction. This element facilitates the construction of controlled basis-change gates, thereby enabling the implementation of a complete set of exciton-based gates for universal quantum computation.

77 NANOSCIENCE AND NANOTECHNOLOGY↗