Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Hamiltonian graph”

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

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 OSTI2025

Materials Graph Library (MatGL), an open-source graph deep learning library for materials science and chemistry

Graph deep learning models, which incorporate a natural inductive bias for atomic structures, are of immense interest in materials science and chemistry. Here, we introduce the Materials Graph Library (MatGL), an open-source graph deep learning library for materials science and chemistry. Built on top of the popular Deep Graph Library (DGL) and Python Materials Genomics (Pymatgen) packages, MatGL is designed to be an extensible “batteries-included” library for developing advanced model architectures for materials property predictions and interatomic potentials. At present, MatGL has efficient implementations for both invariant and equivariant graph deep learning models, including the Materials 3-body Graph Network (M3GNet), MatErials Graph Network (MEGNet), Crystal Hamiltonian Graph Network (CHGNet), TensorNet and SO3Net architectures. MatGL also provides several pre-trained foundation potentials (FPs) with coverage of the entire periodic table, and property prediction models for out-of-box usage, benchmarking and fine-tuning. Finally, MatGL integrates with PyTorch Lightning to enable efficient model training.

chemistry↗
DOE OSTI2021

Spectra of perfect state transfer Hamiltonians on fractal-like graphs

Abstract In this paper we study the spectral features, on fractal-like graphs, of Hamiltonians which exhibit the special property of perfect quantum state transfer (PQST): the transmission of quantum states without dissipation. The essential goal is to develop the theoretical framework for understanding the interplay between PQST, spectral properties, and the geometry of the underlying graph, in order to design novel protocols for applications in quantum information science. We present a new lifting and gluing construction, and use this to prove results concerning an inductive spectral structure, applicable to a wide variety of fractal-like graphs. We illustrate this construction with explicit examples for several classes of diamond graphs.

Physics↗
DOE OSTI2023

CHGNet as a pretrained universal neural network potential for charge-informed atomistic modelling

Large-scale simulations with complex electron interactions remain one of the greatest challenges for atomistic modelling. Although classical force fields often fail to describe the coupling between electronic states and ionic rearrangements, the more accurate ab initio molecular dynamics suffers from computational complexity that prevents long-time and large-scale simulations, which are essential to study technologically relevant phenomena. Here we present the Crystal Hamiltonian Graph Neural Network (CHGNet), a graph neural network-based machine-learning interatomic potential (MLIP) that models the universal potential energy surface. CHGNet is pretrained on the energies, forces, stresses and magnetic moments from the Materials Project Trajectory Dataset, which consists of over 10 years of density functional theory calculations of more than 1.5 million inorganic structures. The explicit inclusion of magnetic moments enables CHGNet to learn and accurately represent the orbital occupancy of electrons, enhancing its capability to describe both atomic and electronic degrees of freedom. We demonstrate several applications of CHGNet in solid-state materials, including charge-informed molecular dynamics in Li x MnO 2 , the finite temperature phase diagram for Li x FePO 4 and Li diffusion in garnet conductors. We highlight the significance of charge information for capturing appropriate chemistry and provide insights into ionic systems with additional electronic degrees of freedom that cannot be observed by previous MLIPs.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Effective dissipation rate in a Liouvillian-graph picture of high-temperature quantum hydrodynamics

At high temperature, generic strongly interacting spin systems are expected to display hydrodynamics: local transport of conserved quantities, governed by classical partial differential equations like the diffusion equation. I argue that the emergence of this dissipative long-wavelength dynamics from the system's unitary microscopic dynamics is controlled by the structure of the Liouvillian graph of the system's Hamiltonian, that is, the graph induced on Pauli strings by commutation with that Hamiltonian. The Liouvillian graph decomposes naturally into subgraphs of Pauli strings of constant diameter, and the coherent dynamics of these subgraphs determines the rate at which operator weight spreads to long operators. In conclusion, this argument provides a quantitative theory of the emergence of a dissipative effective dynamics from unitary microscopic dynamics; it also leads to an effective model with Hilbert space dimension linear in system size and exponential in the UV cutoff for diffusion.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Effective Gaps Are Not Effective: Quasipolynomial Classical Simulation of Obstructed Stoquastic Hamiltonians

