Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “HAMILTONIANS”

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 37 records · Page 2

Lie–Poisson Neural Networks (LPNets): Data-based computing of Hamiltonian systems with symmetries

An accurate data-based prediction of the long-term evolution of Hamiltonian systems requires a network that preserves the appropriate structure under each time step. Every Hamiltonian system contains two essential ingredients: the Poisson bracket and the Hamiltonian. Hamiltonian systems with symmetries, whose paradigm examples are the Lie–Poisson systems, have been shown to describe a broad category of physical phenomena, from satellite motion to underwater vehicles, fluids, geophysical applications, complex fluids, and plasma physics. The Poisson bracket in these systems comes from the symmetries, while the Hamiltonian comes from the underlying physics. We view the symmetry of the system as primary, hence the Lie–Poisson bracket is known exactly, whereas the Hamiltonian is regarded as coming from physics and is considered not known, or known approximately. Using this approach, we develop a network based on transformations that exactly preserve the Poisson bracket and the special functions of the Lie–Poisson systems (Casimirs) to machine precision. We present two flavors of such systems: one, where the parameters of transformations are computed from data using a dense neural network (LPNets), and another, where the composition of transformations is used as building blocks (G-LPNets). We also show how to adapt these methods to a larger class of Poisson brackets. We apply the resulting methods to several examples, such as rigid body (satellite) motion, underwater vehicles, a particle in a magnetic field, and others. The methods developed in this paper are important for the construction of accurate data-based methods for simulating the long-term dynamics of physical systems.

Data-based modeling↗

A canonical Hamiltonian for open quantum systems

Abstract If an open quantum system is initially uncorrelated from its environment, then its dynamics can be written in terms of a Lindblad-form master equation. The master equation is divided into a unitary piece, represented by an effective Hamiltonian, and a dissipative piece, represented by a hermiticity-preserving superoperator; however, the division of open system dynamics into unitary and dissipative pieces is non-unique. For finite-dimensional quantum systems, we resolve this non-uniqueness by specifying a norm on the space of dissipative superoperators and defining the canonical Hamiltonian to be the one whose dissipator is minimal. We show that the canonical Hamiltonian thus defined is equivalent to the Hamiltonian initially defined by Lindblad, and that it is uniquely specified by requiring the dissipator’s jump operators to be traceless, extending a uniqueness result known previously in the special case of Markovian master equations. For a system weakly coupled to its environment, we give a recursive formula for computing the canonical effective Hamiltonian to arbitrary orders in perturbation theory, which we can think of as a perturbative scheme for renormalizing the system’s bare Hamiltonian.

Physics↗

Twisted symmetric trilayer graphene: Single-particle and many-body Hamiltonians and hidden nonlocal symmetries of trilayer moiré systems with and without displacement field

Here, we derive the Hamiltonian for trilayer moiré systems with the Coulomb interaction projected onto the bands near the charge neutrality point. Motivated by the latest experimental results, we focus on the twisted symmetric trilayer graphene (TSTG) with a mirror symmetry with respect to the middle layer. We provide a full symmetry analysis of the noninteracting Hamiltonian with a perpendicular displacement field coupling the band structure made otherwise of the twisted bilayer graphene (TBG) and the high-velocity Dirac fermions, and we identify a hidden nonlocal symmetry of the problem. In the presence of this displacement field, we construct an approximate single-particle model, akin to the tripod model for TBG, capturing the essence of noninteracting TSTG. We also derive more quantitative perturbation schemes for the low-energy physics of TSTG with displacement field, obtaining the corresponding eigenstates. This allows us to obtain the Coulomb interaction Hamiltonian projected in the active band TSTG wave functions and derive the full many-body Hamiltonian of the system. We also provide an efficient parametrization of the interacting Hamiltonian. Finally, we show that the discrete symmetries at the single-particle level promote the U (2) × U (2) spin-valley symmetry to enlarged symmetry groups of the interacting problem under different limits. The interacting part of the Hamiltonian exhibits a large U (4) × U (4) × U (4) × U (4) symmetry in the chiral limit. Moreover, by identifying a symmetry which we dub spatial many-body charge conjugation, we show that the physics of TSTG is symmetric around charge neutrality.

2-dimensional systems↗

Quantum simulations in effective model spaces: Hamiltonian-learning variational quantum eigensolver using digital quantum computers and application to the Lipkin-Meshkov-Glick model

