Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Hamiltonian”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Simultaneous fermion and exciton condensations from a model Hamiltonian

Fermion-exciton condensation in which both fermion-pair (i.e., superconductivity) and exciton condensations occur simultaneously in a single coherent quantum state has recently been conjectured to exist. Here, we capture the fermion-exciton condensation through a model Hamiltonian that can recreate the physics of this new class of highly correlated condensation phenomena. We demonstrate that the Hamiltonian generates the large-eigenvalue signatures of fermion-pair and exciton condensations for a series of states with increasing particle numbers. The results confirm that the dual-condensate wave function arises from the entanglement of fermion-pair and exciton wave functions, which we previously predicted in the thermodynamic limit. Furthermore, this model Hamiltonian—generalizing well-known model Hamiltonians for either superconductivity or exciton condensation—can explore a wide variety of condensation behavior. It provides significant insights into the required forces for generating a fermion-exciton condensate, which will likely be invaluable for realizing such condensations in realistic materials with applications from superconductors to excitonic materials.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

Deep learning Hamiltonians from disordered image data in quantum materials

The capabilities of image probe experiments are rapidly expanding, providing new information about quantum materials on unprecedented length- and timescales. Many such materials feature inhomogeneous electronic properties with intricate pattern formation on the observable surface. This rich spatial structure contains information about interactions, dimensionality, and disorder—a spatial encoding of the Hamiltonian driving the pattern formation. Image recognition techniques from machine learning are an excellent tool for interpreting information encoded in the spatial relationships in such images. Here, we develop a deep learning framework for using the rich information available in these spatial correlations in order to discover the underlying Hamiltonian driving the patterns. We first vet the method on a known case, scanning near-field optical microscopy on a thin film of V⁢O 2 . We then apply our trained convolutional neural network architecture to new optical microscope images of a different V⁢O 2 film as it goes through the metal-insulator transition. We find that a two-dimensional Hamiltonian with both interactions and random field disorder is required to explain the intricate, fractal intertwining of metal and insulator domains during the transition. This detailed knowledge about the underlying Hamiltonian paves the way for using the model to control the pattern formation via, e.g., tailored hysteresis protocols. Finally, we also introduce a distribution-based confidence measure on the results of a multilabel classifier, which does not rely on adversarial training. In addition, we propose a machine-learning-based criterion for diagnosing a physical system's proximity to criticality.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Search for efficient formulations for Hamiltonian simulation of non-Abelian lattice gauge theories

Hamiltonian formulation of lattice gauge theories (LGTs) is the most natural framework for the purpose of quantum simulation, an area of research that is growing with advances in quantum-computing algorithms and hardware. It, therefore, remains an important task to identify the most accurate, while computationally economic, Hamiltonian formulation(s) in such theories, considering the necessary truncation imposed on the Hilbert space of gauge bosons with any finite computing resources. This paper is a first step toward addressing this question in the case of non-Abelian LGTs, which further require the imposition of non-Abelian Gauss’s laws on the Hilbert space, introducing additional computational complexity. Focusing on the case of SU(2) LGT in 1+1 dimensions coupled to one flavor of fermionic matter, a number of different formulations of the original Kogut-Susskind framework are analyzed with regard to the dependence of the dimension of the physical Hilbert space on boundary conditions, system’s size, and the cutoff on the excitations of gauge bosons. The impact of such dependencies on the accuracy of the spectrum and dynamics obtained from a Hamiltonian computation is examined, and the (classical) computational-resource requirements given these considerations are studied. Besides the well-known angular-momentum formulation of the theory, the cases of purely fermionic and purely bosonic formulations (with open boundary conditions), and the Loop-String-Hadron formulation are analyzed, along with a brief discussion of a Quantum-Link-Model formulation of the same theory. Clear advantages are found in working with the Loop-String-Hadron framework which implements non-Abelian Gauss’s laws a priori using a complete set of gauge-invariant operators. Although small lattices are studied in the numerical analysis of this work, and only the simplest algorithms are considered, a range of conclusions will be applicable to larger systems and potentially to higher dimensions. Future studies will extend this investigation to the analysis of resource requirements for quantum simulations of non-Abelian LGT, with the goal of shedding light on the most efficient Hamiltonian formulation of gauge theories of relevance in nature

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Learning Many-Body Hamiltonians with Heisenberg-Limited Scaling

