SEARCH · Engineering Papers

Results for “variational”

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.

SourceResearch connectionFrom yearThrough year

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

At least 235 records · Page 13

All sources NASA NTRS DOE OSTI

DOE OSTI2020

Gamma-ray spectrum variations for surface measurements of uranium hexafluoride cylinders

Here, this work aims to characterize features that contribute to the spectral variations that appear in gamma-23 ray spectra of filled uranium hexafluoride (UF 6 ) cylinders. While the enrichment of the UF 6 in a 24 cylinder can greatly affect gamma-ray spectra at peaks such as the 185.7 keV peak and be used to 25 verify enrichment, many other characteristics of a filled UF 6 cylinder can affect the spectra. These 26 characteristics vary on a per-cylinder basis and can include: the time between when a cylinder was 27 filled and when it was measured; the previous fill history of a cylinder; how the cylinder was most 28 recently filled; the UF 6 geometric distribution within the cylinder; and the measurement location 29 along the cylinder. This work explores spectral variations seen in measurement data and uses 30 validated simulation models to find trends in these uncertainties. These trends are analyzed to observe 31 how each parameter can contribute to the overall uncertainty of UF 6 spectral measurements.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2026

Variational neural network approach to QFT in the field basis

We present a variational neural network approach for solving quantum field theories in the field basis, focusing on the free Klein-Gordon model formulated in momentum space. While recent studies have explored neural-network-based variational methods for scalar field theory in position space, a systematic benchmark of the analytically solvable Klein-Gordon ground state—particularly in the momentum-space field basis—has been lacking. In this work, we represent the ground-state wavefunctional as a neural network defined on a discretized set of field configurations and train it by minimizing the Hamiltonian expectation value. This framework enables direct comparison to exact analytic results for a range of key observables, including the ground-state energy, two-point correlators, expectation value of the field, and the structure of the learned wavefunctional itself. Our results provide quantitative diagnostics of accuracy and establish a validated foundation for extending neural-network wavefunctional methods to interacting field theories and position-space formulations.

Klein-Gordon model↗

DOE OSTI2020

Noether currents for Eulerian variational principles in non-barotropic magnetohydrodynamics and topological conservations laws

We derive a Noether current for the Eulerian variational principle of ideal non-barotropic magnetohydrodynamics (MHD). It was shown previously that ideal non-barotropic MHD is mathematically equivalent to a five function field theory with an induced geometrical structure in the case that field lines cover surfaces and this theory can be described using a variational principle. Here we use various symmetries of the flow to derive topological constants of motion through the derived Noether current and discuss their implication for non-barotropic MHD.

42 ENGINEERING↗

DOE OSTI2026

An end-to-end workflow for executing a classically bootstrapped variational quantum algorithm on an academic quantum computer

Academic quantum computing platforms often face unique challenges in executing quantum workloads due to fragmented software environments and limited engineering support. Unlike commercial ecosystems, academic devices typically evolve without full-stack integration in mind, making it difficult to run complex applications—such as variational quantum algorithms (VQA)—reliably and efficiently. Issues such as incompatible software layers and lack of automated job management significantly increase the overhead of theory-experiment collaboration. To address these challenges, we develop a modular, end-to-end workflow that decouples application-layer code from low-level hardware control, automates circuit submission and result collection, and supports fine-grained circuit-level job scheduling and recovery. The architecture employs a dual-end application programming interface (API) design, enabling robust operation across unstable or resource-constrained hardware backends. For practical use, the framework is lightweight and user-friendly, allowing rapid prototyping of full-stack workflows using basic Python tools. We validate this workflow on a high-fidelity trapped-ion quantum computer by demonstrating a variational quantum eigensolver (VQE) experiment with a classically bootstrapped ansatz initialization technique. The system successfully executed over 60,000 circuits across multiple molecular test cases with minimal human intervention, highlighting the framework’s effectiveness in enabling reproducible, resilient quantum experimentation in academic settings.

Clifford↗

DOE OSTI2022

Sequential linear integer programming for integer optimal control with total variation regularization