All known examples suggesting an exponential separation between classical simulation algorithms and stoquastic adiabatic quantum computing (StoqAQC) exploit symmetries that constrain adiabatic dynamics to effective, symmetric subspaces. The symmetries produce large effective eigenvalue gaps, which in turn make adiabatic computation efficient. We present a classical algorithm to subexponentially sample from an effective subspace of any k -local stoquastic Hamiltonian H , without a priori knowledge of its symmetries (or near symmetries). Our algorithm maps any k -local Hamiltonian to a graph G = ( V , E ) with | V | = O (poly (n)) , where n is the number of qubits. Given the well-known result of Babai [Graph isomorphism in quasipolynomial time, in Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing (2016), pp. 684–697], we exploit graph isomorphism to study the automorphisms of G and arrive at an algorithm quasipolynomial in | V | for producing samples from effective subspace eigenstates of H . Our results rule out exponential separations between StoqAQC and classical computation that arise from hidden symmetries in k -local Hamiltonians. Our graph representation of H is not limited to stoquastic Hamiltonians and may rule out corresponding obstructions in nonstoquastic cases, or be useful in studying additional properties of k -local Hamiltonians.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Gauge loop-string-hadron formulation on general graphs and applications to fully gauge fixed Hamiltonian lattice gauge theory

We develop a gauge invariant, Loop-String-Hadron (LSH) based representation of SU(2) Yang-Mills theory defined on a general graph consisting of vertices and half-links. Inspired by weak coupling studies, we apply this technique to maximal tree gauge fixing. This allows us to develop a fully gauge-fixed representation of the theory in terms of LSH quantum numbers. We explicitly show how the quantum numbers in this formulation directly relate to the variables in the magnetic description. In doing so, we will also explain in detail how the Kogut-Susskind formulation, prepotentials, and point splitting work for general graphs. In the appendix of this work, we provide a self-contained exposition of the mathematical details of Hamiltonian pure gauge theories defined on general graphs.

Algorithms and Theoretical Developments↗
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 OSTI2023

Prepare Ground States of Highly Frustrated Magnetic Clusters on Quantum Computers

Solving challenging problems in physical, chemical, and materials sciences is one of the most promising applications of quantum utility that can be realized on current noisy hardware, considering (i) the direct map (encoding) from the quantum particles and their interactions to the qubits and their entangling gates and (ii) the rapidly improved quantum hardware and advanced error-mitigation techniques. Understanding quantum spin liquid in frustrated magnetic materials is a longstanding challenge in condensed matter physics and the nature of the ground-state phases is highly debated among researchers. Using IBM quantum computers with superconducting qubits, we implemented a variational quantum eigensolver (VQE) algorithm to prepare the ground states of two 12-site cluster approximations of these highly frustrated magnetic materials. The interaction graphs of the two corresponding Hamiltonians are (a) the six-pointed star graph (a unit cell of the kagome lattice) and (b) the cuboctahedral graph (the kagome on a sphere). These are also two instances of Quantum Max Cut problem. With the VQE based on the Hamiltonian variational ansatz acting on a valence bond solid initial trial state, we prepared the ground states and obtained the exact ground energy on simulator and high accuracy on noisy hardware. The deep ansatz necessary to reach the ground state of the cuboctahedral graph indicates that it is a hard instance of Quantum Max Cut.

Wang, Yan↗
DOE OSTI2021

Hamiltonian systems, Toda lattices, solitons, Lax pairs on weighted Z -graded graphs

In this study, we consider discrete one-dimensional nonlinear equations and present the procedure of lifting them to Z -graded graphs. We identify conditions that allow one to lift one-dimensional solutions to solutions on graphs. In particular, we prove the existence of solitons for static potentials on graded fractal graphs. We also show that even for a simple example of a topologically interesting graph, the corresponding non-trivial Lax pairs and associated unitary transformations do not lift to a Lax pair on the Z -graded graph.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Stability of Kuramoto networks subject to large and small fluctuations from heterogeneous and spatially correlated noise

Oscillatory networks subjected to noise are broadly used to model physical and technological systems. Due to their nonlinear coupling, such networks typically have multiple stable and unstable states that a network might visit due to noise. In this article, we focus on the assessment of fluctuations resulting from heterogeneous and spatially correlated noise inputs on Kuramoto model networks. We evaluate the typical, small fluctuations near synchronized states and connect the network variance to the overlap between stable modes of synchronization and the input noise covariance. Going beyond small to large fluctuations, we introduce the indicator mode approximation that projects the dynamics onto a single amplitude dimension. Such an approximation allows for estimating rates of fluctuations to saddle instabilities, resulting in phase slips between connected oscillators. Statistics for both regimes are quantified in terms of effective noise amplitudes that are compared and contrasted for several noise models. In conclusion, bridging the gap between small and large fluctuations, we show that a larger network variance does not necessarily lead to higher rates of large fluctuations.

