Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “variational algorithms”

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 235 records · Page 13

Efficient quantum circuits based on the quantum natural gradient

Efficient preparation of arbitrary entangled quantum states is crucial for quantum computation. This is particularly important for noisy intermediate-scale quantum simulators relying on variational hybrid quantum-classical algorithms. To that end, we propose symmetry-conserving modified quantum approximate optimization algorithm (SCom-QAOA) circuits. The depths of these circuits depend not only on the desired fidelity to the target state but also on the amount of entanglement the state contains. The parameters of the SCom-QAOA circuits are optimized using the quantum natural gradient method based on the Fubini-Study metric. The SCom-QAOA circuit transforms an unentangled state into a ground state of a gapped one-dimensional Hamiltonian with a circuit depth that depends not on the system size but rather on the finite correlation length. In contrast, the circuit depth grows proportionally to the system size for preparing low-lying states of critical one-dimensional systems. Even in the latter case, SCom-QAOA circuits with depth less than the system size were sufficient to generate states with fidelity in excess of 99%, which is relevant for near-term applications. The proposed scheme enlarges the set of the initial states accessible for variational quantum algorithms and widens the scope of investigation of nonequilibrium phenomena in quantum simulators. Published by the American Physical Society 2024

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A controlled variation scheme for convection treatment in pressure-based algorithm

Convection effect and source terms are two primary sources of difficulties in computing turbulent reacting flows typically encountered in propulsion devices. The present work intends to elucidate the individual as well as the collective roles of convection and source terms in the fluid flow equations, and to devise appropriate treatments and implementations to improve our current capability of predicting such flows. A controlled variation scheme (CVS) has been under development in the context of a pressure-based algorithm, which has the characteristics of adaptively regulating the amount of numerical diffusivity, relative to central difference scheme, according to the variation in local flow field. Both the basic concepts and a pragmatic assessment will be presented to highlight the status of this work.

Shyy, Wei↗

Rigid registration algorithm based on the minimization of the total variation of the difference map

Image registration is broadly used in various scenarios in which similar scenes in different images are to be aligned. However, image registration becomes challenging when the contrasts and backgrounds in the images are vastly different. This work proposes using the total variation of the difference map between two images (TVDM) as a dissimilarity metric in rigid registration. A method based on TVDM minimization is implemented for image rigid registration. The method is tested with both synthesized and real experimental data that have various noise and background conditions. The performance of the proposed method is compared with the results of other rigid registration methods. It is demonstrated that the proposed method is highly accurate and robust and outperforms other methods in all of the tests. The new algorithm provides a robust option for image registrations that are critical to many nano-scale X-ray imaging and microscopy applications.

36 MATERIALS SCIENCE↗

Learning the ground state of a non-stoquastic quantum Hamiltonian in a rugged neural network landscape

Strongly interacting quantum systems described by non-stoquastic Hamiltonians exhibit rich low-temperature physics. Yet, their study poses a formidable challenge, even for state-of-the-art numerical techniques. Here, we investigate systematically the performance of a class of universal variational wave-functions based on artificial neural networks, by considering the frustrated spin- 1/2 1 / 2 J_1-J_2 J 1 − J 2 Heisenberg model on the square lattice. Focusing on neural network architectures without physics-informed input, we argue in favor of using an ansatz consisting of two decoupled real-valued networks, one for the amplitude and the other for the phase of the variational wavefunction. By introducing concrete mitigation strategies against inherent numerical instabilities in the stochastic reconfiguration algorithm we obtain a variational energy comparable to that reported recently with neural networks that incorporate knowledge about the physical system. Through a detailed analysis of the individual components of the algorithm, we conclude that the rugged nature of the energy landscape constitutes the major obstacle in finding a satisfactory approximation to the ground state wavefunction, and prevents learning the correct sign structure. In particular, we show that in the present setup the neural network expressivity and Monte Carlo sampling are not primary limiting factors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Accurate prediction of core-level spectra of radicals at density functional theory cost via square gradient minimization and recoupling of mixed configurations