We propose a trust-region method that solves a sequence of linear integer programs to tackle integer optimal control problems regularized with a total variation penalty. The total variation penalty implies that the considered integer control problems admit minimizers. We introduce a local optimality concept for the problem, which arises from the infinite-dimensional perspective. In the case of a one-dimensional domain of the control function, we prove convergence of the iterates produced by our algorithm to points that satisfy first-order stationarity conditions for local optimality. We demonstrate the theoretical findings on a computational example.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Excited states in variational Monte Carlo using a penalty method

Here, in this article, the authors present a technique using variational Monte Carlo to solve for excited states of electronic systems. This technique is based on enforcing orthogonality to lower energy states, which results in a simple variational principle for the excited states. Energy optimization is then used to solve for the excited states. This technique is applied to the well-characterized benzene molecule, in which ~10 000 parameters are optimized for the first 12 excited states. Agreement within ~0.2 eV is obtained with higher scaling coupled cluster methods; small disagreements with experiment are likely due to vibrational effects.

36 MATERIALS SCIENCE↗

DOE OSTI2023

Finding simplicity: unsupervised discovery of features, patterns, and order parameters via shift-invariant variational autoencoders *

Abstract Recent advances in scanning tunneling and transmission electron microscopies (STM and STEM) have allowed routine generation of large volumes of imaging data containing information on the structure and functionality of materials. The experimental data sets contain signatures of long-range phenomena such as physical order parameter fields, polarization, and strain gradients in STEM, or standing electronic waves and carrier-mediated exchange interactions in STM, all superimposed onto scanning system distortions and gradual changes of contrast due to drift and/or mis-tilt effects. Correspondingly, while the human eye can readily identify certain patterns in the images such as lattice periodicities, repeating structural elements, or microstructures, their automatic extraction and classification are highly non-trivial and universal pathways to accomplish such analyses are absent. We pose that the most distinctive elements of the patterns observed in STM and (S)TEM images are similarity and (almost-) periodicity, behaviors stemming directly from the parsimony of elementary atomic structures, superimposed on the gradual changes reflective of order parameter distributions. However, the discovery of these elements via global Fourier methods is non-trivial due to variability and lack of ideal discrete translation symmetry. To address this problem, we explore the shift-invariant variational autoencoders (shift-VAEs) that allow disentangling characteristic repeating features in the images, their variations, and shifts that inevitably occur when randomly sampling the image space. Shift-VAEs balance the uncertainty in the position of the object of interest with the uncertainty in shape reconstruction. This approach is illustrated for model 1D data, and further extended to synthetic and experimental STM and STEM 2D data. We further introduce an approach for training shift-VAEs that allows finding the latent variables that comport to known physical behavior. In this specific case, the condition is that the latent variable maps should be smooth on the length scale of the atomic lattice (as expected for physical order parameters), but other conditions can be imposed. The opportunities and limitations of the shift VAE analysis for pattern discovery are elucidated.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Genomic patterns of structural variation among diverse genotypes of Sorghum bicolor and a potential role for deletions in local adaptation

Genomic structural mutations, especially deletions, are an important source of variation in many species and can play key roles in phenotypic diversification and evolution. Previous work in many plant species has identified multiple instances of structural variations (SVs) occurring in or near genes related to stress response and disease resistance, suggesting a possible role for SVs in local adaptation. Sorghum [Sorghum bicolor (L.) Moench] is one of the most widely grown cereal crops in the world. It has been adapted to an array of different climates as well as bred for multiple purposes, resulting in a striking phenotypic diversity. In this study, we identified genome-wide SVs in the Biomass Association Panel, a collection of 347 diverse sorghum genotypes collected from multiple countries and continents. Using Illumina-based, short-read whole-genome resequencing data from every genotype, we found a total of 24,648 SVs, including 22,359 deletions. The global site frequency spectrum of deletions and other types of SVs fit a model of neutral evolution, suggesting that the majority of these mutations were not under any types of selection. Clustering results based on single nucleotide polymorphisms separated the genotypes into eight clusters which largely corresponded with geographic origins, with many of the large deletions we uncovered being unique to a single cluster. Even though most deletions appeared to be neutral, a handful of cluster-specific deletions were found in genes related to biotic and abiotic stress responses, supporting the possibility that at least some of these deletions contribute to local adaptation in sorghum.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2026

