Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “hybrid algorithm”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Quantum Orbital Minimization Method for Excited States Calculation on a Quantum Computer

Herein we propose a quantum-classical hybrid variational algorithm, the quantum orbital minimization method (qOMM), for obtaining the ground state and low-lying excited states of a Hermitian operator. Given parametrized ansatz circuits representing eigenstates, qOMM implements quantum circuits to represent the objective function in the orbital minimization method and adopts a classical optimizer to minimize the objective function with respect to the parameters in ansatz circuits. The objective function has an orthogonality constraint implicitly embedded, which allows qOMM to apply a different ansatz circuit to each input reference state. We carry out numerical simulations that seek to find excited states of H 2 , LiH, and a toy model consisting of four hydrogen atoms arranged in a square lattice in the STO-3G basis with UCCSD ansatz circuits. Comparing the numerical results with existing excited states methods, qOMM is less prone to getting stuck in local minima and can achieve convergence with more shallow ansatz circuits.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Magnetic phases of spatially modulated spin-1 chains in Rydberg excitons: Classical and quantum simulations

Here, in this work, we study the magnetic phases of a spatially modulated chain of spin-1 Rydberg excitons. Using the Density Matrix Renormalization Group (DMRG) technique, we study various magnetic and topologically nontrivial phases using both single-particle properties, such as local magnetization and quantum entropy, and many-body ones, such as pair-wise Néel and long-range string correlations. In particular, we investigate the emergence and robustness of the Haldane phase, a topological phase of anti-ferromagnetic spin-1 chains. Furthermore, we devise a hybrid quantum algorithm employing restricted Boltzmann machine to simulate the ground state of such a system that shows very good agreement with the results of exact diagonalization and DMRG.

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

Physics makes the difference: Bayesian optimization and active learning via augmented Gaussian process

Abstract Both experimental and computational methods for the exploration of structure, functionality, and properties of materials often necessitate the search across broad parameter spaces to discover optimal experimental conditions and regions of interest in the image space or parameter space of computational models. The direct grid search of the parameter space tends to be extremely time-consuming, leading to the development of strategies balancing exploration of unknown parameter spaces and exploitation towards required performance metrics. However, classical Bayesian optimization (BO) strategies based on the Gaussian process (GP) do not readily allow for the incorporation of the known physical behaviors or past knowledge. Here we explore a hybrid optimization/exploration algorithm created by augmenting the standard GP with a structured probabilistic model of the expected system’s behavior. This approach balances the flexibility of the non-parametric GP approach with a rigid structure of physical knowledge encoded into the parametric model. The fully Bayesian treatment of the latter allows additional control over the optimization via the selection of priors for the model parameters. The method is demonstrated for a noisy version of a standard univariate test function used to evaluate optimization algorithms and further extended to physical lattice models. This methodology is expected to be universally suitable for injecting prior knowledge in the form of physical models and past data in the BO framework.

42 ENGINEERING↗
DOE OSTI2022

Variational Adiabatic Gauge Transformation on Real Quantum Hardware for Effective Low-Energy Hamiltonians and Accurate Diagonalization

Effective low-energy theories represent powerful theoretical tools to reduce the complexity in modeling interacting quantum many-particle systems. However, common theoretical methods rely on perturbation theory, which limits their applicability to weak interactions. Here we introduce the Variational Adiabatic Gauge Transformation (VAGT), a nonperturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit that brings the Hamiltonian to either its block-diagonal or full-diagonal form. If a Hamiltonian can be diagonalized via a shallow quantum circuit, then VAGT can learn the optimal parameters using a polynomial number of runs. The accuracy of VAGT is tested through numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Quantifying the impact of precision errors on quantum approximate optimization algorithms

The quantum approximate optimization algorithm (QAOA) is a hybrid quantum-classical algorithm that seeks to achieve approximate solutions to optimization problems by iteratively alternating between intervals of controlled quantum evolution. Here, we examine the effect of analog precision errors on QAOA performance from the perspective of both algorithmic training and performance guarantees. Leveraging cumulant expansions, we recast the faulty QAOA as a control problem in which precision errors are expressed as multiplicative control noise and derive bounds on the performance of QAOA. We show using both analytical techniques and numerical simulations that fixed precision implementations of QAOA circuits are subject to an exponential degradation in performance dependent upon the number of optimal QAOA layers and magnitude of the precision error. Despite this significant reduction, we show that it is possible to mitigate precision errors in QAOA via digitization of the variational parameters at the cost of increasing circuit depth.

quantum algorithms↗
DOE OSTI2023

Scalar QED with Rydberg atoms

We review recent suggestions to quantum simulate scalar electrodynamics (the lattice Abelian Higgs model) in $1+1$ dimensions with rectangular arrays of Rydberg atoms. We show that platforms made publicly available recently allow empirical explorations of the critical behavior of quantum simulators. We discuss recent progress regarding the phase diagram of two-leg ladders, effective Hamiltonian approaches and the construction of hybrid quantum algorithms targeting hadronization in collider physics event generators.