State-specific orbital optimized approaches are more accurate at predicting core-level spectra than traditional linear-response protocols, but their utility had been restricted due to the risk of "variational collapse" down to the ground state. We employ the recently developed square gradient minimization algorithm to reliably avoid variational collapse and study the effectiveness of orbital optimized density functional theory (DFT) at predicting second period element 1s core-level spectra of open-shell systems. Several density functionals (including SCAN, B3LYP, and ωB97X-D3) are found to predict excitation energies from the core to singly occupied levels with high accuracy (≤0.3 eV RMS error) against available experimental data. Higher excited states are, however, more challenging by virtue of being intrinsically multiconfigurational. We thus present a configuration interaction inspired route to self-consistently recouple single determinant mixed configurations obtained from DFT, in order to obtain approximate doublet states. This recoupling scheme is used to predict the C K-edge spectra of the allyl radical, the O K-edge spectra of CO + , and the N K-edge of NO 2 with high accuracy relative to experiment, indicating substantial promise in using this approach for the computation of core-level spectra for doublet species [vs more traditional time dependent DFT, equation of motion coupled cluster singles and doubles (EOM-CCSD), or using unrecoupled mixed configurations]. Finally, we also present general guidelines for computing core-excited states from orbital optimized DFT.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Image Reconstruction from Sparse-view Data Acquired with Portable X-ray Devices

• Portable X-ray systems enable on-site 3D imaging for non-invasive inspection of suspicious packages and explosives. • Existing reconstruction algorithms (e.g., FDK or Feldkamp, Davis and Kress) require hundreds of projections over 360 degrees. • Sparse-view scan reduces scanning time and setup effort, making it ideal for field use in timecritical scenarios. • Existing reconstruction algorithms introduce severe artifacts when applied to sparse-view data. • We developed a total variation (TV)-based optimization algorithm for yielding 3D images from sparse-view data collected with our portable X-ray imaging system.

Xia, Dan [University of Chicago, Chicago, IL]↗

A dimensionality reduction algorithm for mapping tokamak operational regimes using a variational autoencoder (VAE) neural network

Abstract A variational autoencoder (VAE) is a type of unsupervised neural network which is able to learn meaningful data representations in a reduced dimensional space. We present an application of VAE in identifying the operational stability boundary of tokamak plasma discharges. This model was implemented using a dataset of over 3000 discharges from the high beta tokamak-extended pulse (HBT-EP) device. We found the VAE model to be capable of forming a continuous low-dimensional operational space map and identifying the operational boundaries using a specified warning time window. By projecting the operational parameters onto the same reduced space, this provides an intuitive way for the machine operator or an automated control system to perform disruption avoidance using a relevant control actuator as a discharge approaches a boundary. Pre-programmed GPU control experiments were conducted to demonstrate this control technique using HBT-EP’s saddle control coils as a horizontal position actuator, showing the ability to avoid the oncoming disruptive event and extend the duration of the discharge.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

ESCARGOT: Mapping Vertical Phase Spiral Characteristics Throughout the Real and Simulated Milky Way

Abstract The recent discovery of a spiral pattern in the vertical kinematic structure in the solar neighborhood provides a prime opportunity to study nonequilibrium dynamics in the Milky Way from local stellar kinematics. Furthermore, results from simulations indicate that even in a limited volume, differences in stellar orbital histories allow us to trace variations in the initial perturbation across large regions of the disk. We present ESCARGOT , a novel algorithm for studying these variations in both simulated and observed data sets. ESCARGOT automatically extracts key quantities from the structure of a given phase spiral, including the time since perturbation and the perturbation mode. We test ESCARGOT on simulated data and show that it is capable of accurately recovering information about the time since the perturbation occurred as well as subtle differences in phase spiral morphology due to stellar locations in the disk at the time of perturbation. We apply ESCARGOT to kinematic data from data release 3 of the Gaia mission in bins of guiding radius. We show that similar structural differences in morphology occur in the Gaia phase spirals as a function of stellar orbital history. These results indicate that the phase spirals are the product of a complex dynamical response in the disk with large-scale coupling between different regions of phase space.

Darragh-Ford, Elise (ORCID:0000000288005652)↗

Upscaling Methane Flux From Plot Level to Eddy Covariance Tower Domains in Five Alaskan Tundra Ecosystems

