Search NASA⌕ Search

SEARCH · Search NASA

Results for “variational optimization”

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 109 records · Page 6

Optimal Control of Generalized Quasi-Variational Hemivariational Inequalities and Its Applications

The purpose of this paper is to study optimal control of generalized quasi-variational hemivariational inequalities involving multivalued mapping. Under some suitable conditions, we give existence results of the optimal control. We also consider the convergence behavior of the optimal control when the data for the underlying quasi-variational hemivariational inequalities is contaminated by some noise. In the last section, we give an example to illustrate our main results.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Benchmarking quantum trial wavefunctions for phaseless auxiliary-field quantum Monte Carlo

The phaseless auxiliary-field quantum Monte Carlo (ph-AFQMC) method is a stochastic imaginary-time projection technique for computing ground-state properties of strongly correlated quantum systems, with accuracy that depends critically on the choice of trial wavefunction. Here, we investigate ph-AFQMC with trial states prepared using parameterized quantum circuits. In this work, we present a comprehensive benchmarking study of quantum trial wavefunctions spanning unitary coupled-cluster, Hamiltonian-informed, Jastrow-inspired, and adaptively constructed ansatze. The benchmarking evaluates accuracy, expressibility, and scalability of these ansatze within the QC-AFQMC framework. We test these ansatze on linear hydrogen chains under bond stretching and find that several ansatz families produce chemically accurate ph-AFQMC energies across the dissociation curve. We have performed simulations using the CUDA-Q quantum development platform on the GPU partition of the Perlmutter supercomputer. When comparing ansatze at similar numbers of variational parameters, we find that different ansatz families yield comparable ph-AFQMC results despite exhibiting substantially different variational energies, optimization costs, and circuit depths. Our results indicate that the variational energy of an ansatz is not always a reliable indicator of its quality for ph-AFQMC and reveal instances of over-parameterization. In the strongly correlated regime, trial wavefunctions obtained from adaptive ansatze, exemplified here by ADAPT-VQE with the UCCSD operator pool, can outperform their fixed-ansatz counterparts (UCCSD) in terms of projected energies while using substantially more compact circuits, providing a flexible route to optimize quantum resources within the ph-AFQMC framework.

