Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Hamiltonian systems”

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 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

SympGNNs: Symplectic Graph Neural Networks for identifying high-dimensional Hamiltonian systems and node classification

Existing neural network models to learn Hamiltonian systems, such as SympNets, although accurate in low-dimensions, struggle to learn the correct dynamics for high-dimensional many-body systems. Herein, we introduce Symplectic Graph Neural Networks (SympGNNs) that can effectively handle system identification in high-dimensional Hamiltonian systems, as well as node classification. SympGNNs combine symplectic maps with permutation equivariance, a property of graph neural networks. Specifically, we propose two variants of SympGNNs: (i) G-SympGNN and (ii) LA-SympGNN, arising from different parameterizations of the kinetic and potential energy. We demonstrate the capabilities of SympGNN on two physical examples: a 40-particle coupled Harmonic oscillator, and a 2000-particle molecular dynamics simulation in a two-dimensional Lennard-Jones potential. Furthermore, we demonstrate the performance of SympGNN in the node classification task, achieving accuracy comparable to the state-of-the-art. Finally, we also empirically show that SympGNN can overcome the oversmoothing and heterophily problems, two key challenges in the field of graph neural networks.

Deep learning↗
DOE OSTI2025

CLPNets: Coupled Lie–Poisson neural networks for multi-part Hamiltonian systems with symmetries

To accurately compute data-based prediction of Hamiltonian systems, it is essential to utilize methods that preserve the structure of the equations over time. We consider a particularly challenging case of systems with interacting parts that do not reduce to pure momentum evolution. Such systems are essential in scientific computations, such as discretization of a continuum elastic rod, which can be viewed as the group of rotations and translations $SE(3)$. The evolution involves not only the momenta but also the relative positions and orientations of the particles. The presence of Lie group-valued elements, such as relative positions and orientations, poses a problem for applying previously derived methods for data-based computing. We develop a novel method of data-based computation and complete phase space learning of such systems. We follow the original framework of SympNets (Jin et al., 2020) and LPNets (Eldred et al., 2024), building the neural network from phase space mappings that preserve the Lie–Poisson structure. We derive a novel system of mappings that are built into neural networks describing the evolution of such systems. We call such networks Coupled Lie–Poisson Neural Networks, or CLPNets. We consider increasingly complex examples for the applications of CLPNets, starting with the rotation of two rigid bodies about a common axis, progressing to the free rotation of two rigid bodies, and finally to the evolution of two connected and interacting $SE(3)$ components, describing the discretization of an elastic rod into two elements. Our method preserves all Casimir invariants to machine precision, preserves energy to high accuracy, and shows good resistance to the curse of dimensionality, requiring only a few thousand data points for all cases studied (three to eighteen dimensions). Additionally, the method is highly economical in memory requirements, requiring only about 200 parameters for the most complex case considered.

Data-based modeling↗
DOE OSTI2025

Construction of approximate invariants for nonintegrable Hamiltonian systems

We present a method to construct high-order polynomial approximate invariants (AI) for nonintegrable Hamiltonian dynamical systems and apply it to a modern ring-based particle accelerator. Taking advantage of a special property of one-turn transformation maps expressed as square matrices, AIs can be constructed order by order iteratively. Evaluating AI with simulation data, we observe that AI’s fluctuation is actually a measure of chaos. Through minimizing the fluctuations, the stable region of long-term motions, i.e., the dynamic aperture of the accelerator, could be enlarged.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Construction of approximate invariants for non-integrable Hamiltonian systems

We present a method to construct high-order polynomial approximate invariants (AI) for non integrable Hamiltonian dynamical systems, and apply it to a modern ring-based particle accelerator. Taking advantage of a special property of one-turn transformation maps in the form of a square matrix, AIs can be constructed order-by-order iteratively. Evaluating AI with simulation data, we observe that AI’s fluctuation is actually a measure of chaos. Through minimizing the fluctuations, the stable region of long-term motions, i.e., the dynamic aperture of the accelerator, could be enlarged.

43 PARTICLE ACCELERATORS↗
DOE OSTI2025

Symplectic neural network and its application to charged particle dynamics in electromagnetic fields