Learning a many-body Hamiltonian from its dynamics is a fundamental problem in physics. Here, in this Letter, we propose the first algorithm to achieve the Heisenberg limit for learning an interacting N-qubit local Hamiltonian. After a total evolution time of $\mathscr{O}$⁡(ε –1 ), the proposed algorithm can efficiently estimate any parameter in the N-qubit Hamiltonian to ε error with high probability. Our algorithm uses ideas from quantum simulation to decouple the unknown N-qubit Hamiltonian H into noninteracting patches and learns H using a quantum-enhanced divide-and-conquer approach. The proposed algorithm is robust against state preparation and measurement error, does not require eigenstates or thermal states, and only uses polylog⁡(ε –1 ) experiments. In contrast, the best existing algorithms require $\mathscr{O}$⁡⁡(ε –2 ) experiments and total evolution time. We prove a matching lower bound to establish the asymptotic optimality of our algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Parameter estimation for X-ray scattering analysis with Hamiltonian Markov Chain Monte Carlo

Bayesian-inference-based approaches, in particular the random-walk Markov Chain Monte Carlo (MCMC) method, have received much attention recently for X-ray scattering analysis. Hamiltonian MCMC, a state-of-the-art development in the field of MCMC, has become popular in recent years. It utilizes Hamiltonian dynamics for indirect but much more efficient drawings of the model parameters. We described the principle of the Hamiltonian MCMC for inversion problems in X-ray scattering analysis by estimating high-dimensional models for several motivating scenarios in small-angle X-ray scattering, reflectivity, and X-ray fluorescence holography. Hamiltonian MCMC with appropriate preconditioning can deliver superior performance over the random-walk MCMC, and thus can be used as an efficient tool for the statistical analysis of the parameter distributions, as well as model predictions and confidence analysis.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Hamiltonian structure of 2D fluid dynamics with broken parity

Isotropic fluids in two spatial dimensions can break parity symmetry and sustain transverse stresses which do not lead to dissipation. Corresponding transport coefficients include odd viscosity, odd torque, and odd pressure. We consider an isotropic Galilean invariant fluid dynamics in the adiabatic regime with momentum and particle density conservation. We find conditions on transport coefficients that correspond to dissipationless and separately to Hamiltonian fluid dynamics. The restriction on the transport coefficients will help identify what kind of hydrodynamics can be obtained by coarse-graining a microscopic Hamiltonian system. Interestingly, not all parity-breaking transport coefficients lead to energy conservation and, generally, the fluid dynamics is energy conserving but not Hamiltonian. We show how this dynamics can be realized by imposing a nonholonomic constraint on the Hamiltonian system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Deep learning of dynamically responsive chemical Hamiltonians with semiempirical quantum mechanics

Conventional machine-learning (ML) models in computational chemistry learn to directly predict molecular properties using quantum chemistry only for reference data. While these heuristic ML methods show quantum-level accuracy with speeds several orders of magnitude faster than traditional quantum chemistry methods, they suffer from poor extensibility and transferability; i.e., their accuracy degrades on large or new chemical systems. Incorporating quantum chemistry frameworks into the ML models directly solves this problem. Here we take the structure of semiempirical quantum mechanics (SEQM) methods to construct dynamically responsive Hamiltonians. SEQM methods use empirical parameters fitted to experimental properties to construct reduced-order Hamiltonians, facilitating much faster calculations than ab initio methods but with compromised accuracy. By replacing these static parameters with machine-learned dynamic values inferred from the local environment, we greatly improve the accuracy of the SEQM methods. Trained on molecular energies and atomic forces, these dynamically generated Hamiltonian parameters show a strong correlation with atomic hybridization and bonding. Trained with only about 60,000 small organic molecular conformers, the resulting model retains interpretability, extensibility, and transferability when testing on much larger chemical systems and predicting various molecular properties. Overall, this work demonstrates the virtues of incorporating physics-based descriptions with ML to develop models that are simultaneously accurate, transferable, and interpretable.

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

Hamiltonian simulation in Zeno subspaces

Here, we investigate the quantum Zeno effect as a framework for designing and analyzing quantum algorithms for Hamiltonian simulation. We show that frequent projective measurements of an ancilla qubit register can be used to simulate quantum dynamics on a target qubit register with a circuit complexity similar to randomized approaches. The classical sampling overhead in the latter approaches is traded for ancilla qubit overhead in Zeno-based approaches. A second-order Zeno sequence is developed to improve scaling and implementations through unitary kicks are discussed. We derive rigorous error bounds that allow for identifying the associated circuit complexities for the first- and second-order Zeno sequences. We show that the circuits over the combined register can be identified as a subroutine commonly used in post-Trotter Hamiltonian simulation methods. We build on this observation to reveal connections between different Hamiltonian simulation algorithms.

Hamiltonian simulation↗
DOE OSTI2023

Bayesian Inference with Latent Hamiltonian Neural Networks (L-HNNs)