Meurice, Yannick↗
DOE OSTI2024

A hybrid finite volume method and smoothed particle hydrodynamics approach for efficient and accurate blast simulations

Modeling strong shock waves in fluids remains a persistent challenge in computational physics. Essential to research efforts in industry and defense, numerous methods have been devised to improve the accuracy and efficiency of shock simulations. A novel, hybrid Finite Volume Method (FVM)-Smoothed Particle Hydrodynamics (SPH) approach is capable of further improving efficiency and retaining accuracy by exploiting the favorable characteristics of each respective method. This hybrid approach is presented for shock capturing in compressible fluids. The Python framework Pyro2 is employed to simulate a coarse FVM mesh, while the Python framework PySPH is utilized to model the fluid in regions with high gradients through SPH particles. The performance of the hybrid FVM-SPH scheme, compared to the individual FVM and SPH methods, is assessed in 1 kt and 10 kt blast simulations. Our results indicate that the hybrid approach offers higher computational efficiency than SPH while preserving its accuracy and characteristics. The hybrid approach had a relative speedup of 11.3x and 22.3x over the FVM and SPH approaches for the 1 kt simulation and a relative speedup of 14.7x and 20.9x over the FVM and SPH approaches for the 10 kt simulation. The hybrid SPH algorithm enables future compressible fluid simulations with more extensive capabilities than grid-based methods alone, presenting potential applications in modeling fluid-structure interactions and solid deformation and fracturing in blast simulations.

Myers, Conner↗
DOE OSTI2022

Quantum algorithmic measurement

There has been recent promising experimental and theoretical evidence that quantum computational tools might enhance the precision and efficiency of physical experiments. However, a systematic treatment and comprehensive framework are missing. Here we initiate the systematic study of experimental quantum physics from the perspective of computational complexity. To this end, we define the framework of quantum algorithmic measurements (QUALMs), a hybrid of black box quantum algorithms and interactive protocols. We use the QUALM framework to study two important experimental problems in quantum many-body physics: determining whether a system’s Hamiltonian is time-independent or time-dependent, and determining the symmetry class of the dynamics of the system. We study abstractions of these problems and show for both cases that if the experimentalist can use her experimental samples coherently (in both space and time), a provable exponential speedup is achieved compared to the standard situation in which each experimental sample is accessed separately. Our work suggests that quantum computers can provide a new type of exponential advantage: exponential savings in resources in quantum experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

A Component-Sizing Methodology for a Hybrid Electric Vehicle Using an Optimization Algorithm

Many leading companies in the automotive industry have been putting tremendous effort into developing new powertrains and technologies to make their products more energy efficient. Evaluating the fuel economy benefit of a new technology in specific powertrain systems is straightforward; and, in an early concept phase, obtaining a projection of energy efficiency benefits from new technologies is extremely useful. However, when carmakers consider new technology or powertrain configurations, they must deal with a trade-off problem involving factors such as energy efficiency and performance, because of the complexities of sizing a vehicle’s powertrain components, which directly affect its energy efficiency and dynamic performance. As powertrains of modern vehicles become more complicated, even more effort is required to design the size of each component. This study presents a component-sizing process based on the forward-looking vehicle simulator “Autonomie” and the optimization algorithm “POUNDERS”; the supervisory control strategy based on Pontryagin’s Minimum Principle (PMP) assures sufficient computational system efficiency. We tested the process by applying it to a single power-split hybrid electric vehicle to determine optimal values of gear ratios and each component size, where we defined the optimization problem as minimizing energy consumption when the vehicle’s dynamic performance is given as a performance constraint. The suggested sizing process will be helpful in determining optimal component sizes for vehicle powertrain to maximize fuel efficiency while dynamic performance is satisfied. Indeed, this process does not require the engineer’s intuition or rules based on heuristics required in the rule-based process.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2025

Bidding Curve Design for Hybrid Power Plants with Uncertain Solar Forecast

This paper presents a novel bidding curve design algorithm tailored for hybrid power plants (HPPs) to participate in the wholesale electricity market. Utilizing forecasts for photovoltaic (PV) generation and available battery power, our algorithm strategically computes the bidding curve to maximize HPP profit while adeptly managing the inherent uncertainty associated with PV power generation. In addition, the introduction of the penalty cost in HPP bidding curves provides the system operator a tool to effectively manage the system-level uncertainty that caused by HPPs. Numerical analysis through Monte Carlo simulations confirms that our bidding curve methodology outperforms the benchmark across various scenarios.

bidding curve↗
DOE OSTI2024

Bidding Curve Design for Hybrid Power Plants with Uncertain Solar Forecast: Preprint