Quantum simulations offer the potential to predict the structure and dynamics of nuclear many-body systems that are beyond the capabilities of classical computing. Generally, preparing the ground state of strongly-interacting many-body systems relevant to nuclear physics is however inefficient, even using ideal quantum computers. In addition, currently available NISQ-era quantum devices possess modest numbers of qubits, limiting the size of quantum many-body systems that can be simulated. In this context, a reformulation of the quantum many-body problems using truncated model spaces and Hamiltonians is desirable to make them more amenable to near-term quantum computers. The importance of symmetries in low-energy theories, including effective field theories (EFTs), lattice quantum chromodynamics (QCD), and effective model spaces for nuclear systems, in particular their interplay with the reduction of active Hilbert spaces, is well known. Lesser known is the fact that the non-commutivity of some symmetries and truncations of the model space can be profitably combined with variational calculations to rearrange the entanglement into localized structures and enable more efficient simulations. Here, the goal of the present study is to explore and utilize the non-commutivity of symmetries and model-space truncations of quantum many-body systems important to nuclear physics, particularly in combination with variational algorithms for quantum simulations and effective Hamiltonian learning. We introduce an iterative hybrid classical-quantum algorithm, Hamiltonian learning variational quantum eigensolver (HL-VQE), that simultaneously optimizes an effective Hamiltonian, thereby rearranging entanglement into the effective model space, and the associated ground-state wavefunction. Quantum simulations, using classical computers and IBM's superconducting-qubit quantum computers, are performed to demonstrate the HL-VQE algorithm, in the context of the Lipkin-Meshkov-Glick (LMG) model of interacting fermions, where the Hamiltonian transformation corresponds to an orbital rotation. We use a mapping where the number of qubits scales with the $\log$ of the size of the effective model space, rather than the particle number. HL-VQE is found to provide an exponential improvement in LMG-model calculations of the ground-state energy and wavefunction, compared to naive truncations without Hamiltonian learning, throughout a significant fraction of the Hilbert space. In the context of EFT, this corresponds to counterterms scaling exponentially with the cut-off as opposed to power law. Implementations on IBM's QExperience quantum computers and simulators for 1- and 2-qubit effective model spaces are shown to provide accurate and precise results, reproducing classical predictions. For a range of parameters defining the LMG model, the HL-VQE algorithm is found to have better scaling of quantum resources requirements than previously explored algorithms. In particular, the HL-VQE scales efficiently over a large fraction of the model space, in contrast to VQE alone. This work constitutes a step in the development of entanglement-driven quantum algorithms for descriptions of nuclear many-body systems. This, in part, leverages the potential of noisy intermediate-scale quantum (NISQ) devices. The exponential scaling of counterterms observed in this study suggests the possibility of more general applicability to other non-perturbative EFTs.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Machine learning a molecular Hamiltonian for predicting electron dynamics

We develop a computational method to learn a molecular Hamiltonian matrix from matrix-valued time series of the electron density. As we demonstrate for three small molecules, the resulting Hamiltonians can be used for electron density evolution, producing highly accurate results even when propagating 1,000 time steps beyond the training data. As a more rigorous test, we use the learned Hamiltonians to simulate electron dynamics in the presence of an applied electric field, extrapolating to a problem that is beyond the field-free training data. We find that the resulting electron dynamics predicted by our learned Hamiltonian are in close quantitative agreement with the ground truth. Our method relies on combining a reduced-dimensional, linear statistical model of the Hamiltonian with a time-discretization of the quantum Liouville equation within time-dependent Hartree Fock theory. In conclusion, we train the model using a least-squares solver, avoiding numerous, CPU-intensive optimization steps. For both field-free and field-on problems, we quantify training and propagation errors, highlighting areas for future development.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Hartree–Fock–Bogoliubov theory for number-parity-violating fermionic Hamiltonians

