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 541 records · Page 30
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Quantum-Inspired Bayesian Sampling for Uncertainty Quantification and Machine Learning (Final Technical Report)

With increasing simulation and measurement data, machine learning and artificial intelligence have been widely used in computational decision-making of complex engineering systems. The resulting tools, such as uncertainty quantification solvers, reinforcement learning, and physics-informed machine learning, have achieved great success in critical DOE tasks such as material discovery and design, energy system modeling and control, and numerical weather and climate prediction. A core topic in scientific machine learning and artificial intelligence is Bayesian inference: given an observed data set, people want to estimate the posterior distribution of a (possibly large) number of hidden parameters. Due to the flexibility and weak assumptions, Bayesian sampling has been the mainstream Bayesian inference solvers despite the rapid progress of approximate Bayesian inference. Classical Bayesian sampling methods such as Markov-chain Monte Carlo suffer from a low-acceptance rate due to the random walk nature, therefore state-of-the-art techniques use Hamiltonian Monte Carlo and its variants to efficiently draw posterior samples in a high dimension. The key idea of Hamiltonian Monte Carlo and its variants is to simulate the Hamiltonian dynamics of a classical particle with a fixed mass, and their performance significantly degrades when the posterior distribution is highly spiky or has multiple modes. Leveraging the idea of quantum physics, this project has investigated new theory, algorithms and applications of Bayesian inference (especially Bayesian sampling). The main results include: (1) novel quantum-inspired Bayesian sampling methods that can lead to better accuracy for challenging multi-modal or spiky distributions, (2) more scalable machine learning framework leveraging tensor-compressed Bayesian inference, and (3) Bayesian and sampling approaches for verifying the robustness of continuous and binary neural networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Zero and Finite Temperature Quantum Simulations Powered by Quantum Magic

We introduce a quantum information theory-inspired method to improve the characterization of many-body Hamiltonians on near-term quantum devices. We design a new class of similarity transformations that, when applied as a preprocessing step, can substantially simplify a Hamiltonian for subsequent analysis on quantum hardware. By design, these transformations can be identified and applied efficiently using purely classical resources. In practice, these transformations allow us to shorten requisite physical circuit-depths, overcoming constraints imposed by imperfect near-term hardware. Importantly, the quality of our transformations is t u n a b l e : we define a 'ladder' of transformations that yields increasingly simple Hamiltonians at the cost of more classical computation. Using quantum chemistry as a benchmark application, we demonstrate that our protocol leads to significant performance improvements for zero and finite temperature free energy calculations on both digital and analog quantum hardware. Specifically, our energy estimates not only outperform traditional Hartree-Fock solutions, but this performance gap also consistently widens as we tune up the quality of our transformations. In short, our quantum information-based approach opens promising new pathways to realizing useful and feasible quantum chemistry algorithms on near-term hardware.

Physics↗
DOE OSTI2022

Fock-Space Schrieffer–Wolff Transformation: Classically-Assisted Rank-Reduced Quantum Phase Estimation Algorithm

We present an extension of many-body downfolding methods to reduce the resources required in the quantum phase estimation (QPE) algorithm. In this paper, we focus on the Schrieffer–Wolff (SW) transformation of the electronic Hamiltonians for molecular systems that provides significant simplifications of quantum circuits for simulations of quantum dynamics. We demonstrate that by employing Fock-space variants of the SW transformation (or rank-reducing similarity transformations (RRST)) one can significantly increase the locality of the qubit-mapped similarity-transformed Hamiltonians. The practical utilization of the SW-RRST formalism is associated with a series of approximations discussed in the manuscript. In particular, amplitudes that define RRST can be evaluated using conventional computers and then encoded on quantum computers. The SW-RRST QPE quantum algorithms can also be viewed as an extension of the standard state-specific coupled-cluster downfolding methods to provide a robust alternative to the traditional QPE algorithms to identify the ground and excited states for systems with various numbers of electrons using the same Fock-space representations of the downfolded Hamiltonian. The RRST formalism serves as a design principle for developing new classes of approximate schemes that reduce the complexity of quantum circuits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Dimension Reduction and Redundancy Removal through Successive Schmidt Decompositions