This paper presents a novel bidding curve design algorithm tailored for hybrid power plants (HPPs) to participate in the wholesale electricity market. Utilizing forecasts for photovoltaic (PV) generation and available battery power, our algorithm strategically computes the bidding curve to maximize HPP profit while adeptly managing the inherent uncertainty associated with PV power generation. In addition, the introduction of the penalty cost in HPP bidding curves provides the system operator a tool to effectively manage the system-level uncertainty that caused by HPPs. Numerical analysis through Monte Carlo simulations confirms that our bidding curve methodology outperforms the benchmark across various scenarios.

bidding curve↗
DOE OSTI2025

Co-designing Spectral Transformation Oracles with Hybrid Oscillator-Qubit Quantum Processors: From Algorithms to Compilation

We co-design a family of quantum eigenvalue transformation oracles that can be efficiently implemented on hybrid discrete- or continuous-variable (qubit or qumode) hardware. To illustrate the oracle’s representation-theoretic power and near-term experimental accessibility, we encode a Gaussian imaginary time-evolution spectral filter. As a result, we define a continuous linear combination of unitaries block encoding. Due to the ancillary qumode’s infinite-dimensional nature, continuous-variable qumodes constitute a powerful compilation tool for encoding continuous spectral functions without discretization errors while minimizing resource requirements. We then focus on the ubiquitous task of preparing eigenstates in quantum spin models. For completeness, we provide an end-to-end compilation which expresses high-level oracles in terms of an experimentally realizable instruction set architecture in both 1D and 2D. Finally, we examine the leading-order effects of physical errors and highlight open research directions. Our algorithms scale linearly with the spatial extent of the target system and are applicable to both near-term and large-scale quantum processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Hybrid Interior-Point/Active-Set SCOPF Algorithms Exploiting Power System Characteristics

These protected data were produced under agreement no. with the U.S. Department of Energy and may not be published, disseminated, or disclosed to others outside the Government until 5 years after development of information under this agreement, unless express written authorization is obtained from the recipient. Upon expiration of the period of protection set forth in this Notice, the Government shall have unlimited rights in this data. This Notice shall be marked on any reproduction of this data, in whole or in part.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Taylor-Expansion-Based Robust Power Flow in Unbalanced Distribution Systems: A Hybrid Data-Aided Method

Traditional power flow methods often adopt certain assumptions designed for passive balanced distribution systems, thus lacking practicality for unbalanced operation. moreover, their computation accuracy and efficiency are heavily subject to unknown errors and bad data in measurements or prediction data of distributed energy resources (ders). to address these issues, this paper proposes a hybrid data-aided robust power flow algorithm in unbalanced distribution systems, which combines taylor series expansion knowledge with a data-driven regression technique. the proposed method initiates a linearization power flow model to derive an explicitly analytical solution by modified taylor expansion. to mitigate the approximation loss that surges due to the der integration and bad data, we further develop a data-aided robust support vector regression approach to estimate the errors efficiently. comparative analysis in the 13-bus and 123-bus ieee unbalanced feeders shows that the proposed hybrid algorithm achieves superior computational efficiency, with guaranteed accuracy and robustness against outliers.

data-driven↗
DOE OSTI2024

Determining the N -Representability of a Reduced Density Matrix via Unitary Evolution and Stochastic Sampling

The N-representability problem consists in determining whether, for a given p-body matrix, there exists at least one N-body density matrix from which the p-body matrix can be obtained by contraction, that is, if the given matrix is a p-body reduced density matrix (p-RDM). The knowledge of all necessary and sufficient conditions for a p-body matrix to be N-representable allows the constrained minimization of a many-body Hamiltonian expectation value with respect to the p-body density matrix and, thus, the determination of its exact ground state. However, the number of constraints that complete the N-representability conditions grows exponentially with system size, and hence, the procedure quickly becomes intractable for practical applications. This work introduces a hybrid quantum-stochastic algorithm to effectively replace the N-representability conditions. The algorithm consists of applying to an initial N-body density matrix a sequence of unitary evolution operators constructed from a stochastic process that successively approaches the reduced state of the density matrix on a p-body subsystem, represented by a p-RDM, to a target p-body matrix, potentially a p-RDM. The generators of the evolution operators follow the well-known adaptive derivative-assembled pseudo-Trotter method (ADAPT), while the stochastic component is implemented by using a simulated annealing process. The resulting algorithm is independent of any underlying Hamiltonian, and it can be used to decide whether a given p-body matrix is N-representable, establishing a criterion to determine its quality and correcting it. We apply the proposed hybrid ADAPT algorithm to alleged reduced density matrices from a quantum chemistry electronic Hamiltonian, from the reduced Bardeen–Cooper–Schrieffer model with constant pairing, and from the Heisenberg XXZ spin model. In all cases, the proposed method behaves as expected for 1-RDMs and 2-RDMs, evolving the initial matrices toward different targets.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