When sampling for Bayesian inference, one popular approach is to use Hamiltonian Monte Carlo (HMC) and the No-U-Turn Sampler (NUTS). However, HMC and NUTS can require numerous numerical gradients of the target density and can prove slow in practice. We propose Hamiltonian neural networks (HNNs) with HMC and NUTS for solving Bayesian inference problems [1, 2]. Once trained, HNNs do not require gradients of the target density while sampling. Moreover, they 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 an HNN extension called latent HNNs (L-HNNs), which predict latent variable outputs. Compared to HNNs, L-HNNs offer improved expressivity and a reduction in integration errors. Finally, we propose employing L-HNNs in NUTS with an online error monitoring scheme to prevent degeneracy of the sampling in regions of low probability density. We demonstrate L-HNNs in NUTS with online error monitoring by using several example cases involving complex, heavy-tailed, and high local curvature probability densities. Overall, L-HNNs in NUTS with online error monitoring satisfactorily inferred these probability densities. Compared to traditional NUTS, L-HNNs in NUTS with online error monitoring improved the effective sample size (ESS) per gradient by an order of magnitude.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Spin Waves and Magnetic Exchange Hamiltonian in CrSBr

Abstract CrSBr is an air‐stable two‐dimensional (2D) van der Waals semiconducting magnet with great technological promise, but its atomic‐scale magnetic interactions—crucial information for high‐frequency switching—are poorly understood. An experimental study is presented to determine the CrSBr magnetic exchange Hamiltonian and bulk magnon spectrum. The A ‐type antiferromagnetic order using single crystal neutron diffraction is confirmed here. The magnon dispersions are also measured using inelastic neutron scattering and rigorously fit the excitation modes to a spin wave model. The magnon spectrum is well described by an intra‐plane ferromagnetic Heisenberg exchange model with seven nearest in‐plane exchanges. This fitted exchange Hamiltonian enables theoretical predictions of CrSBr behavior: as one example, the fitted Hamiltonian is used to predict the presence of chiral magnon edge modes with a spin‐orbit enhanced CrSBr heterostructure.

2D materials↗
DOE OSTI2026

Discrete Superconvergence Analysis for Quantum Magnus Algorithms of Unbounded Hamiltonian Simulation

Motivated by various applications, unbounded Hamiltonian simulation has recently garnered great attention. Quantum Magnus algorithms, designed to achieve commutator scaling for time-dependent Hamiltonian simulation, have been found to be particularly efficient for such applications. When applied to unbounded Hamiltonian simulation in the interaction picture, they exhibit an unexpected superconvergence phenomenon. However, existing proofs are limited to the spatially continuous setting and do not extend to discrete spatial discretizations. Here, in this work, we provide the first superconvergence estimate in the fully discrete setting with a finite number of spatial discretization points N, and show that it holds with an error constant uniform in N. The proof is based on the two-parameter symbol class, which, to our knowledge, is applied for the first time in algorithm analysis. The key idea is to establish a semiclassical framework by identifying two parameters through the discretization number and the time step size rescaled by the operator norm, such that the semiclassical uniformity guarantees the uniformity of both. This approach may have broader applications in numerical analysis beyond the specific context of this work.