Quantum computers are believed to have the ability to process huge data sizes, which can be seen in machine learning applications. In these applications, the data, in general, are classical. Therefore, to process them on a quantum computer, there is a need for efficient methods that can be used to map classical data on quantum states in a concise manner. On the other hand, to verify the results of quantum computers and study quantum algorithms, we need to be able to approximate quantum operations into forms that are easier to simulate on classical computers with some errors. Motivated by these needs, in this paper, we study the approximation of matrices and vectors by using their tensor products obtained through successive Schmidt decompositions. We show that data with distributions such as uniform, Poisson, exponential, or similar to these distributions can be approximated by using only a few terms, which can be easily mapped onto quantum circuits. The examples include random data with different distributions, the Gram matrices of iris flower, handwritten digits, 20newsgroup, and labeled faces in the wild. Similarly, some quantum operations, such as quantum Fourier transform and variational quantum circuits with a small depth, may also be approximated with a few terms that are easier to simulate on classical computers. Furthermore, we show how the method can be used to simplify quantum Hamiltonians: In particular, we show the application to randomly generated transverse field Ising model Hamiltonians. The reduced Hamiltonians can be mapped into quantum circuits easily and, therefore, can be simulated more efficiently.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Variational Quantum Circuits to Prepare Low Energy Symmetry States

We explore how to build quantum circuits that compute the lowest energy state corresponding to a given Hamiltonian within a symmetry subspace by explicitly encoding it into the circuit. We create an explicit unitary and a variationally trained unitary that maps any vector output by ansatz A(α → ) from a defined subspace to a vector in the symmetry space. The parameters are trained varitionally to minimize the energy, thus keeping the output within the labelled symmetry value. The method was tested for a spin XXZ Hamiltonian using rotation and reflection symmetry and H 2 Hamiltonian within S z = 0 subspace using S 2 symmetry. We have found the variationally trained unitary gives good results with very low depth circuits and can thus be used to prepare symmetry states within near term quantum computers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Improved Statistical Analysis for the Neutrinoless Double-Beta Decay Matrix Element of 136Xe

Neutrinoless double beta decay nuclear matrix element (M0ν) for 136Xe was recently analyzed using a statistical approach (Phys. Rev. C 107, 045501 (2023)). In the analysis, three initial shell model effective Hamiltonians were randomly altered, and their results for 23 measured observables were used to infer credibility for the M0ν nuclear matrix element (NME) based on a Bayesian Model Averaging approach. In that analysis, a reasonable Gamow-Teller quenching factor of 0.7 was assumed for each starting effective Hamiltonian. Given that the result of the statistical analysis was sensible to this choice, we are here improving that analysis by assuming that the Gamow-Teller quenching factor is also randomly chosen within reasonabe limits for all three starting Hamiltonians. The outcomes are slightly higher expectation values and uncertainties for the M0ν NME.

Astronomy & Astrophysics↗
NASA NTRS1972

Charged particle motion in the vicinity of a neutral plane

The motion of a charged particle in a 2-dimensional neutral sheet with linear magnetic field variation is analyzed by Hamiltonian methods. From the basic Hamiltonian formulation, results of Sonnerup are recovered and given intuitive interpretation. The transformed Hamiltonian is used to derive the correct frequency of oscillation and serves as the basis of analytical treatment of perturbed versions of the motion, e.g. with electric field added. For 2-dimensional fields with slightly differing configurations - in particular, with added small field component orthogonal to the sheet, with an X-type null or with a chain of null points - two alternative methods are developed, reducing the problem either to motion in a 2-dimensional potential or to a pair of coupled oscillators.

Stern, D.↗
NASA NTRS1972

Redundancy of constraints in the classical and quantum theories of gravitation.

It is shown that in Dirac's version of the quantum theory of gravitation, the Hamiltonian constraints are greatly redundant. If the Hamiltonian constraint condition is satisfied at one point on the underlying, closed three-dimensional manifold, then it is automatically satisfied at every point, provided only that the momentum constraints are everywhere satisfied. This permits one to replace the usual infinity of Hamiltonian constraints by a single condition which may be taken in the form of an integral over the manifold. Analogous theorems are given for the classical Einstein Hamilton-Jacobi equations.

Moncrief, V.↗
NASA NTRS1972

An EPR investigation of the dynamic Jahn-Teller effect in SrCl2:y(2 plus) and SrCl2:Sc(2 plus)