MAL33 drives natural variation in maltose metabolism in Saccharomyces eubayanus

Maltose is one of the most abundant sugars in brewer’s wort, and its efficient utilization is critical for successful fermentation. However, maltose consumption varies naturally among Saccharomyces eubayanus strains isolated from different host trees, such as Quercus and Nothofagus. To identify the genetic determinants underlying these phenotypic differences, we performed bulk segregant analysis (BSA) and quantitative trait loci (QTL) mapping using an F 2 offspring derived from QC18 (Quercus-associated) and CL467.1 (Nothofagus-associated) strains. QTL mapping identified two significant genomic regions on subtelomeric loci of chromosomes V-R and XVI-L, each containing complete MAL loci composed of MAL32 (encoding maltase), MAL31 (transporter), and MAL33 (transcriptional activator) genes. Comparative polymorphism analyses identified mutations in MAL32 and MAL33 of QC18, including frameshift mutations resulting in premature stop codons. Functional validation demonstrated that the heterologous expression of MAL33 ChrV from CL467.1 fully restored maltose utilization in QC18, indicating the functional presence of MAL33 cis-regulatory sequences and MAL32 and MAL31 genes in QC18. While structural protein predictions identified truncation and impaired functionality in the maltose-responsive activation domain of Mal33p from QC18, overexpression of QC18’s own MAL33 ChrV allele also improved maltose metabolism, suggesting dosage-dependent transcriptional limitations rather than complete functional loss. These results indicate that allelic variations in the maltose-responsive activation domain of Mal33p result in differences in maltose consumption between strains. Here, we hypothesized that reduced maltose metabolism in QC18 is an adaptive response to the distinct sugar composition in Quercus robur bark, contrasting with the starch-rich environment of Nothofagus pumilio. These findings highlight subtelomeric MAL gene diversity as a reservoir of genetic variation, representing a key evolutionary mechanism that influences maltose adaptation among natural Saccharomyces isolates.

evolutionary plasticity↗

DOE OSTI2023

Gauge constrained algorithm of variational discrete action theory at N = 3 for the multiorbital Hubbard model

The recently developed variational discrete action theory (VDAT) provides a systematic variational approach to the ground state of the quantum many-body problem, where the quality of the solution is controlled by an integer N, and increasing N monotonically approaches the exact solution. VDAT can be exactly evaluated in the d = ∞ multiorbital Hubbard model using the self-consistent canonical discrete action theory (SCDA), which requires a self-consistency condition for the integer time Green's functions. Previous work demonstrates that N = 3 accurately captures multiorbital Mott/Hund physics at a cost similar to the Gutzwiller approximation. Here we employ a gauge constraint to automatically satisfy the self-consistency condition of the SCDA at N = 3, yielding an even more efficient algorithm with enhanced numerical stability. We derive closed form expressions of the gauge constrained algorithm for the multiorbital Hubbard model with general density-density interactions, allowing VDAT at N = 3 to be straightforwardly applied to the seven-orbital Hubbard model. We present results and a performance analysis using N = 2 and N = 3 for the SU⁡(2⁢N orb ) Hubbard model in d = ∞ with N orb = 2–8, and compare to numerically exact dynamical mean-field theory solutions where available. Finally, the developments in this work will greatly facilitate the application of VDAT at N = 3 to strongly correlated electron materials.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2022

Preparation of the SU(3) lattice Yang-Mills vacuum with variational quantum methods