Borns-Weil, Yonah [University of California, Berke↗
DOE OSTI2021

Hamiltonian reduction of Vlasov–Maxwell to a dark slow manifold

In this work, we show that non-relativistic scaling of the collisionless Vlasov–Maxwell system implies the existence of a formal invariant slow manifold in the infinite-dimensional Vlasov–Maxwell phase space. Vlasov–Maxwell dynamics restricted to the slow manifold recovers the Vlasov–Poisson and Vlasov–Darwin models as low-order approximations, and provides higher-order corrections to the Vlasov–Darwin model more generally. The slow manifold may be interpreted to all orders in perturbation theory as a collection of formal Vlasov–Maxwell solutions that do not excite light waves, and are therefore ‘dark’. We provide a heuristic lower bound for the time interval over which Vlasov–Maxwell solutions initialized optimally near the slow manifold remain dark. We also show how the dynamics on the slow manifold naturally inherits a Hamiltonian structure from the underlying system. After expressing this structure in a simple form, we use it to identify a manifestly Hamiltonian correction to the Vlasov–Darwin model. The derivation of higher-order terms is reduced to computing the corrections of the system Hamiltonian restricted to the slow manifold.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Practical Hamiltonian learning with unitary dynamics and Gibbs states

We study the problem of learning the parameters for the Hamiltonian of a quantum many-body system, given limited access to the system. In this work, we build upon recent approaches to Hamiltonian learning via derivative estimation. We propose a protocol that improves the scaling dependence of prior works, particularly with respect to parameters relating to the structure of the Hamiltonian (e.g., its locality k). Furthermore, by deriving exact bounds on the performance of our protocol, we are able to provide a precise numerical prescription for theoretically optimal settings of hyperparameters in our learning protocol, such as the maximum evolution time (when learning with unitary dynamics) or minimum temperature (when learning with Gibbs states). Thanks to these improvements, our protocol has practical scaling for large problems: we demonstrate this with a numerical simulation of our protocol on an 80-qubit system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Downfolding from ab initio to interacting model Hamiltonians: comprehensive analysis and benchmarking of the DFT+cRPA approach

Abstract Model Hamiltonians are regularly derived from first principles to describe correlated matter. However, the standard methods for this contain a number of largely unexplored approximations. For a strongly correlated impurity model system, here we carefully compare a standard downfolding technique with the best possible ground-truth estimates for charge-neutral excited-state energies and wave functions using state-of-the-art first-principles many-body wave function approaches. To this end, we use the vanadocene molecule and analyze all downfolding aspects, including the Hamiltonian form, target basis, double-counting correction, and Coulomb interaction screening models. We find that the choice of target-space basis functions emerges as a key factor for the quality of the downfolded results, while orbital-dependent double-counting corrections diminish the quality. Background screening of the Coulomb interaction matrix elements primarily affects crystal-field excitations. Our benchmark uncovers the relative importance of each downfolding step and offers insights into the potential accuracy of minimal downfolded model Hamiltonians.

Chemistry↗
DOE OSTI2022

A quantum hamiltonian simulation benchmark

Hamiltonian simulation is one of the most important problems in quantum computation, and quantum singular value transformation (QSVT) is an efficient way to simulate a general class of Hamiltonians. However, the QSVT circuit typically involves multiple ancilla qubits and multi-qubit control gates. In order to simulate a certain class of n-qubit random Hamiltonians, we propose a drastically simplified quantum circuit that we refer to as the minimal QSVT circuit, which uses only one ancilla qubit and no multi-qubit controlled gates. We formulate a simple metric called the quantum unitary evolution score (QUES), which is a scalable quantum benchmark and can be verified without any need for classical computation. Under the globally depolarized noise model, we demonstrate that QUES is directly related to the circuit fidelity, and the potential classical hardness of an associated quantum circuit sampling problem. Under the same assumption, theoretical analysis suggests there exists an ‘optimal’ simulation time t opt ≈ 4.81, at which even a noisy quantum device may be sufficient to demonstrate the potential classical hardness.

97 MATHEMATICS AND COMPUTING↗
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 OSTI2025

Leveraging Hamiltonian simulation techniques to compile operations on bosonic devices

Circuit quantum electrodynamics enables the combined use of qubits and oscillator modes. Despite a variety of available gate sets, many hybrid qubit-boson (i.e. qubit-oscillator) operations are realizable only through optimal control theory, which is oftentimes intractable and uninterpretable. We introduce an analytic approach with rigorously proven error bounds for realizing specific classes of operations via two matrix product formulas commonly used in Hamiltonian simulation, the Lie–Trotter–Suzuki and Baker–Campbell–Hausdorff product formulas. We show how this technique can be used to realize a number of operations of interest, including polynomials of annihilation and creation operators, namely (a) p (a † ) q for integer p, q. We show examples of this paradigm including obtaining universal control within a subspace of the entire Fock space of an oscillator, state preparation of a fixed photon number in the cavity, simulation of the Jaynes–Cummings Hamiltonian, and simulation of the Hong-Ou-Mandel effect. This work demonstrates how techniques from Hamiltonian simulation can be applied to better control hybrid qubit-boson devices.

bosonic qubits↗
DOE OSTI2022

Simulations of frustrated Ising Hamiltonians using quantum approximate optimization

Novel magnetic materials are important for future technological advances. Theoretical and numerical calculations of ground-state properties are essential in understanding these materials, however, computational complexity limits conventional methods for studying these states. Here we investigate an alternative approach to preparing materials ground states using the quantum approximate optimization algorithm (QAOA) on near-term quantum computers. We study classical Ising spin models on unit cells of square, Shastry-Sutherland and triangular lattices, with varying field amplitudes and couplings in the material Hamiltonian. We find relationships between the theoretical QAOA success probability and the structure of the ground state, indicating that only a modest number of measurements (≲100) are needed to find the ground state of our nine-spin Hamiltonians, even for parameters leading to frustrated magnetism. We further demonstrate the approach in calculations on a trapped-ion quantum computer and succeed in recovering each ground state of the Shastry-Sutherland unit cell with probabilities close to ideal theoretical values. The results demonstrate the viability of QAOA for materials ground state preparation in the frustrated Ising limit, giving important first steps towards larger sizes and more complex Hamiltonians where quantum computational advantage may prove essential in developing a systematic understanding of novel materials.

97 MATHEMATICS AND COMPUTING↗