EPR spectra have been observed for SrCl2:Y(2+) and SrCl2:Sc(2+) at liquid helium temperatures. At 1.2 K the spectra were dominated by anisotropic hyperfine patterns whose lineshapes and angular dependences were explained using second order solutions of the effective Hamiltonian for an isolated 2Eg state split by large random internal strains. Pronounced asymmetries in some of the strin produced lineshapes for Srcl2:Sc(2+) are shown to result from second order terms in the solution of the effective Hamiltonian. Coexisting with the anisotropic hyperfine patterns are weak nearly isotropic hyperfine patterns with typical lineshapes. Variations in the apparent intensity of lines in these weak hyperfine patterns as functions of the applied magnetic field direction and temperature imply that these lines result from averaging by vibronic relaxation of a portion of the anisotropic pattern. The effective Hamiltonian parameters for SrCl2:La(2+), SrCl2:y(2+), and SrCl2:SC(2+) are analyzed in terms of crystal field theory modified to include a dynamic Jahn-Teller effect.

Herrington, J. R.↗
NASA NTRS1989

Three-electron atoms from a Bethe-Salpeter equation approach

The two-electron Bethe-Salpeter equation is reviewed. The transition to a Hamiltonian form is discussed, and the criterion that the first-order energy shift vanish is used to determine the electron-electron potential that appears in the Hamiltonian. A similar program is carried through for the three-electron case. The fundamental idea of Feldman and Fulton is used for the transition to the Hamiltonian form, although some changes are necessary. The optimum two-electron interaction is the same as that in the two-electron case.

Mittleman, Marvin H.↗
NASA NTRS1993

On a Lagrange-Hamilton formalism describing position and momentum uncertainties

According to Heisenberg's uncertainty relation, in quantum mechanics it is not possible to determine, simultaneously, exact values for the position and the momentum of a material system. Calculating the mean value of the Hamiltonian operator with the aid of exact analytic Gaussian wave packet solutions, these uncertainties cause an energy contribution additional to the classical energy of the system. For the harmonic oscillator, e.g., this nonclassical energy represents the ground state energy. It will be shown that this additional energy contribution can be considered as a Hamiltonian function, if it is written in appropriate variables. With the help of the usual Lagrange-Hamilton formalism known from classical particle mechanics, but now considering this new Hamiltonian function, it is possible to obtain the equations of motion for position and momentum uncertainties.

Schuch, Dieter↗
NASA NTRS1994

Understanding squeezing of quantum states with the Wigner function

The Wigner function is argued to be the only natural phase space function evolving classically under quadratic Hamiltonians with time-dependent bilinear part. This is used to understand graphically how certain quadratic time-dependent Hamiltonians induce squeezing of quantum states. The Wigner representation is also used to generalize Ehrenfest's theorem to the quantum uncertainties. This makes it possible to deduce features of the quantum evolution, such as squeezing, from the classical evolution, whatever the Hamiltonian.

Royer, Antoine↗
NASA NTRS2005

Research on Spectroscopy, Opacity, and Atmospheres