42 ENGINEERING↗
DOE OSTI2020

Polaritons and excitons: Hamiltonian design for enhanced coherence

The primary questions motivating this report are: Are there ways to increase coherence and delocalization of excitation among many molecules at moderate electronic coupling strength? Coherent delocalization of excitation in disordered molecular systems is studied using numerical calculations. The results are relevant to molecular excitons, polaritons, and make connections to classical phase oscillator synchronization. In particular, it is hypothesized that it is not only the magnitude of electronic coupling relative to the standard deviation of energetic disorder that decides the limits of coherence, but that the structure of the Hamiltonian—connections between sites (or molecules) made by electronic coupling—is a significant design parameter. Inspired by synchronization phenomena in analogous systems of phase oscillators, some properties of graphs that define the structure of different Hamiltonian matrices are explored. The report focuses on eigenvalues and ensemble density matrices of various structured, random matrices. Some reasons for the special delocalization properties and robustness of polaritons in the single-excitation subspace (the star graph) are discussed. The key result of this report is that, for some classes of Hamiltonian matrix structure, coherent delocalization is not easily defeated by energy disorder, even when the electronic coupling is small compared to disorder.

Science & Technology - Other Topics↗
DOE OSTI2023

Solving MaxCut with quantum imaginary time evolution

We introduce a method to solve the MaxCut problem efficiently based on quantum imaginary time evolution (QITE). We employ a linear Ansatz for unitary updates and an initial state involving no entanglement, as well as an imaginary-time-dependent Hamiltonian interpolating between a given graph and a subgraph with two edges excised. We apply the method to thousands of randomly selected graphs with up to fifty vertices. We show that our algorithm exhibits a 93% and above performance converging to the maximum solution of the MaxCut problem for all considered graphs. Our results compare favorably with the performance of classical algorithms, such as the greedy and Goemans–Williamson algorithms. We also discuss the overlap of the final state of the QITE algorithm with the ground state as a performance metric, which is a quantum feature not shared by other classical algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Quantum Algorithm for Approximating Maximum Independent Sets

We present a quantum algorithm for approximating maximum independent sets of a graph based on quantum non-Abelian adiabatic mixing in the sub-Hilbert space of degenerate ground states, which generates quantum annealing in a secondary Hamiltonian. For both sparse and dense random graphs G , numerical simulation suggests that our algorithm on average finds an independent set of size close to the maximum size α ( G ) in low polynomial time. The best classical algorithms, by contrast, produce independent sets of size about half of α ( G ) in polynomial time.

Physics↗
DOE OSTI2024

Heisenberg-limited Hamiltonian learning for interacting bosons

We develop a protocol for learning a class of interacting bosonic Hamiltonians from dynamics with Heisenberg-limited scaling. For Hamiltonians with an underlying bounded-degree graph structure, we can learn all parameters with root mean square error ϵ using ${\mathcal{O}}(1/\epsilon )$ total evolution time, which is independent of the system size, in a way that is robust against state-preparation and measurement error. In the protocol, we only use bosonic coherent states, beam splitters, phase shifters, and homodyne measurements, which are easy to implement on many experimental platforms. A key technique we develop is to apply random unitaries to enforce symmetry in the effective Hamiltonian, which may be of independent interest.

computer science↗
DOE OSTI2020

Perfect quantum state transfer on diamond fractal graphs

In the quest for designing novel protocols for quantum information and quantum computation, an important goal is to achieve perfect quantum state transfer for systems beyond the well-known one- dimensional cases, such as 1D spin chains. Here, we use methods from fractal analysis and probability to find a new class of quantum spin chains on fractal-like graphs (known as diamond fractals) which support perfect quantum state transfer and which have a wide range of different Hausdorff and spectral dimensions. The resulting systems are spin networks combining Dyson hierarchical model structure with transverse permutation symmetries of varying order.

97 MATHEMATICS AND COMPUTING↗