SEARCH · Search NASA

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.

SourceResearch connectionFrom yearThrough year

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

At least 19 records

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Quantum simulation of boson-related Hamiltonians: techniques, effective Hamiltonian construction, and error analysis

Elementary quantum mechanics proposes that a closed physical system consistently evolves in a reversible manner. However, control and readout necessitate the coupling of the quantum system to the external environment, subjecting it to relaxation and decoherence. Consequently, system-environment interactions are indispensable for simulating physically significant theories. A broad spectrum of physical systems in condensed-matter and high-energy physics, vibrational spectroscopy, and circuit and cavity QED necessitates the incorporation of bosonic degrees of freedom, such as phonons, photons, and gluons, into optimized fermion algorithms for near-future quantum simulations. In particular, when a quantum system is surrounded by an external environment, its basic physics can usually be simplified to a spin or fermionic system interacting with bosonic modes. Nevertheless, troublesome factors such as the magnitude of the bosonic degrees of freedom typically complicate the direct quantum simulation of these interacting models, necessitating the consideration of a comprehensive plan. This strategy should specifically include a suitable fermion/boson-to-qubit mapping scheme to encode sufficiently large yet manageable bosonic modes, and a method for truncating and/or downfolding the Hamiltonian to the defined subspace for performing an approximate but highly accurate simulation, guided by rigorous error analysis. In this pedagogical tutorial review, we aim to provide such an exhaustive strategy, focusing on encoding and simulating certain bosonic-related model Hamiltonians, inclusive of their static properties and time evolutions. Specifically, we emphasize two aspects: (1) the discussion of recently developed quantum algorithms for these interacting models and the construction of effective Hamiltonians, and (2) a detailed analysis regarding a tightened error bound for truncating the bosonic modes for a class of fermion-boson interacting Hamiltonians.

bosonic Hamiltonian↗

DOE OSTI2026

ProtNHF: Neural Hamiltonian Flows for Controllable Protein Sequence Generation

This dataset accompanies the publication "ProtNHF: Neural Hamiltonian Flows for Controllable Protein Sequence Generation". This paper introduces a new AI model for protein sequence generation. This dataset contains data related to experiments discussed in the publication. This includes generated sequences and evaluation metrics supporting all unconditional and bias-controlled experiments in the ProtNHF paper.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2024

Coarse-graining Hamiltonian systems using WSINDy

Abstract Weak form equation learning and surrogate modeling has proven to be computationally efficient and robust to measurement noise in a wide range of applications including ODE, PDE, and SDE discovery, as well as in coarse-graining applications, such as homogenization and mean-field descriptions of interacting particle systems. In this work we extend this coarse-graining capability to the setting of Hamiltonian dynamics which possess approximate symmetries associated with timescale separation. A smooth $$\varepsilon$$ ε -dependent Hamiltonian vector field $$X_\varepsilon$$ X ε possesses an approximate symmetry if the limiting vector field $$X_0=\lim _{\varepsilon \rightarrow 0}X_\varepsilon$$ X 0 = lim ε → 0 X ε possesses an exact symmetry. Such approximate symmetries often lead to the existence of a Hamiltonian system of reduced dimension that may be used to efficiently capture the dynamics of the symmetry-invariant dependent variables. Deriving such reduced systems, or approximating them numerically, is an ongoing challenge. We demonstrate that WSINDy can successfully identify this reduced Hamiltonian system in the presence of large perturbations imparted in the $$\varepsilon >0$$ ε > 0 regime, while remaining robust to extrinsic noise. This is significant in part due to the nontrivial means by which such systems are derived analytically. WSINDy naturally preserves the Hamiltonian structure by restricting to a trial basis of Hamiltonian vector fields. The methodology is computationally efficient, often requiring only a single trajectory to learn the global reduced Hamiltonian, and avoiding forward solves in the learning process. In this way, we argue that weak-form equation learning is particularly well-suited for Hamiltonian coarse-graining. Using nearly-periodic Hamiltonian systems as a prototypical class of systems with approximate symmetries, we show that WSINDy robustly identifies the correct leading-order system, with dimension reduced by at least two, upon observation of the relevant degrees of freedom. While our main contribution is computational, we also provide a contribution to the literature on averaging theory by proving that first-order averaging at the level of vector fields preserves Hamiltonian structure in nearly-periodic Hamiltonian systems. This provides theoretical justification for our approach as WSINDy’s computations occur at the level of Hamiltonian vector fields. We illustrate the efficacy of our proposed method using physically relevant examples, including coupled oscillator dynamics, the Hénon–Heiles system for stellar motion within a galaxy, and the dynamics of charged particles.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Quadrature Based Neural Network Learning of Stochastic Hamiltonian Systems