Studying QCD and other gauge theories on quantum hardware requires the preparation of physically interesting states. The variational quantum eigensolver provides a way of performing vacuum state preparation on quantum hardware. Here in this work, variational quantum eigensolver is applied to pure SU(3) lattice Yang-Mills on a single plaquette and one dimensional plaquette chains. Bayesian optimization and gradient descent were investigated for performing the classical optimization. Ansatz states for plaquette chains are constructed in a scalable manner from smaller systems using domain decomposition and a stitching procedure analogous to the density matrix renormalization group. Small examples are performed on IBM’s superconducting Manila processor.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2021

Variational Discrete Action Theory

In this work, we propose the variational discrete action theory (VDAT) to study the ground state properties of quantum many-body Hamiltonians. VDAT is a variational theory based on the sequential product density matrix (SPD) ansatz, characterized by an integer $\mathscr{N}$, which monotonically approaches the exact solution with increasing $\mathscr{N}$. To evaluate the SPD, we introduce a discrete action and a corresponding integer time Green’s function. We use VDAT to exactly evaluate the SPD in two canonical models of interacting electrons: the Anderson impurity model and the d = ∞ Hubbard model. For the latter, we evaluate $\mathscr{N}$ = 2 – 4, where $\mathscr{N}$ = 2 recovers the Gutzwiller approximation (GA), and we show that $\mathscr{N}$ = 3, which exactly evaluates the Gutzwiller-Baeriswyl wave function, provides a truly minimal yet precise description of Mott physics with a cost similar to that of the GA. VDAT is a flexible theory for studying quantum Hamiltonians, competing both with state-of-the-art methods and simple, efficient approaches all within a single framework.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2023

Variational Neural-Network Ansatz for Continuum Quantum Field Theory

Physicists dating back to Feynman have lamented the difficulties of applying the variational principle to quantum field theories. In nonrelativistic quantum field theories, the challenge is to parametrize and optimize over the infinitely many n-particle wave functions comprising the state’s Fock-space representation. Here we approach this problem by introducing neural-network quantum field states, a deep learning ansatz that enables application of the variational principle to nonrelativistic quantum field theories in the continuum. Our ansatz uses the Deep Sets neural network architecture to simultaneously parametrize all of the n-particle wave functions comprising a quantum field state. We employ our ansatz to approximate ground states of various field theories, including an inhomogeneous system and a system with long-range interactions, thus demonstrating a powerful new tool for probing quantum field theories.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

Distributionally Robust Variational Quantum Algorithms With Shifted Noise

Given their potential to demonstrate near-term quantum advantage, variational quantum algorithms (VQAs) have been extensively studied. Although numerous techniques have been developed for VQA parameter optimization, it remains a significant challenge. A practical issue is the high sensitivity of quantum noise to environmental changes, and its propensity to shift in real time. This presents a critical problem as an optimized VQA ansatz may not perform effectively under a different noise environment. For the first time, we explore how to optimize VQA parameters to be robust against unknown shifted noise. We model the noise level as a random variable with an unknown probability density function (PDF), and we assume that the PDF may shift within an uncertainty set. This assumption guides us to formulate a distributionally robust optimization problem, with the goal of finding parameters that maintain effectiveness under shifted noise. We utilize a distributionally robust Bayesian optimization solver for our proposed formulation. This provides numerical evidence in both the Quantum Approximate Optimization Algorithm (QAOA) and the Variational Quantum Eigensolver (VQE) with hardware-efficient ansatz, indicating that we can identify parameters that perform more robustly under shifted noise. We regard this work as the first step towards improving the reliability of VQAs influenced by real-time noise.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

A Variational Autoencoder Model Toward Molecular Structure Representation Learning of Fuels