Spatial heterogeneity in methane (CH 4 ) flux requires a reliable upscaling approach to reach accurate regional CH 4 budgets in the Arctic tundra. In this study, we combined the CLM-Microbe model with three footprint algorithms to scale up CH 4 flux from a plot level to eddy covariance (EC) tower domains (200 m × 200 m) in the Alaska North Slope, for three sites in Utqiaġvik (US-Beo, US-Bes, and US-Brw), one in Atqasuk (US-Atq) and one in Ivotuk (US-Ivo), for a period of 2013–2015. Three footprint algorithms were the homogenous footprint (HF) that assumes even contribution of all grid cells, the gradient footprint (GF) that assumes gradually declining contribution from center grid cells to edges, and the dynamic footprint (DF) that considers the impacts of wind and heterogeneity of land surface. Simulated annual CH 4 flux was highly consistent with the EC measurements at US-Beo and US-Bes. In contrast, flux was overestimated at US-Brw, US-Atq, and US-Ivo due to the higher simulated CH 4 flux in early growing seasons. The simulated monthly CH 4 flux was consistent with EC measurements but with different accuracies among footprint algorithms. At US-Bes in September 2013, RMSE and NNSE were 0.002 μmol m −2 s −1 and 0.782 using the DF algorithm, but 0.007 μmol m −2 s −1 and 0.758 using HF and 0.007 μmol m −2 s −1 and 0.765 using GF, respectively. DF algorithm performed better than the HF and GF algorithms in capturing the temporal variation in daily CH 4 flux each month, while the model accuracy was similar among the three algorithms due to flat landscapes. Temporal variations in CH 4 flux during 2013–2015 were predominately explained by air temperature (67–74%), followed by precipitation (22–36%). Spatial heterogeneities in vegetation fraction and elevation dominated the spatial variations in CH 4 flux for all five tower domains despite relatively weak differences in simulated CH 4 flux among three footprint algorithms. The CLM-Microbe model can simulate CH 4 flux at both plot and landscape scales at a high temporal resolution, which should be applied to other landscapes. Integrating land surface models with an appropriate algorithm provides a powerful tool for upscaling CH 4 flux in terrestrial ecosystems.

54 ENVIRONMENTAL SCIENCES↗

A Multifidelity Ensemble Kalman Filter with Reduced Order Control Variates

This work develops a new multi delity ensemble Kalman lter (MFEnKF) algorithm based on linear control variate framework. The approach allows for rigorous multi delity extensions of the EnKF, where the uncertainty in coarser delities in the hierarchy of models represent control variates for the uncertainty in ner delities. Small ensembles of high delity model runs are com- plemented by larger ensembles of cheaper, lower delity runs, to obtain much improved analyses at only small additional computational costs. We investigate the use of reduced order models as coarse delity control variates in the MFEnKF, and provide analyses to quantify the improvements over the traditional ensemble Kalman lters. We apply these ideas to perform data assimilation with a quasi-geostrophic test problem, using direct numerical simulation and a corresponding POD-Galerkin reduced order model. Numerical results show that the two- delity MFEnKF provides better analyses than existing EnKF algorithms at comparable or reduced computational costs.

97 MATHEMATICS AND COMPUTING↗

The MHOST finite element program: 3-D inelastic analysis methods for hot section components. Volume 1: Theoretical manual

Formulations and algorithms implemented in the MHOST finite element program are discussed. The code uses a novel concept of the mixed iterative solution technique for the efficient 3-D computations of turbine engine hot section components. The general framework of variational formulation and solution algorithms are discussed which were derived from the mixed three field Hu-Washizu principle. This formulation enables the use of nodal interpolation for coordinates, displacements, strains, and stresses. Algorithmic description of the mixed iterative method includes variations for the quasi static, transient dynamic and buckling analyses. The global-local analysis procedure referred to as the subelement refinement is developed in the framework of the mixed iterative solution, of which the detail is presented. The numerically integrated isoparametric elements implemented in the framework is discussed. Methods to filter certain parts of strain and project the element discontinuous quantities to the nodes are developed for a family of linear elements. Integration algorithms are described for linear and nonlinear equations included in MHOST program.

Nakazawa, Shohei↗

Assessing Ground State Energy of Molecules and Energy Profile of the NH3 Capturing CO2 System Using the Quantum Computing Algorithms