Hamiltonian Neural Networks (HNNs) provide structure-preserving learning of Hamiltonian systems. In this paper, we extend HNNs to structure-preserving inversion of stochastic Hamiltonian systems (SHSs) from observational data. We propose the quadrature-based models according to the integral form of the SHSs’ solutions, where we denoise the loss-by-moment calculations of the solutions. The integral pattern of the models transforms the source of the essential learning error from the discrepancy between the modified Hamiltonian and the true Hamiltonian in the classical HNN models into that between the integrals and their quadrature approximations. This transforms the challenging task of deriving the relation between the modified and the true Hamiltonians from the (stochastic) Hamilton–Jacobi PDEs, into the one that only requires invoking results from the numerical quadrature theory. Meanwhile, denoising via moments calculations gives a simpler data fitting method than, e.g., via probability density fitting, which may imply better generalization ability in certain circumstances. Numerical experiments validate the proposed learning strategy on several concrete Hamiltonian systems. The experimental results show that both the learned Hamiltonian function and the predicted solution of our quadrature-based model are more accurate than that of the corrected symplectic HNN method on a harmonic oscillator, and the three-point Gaussian quadrature-based model produces higher accuracy in long-time prediction than the Kramers–Moyal method and the numerics-informed likelihood method on the stochastic Kubo oscillator as well as other two stochastic systems with non-polynomial Hamiltonian functions. Moreover, the Hamiltonian learning error εH arising from the Gaussian quadrature-based model is lower than that from Simpson’s quadrature-based model. These demonstrate the superiority of our approach in learning accuracy and long-time prediction ability compared to certain existing methods and exhibit its potential to improve learning accuracy via applying precise quadrature formulae.

Mathematics↗

DOE OSTI2025

Data-driven reduced-order models for port-Hamiltonian systems with operator inference

Hamiltonian operator inference has been developed in Sharma et al. (2022) to learn structure-preserving reduced-order models (ROMs) for Hamiltonian systems. The method constructs a low-dimensional model using only data and knowledge of the functional form of the Hamiltonian. The resulting ROMs preserve the intrinsic structure of the system, ensuring that the mechanical and physical properties of the system are maintained. In this work, we extend this approach to port-Hamiltonian systems, which generalize Hamiltonian systems by including energy dissipation, external input, and output. Based on snapshots of the system’s state and output, together with the information about the functional form of the Hamiltonian, reduced operators are inferred through optimization and are then used to construct data-driven ROMs. To further alleviate the complexity of evaluating nonlinear terms in the ROMs, a hyper-reduction method via discrete empirical interpolation is applied. Accordingly, we derive error estimates for the ROM approximations of the state and output. Lastly, we demonstrate the structure preservation, as well as the accuracy of the proposed port-Hamiltonian operator inference framework, through numerical experiments on a linear mass–spring-damper problem and a nonlinear Toda lattice problem.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

On finite-dimensional smoothed-particle Hamiltonian reductions of the Vlasov equation

The inclusion of spatial smoothing in finite-dimensional particle-based Hamiltonian reductions of the Vlasov equation and related models is considered. Here, this work investigates the underlying Hamiltonian structure of such smoothed particle-based methods for Hamiltonian systems and the small-scale regularization such methods implicitly make in approximating the continuum theory. In the context of the Vlasov–Poisson equation and other mean-field Lie–Poisson systems, of which Vlasov–Poisson is a special case, smoothing amounts to a convolutive regularization of the Hamiltonian. This regularization may be interpreted as a change of the inner product structure used to identify the dual space in the Lie–Poisson Hamiltonian formulation. In particular, the shape function used for spatial smoothing may be identified as the kernel function of a reproducing kernel Hilbert space whose inner product is used to define the Lie–Poisson Hamiltonian structure. It is likewise possible to introduce smoothing in the Vlasov–Maxwell system, but in this case the Poisson bracket must be modified rather than the Hamiltonian. The smoothing applied to the Vlasov–Maxwell system is incorporated by inserting smoothing in the map from canonical to kinematic coordinates. In the filtered system, the Lorentz force law and the current, the two terms coupling the Vlasov equation with Maxwell’s equations, are spatially smoothed.