Here, in this work, a Variational Autoencoder (VAE)-based data-driven modeling framework is developed with the overarching goal of enabling fuel design. The VAE model is trained on a large dataset with several chemical species to learn a compressed latent space molecular representation. Chemical structure in the form of Simplified Molecular Input Line Entry System (SMILES) string is fed as input, encoded into the VAE latent space, and decoded back to the SMILES string using Long Short-Term Memory (LSTM) networks. Complexities of the VAE training loss function are thoroughly examined by varying the weightage (beta (𝜷) parameter) of the latent space regularization term, thereby assessing the balance between reconstruction accuracy and validity, and focusing on both accurate molecular structure reconstruction and latent space consistency. Two different strategies for 𝜷 variation are evaluated: linear annealing and cyclic annealing. In addition, the impact of total correlation adjustment and hierarchical priors is also studied with regard to the balance between reconstruction fidelity and latent space regularization, and potential issues such as posterior collapse, over-regularization, and poor disentanglement of latent variables. Overall, the best performance of the model is achieved with hierarchical priors and incrementally increasing 𝜷 from 0 to a threshold value of 0.25 over 75 epochs. The generative VAE model can be readily coupled with Quantitative Structure–Property Relationship (QSPR) analysis to develop an integrated end-to-end framework for fuel-property prediction and molecular design of novel promising fuels.

fuel design↗

DOE OSTI2022

A Variational Inference Approach to Inverse Problems with Gamma Hyperpriors

Hierarchical models with gamma hyperpriors provide a flexible, sparse-promoting framework to bridge L 1 and L 2 regularizations in Bayesian formulations to inverse problems. Despite the Bayesian motivation for these models, existing methodologies are limited to maximum a posteriori estimation. The potential to perform uncertainty quantification has not yet been realized. This paper introduces a variational iterative alternating scheme for hierarchical inverse problems with gamma hyperpriors. The proposed variational inference approach yields accurate reconstruction, provides meaningful uncertainty quantification, and is easy to implement. In addition, it lends itself naturally to conduct model selection for the choice of hyperparameters. Here, we illustrate the performance of our methodology in several computed examples, including a deconvolution problem and sparse identification of dynamical systems from time series data.

Bayesian shrinkage↗

DOE OSTI2025

Domain Decomposition for Integer Optimal Control with Total Variation Regularization

Total variation integer optimal control problems admit solutions and necessary optimality conditions via geometric variational analysis. In spite of the existence of said solutions, algorithms which solve the discretized objective suffer from high numerical cost associated with the combinatorial nature of integer programming. Hence, such methods are often limited to small and medium-sized problems. We propose a globally convergent, coordinate descent–inspired algorithm that allows tractable subproblem solutions restricted to a partition of the domain. Our decomposition method solves relatively small trust-region subproblems that modify the control variable on a subdomain only. Given nontrivial subdomain overlap, we prove that a global first-order necessary optimality condition is equivalent to a first-order necessary optimality condition per subdomain. We additionally show that a sufficient decrease is achieved on a single subdomain by way of a trust-region subproblem solver using geometric measure–theoretic arguments, which we integrate with a greedy patch selection to prove convergence of our algorithm. In conclusion, we demonstrate the practicality of our algorithm on a benchmark large-scale, PDE-constrained integer optimal control problem and find that our method is faster than the state of the art.

domain decomposition↗

DOE OSTI2024

A Novel Noise-Aware Classical Optimizer for Variational Quantum Algorithms

A key component of variational quantum algorithms (VQAs) is the choice of classical optimizer employed to update the parameterization of an ansatz. It is well recognized that quantum algorithms will, for the foreseeable future, necessarily be run on noisy devices with limited fidelities. Thus, the evaluation of an objective function (e.g., the guiding function in the quantum approximate optimization algorithm (QAOA) or the expectation of the electronic Hamiltonian in variational quantum eigensolver (VQE)) required by a classical optimizer is subject not only to stochastic error from estimating an expected value but also to error resulting from intermittent hardware noise. Model-based derivative-free optimization methods have emerged as popular choices of a classical optimizer in the noisy VQA setting, based on empirical studies. However, these optimization methods were not explicitly designed with the consideration of noise. In this work we adapt recent developments from the “noise-aware numerical optimization” literature to these commonly used derivative-free model-based methods. We introduce the key defining characteristics of these novel noise-aware derivative-free model-based methods that separate them from standard model-based methods. In conclusion, we study an implementation of such noise-aware derivative-free model-based methods and compare its performance on demonstrative VQA simulations to classical solvers packaged in scikit-quant.

classical optimizers↗