Rofougaran, Rod [LBNL, Berkeley; Columbia U.; PNL,↗

Best Practices for Wake Model and Optimization Algorithm Selection in Wind Farm Layout Optimization

This paper presents the results of two case studies regarding the wind farm layout optimization problem. We asked a general audience to take part in the studies that we designed, and nine individuals participated. Case study 1 considered variations in optimization strategies for a given simple Gaussian wake model. Participants were provided with a wake model that outputs annual energy production (AEP) for an input set of wind turbine locations. Participants used an optimization method of their choosing to find an optimal wind farm layout. Case study 2 looked at trade-offs in performance resulting from variation in both physics model and optimization strategy. For case study 2, participants calculated AEP using a wake model of their choice while also implementing their chosen optimization method. Participants then used their wake model to calculate the AEP all other participant submitted turbine configurations produce for cross-comparison results. for optimized turbine locations were then cross-compared by recalculating the AEP using every other participant's wake model. Results for case study 1 show that the best optimal wind farm layouts in this study were achieved by participants who used gradient-based optimization methods. A front-runner emerged with the Sparse Nonlinear OPTimizer plus Wake Expansion Continuation (SNOPTplusWEC) optimization method, which consistently discovered a higher AEP for each scenario. Results for case study 2 show that for small wind farms with few turbines, turbine placement on the wind farm boundary is superior. Conclusions for case study 2 were drawn from participant cross-comparison of results.

17 WIND ENERGY↗

Best Practices for Wake Model and Optimization Algorithm Selection in Wind Farm Layout Optimization: Preprint

This paper presents the results of two case studies regarding the wind farm layout optimization problem. We asked a general audience to take part in the studies that we designed, and nine individuals participated. Case study 1 considered variations in optimization strategies for a given simple Gaussian wake model. Participants were provided with a wake model that outputs annual energy production (AEP) for an input set of wind turbine locations. Participants used an optimization method of their choosing to find an optimal wind farm layout. Case study 2 looked at trade-offs in performance resulting from variation in both physics model and optimization strategy. For case study 2, participants calculated AEP using a wake model of their choice while also implementing their chosen optimization method. Participants then used their wake model to calculate the AEP all other participant submitted turbine configurations produce for cross-comparison results. for optimized turbine locations were then cross-compared by recalculating the AEP using every other participant's wake model. Results for case study 1 show that the best optimal wind farm layouts in this study were achieved by participants who used gradient-based optimization methods. A front-runner emerged with the Sparse Nonlinear OPTimizer plus Wake Expansion Continuation (SNOPTplusWEC) optimization method, which consistently discovered a higher AEP for each scenario. Results for case study 2 show that for small wind farms with few turbines, turbine placement on the wind farm boundary is superior. Conclusions for case study 2 were drawn from participant cross-comparison of results.

17 WIND ENERGY↗

Reward Driven Workflows for Unsupervised Explainable Analysis of Phases and Ferroic Variants From Atomically Resolved Imaging Data

Rapid progress in aberration corrected electron microscopy necessitates development of robust methods for the identification of phases, ferroic variants, and other pertinent aspects of materials structure from imaging data. While unsupervised methods for clustering and classification are widely used for these tasks, their performance can be sensitive to hyperparameter selection in the analysis workflow. In this study, the effects of descriptors and hyperparameters are explored on the capability of unsupervised ML methods to distill local structural information, exemplified by the discovery of polarization and lattice distortion in Sm − dopped BiFeO 3 (BFO) thin films. It is demonstrated that a reward-driven approach can be used to optimize these key hyperparameters across the full workflow, where rewards are designed to reflect domain wall continuity and straightness, ensuring that the analysis aligns with the material's physical behavior. This approach allows the discovery of local descriptors that are best aligned with the specific physical behavior, providing insight into the fundamental physics of materials. The reward driven workflow is further extended to disentangle structural factors of variation via an optimized variational autoencoder (VAE). Lastly, the importance of well-defined rewards is explored as a quantifiable measure of the success of the workflow.

Barakati, Kamyar [University of Tennessee, Knoxvil↗

Toward Consistent High-Fidelity Quantum Learning on Unstable Devices via Efficient In-Situ Calibration

In the near-term noisy intermediate-scale quantum (NISQ) era, high noise will significantly reduce the fidelity of quantum computing. What's worse, recent works reveal that the noise on quantum devices is not stable, that is, the noise is dynamically changing over time. This leads to an imminent challenging problem: At run-time, is there a way to efficiently achieve a consistent high-fidelity quantum system on unstable devices? To study this problem, we take quantum learning (a.k.a., variational quantum algorithm) as a vehicle, which has a wide range of applications, such as combinatorial optimization and machine learning. A straightforward approach is to optimize a variational quantum circuit (VQC) with a parameter-shift approach on the target quantum device before using it; however, the optimization has an extremely high time cost, which is not practical at run-time. To address the pressing issue, in this paper, we proposed a novel quantum pulse-based noise adaptation framework, namely QuPAD. In the proposed framework, first, we identify that the CNOT gate is the fidelity bottleneck of the conventional VQC, and we employ a more robust parameterized multi-qubit gate (i.e., Rzx gate) to replace CNOT gate. Second, by benchmarking Rzx gate with different parameters, we build a fitting function for each coupling qubit pair, such that the deviation between the theoretic output of Rzx gate and its on-device output under a given pulse amplitude and duration can be efficiently predicted. On top of this, an evolutionary algorithm is devised to identify the pulse amplitude and duration of each Rzx gate (i.e., calibration) and find the quantum circuits with high fidelity. Experiments show that the runtime on quantum devices of QuPAD with 8–10 qubits is less than 15 minutes, which is up to 270 x faster than the parameter-shift approach. In addition, compared to the vanilla VQC as a baseline, QuPAD can achieve 59.33% accuracy gain on a classification task, and average 66.34% closer to ground state energy for molecular simulation.

Hu, Zhirui↗

Tracking Excited States in Wave Function Optimization Using Density Matrices and Variational Principles

We introduce an approach for finding individual excited states' energy stationary points in complete active space self-consistent field theory that is compatible with standard optimization methods and highly effective at overcoming difficulties due to root flipping and near-degeneracies. Inspired by both the maximum overlap method and recent progress in excited-state variational principles, our approach combines these ideas in order to track individual excited states throughout the orbital optimization process. In a series of tests involving root flipping, near-degeneracies, charge transfers, and double excitations, we show that this approach is more effective for state-specific optimization than either the naive selection of roots on the basis of energy ordering or a more direct generalization of the maximum overlap method. We offer evidence that this state-specific approach improves the performance of complete active space perturbation theory for vertical excitation energies. Furthermore, we find that the state-specific optimization can help avoid state-averaging-induced discontinuities on potential energy surfaces. With a simple implementation, a low cost, and compatibility with large active space methods, the approach is designed to be useful in a wide range of excited-state investigations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Non-trivial symmetries in quantum landscapes and their resilience to quantum noise

Very little is known about the cost landscape for parametrized Quantum Circuits (PQCs). Nevertheless, PQCs are employed in Quantum Neural Networks and Variational Quantum Algorithms, which may allow for near-term quantum advantage. Such applications require good optimizers to train PQCs. Recent works have focused on quantum-aware optimizers specifically tailored for PQCs. However, ignorance of the cost landscape could hinder progress towards such optimizers. In this work, we analytically prove two results for PQCs: (1) We find an exponentially large symmetry in PQCs, yielding an exponentially large degeneracy of the minima in the cost landscape. Alternatively, this can be cast as an exponential reduction in the volume of relevant hyperparameter space. (2) We study the resilience of the symmetries under noise, and show that while it is conserved under unital noise, non-unital channels can break these symmetries and lift the degeneracy of minima, leading to multiple new local minima. Based on these results, we introduce an optimization method called Symmetry-based Minima Hopping (SYMH), which exploits the underlying symmetries in PQCs. Our numerical simulations show that SYMH improves the overall optimizer performance in the presence of non-unital noise at a level comparable to current hardware. Overall, this work derives large-scale circuit symmetries from local gate transformations, and uses them to construct a noise-aware optimization method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimization Stability in Excited-State-Specific Variational Monte Carlo

Here, we investigate the issue of optimization stability in variance-based state-specific variational Monte Carlo, discussing the roles of the objective function, the complexity of wave function ansatz, the amount of sampling effort, and the choice of minimization algorithm. Using a small cyanine dye molecule as a test case, we systematically perform minimizations using variants of the linear method as both a standalone algorithm and in a hybrid combination with accelerated descent. We demonstrate that adaptive step control is crucial for maintaining the linear method's stability when optimizing complicated wave functions and that the hybrid method enjoys both greater stability and minimization performance.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

IDR Neutrino Factory Front End and Variations

The International Design Report (IDR) neutrino factory scenario for capture, bunching, phase-energy rotation and initial cooling of {mu}'s produced from a proton source target is explored. It requires a drift section from the target, a bunching section and a {phi}-{delta}E rotation section leading into the cooling channel. Optimization and variations are discussed. Important concerns are rf limitations within the focusing magnetic fields and large losses in the transport.

43 PARTICLE ACCELERATORS↗

Optimization of the Solubility of HIV-1-Neutralizing Antibody 10E8 through Somatic Variation and Structure-Based Design

Extraordinary antibodies capable of near pan-neutralization of HIV-1 have been identified. One of the broadest is antibody 10E8, which recognizes the membrane-proximal external region (MPER) of the HIV-1 envelope and neutralizes >95% of circulating HIV-1 strains. If delivered passively, 10E8 might serve to prevent or treat HIV-1 infection. Antibody 10E8, however, is markedly less soluble than other antibodies. Here, we describe the use of both structural biology and somatic variation to develop optimized versions of 10E8 with increased solubility. From the structure of 10E8, we identified a prominent hydrophobic patch; reversion of four hydrophobic residues in this patch to their hydrophilic germ line counterparts resulted in an ~10-fold decrease in turbidity. We also used somatic variants of 10E8, identified previously by next-generation sequencing, to optimize heavy and light chains; this process yielded several improved variants. Of these, variant 10E8v4 with 26 changes versus the parent 10E8 was the most soluble, with a paratope we showed crystallographically to be virtually identical to that of 10E8, a potency on a panel of 200 HIV-1 isolates also similar to that of 10E8, and a half-life in rhesus macaques of ~10 days. An anomaly in 10E8v4 size exclusion chromatography that appeared to be related to conformational isomerization was resolved by engineering an interchain disulfide. Furthermore, by combining a structure-based approach with natural variation in potency and solubility from the 10E8 lineage, we successfully created variants of 10E8 which retained the potency and extraordinary neutralization breadth of the parent 10E8 but with substantially increased solubility.

59 BASIC BIOLOGICAL SCIENCES↗

Optimization of Simultaneous Measurement for Variational Quantum Eigensolver Applications

Variational quantum eigensolver (VQE) is a promising algorithm suitable for near-term quantum computers. VQE aims to approximate solutions to exponentially-sized optimization problems by executing a polynomial number of quantum sub-problems. However, the number of subproblems scales as N-4 for typical problems of interest-a daunting growth rate that poses a serious limitation for emerging applications such as quantum computational chemistry. We mitigate this issue by exploiting the simultaneous measurability of subproblems corresponding to commuting terms. Our technique transpiles VQE instances into a format optimized for simultaneous measurement, ultimately yielding 8-30x lower cost. Our work also encompasses a synthesis tool for compiling simultaneous measurement circuits with minimal overhead. We demonstrate experimental validation of our techniques by estimating the ground state energy of deuteron with a quantum computer. We also investigate the underlying statistics of simultaneous measurement and devise an adaptive strategy for mitigating harmful covariance terms.

quantum computing↗

Constrained Graph Optimization: Interdiction and Preservation Problems

The maximum flow, shortest path, and maximum matching problems are a set of basic graph problems that are critical in theoretical computer science and applications. Constrained graph optimization, a variation of these basic graph problems involving modification of the underlying graph, is equally important but sometimes significantly harder. In particular, one can explore these optimization problems with additional cost constraints. In the preservation case, the optimizer has a budget to preserve vertices or edges of a graph, preventing them from being deleted. The optimizer wants to find the best set of preserved edges/vertices in which the cost constraints are satisfied and the basic graph problems are optimized. For example, in shortest path preservation, the optimizer wants to find a set of edges/vertices within which the shortest path between two predetermined points is smallest. In interdiction problems, one deletes vertices or edges from the graph with a particular cost in order to impede the basic graph problems as much as possible (for example, delete edges/vertices to maximize the shortest path between two predetermined vertices). Applications of preservation problems include optimal road maintenance, power grid maintenance, and job scheduling, while interdiction problems are related to drug trafficking prevention, network stability assessment, and counterterrorism. Computational hardness results are presented, along with heuristic methods for approximating solutions to the matching interdiction problem. Also, efficient algorithms are presented for special cases of graphs, including on planar graphs. The graphs in many of the listed applications are planar, so these algorithms have important practical implications.

97 MATHEMATICS AND COMPUTING↗

An Adaptive Optimizer for Measurement-Frugal Variational Algorithms

Variational hybrid quantum-classical algorithms (VHQCAs) have the potential to be useful in the era of near-term quantum computing. However, recently there has been concern regarding the number of measurements needed for convergence of VHQCAs. Here, we address this concern by investigating the classical optimizer in VHQCAs. We introduce a novel optimizer called individual Coupled Adaptive Number of Shots (iCANS). This adaptive optimizer frugally selects the number of measurements (i.e., number of shots) both for a given iteration and for a given partial derivative in a stochastic gradient descent. We numerically simulate the performance of iCANS for the variational quantum eigensolver and for variational quantum compiling, with and without noise. In all cases, and especially in the noisy case, iCANS tends to out-perform state-of-the-art optimizers for VHQCAs. We therefore believe this adaptive optimizer will be useful for realistic VHQCA implementations, where the number of measurements is limited.

97 MATHEMATICS AND COMPUTING↗

Smart Microbial Cell Technology: A high-throughput platform to optimize biocatalysts

Los Alamos National Laboratory developed an ultra-high-throughput screening platform to engineer custom biocatalysts that enhance the rate of chemical reactions critical in pharmaceuticals, renewable energy, and environmental cleanup. Current methods to find biocatalysts are slow. This platform scans genetic variations to optimize a single enzyme or microbial cell to generate a product efficiently. It selects rare mutations needed for biocatalyst optimization orders of magnitude faster than current screening methods. A custom sensor reporter gene circuit causes cells to fluoresce when they are making the target product. When coupled to flow cytometry, a million biocatalyst variants can be screened in hours.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Sparse Recovery for Scientific Data

We have built build and analyzed fundamental mathematical tools that enable sparse recovery of scientific data for high performance computing, experimental facilities and sensor measurement. The proposed work will impact many areas of research across the DOE. We have designed, developed and analyzed fast scalable algorithms for the sparse recovery of scientific data sets that may be extremely large, generated very quickly and distributed across multiple storage devices. The algorithms we developed will be used to process the copious amounts of scientific data generated by the DOE supercomputer simulations and by DOE experimental and observational facilities. They leverage the fact that while the amount of data produced can be extremely large, the actual quantities of interest (QoI's) are often sparse, either in space time, or in some feature space. Mathematically, notions of compressive sensing, including l1 regularized and total variation regularized optimization have played an important part in this effort.

97 MATHEMATICS AND COMPUTING↗

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↗

Random coordinate descent: A simple alternative for optimizing parameterized quantum circuits

Variational quantum algorithms rely on the optimization of parameterized quantum circuits in noisy settings. The commonly used back-propagation procedure in classical machine learning is not directly applicable in this setting due to the collapse of quantum states after measurements. Thus, gradient estimations constitute a significant overhead in a gradient-based optimization of such quantum circuits. This paper introduces a random coordinate descent algorithm as a practical and easy-to-implement alternative to the full gradient descent algorithm. This algorithm only requires one partial derivative at each iteration. Motivated by the behavior of measurement noise in the practical optimization of parameterized quantum circuits, this paper presents an optimization problem setting that is amenable to analysis. Under this setting, the random coordinate descent algorithm exhibits the same level of stochastic stability as the full gradient approach, making it as resilient to noise. The complexity of the random coordinate descent method is generally no worse than that of the gradient descent and can be much better for various quantum optimization problems with anisotropic Lipschitz constants. Theoretical analysis and extensive numerical experiments validate our findings. Published by the American Physical Society 2024

Ding, Zhiyan (ORCID:000000018863403X)↗