I propose to continue providing observers with basic data for interpreting spectra from stars, novas, supernovas, clusters, and galaxies. These data will include allowed and forbidden line lists, both laboratory and computed, for the first five to ten ions of all atoms and for all relevant diatomic molecules. I will eventually expand to all ions of the first thirty elements to treat far UV and X-ray spectra, and for envelope opacities. I also include triatomic molecules provided by other researchers. I have also made CDs with Partridge and Schwenke's water data for work on UV stars. The line data also serve as input to my model atmosphere and synthesis programs that generate energy distributions, photometry, limb darkening, and spectra that can be used for planning observations and for fitting observed spectra. The spectrum synthesis programs produce detailed plots with the lines identified. Grids of stellar spectra can be used for radial velocity-, rotation-, or abundance templates and for population synthesis. I am fitting spectra of bright stars to test the data and to produce atlases to guide observers. For each star the whole spectrum is computed from the UV to the far IR. The line data, opacities, models, spectra, and programs are freely distributed on CDs and on my Web site and represent a unique resource for many NASA programs. I am now in full production of new line lists for atoms. I am computing all ions of all elements from H to Zn and the first 5 ions of all the heavier elements, about 800 ions. For each ion I treat as many as 61 even and 61 odd configurations, computing all energy levels and eigenvectors. The Hamiltonian is determined from a scaled-Hartree-Fock starting guess by least squares fitting the observed energy levels. The average energy of each configuration is used in computing scaled-Thomas-Fermi-Dirac wavefunctions for each configuration which in turn are used to compute allowed and forbidden transition integrals. These are multiplied into the LS allowed and forbidden transition arrays. The transition arrays are transformed to the observed coupling to yield the allowed and forbidden line lists. Results are put on the web as they are finished. Provided I get funding,there will be more than 500 million lines. I will then compare ion by ion, to all the laboratory and computed data in the literature and make up a working line list for spectrum synthesis and opacity calculations with the best available data. As the laboratory spectrum analyses are improved, I will redo the calculations with the new energy levels. My original plan when I started the new calculations was to run through all the atoms using my old Cray programs from the 1980's that were limited to 1100 x 1100 arrays in the Hamiltonian for each J. Then I would go back and rerun the more complicated cases with 3000 x 3000 arrays so that I could include many more configurations and more configuration interactions. At present I am limited to 61 even and 61 odd configurations and I try to include everything up through n = 9. The current program runs on Alpha workstations. I decided to test the big program on Fe I and Fe II to see whether there was any great difference in the low configurations compared to those from the Cray program. Besides increasing the number of E1 lines by a factor of 6 to 7.7 million, there was an unexpected result: the electric quadrupole transitions were 10 times stronger than before because the transition integrals are weighted by r(exp 2) ---they become very large for high n, and because there are numerous configuration interactions that mix the low and high configurations. As a check I was able to reproduce Carstang's (1962) lower results by running his three configurations with my program. Since my model atom is still only a subset of a real Fe II ion, the true quadrupole A values are probably larger than mine. The magnetic dipole lines are affected by the mixing but the overall scale does not change. Because of this scovery I decided that there was no point in computing the small array cases. I have been running with as many configurations as I can and with thousands of parameters in the Hamiltonian. The computer runs take much longer to set up and produce than I had expected. I have concentrated on redoing the low iron group spectra, especially to get data for supernova modelers. I have done only Ca I -- Zn I, Ca II -- Zn II, CU I -- Cu XXIX, Zn I - Zn XXX, for practice at high stages of ionization, C I, C II, S I, and CL I and Ag I for people who were working on the laboratory spectra. Check my web site kurucz.harvard.edu for current additions. My latest calculations have been for carbon I and sulphur I, and silicon I is under way using the same elaborate approach as for C I, which took many months to do. These line lists greatly increase the number of lines in the ultraviolet, in the visible, and especially in the infrared. They will increase the opacity in A, F, and G stars. They will account for many unidentified lines in the sun.

Kurucz, Robert L.↗
NASA NTRS1997

Numerical Schemes for the Hamilton-Jacobi and Level Set Equations on Triangulated Domains

Borrowing from techniques developed for conservation law equations, numerical schemes which discretize the Hamilton-Jacobi (H-J), level set, and Eikonal equations on triangulated domains are presented. The first scheme is a provably monotone discretization for certain forms of the H-J equations. Unfortunately, the basic scheme lacks proper Lipschitz continuity of the numerical Hamiltonian. By employing a virtual edge flipping technique, Lipschitz continuity of the numerical flux is restored on acute triangulations. Next, schemes are introduced and developed based on the weaker concept of positive coefficient approximations for homogeneous Hamiltonians. These schemes possess a discrete maximum principle on arbitrary triangulations and naturally exhibit proper Lipschitz continuity of the numerical Hamiltonian. Finally, a class of Petrov-Galerkin approximations are considered. These schemes are stabilized via a least-squares bilinear form. The Petrov-Galerkin schemes do not possess a discrete maximum principle but generalize to high order accuracy.

Barth, Timothy J.↗
NASA NTRS2017

The Quantum Approximation Optimization Algorithm for MaxCut: A Fermionic View