Molecule size correlates with the number of electrons on electronic energies and strength of anharmonicity on vibrational properties, however, it is challenging to address using classical computing. In this study, variational quantum eigensolver (VQE) algorithm was implemented on a quantum simulator to quantify electronic and vibrational energies and reaction pathways of CO2 + NH3 = NH2COOH. The VQE-based Hartree-Fock-Embedding algorithm was adopted to benchmark electronic energies for a series of molecules (doi.org/10.1063/5.0188249) and quantify the reaction energy profile of the CO2 capture reaction (doi.org/10.1116/5.0137750). The generated reaction profile is in good agreement with the classical high-level Coupled-Cluster-Singles-and-Doubles (CCSD) results. The quantum computing algorithm also helps enhance the calculation of vibrational ground-state energies by considering the many-body coupling using the Vibrational Self-Consistent Field method, providing results for CO2 and NH3 molecules with accuracy comparable to the direct diagonalization method. Our approach indicates quantum computing can be applied to solve practical problems.

Lee, Yueh-Lin↗

Error mitigation, optimization, and extrapolation on a trapped-ion testbed

Current noisy intermediate-scale quantum (NISQ) trapped-ion devices are subject to errors which can significantly impact the accuracy of calculations if left unchecked. A form of error mitigation called zero noise extrapolation (ZNE) can decrease an algorithm’s sensitivity to these errors without increasing the number of required qubits. Here we explore different methods for integrating this error mitigation technique into the Variational Quantum Eigensolver (VQE) algorithm for calculating the ground state of the HeH + molecule at 0.8 Å in the presence of experimental noise. Using the Quantum Scientific Computing Open User Testbed (QSCOUT) trapped-ion device, we test three methods of scaling noise for extrapolation: time stretching the two-qubit gates, scaling the sideband detuning parameter, and inserting two-qubit gate identity operations into the ansatz circuit. We find that time stretching and sideband detuning scaling fail to scale the noise on our particular hardware in a way that can be extrapolated to zero noise. Scaling our noise with global gate identity insertions and extrapolating after variational optimization, we achieve error suppression of 96.8%, resulting in an energy estimate within –0.004 ± 0.04 hartree of the ground state energy. This is an improvement, but still outside the chemical accuracy threshold of 0.0016 hartree. Furthermore, our results show that the efficacy of this error mitigation technique depends on choosing the correct implementation for a given device architecture.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A multigrid algorithm for the cell-centered finite difference scheme

In this article, we discuss a non-variational V-cycle multigrid algorithm based on the cell-centered finite difference scheme for solving a second-order elliptic problem with discontinuous coefficients. Due to the poor approximation property of piecewise constant spaces and the non-variational nature of our scheme, one step of symmetric linear smoothing in our V-cycle multigrid scheme may fail to be a contraction. Again, because of the simple structure of the piecewise constant spaces, prolongation and restriction are trivial; we save significant computation time with very promising computational results.

Ewing, Richard E.↗

Variational approach to quantum state tomography based on maximal entropy formalism

Quantum state tomography is an integral part of quantum computation and offers the starting point for the validation of various quantum devices. One of the central tasks in the field of state tomography is to reconstruct, with high fidelity, the quantum states of a quantum system. From an experiment on a real quantum device, one can obtain the mean measurement values of different operators. With such data as input, in this report we employ the maximal entropy formalism to construct the least biased mixed quantum state that is consistent with the given set of expectation values. Even though, in principle, the reported formalism is quite general and should work for an arbitrary set of observables, in practice we shall demonstrate the efficacy of the algorithm on an informationally complete (IC) set of Hermitian operators. Such a set possesses the advantage of uniquely specifying a single quantum state from which the experimental measurements have been sampled and hence renders the rare opportunity not only to construct a least-biased quantum state but even replicate the exact state prepared experimentally within a preset tolerance. Here, the primary workhorse of the algorithm is reconstructing an energy function which we designate as the effective Hamiltonian of the system, and parameterizing it with Lagrange multipliers, according to the formalism of maximal entropy. These parameters are thereafter optimized variationally so that the reconstructed quantum state of the system converges to the true quantum state within an error threshold. To this end, we employ a parameterized quantum circuit and a hybrid quantum-classical variational algorithm to obtain such a target state, making our recipe easily implementable on a near-term quantum device.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Exploring Quantum State Preparation Using Tensor Networks and Sparse Wavefunction Simulations