Hamiltonian mechanics↗

DOE OSTI2025

Ansatz-Free Hamiltonian Learning with Heisenberg-Limited Scaling

Learning the unknown interactions that govern a quantum system is crucial for quantum information processing, device benchmarking, and quantum sensing. The problem, known as Hamiltonian learning, is well understood under the assumption that interactions are local, but this assumption may not hold for arbitrary Hamiltonians. Previous methods all require high-order inverse polynomial dependency with precision, unable to surpass the standard quantum limit and reach the gold-standard Heisenberg-limited scaling. Whether Heisenberg-limited Hamiltonian learning is possible without prior assumptions about the interaction structures, a challenge we term ansatz-free Hamiltonian learning , remains an open question. In this work, we present a quantum algorithm to learn arbitrary sparse Hamiltonians without any structure constraints using only black-box queries of the system’s real-time evolution and minimal digital controls to attain Heisenberg-limited scaling in estimation error. Our method is also resilient to state-preparation-and-measurement errors, enhancing its practical feasibility. We numerically demonstrate our ansatz-free protocol for learning physical Hamiltonians and validating analog quantum simulations, benchmarking our performance against the state-of-the-art Heisenberg-limited learning approach. Moreover, we establish a fundamental trade-off between total evolution time and quantum control on learning arbitrary interactions, revealing the intrinsic interplay between controllability and total evolution-time complexity for any learning algorithm. These results pave the way for further exploration into Heisenberg-limited Hamiltonian learning in complex quantum systems under minimal assumptions, potentially enabling new benchmarking and verification protocols.

machine learning↗

DOE OSTI2025

Systematic input scheme for many-boson Hamiltonians with applications to the two-dimensional 𝜙 4 theory

We develop a novel, systematic input scheme for many-boson Hamiltonians in order to solve field theory problems within the light-front Hamiltonian formalism via quantum computing. We present our discussion of this input scheme based on the light-front Hamiltonian of the two-dimensional ϕ 4 theory. In our input scheme, we employ a set of quantum registers, where each register encodes the occupation of a distinct boson mode as binaries. We squeeze the boson operators of each mode and present the Hamiltonian in terms of unique combinations of the squeezed-boson operators. We design the circuit modules for these unique combinations. Based on these circuit modules, we block encode the many-boson Hamiltonian utilizing the idea of quantum walk. For demonstration purposes, we present the spectral calculations of the Hamiltonian utilizing the hybrid quantum-classical symmetry-adapted quantum Krylov subspace diagonalization algorithm based on our input scheme, where the quantum computations are performed with the IBM Qiskit quantum simulator. The results of the hybrid calculations agree with exact results. Here, we can incorporate the input scheme in this work with the input scheme for many-fermion Hamiltonians; they jointly offer new pathways to solving the structure and dynamics of more general field theory problems on future fault-tolerant quantum computers.

Ab initio calculations↗

NASA NTRS1994

An Exact Separation of the Spin-Free and Spin-Dependent Terms of the Dirac-Coulomb-Breit Hamiltonian

The Dirac Hamiltonian is transformed by extracting the operator (sigma x p)/2mc from the small component of the wave function and applying it to the operators of the original Hamiltonian. The resultant operators contain products of Paull matrices that can be rearranged to give spin-free and spin-dependent operators. These operators are the ones encountered in the Breit-Pauli Hamiltonian, as well as some of higher order in alpha(sup 2). However, since the transformation of the original Dirac Hamiltonian is exact, the new Hamiltonian can be used in variational calculations, with or without the spin-dependent terms. The new small component functions have the same symmetry properties as the large component. Use of only the spin-free terms of the new Hamiltonian permits the same factorization over spin variables as in nonrelativistic theory, and therefore all the post-Self-Consistent Field (SCF) machinery of nonrelativistic calculations can be applied. However, the single-particle functions are two-component orbitals having a large and small component, and the SCF methods must be modified accordingly. Numerical examples are presented, and comparisons are made with the spin-free second-order Douglas-Kroll transformed Hamiltonian of Hess.