It is usually asserted that physical Hamiltonians for fermions must contain an even number of fermion operators. This is indeed true in electronic structure theory. However, when the Jordan–Wigner (JW) transformation is used to map physical spin Hamiltonians to Hamiltonians of spinless fermions, terms that contain an odd number of fermion operators may appear. The resulting fermionic Hamiltonian thus does not have number parity symmetry and requires wave functions that do not have this symmetry either. In this work, we discuss the extension of standard Hartree–Fock–Bogoliubov (HFB) theory to the number-parity-nonconserving case. These ideas had appeared in the literature before but, perhaps for lack of practical applications, had, to the best of our knowledge, never been employed. We here present a useful application for this more general HFB theory based on coherent states of the SO(2M + 1) Lie group, where M is the number of orbitals. Here, we also show how using these unusual mean-field states can provide significant improvements when studying the JW transformation of chemically relevant spin Hamiltonians.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum simulation of second-quantized Hamiltonians in compact encoding

We describe methods for simulating general second-quantized Hamiltonians using the compact encoding, in which qubit states encode only the occupied modes in physical occupation number basis states. These methods apply to second-quantized Hamiltonians composed of a constant number of interactions, i.e., linear combinations of ladder operator monomials of fixed form. Compact encoding leads to qubit requirements that are optimal up to logarithmic factors. Here, we show how to use sparse Hamiltonian simulation methods for second-quantized Hamiltonians in compact encoding, give explicit implementations for the required oracles, and analyze the methods. We also describe several example applications including the free boson and fermion theories, the φ 4 -theory, and the massive Yukawa model, all in both equal-time and light-front quantization. Our methods provide a general-purpose tool for simulating second-quantized Hamiltonians, with optimal or near-optimal scaling with error and model parameters.

97 MATHEMATICS AND COMPUTING↗

Large classes of quantum scarred Hamiltonians from matrix product states

Motivated by the existence of exact many-body quantum scars in the Affleck-Kennedy-Lieb-Tasaki (AKLT) chain, in this work we explore the connection between matrix product state (MPS) wave functions and many-body quantum scarred Hamiltonians. We provide a method to systematically search for and construct parent Hamiltonians with towers of exact eigenstates composed of quasiparticles on top of an MPS wave function. These exact eigenstates have low entanglement in spite of being in the middle of the spectrum, thus violating the strong eigenstate thermalization hypothesis. Using our approach, we recover the AKLT chain starting from the MPS of its ground state, and we derive the most general nearest-neighbor Hamiltonian that shares the AKLT quasiparticle tower of exact eigenstates. We further apply this formalism to other simple MPS wave functions, and derive families of Hamiltonians that exhibit AKLT-like quantum scars. As a consequence, we also construct a scar-preserving deformation that connects the AKLT chain to the integrable spin-1 pure biquadratic model. Finally, we also derive other families of Hamiltonians that exhibit types of exact quantum scars, including a $\textit{U}$(1)-invariant perturbed Potts model.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

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↗

Stability of PT and anti- PT -symmetric Hamiltonians with multiple harmonics

Hermitian Hamiltonians with time-periodic coefficients can be analyzed via Floquet theory, and have been extensively used for engineering Floquet Hamiltonians in standard quantum simulators. Generalized to non-Hermitian Hamiltonians, time periodicity offers avenues to engineer the landscape of Floquet quasienergies across the complex plane. We investigate two-level non-Hermitian PT and anti- PT -symmetric Hamiltonians with coefficients that have multiple harmonics using Floquet theory. By analytical and numerical calculations, we obtain their regions of stability, defined by real Floquet quasienergies, and contours of exceptional point (EP) degeneracies. We extend our analysis to study the phases that accompany these cyclic changes with the biorthogonality approach. Our results demonstrate that these time-periodic Hamiltonians generate a rich landscape of stable (real) and unstable (complex) regions. Published by the American Physical Society 2024

Cen, Julia (ORCID:0000000299353943)↗

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↗

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

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

K-Spin Hamiltonian for Quantum-Resolvable Markov Decision Processes

The Markov decision process is the mathematical formalization underlying the modern field of reinforcement learning when transition and reward functions are unknown. We derive a pseudo-Boolean cost function that is equivalent to a K-spin Hamiltonian representation of the discrete, finite, discounted Markov decision process with infinite horizon. This K-spin Hamiltonian furnishes a starting point from which to solve for an optimal policy using heuristic quantum algorithms such as adiabatic quantum annealing and the quantum approximate optimization algorithm on near-term quantum hardware. In arguing that the variational minimization of our Hamiltonian is approximately equivalent to the Bellman optimality condition for a prevalent class of environments we establish an interesting analogy with classical field theory. Along with proof-of-concept calculations to corroborate our formulation by simulated and quantum annealing against classical Q-Learning, we analyze the scaling of physical resources required to solve our Hamiltonian on quantum hardware.