Recently, machine learning models have shown many successes in various applications in science and technology. In this work, we focus on the charged particle dynamics, with the development of a class of symplectic neural networks, including a linear version, SympMat, and a nonlinear version, HénonNet. Both are designed to preserve the structure of Hamiltonian systems. We show that they can be used to model relevant Hamiltonian systems of interest in plasma physics and astrophysics, for linear and nonlinear charged particle dynamics, with the potential to bridge multi-scale simulations. These symplectic neural networks are adapted to the applications in plasma simulations and particle-wave interaction with parametric dependence and periodicity, where we have investigated their performance and accuracy. In particular, SympMat is shown to outperform the traditional Boris particle pusher down to the sub-gyroperiod scale in the case of charged particles in uniform magnetic fields. HénonNet successfully predicts the hot electron distribution, which is validated against theoretical results. These results highlight the potential of symplectic neural networks as a trajectory integrator for particle-in-cell simulations or a fast surrogate to replace conventional numerical schemes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

The topology of non-resonant stellarator divertors

We apply topological methods to better understand how the magnetic field in the stellarator edge can be diverted away from the confined region. Our primary method is calculating the winding numbers of closed contours, which gives information on the number and nature of fixed points within a bounded region. We first apply this to the non-resonant divertor Hamiltonian system, and present a simple explanation for the system’s diversion: trajectories are guided away from the confined region by X-points which are ‘unpaired’ i.e. do not have corresponding O-points and therefore do not resemble an island chain. We show how similar phenomena can occur in a similar, axisymmetric Hamiltonian system. Secondly, we find examples of neoclassically optimised stellarators in the quasi-symmetric stellarator repository database which divert the magnetic field via unpaired X-points. We present and discuss three examples, each containing novel phenomena which might be desirable for stellarator divertors. These examples serve as an illustration of new divertor possibilities which exist in realistic stellarators, which may ultimately have application for future experiments and reactors.

X-points, topology↗
DOE OSTI2025

Simulated annealing of reduced magnetohydrodynamic systems

Theory of simulated annealing (SA), a method for equilibrium and stability analyses for Hamiltonian systems, is reviewed. The SA explained in this review is based on a double bracket formulation that derives from Hamiltonian structure. In addition to general theoretical aspects, the explicit formulation as well as numerical applications are presented. Both finite and infinite degree-of-freedom systems are treated, in particular, the heavy top, a toy model mimicking low-beta reduced magnetohydrodynamics (MHD) and low- and high-beta reduced MHD. Furthermore, the numerical results successfully demonstrate the usefulness of SA for equilibrium and stability analyses. At the same time, the results raise some future issues that are discussed in the paper.

Poisson Bracket↗
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 OSTI2024

Unleashed from constrained optimization: quantum computing for quantum chemistry employing generator coordinate inspired method

Hybrid quantum-classical approaches offer potential solutions to quantum chemistry problems, yet they often manifest as constrained optimization problems. Here, we explore the interconnection between constrained optimization and generalized eigenvalue problems through the Unitary Coupled Cluster (UCC) excitation generators. Inspired by the generator coordinate method, we employ these UCC excitation generators to construct non-orthogonal, overcomplete many-body bases, projecting the system Hamiltonian into an effective Hamiltonian, which bypasses issues such as barren plateaus that heuristic numerical minimizers often encountered in standard variational quantum eigensolver (VQE). Diverging from conventional quantum subspace expansion methods, we introduce an adaptive scheme that robustly constructs the many-body basis sets from a pool of the UCC excitation generators. This scheme supports the development of a hierarchical ADAPT quantum-classical strategy, enabling a balanced interplay between subspace expansion and ansatz optimization to address complex, strongly correlated quantum chemical systems cost-effectively, setting the stage for more advanced quantum simulations in chemistry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2026

Robust qubit interactions mediated by photonic topological edge states

Here, we investigate the coupling of two spatially separated qubits via topologically protected edge states in a two-dimensional Hofstadter lattice. In this hybrid platform, the qubits are coupled to distinct edge sites of the lattice, enabling long-range interactions mediated by topological edge modes. We solve the full system Hamiltonian and analyze the resulting eigenstate structure to uncover the conditions under which coherent qubit interactions emerge. Our analysis reveals that the effective coupling is highly sensitive to the qubit placement, energy detuning, and the topological character of the edge spectrum. We obtain an analytical solution that goes beyond the perturbative regime, capturing the full interplay between the qubits and edge modes. These results provide a foundation for exploring information transport and many-body effects in engineered quantum systems where interactions are mediated by topological edge modes.

Chern insulators↗
DOE OSTI2026

Operationally induced preferred basis in unitary quantum mechanics