Dyall, Kenneth G.↗

NASA NTRSDate not supplied

Self-consistent Quantum Iteratively Sparsified Hamiltonian Algorithm (SQuISH)

Due to coherence time limitations, reducing the resources required to run quantum algorithms and simulate physical systems on a quantum computer is crucial. With regards to Hamiltonian simulation, a significant effort has focused on building efficient algorithms using various factorizations and truncations, typically derived from the Hamiltonian alone. We introduce a new paradigm for improving Hamiltonian simulation and reducing the cost of ground state problems based on ideas recently developed for classical chemistry simulations. The key idea is that one can find efficient ways to reduce resources needed by quantum algorithms by making use of two key pieces of information: the Hamiltonian operator and an approximate ground state wavefunction. We refer to our algorithm as the self-consistent quantum iteratively sparsified Hamiltonian (SQuISH). By performing our scheme iteratively, one can drive SQuISH to create an accurate wavefunction using a truncated, resource-efficient Hamiltonian. By utilizing this more compact Hamiltonian, our algorithm provides an approach to reduce the gate complexity of ground state calculations on quantum hardware. As proof of principle, we implement SQuISH using configuration interaction for small molecules and coupled cluster for larger systems. Through our combination of approaches, we demonstrate how it performs on a range of systems, the largest of which would require more than 200 qubits to run on quantum hardware.

Diana Chamaki↗

NASA NTRSDate not supplied

Downfolding Complex Materials Problems Onto Model Hamiltonians for Quantum Computers

Simulating the properties of quantum materials is expected to be one of the exciting applications for quantum computers and where we hope to see advantages over classical hardware. The complexity of ab initio Hamiltonians describing the physics of application-relevant materials places them beyond the realm of possibility for solution on near-term hardware with a limited number of qubits. Various Hamiltonian approximations, including Hamiltonian downfolding, offers a possibility towards simulating complex materials on near-term hardware. This is accomplished by approximating the relevant physics of a given material through their representation by simpler model Hamiltonians, such as the Hubbard Hamiltonian or extensions of it. Here we employ a well-defined first-principles methodology for deriving downfolded multi-band extended Hubbard Hamiltonians of materials, capturing strong electronic correlation and electron-phonon coupling, based on the formalism of Wannier functions and the calculation of the screened Coulomb interaction. We demonstrate for a variety of systems that quantum simulation of these downfolded Hamiltonians reproduces key properties, thus establishing downfolding as a promising route to achieve near-term simulation of application-relevant systems on quantum hardware.

Antonios Markos Alvertis↗

NASA NTRSDate not supplied

Downfolding complex materials problems onto model Hamiltonians for quantum computers

Antonios M. Alvertis↗

DOE OSTI2024

An efficient quantum circuit for block encoding a pairing Hamiltonian

We present an efficient quantum circuit for block encoding a pairing Hamiltonian often studied in nuclear physics. Our block encoding scheme does not require mapping the creation and annihilation operators to the Pauli operators and representing the Hamiltonian as a linear combination of unitaries. Instead, we show how to encode the Hamiltonian directly using controlled swap operations. We analyze the gate complexity of the block encoding circuit and show that it scales polynomially with respect to the number of qubits required to represent a quantum state associated with the pairing Hamiltonian. We also show how the block encoding circuit can be combined with the quantum singular value transformation to construct an efficient quantum circuit for approximating the density of states of a pairing Hamiltonian. The techniques presented can be extended to encode more general second-quantized Hamiltonians.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Genesis: A Compiler Framework for Hamiltonian Simulation on Hybrid CV-DV Quantum Computers