Hamiltonian↗

Efficient Bayesian inference with latent Hamiltonian neural networks in No-U-Turn Sampling

When sampling for Bayesian inference, one popular approach in the computational field is to use Hamiltonian Monte Carlo (HMC) and specifically the No-U-Turn Sampler (NUTS), which automatically decides the end time of the Hamiltonian trajectory. However, HMC and NUTS can require numerous numerical gradients of the target density and can prove slow in practice when relying on computationally expensive forward models. We propose Latent Hamiltonian neural networks (L-HNNs) with HMC and NUTS for solving Bayesian inference problems. Once trained, L-HNNs do not require numerical gradients of the target density during sampling, and hence numerous evaluations of the forward computational model. Moreover, L-HNNs satisfy important properties such as perfect time reversibility and Hamiltonian conservation, making them well-suited for use within HMC and NUTS because stationarity can be shown. We also propose the integration of L-HNNs in an online error monitoring scheme, in which numerical gradients of the target density are used for a few samples whenever the L-HNNs prediction errors are large. This online error monitor scheme prevents sample degeneracy in regions of low probability density and ensures robust uncertainty quantification. We demonstrate L-HNNs in NUTS with online error monitoring on several analytical examples involving complex, heavy-tailed, and high-local-curvature probability densities. We then demonstrate the applicability of L-HNNs in NUTS to two computational case studies, namely the Allen-Cahn stochastic partial differential equation and an elliptic partial differential equation with 25 and 50 inference parameters, respectively. Overall, the L-HNNs in NUTS with online error monitoring satisfactorily inferred these probability densities. In conclusion, compared to traditional NUTS, L-HNNs in NUTS with online error monitoring required 1–2 orders of magnitude fewer numerical gradients of the target density and improved the effective sample size (ESS) per gradient (which is a measure of both the sampling quality and the computational expense) by an order of magnitude.

97 MATHEMATICS AND COMPUTING↗

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↗

New basis for Hamiltonian SU(2) simulations

Due to rapidly improving quantum computing hardware, Hamiltonian simulations of relativistic lattice field theories have seen a resurgence of attention. This computational tool requires turning the formally infinite-dimensional Hilbert space of the full theory into a finite-dimensional one. For gauge theories, a widely used basis for the Hilbert space relies on the representations induced by the underlying gauge group, with a truncation that keeps only a set of the lowest dimensional representations. This works well at large bare gauge coupling, but becomes less efficient at small coupling, which is required for the continuum limit of the lattice theory. In this work, we develop a new basis suitable for the simulation of an SU(2) lattice gauge theory in the maximal tree gauge. In particular, we show how to perform a Hamiltonian truncation so that the eigenvalues of both the magnetic and electric gauge-fixed Hamiltonian are mostly preserved, which allows for this basis to be used at all values of the coupling. Little prior knowledge is assumed, so this may also be used as an introduction to the subject of Hamiltonian formulations of lattice gauge theories. Published by the American Physical Society 2024

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Defining quantum-ready primitives for hybrid HPC-QC supercomputing: a case study in Hamiltonian simulation

As computational demands in scientific applications continue to rise, hybrid high-performance computing (HPC) systems integrating classical and quantum computers (HPC-QC) are emerging as a promising approach to tackling complex computational challenges. One critical area of application is Hamiltonian simulation, a fundamental task in quantum physics and other large-scale scientific domains. This paper investigates strategies for quantum-classical integration to enhance Hamiltonian simulation within hybrid supercomputing environments. By analyzing computational primitives in HPC allocations dedicated to these tasks, we identify key components in Hamiltonian simulation workflows that stand to benefit from quantum acceleration. To this end, we systematically break down the Hamiltonian simulation process into discrete computational phases, highlighting specific primitives that could be effectively offloaded to quantum processors for improved efficiency. Our empirical findings provide insights into system integration, potential offloading techniques, and the challenges of achieving seamless quantum-classical interoperability. We assess the feasibility of quantum-ready primitives within HPC workflows and discuss key barriers such as synchronization, data transfer latency, and algorithmic adaptability. These results contribute to the ongoing development of optimized hybrid solutions, advancing the role of quantum-enhanced computing in scientific research.

97 MATHEMATICS AND COMPUTING↗