Farhi et al. recently proposed a class of quantum algorithms, the Quantum Approximate Optimization Algorithm (QAOA), for approximately solving combinatorial optimization problems. A level-p QAOA circuit consists of steps in which a classical Hamiltonian, derived from the cost function, is applied followed by a mixing Hamiltonian. The 2p times for which these two Hamiltonians are applied are the parameters of the algorithm. As p increases, however, the parameter search space grows quickly. The success of the QAOA approach will depend, in part, on finding effective parameter-setting strategies. Here, we analytically and numerically study parameter setting for QAOA applied to MAXCUT. For level-1 QAOA, we derive an analytical expression for a general graph. In principle, expressions for higher p could be derived, but the number of terms quickly becomes prohibitive. For a special case of MAXCUT, the Ring of Disagrees, or the 1D antiferromagnetic ring, we provide an analysis for arbitrarily high level. Using a Fermionic representation, the evolution of the system under QAOA translates into quantum optimal control of an ensemble of independent spins. This treatment enables us to obtain analytical expressions for the performance of QAOA for any p. It also greatly simplifies numerical search for the optimal values of the parameters. By exploring symmetries, we identify a lower-dimensional sub-manifold of interest; the search effort can be accordingly reduced. This analysis also explains an observed symmetry in the optimal parameter values. Further, we numerically investigate the parameter landscape and show that it is a simple one in the sense of having no local optima.

quantum algorithm↗
NASA NTRS2018

XY vs X Mixer in Quantum Alternating Operator Ansatz for Optimization Problems with Constraints

Quantum Approximate Optimization Algorithm, further generalized as Quantum Alternating Operator Ansatz (QAOA), is a family of algorithms for combinatorial optimization problems. It is a leading candidate to run on emerging universal quantum computers to gain insight into quantum heuristics. In constrained optimization, penalties are often introduced so that the ground state of the cost Hamiltonian encodes the solution (a standard practice in quantum annealing). An alternative is to choose a mixing Hamiltonian such that the constraint corresponds to a constant of motion and the quantum evolution stays in the feasible subspace. Better performance of the algorithm is speculated due to a much smaller search space. We consider problems with a constant Hamming weight as the constraint. We also compare different methods of generating the generalized W-state, which serves as a natural initial state for the Hamming-weight constraint. Using graph-coloring as an example, we compare the performance of using XY model as a mixer that preserves the Hamming weight with the performance of adding a penalty term in the cost Hamiltonian.

quantum computing↗
DOE OSTI2022

Time Evolution in Quantum Cosmology

The quantum description of time evolution in non-linear gravitational systems such as cosmological space-times is not well understood. We show, in the simplified setting of mini-superspace, that time evolution of this system can be obtained using a gauge fixed path integral, as long as one does not integrate over proper time. Using this gauge fixed action we can construct a Hamiltonian in the coherent - or classical - state basis. We show that by construction the coherent states satisfy the classical dynamical equations of General Relativity. They do not satisfy the Hamiltonian constraint. A consequence of this is that the Wheeler-DeWitt equation should not be satisfied in quantum gravity. Classical states have a natural non-trivial time evolution since they are not eigenstates of the Hamiltonian. A general feature of the unconstrained quantum theory of gravity is the prediction of a pressureless dark matter component of either sign energy density in the classical universe which may lead to novel phenomenology.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

Component-Level Inverse Design of Transmon Qubits Using Neural Networks

Designing a superconducting qubit to realize specific Hamiltonian parameters typically requires iterating through a time and compute-intensive forward loop in which the designer chooses a layout geometry, simulates it, extracts circuit parameters such as capacitances, and refines the geometry. We study the inverse version of this task using a neural-network workflow that maps target Hamiltonian parameters directly to component-level layout parameters, which we subsequently demonstrate on a planar transmon layout. During training, we pair the inverse model with a frozen forward surrogate model and evaluate the loss in Hamiltonian space rather than in layout-parameter space. In validation against a conventional EM solver, 97% of generated designs produce usable geometries, and the inverse-plus-surrogate pipeline reaches mean percent errors of 0.73% for qubit frequency and 1.58% for anharmonicity, comparable to or below the fabrication and simulation-to-measurement uncertainty expected for academic-process transmon devices of this type. A single pipeline query takes ~60 ms on CPU, versus ~2 min for a conventional EM capacitance extraction on the same hardware, a speedup of approximately 2,000x. Batching minimizes the AI model inference overhead, reducing the runtime to 3.1 microseconds per sample on CPU and 2.6 microseconds per sample on GPU at a batch size of 2048, resulting in speedups of 3.9 x 10^7 and 4.6 x 10^7, respectively, relative to a single conventional CPU EM extraction. Our results indicate that component-level inverse design usefully extends and complements conventional EM simulation, including for small datasets on the order of 1,000 samples.

Seidel, Olivia [Fermilab; Texas U., Arlington]↗