We introduce Genesis, the first compiler designed to support Hamiltonian Simulation on hybrid continuous-variable (CV) and discrete-variable (DV) quantum computing systems. Genesis is a two-level compilation system. At the first level, it decomposes an input Hamiltonian into basis gates using the native instruction set of the target hybrid CV-DV quantum computer. At the second level, it tackles the mapping and routing of qumodes/qubits to implement long-range interactions for the gates decomposed from the first level. Rather than a typical implementation that relies on SWAP primitives similar to qubit-based (or DV-only) systems, we propose an integrated design of connectivity-aware gate synthesis and beamsplitter SWAP insertion tailored for hybrid CV-DV systems. We also introduce an OpenQASM-like domain-specific language (DSL) named CVDV-QASM to represent Hamiltonian in terms of Pauli-exponentials and basic gate sequences from the hybrid CVDV gate set. Genesis has successfully compiled several important Hamiltonians, including the Bose-Hubbard model, Z2−Higgs model, Hubbard-Holstein model, Heisenberg model and Electron-vibration coupling Hamiltonians, which are critical in domains like quantum field theory, condensed matter physics, and quantum chemistry. Our implementation is available at Genesis-CVDV-Compiler https://github.com/ruadapt/Genesis-CVDV-Compiler

Chen, Henry↗

DOE OSTI2024

On the hardness of learning ground state entanglement of geometrically local Hamiltonians

Characterizing the entanglement structure of ground states of local Hamiltonians is a fundamental problem in quantum information. In this work we study the computational complexity of this problem, given the Hamiltonian as input. Our main result is that to show it is cryptographically hard to determine if the ground state of a geometrically local, polynomially gapped Hamiltonian on qudits (d=O(1)) has near-area law vs near-volume law entanglement. This improves prior work of Bouland et al. (arXiv:2311.12017) showing this for non-geometrically local Hamiltonians. In particular we show this problem is roughly factoring-hard in 1D, and LWE-hard in 2D. Our proof works by constructing a novel form of public-key pseudo-entanglement which is highly space-efficient, and combining this with a modification of Gottesman and Irani's quantum Turing machine to Hamiltonian construction. Our work suggests that the problem of learning so-called "gapless" quantum phases of matter might be intractable.

Computational Complexity (cs.CC)↗

DOE OSTI2025

Ginsparg-Wilson Hamiltonians with Improved Chiral Symmetry

We construct a family of Ginsparg-Wilson Hamiltonians with improved chiral properties, starting from a construction of Creutz-Horvath-Neuberger that provides a doubler-free Hamiltonian lattice regularization for Dirac fermions in even spacetime dimensions. We use a higher-order generalization of the Ginsparg-Wilson relation due to Fujikawa, which yields an order-$k$ Hamiltonian overlap operator for each integer $k \geq 0$, with an exactly conserved but nonquantized chiral charge that becomes quantized as $k \to \infty$. Our construction provides physical insight into how Fujikawa's higher-order Ginsparg-Wilson relation improves chiral symmetry while reproducing the anomaly, highlighting the trade-offs inherent in any Hamiltonian lattice realization of an anomalous chiral symmetry. This class of Hamiltonian lattice regularizations, with their tunable chiral symmetry properties, offers potential advantages for quantum and tensor-network simulations.

Singh, Hersh [Fermilab]↗

NASA NTRS1972

Hamiltonian cosmology.

The study of cosmological models by means of equations of motion in Hamiltonian form is considered. Hamiltonian methods applied to gravity seem to go back to Rosenfeld (1930), who constructed a quantum-mechanical Hamiltonian for linearized general relativity theory. The first to notice that cosmologies provided a simple model in which to demonstrate features of Hamiltonian formulation was DeWitt (1967). Applications of the ADM formalism to homogeneous cosmologies are discussed together with applications of the Hamiltonian formulation, giving attention also to Bianchi-type universes. Problems involving the concept of superspace and techniques of quantization are investigated.

Ryan, M.↗

DOE OSTI2024

Fermionic mean-field theory as a tool for studying spin Hamiltonians

The Jordan–Wigner transformation permits one to convert spin 1/2 operators into spinless fermion ones, or vice versa. In some cases, it transforms an interacting spin Hamiltonian into a noninteracting fermionic one, which is exactly solved at the mean-field level. Even when the resulting fermionic Hamiltonian is interacting, its mean-field solution can provide surprisingly accurate energies and correlation functions. Furthermore, Jordan–Wigner is, however, only one possible means of interconverting spin and fermionic degrees of freedom. Here, we apply several such techniques to the XXZ and J 1 –J 2 Heisenberg models, as well as to the pairing or reduced Bardeen–Cooper–Schrieffer Hamiltonian, with the aim of discovering which of these mappings is most useful in applying fermionic mean-field theory to the study of spin Hamiltonians.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