The preferred-basis problem and the definite-outcome aspect of the measurement problem persist even if the detector is modeled unitarily, because experimental data are necessarily represented in a Boolean event algebra of mutually exclusive records whereas the theoretical description is naturally formulated in a noncommutative operator algebra with continuous unitary symmetry. This change of mathematical type constitutes the core of the 'cut': a structurally necessary interface from group-based kinematics to set-based counting. In the presented view the basis relevant for recorded outcomes is not determined by the system Hamiltonian alone; it is induced by the measurement mapping, i.e., by the detector channel together with the coarse-grained readout that defines an instrument. The probabilistic mapping is anchored in symmetry and measure theory: by Gleason-type uniqueness (Gleason for projections in $d>2$ and Busch's extension for Positive Operator-Valued Measures (POVMs) including $d=2$), the trace rule is the unique probability measure consistent with additivity over exclusive events and basis-independence of the unitary sector. A compact qubit--pointer model yields an induced unsharp POVM $E_\pm=\tfrac12(\id\pm η\,σ_z)$ with $η$ fixed by pointer resolution, displaying explicitly how the detector induces the relevant basis. Finally, nested-observer paradoxes are tightened into a non-composability lemma: joint assignment of outcome propositions is obstructed unless a joint instrument exists. This relocates the origin of randomness to the stochasticity of the transition rules.

Pronskikh, Vitaly [Fermilab] (ORCID:00000002518174↗
DOE OSTI2025

Feynman path integrals for discrete-variable systems: Walks on Hamiltonian graphs

We propose a natural, parameter-free, discrete-variable formulation of Feynman path integrals. We show that for discrete-variable quantum systems, Feynman path integrals take the form of walks on the graph whose weighted adjacency matrix is the Hamiltonian. By working out expressions for the partition function and transition amplitudes of discretized versions of continuous-variable quantum systems, and then taking the continuum limit, we explicitly recover Feynman's continuous-variable path integrals. We also discuss the implications of our result.

Feynman diagrams↗
DOE OSTI2026

Learning thermodynamic master equations for open quantum systems

The characterization of Hamiltonians and other components of open quantum dynamical systems plays a crucial role in quantum computing and other applications. Scientific machine learning techniques have been applied to this problem in a variety of ways, including by modeling with deep neural networks. However, the majority of mathematical models describing open quantum systems are linear, and the natural nonlinearities in learnable models have not been incorporated using physical principles. We present a data-driven model for open quantum systems that includes learnable, thermodynamically consistent terms. The trained model is interpretable, as it directly estimates the system Hamiltonian and linear components of coupling to the environment. We validate the model on synthetic two and three-level data, as well as experimental two-level data collected from a quantum device at Lawrence Livermore National Laboratory.

Mathematics and Computing↗
DOE OSTI2024

Hamiltonian switching control of noisy bipartite qubit systems

Abstract We develop a Hamiltonian switching ansatz for bipartite control that is inspired by the quantum approximate optimization algorithm, to mitigate environmental noise on qubits. We demonstrate the control for a central spin coupled to bath spins via isotropic Heisenberg interactions, and then make physical applications to the protection of quantum gates performed on superconducting transmon qubits coupling to environmental two-level-systems (TLSs) through dipole-dipole interactions, as well as on such qubits coupled to both TLSs and a Lindblad bath. The control field is classical and acts only on the system qubits. We use reinforcement learning with policy gradient to optimize the Hamiltonian switching control protocols, using a fidelity objective for specific target quantum gates. We use this approach to demonstrate effective suppression of both coherent and dissipative noise, with numerical studies achieving target gate implementations with fidelities over 0.9999 (four nines) in the majority of our test cases and showing improvement beyond this to values of 0.999 999 999 (nine nines) upon a subsequent optimization by GRadient Ascent Pulse Engineering (GRAPE). We analyze how the control depth, total evolution time, number of environmental TLS, and choice of optimization method affect the fidelity achieved by the optimal protocols and reveal some critical behaviors of bipartite control of quantum gates.

Physics↗
DOE OSTI2025

A geometric perspective on kinetic matter–radiation interaction and moment systems

Here, in this paper, we provide a geometric perspective on the kinetic interaction of matter and radiation, based on a pair bracket approach. We discuss the interaction of kinetic theories via dissipative brackets, with our fundamental example being the coupling of matter, described by the Boltzmann equation, and radiation, described by the radiation transport equation. We explore the transition from kinetic systems to their corresponding moment systems, provide a Hamiltonian description of such moment systems, and give a geometric interpretation of the moment closure problem for kinetic theories. As an application, we discuss in detail diffusion radiation hydrodynamics as an example of a pair bracket formulation on a space of moments corresponding to kinetic matter–radiation interaction. Additionally, using the variable moment closure framework of Burby [J. W. Burby, Variable-moment fluid closures with Hamiltonian structure, Sci. Rep. 13 (2023) 18286, doi:10.1038/s41598-023-45416-5], we show how to construct Hamiltonian moment closures for kinetic transport equations with arbitrary Hamiltonian. Using this general construction, we derive novel Hamiltonian moment closures for pure radiation transport.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Quantum Routing and Entanglement Dynamics Through Bottlenecks

To implement arbitrary quantum circuits in architectures with restricted interactions, one may effectively simulate all-to-all connectivity by routing quantum information. We consider the entanglement dynamics and routing between two regions only connected through an intermediate “bottleneck” region with few qubits. In such systems, where the entanglement rate is restricted by a vertex boundary rather than an edge boundary of the underlying interaction graph, existing results such as the small incremental entangling theorem give only a trivial constant lower bound on the routing time (the minimum time to perform an arbitrary permutation). We significantly improve the lower bound on the routing time in systems with a vertex bottleneck. Specifically, for any system with two regions 𝐿,𝑅 with 𝑁 𝐿 ,𝑁 𝑅 qubits, respectively, coupled only through an intermediate region 𝐶 with 𝑁 𝐶 qubits, for any 𝛿 > 0 we show a lower bound of Ω⁢(𝑁$^{1−𝛿}_{𝑅}$/√𝑁 𝐿⁢ 𝑁 𝐶 ) on the Hamiltonian quantum routing time when using piecewise time-independent Hamiltonians, or time-dependent Hamiltonians subject to a smoothness condition. We also prove an upper bound on the average amount of bipartite entanglement between 𝐿 and 𝐶,𝑅 that can be generated in time 𝑡 by such architecture-respecting Hamiltonians in systems constrained by vertex bottlenecks, improving the scaling in the system size from 𝑂⁡(𝑁 𝐿⁢ 𝑡) to 𝑂⁡(√𝑁 𝐿⁢ 𝑡). As a special case, when applied to the star graph (i.e., one vertex connected to 𝑁 leaves), we obtain an Ω⁡(√𝑁 1−𝛿 ) lower bound on the routing time and on the time to prepare 𝑁/2 Bell pairs between the vertices. We also show that, in systems of free particles, we can route optimally on the star graph in time Θ⁡(√𝑁) using Hamiltonian quantum routing, obtaining a speedup over gate-based routing, which takes time Θ⁡(𝑁).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Classification of fragile topology enabled by matrix homotopy

Flat bands in twisted materials have attracted considerable attention due to the emergence of correlated phases that can be associated with the non-Wannier-representable nature of its single-particle states. Specifically, these bands can exhibit a class of topology that can be nullified by the addition of trivial bands, termed fragile topology, which has required an expansion of prior classification schemes. However, existing approaches for predicting fragile topology rely on momentum-space methods, e.g., Wilson loops, presenting a fundamental challenge for using fragile topology as a predictor of correlated phases in aperiodic systems, such as incommensurate twist angles in moiré materials. Here, we develop a ℤ 2 energy-resolved topological marker for classifying fragile phases using a system’s position-space description, enabling the direct classification of finite, disordered, and aperiodic materials. By translating the physical symmetries protecting the system’s fragile topological phase into matrix symmetries of the system’s Hamiltonian and position operators, we use matrix homotopy to construct our topological marker while simultaneously yielding a quantitative measure of topological robustness. We demonstrate our framework’s effectiveness in both a low-energy tight-binding model and a continuum photonic crystal model of 𝐶 2 ⁢𝒯-symmetric systems, and find that fragile topology can both persist under strong disorder and even exhibit disorder-induced reentrant phase transitions. Our photonic crystal results also demonstrate the robustness of fragile topology, and the applicability of our approach, to heterostructures lacking a bulk spectral gap. Overall, our framework serves as an efficient tool for elucidating fragile topology, offering guidance for the prediction and discovery of correlated phases in both crystalline and aperiodic materials.

Lee, Ki Young [Sandia National Laboratories (SNL-N↗