The variational quantum eigenvalue solver is a powerful hybrid quantum-classical approach that has been suggested as a candidate method to run on near-term quantum hardware for computing ground state electronic energies of molecular systems. However, even for small molecules, the number of variational parameters and qubits required to minimize the electronic energy is beyond the reach of current quantum computers except for small basis sets. We explore a new paradigm for state preparation where we test how much of the optimization can be approximately prepared with classical computers to reduce the number of optimization steps performed using a quantum device. By adapting a recent algorithm for the factorized form of the UCC ansatz, we can study molecular electronic structure problems with up to 64 qubits. In addition, we also test a related approach of using tensor networks to optimize quantum circuits in order to benchmark various lattice models. We present results using these approaches and discuss strategies for incorporating these ideas into variational algorithms involving near-term quantum computers. Our results help demonstrate the strength of the UCC ansatz and address pressing questions about optimal initial parameterizations and circuit construction.

quantum computing↗

Validation of a New NIRS Method for Measuring Muscle Oxygenation During Rhythmic Handgrip Exercise

Near infrared spectroscopy (NIRS) is commonly used to measure muscle oxygenation during exercise and recovery. Current NIRS algorithms do not account for variation in water content and optical pathlength during exercise. The current effort attempts to validate a newly developed NIRS algorithm during rhythmic handgrip exercise and recovery. Six female subjects, aver age 28 +/- 6 yrs, participated in the study. A venous catheter was placed in the retrograde direction in the antecubital space. A NIRS sensor with 30 mm source-detector separation was placed on the flexor digitorum profundus. Subjects performed two 5-min bouts of rhythmic handgrip exercise (2 s contraction/1 s relaxation) at 15% and 30% of maximal voluntary contraction. Venous blood was sampled before each bout, during the last minute of exercise, and after 5 minutes of recovery. Venous oxygen saturation (SvO2) was measured with a I-stat CG-4+ cartridge. Spectra were collected between 700-900 nm. A modified Beer's Law formula was used to calculate the absolute concentration of oxyhemoglobin (HbO2), deoxyhemoglobin (Hb) and water, as well as effective pathlength for each spectrum. Muscle oxygen saturation (SmO2) was calculated from the HbO2 and Hb results. The correlation between SvO2 and SmO2 was determined. Optical pathlength and water varied significantly during each exercise bout, with pathlength increasing approximately 20% and water increasing about 2%. R2 between blood and muscle SO2 was found to be 0.74, the figure shows the relationship over SvO2 values between 22% and 82%. The NIRS measurement was, on average, 6% lower than the blood measurement. It was concluded that pathlength changes during exercise because muscle contraction causes variation in optical scattering. Water concentration also changes, but only slightly. A new NIRS algorithm which accounts for exercise-induced variation in water and pathlength provided an accurate assessment of muscle oxygen saturation before, during and after exercise.

Hagan, R. Donald↗

Classical optimization with imaginary-time block encoding on quantum computers: The MaxCut problem

Optimization problems in finance, physics, and computer science are typically very hard to tackle in classical computing; quantum computing could help speed up computations and provide efficient methods for tackling large problems. Typically, to treat a problem with a quantum computer, the optimal solution is cast as the ground state of a diagonal Hamiltonian. Here, we develop a method, called imaginary-time evolution block encoding (ITE-BE), based on a recent imaginary-time algorithm, which requires no variational parameter optimization, as all parameters can be derived analytically from the target Hamiltonian. We also demonstrate that our method can be successfully combined with other quantum algorithms such as the quantum approximate optimization algorithm (QAOA). For illustration, here we study the MaxCut problem. We find that the QAOA ansatz increases the postselection success of ITE-BE, and shallow QAOA circuits, when boosted with ITE-BE, achieve better performance than deeper QAOA circuits. For the special case of the transverse initial state, we adapt our block-encoding scheme to allow for a deterministic application of the first layer of the circuit.

Zhong, Dawei [University of Southern California, L↗