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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Leakage Reduces Device Coherence Demands for Pulse-Level Molecular Simulations

Quantum simulation on noisy intermediate-scale quantum devices is severely limited by short qubit coherence times. A variational pulse-shaping algorithm known as ctrl-VQE was recently proposed to address this issue by eliminating the need for parameterized quantum circuits, which lead to long state preparation times. Here, in this study, we find the fastest possible pulses that prepare target molecular wave functions for a given device Hamiltonian describing coupled transmon qubits using simulations. We find that the resulting time-optimal pulses develop a bang-bang form consistent with Pontryagin’s maximum principle. We further investigate how the minimal state preparation time is impacted by the number of energy levels active in the transmon simulations. We find that leakage outside the computational subspace (something that is usually considered problematic) speeds up the state preparation, further reducing device coherence-time demands. Our analysis reveals that this speedup is due to both an enlarged solution space of target wave functions and the appearance of additional channels connecting initial and target states.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Lipkin model on a quantum computer

Atomic nuclei are important laboratories for exploring and testing new insights into the universe, such as experiments to directly detect dark matter or explore properties of neutrinos. The targets of interest are often heavy, complex nuclei that challenge our ability to reliably model them (as well as quantify the uncertainty of those models) with classical computers. Hence there is great interest in applying quantum computation to nuclear structure for these applications. As an early step in this direction, especially with regards to the uncertainties in the relevant quantum calculations, we develop circuits to implement variational quantum eigensolver (VQE) algorithms for the Lipkin-Meshkov-Glick model, which is often used in the nuclear physics community as a testbed for many-body methods. Here, we present quantum circuits for VQE for two and three particles and discuss the construction of circuits for more particles. Implementing the VQE for a two-particle system on the IBM Quantum Experience, we identify initialization and two-qubit gates as the largest sources of error. We find that error mitigation procedures reduce the errors in the results significantly, but additional quantum hardware improvements are needed for quantum calculations to be sufficiently accurate to be competitive with the best current classical methods.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Gutzwiller hybrid quantum-classical computing approach for correlated materials

Rapid progress in noisy intermediate-scale quantum (NISQ) computing technology has led to the development of novel resource-efficient hybrid quantum-classical algorithms, such as the variational quantum eigensolver (VQE), that can address open challenges in quantum chemistry, physics, and material science. Proof-of-principle quantum chemistry simulations for small molecules have been demonstrated on NISQ devices. While several approaches have been theoretically proposed for correlated materials, NISQ simulations of interacting periodic models on current quantum devices have not yet been demonstrated. Here, we develop a hybrid quantum-classical simulation framework for correlated electron systems based on the Gutzwiller variational embedding approach. We implement this framework on Rigetti quantum processing units (QPUs) and apply it to the periodic Anderson model, which describes a correlated heavy electron band hybridizing with noninteracting conduction electrons. Our simulation results quantitatively reproduce the known ground state quantum phase diagram including metallic, Kondo and Mott insulating phases. This is the first fully self-consistent hybrid quantum-classical simulation of an infinite correlated lattice model executed on QPUs, demonstrating that the Gutzwiller hybrid quantum-classical embedding framework is a powerful approach to simulate correlated materials on NISQ hardware. This benchmark study also puts forth a concrete pathway towards practical quantum advantage on NISQ devices.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Enabling Scalable VQE Simulation on Leading HPC Systems

Large-scale simulations of quantum circuits pose significant challenges, especially in the context of quantum chemistry, due to the number of qubits, circuit depth, and the number of circuits needed per problem. High-performance computing (HPC) systems offer massive computational capabilities that could help overcome these obstacles. We developed a high-performance quantum circuit simulator, called NWQ-Sim, and demonstrate its capability to simulate large quantum chemistry problems on NERSC's Perlmutter supercomputer. Integrating NWQ-Sim with XACC, we have executed QPE and VQE algorithms for downfolded quantum chemistry systems at unprecedented scales. Our work demonstrates the potential of leveraging HPC resources to advance quantum chemistry and other applications of near-term quantum devices.

Wang, Meng↗
DOE OSTI2023

tih_vqe [SWR-23-32]

This software supports the paper, "Exploring the scaling limitations of the variational quantum eigensolver with the bond dissociation of hydride diatomic molecules," published in the International Journal of Quantum Chemistry, whose abstract is as follows: Materials simulations involving strongly correlated electrons pose fundamental challenges to state-of-the-art electronic structure methods but are hypothesized to be the ideal use case for quantum computing. To date, no quantum computer has simulated a molecule of a size and complexity relevant to real-world applications, despite the fact that the variational quantum eigensolver (VQE) algorithm can predict chemically accurate total energies. Nevertheless, because of the many applications of moderately-sized, strongly correlated systems, such as molecular catalysts, the successful use of the VQE stands as an important waypoint in the advancement toward useful chemical modeling on near-term quantum processors. In this paper, we take a significant step in this direction. We lay out the steps, write, and run parallel code for an (emulated) quantum computer to compute the bond dissociation curves of the TiH, LiH, NaH, and KH diatomic hydride molecules using VQE. TiH was chosen as a relatively simple chemical system that incorporates d orbitals and strong electron correlation. Because current VQE implementations on existing quantum hardware are limited by qubit error rates, the number of qubits available, and the allowable gate depth, recent studies have focused on chemical systems involving s and p block elements. Through VQE + UCCSD calculations of TiH, we evaluate the near-term feasibility of modeling a molecule with d-orbitals on real quantum hardware. We demonstrate that the inclusion of d-orbitals and the use of the UCCSD ansatz, which are both necessary to capture the correct TiH physics, dramatically increase the cost of this problem. We estimate the approximate error rates necessary to model TiH on current quantum computing hardware using VQE+UCCSD and show them to likely be prohibitive until significant improvements in hardware and error correction algorithms are available.

Graf, Peter↗
DOE OSTI2020

Approaching scalable VQE of interacting bosons with NISQ devices [Slides]

Scaling up variational quantum eigensolver (VQE) algorithms to practical applications utilizing quantum advantage with noisy intermediate-scale quantum (NISQ) devices is challenging. The expansive cost-function evaluation and demanding optimization quickly exhaust the precious quantum resource available on NISQ devices. In this work, we discuss the appropriate VQE strategy suitable for multi-site interacting boson systems, for example, the Holstein model and the Rabi lattice model. We investigate the cost-function setup and the optimization tactics to utilize the limited quantum resource efficiently. Our strategy illustrates that the scalable VQE algorithms of interacting bosons have a promising future.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Effect of GPS Manipulation to Traditional and Next Generation Relay Protection

This project’s objective is to test the effect of GPS timing variations on relay protection algorithms to determine vulnerabilities and the associated hazards to the electric grid. This will focus on differential protection which utilizes peer to peer communication between substations to determine if the current is not equivalent. This requires the use of GPS to sync the two substations and can be vulnerable to GPS manipulation. However, the effects of GPS manipulation are not a commonly known risk. Therefore, this LDRD will address the risks of GPS manipulation for such a widely implemented technology. For differential protection a GPS resilient architecture was implemented and tested for differential protective relays through a direct serial fiber connection between the two relays. This allows for one relay to be the master and provide synchronization outside of timestamp for differential protection.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Effect of GPS Manipulation to Traditional and Next Generation Relay Protection (Final Report)

This project’s objective is to test the effect of GPS timing variations on relay protection algorithms to determine vulnerabilities and the associated hazards to the electric grid. This will focus on time domain protection which utilizes traveling waves measured on the transmission lines to detect the fault within a tower span. This requires the use of GPS to sync the two substations and can be vulnerable to GPS manipulation. However, the effects of GPS manipulation are not a commonly known risk. Therefore, this LDRD will address the risks of GPS manipulation for on a new protective relay technology that has the potential to change protective relaying. For time domain protection a GPS resilient architecture was implemented and tested for time domain protective relays through a direct serial fiber connection between the two relays. This allows for one relay to be the master and provide synchronization outside of timestamp for traveling wave protection.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Building spatial symmetries into parameterized quantum circuits for faster training

Practical success of quantum learning models hinges on having a suitable structure for the parameterized quantum circuit. Such structure is defined both by the types of gates employed and by the correlations of their parameters. While much research has been devoted to devising adequate gate-sets, typically respecting some symmetries of the problem, very little is known about how their parameters should be structured. In this work, we show that an ideal parameter structure naturally emerges when carefully considering spatial symmetries (i.e. the symmetries that are permutations of parts of the system under study). Namely, we consider the automorphism group of the problem Hamiltonian, leading us to develop a circuit construction that is equivariant under this symmetry group. The benefits of our novel circuitstructure, called ORB, are numerically probed in several ground-state problems. We find a consistent improvement (in terms of circuit depth, number of parameters required, and gradient magnitudes) compared to literature circuit constructions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Quantum simulation of massive Thirring and Gross--Neveu models for arbitrary number of flavors

The study of fermionic quantum field theories is an important problem for realizing the standard model of particle physics on a quantum computer. As a step towards this goal, we consider the massive Thirring and Gross--Neveu models with arbitrary number of fermion flavors, $N_f$, discretized on a spatial one-dimensional lattice of size $L$ in the Hamiltonian formulation. We compute the gate complexity using the higher-order product formula and using block-encoding/qubitization and quantum singular value transformations in the limit of large $N_f$ and $L$. We also prepare the ground states of both models with excellent fidelity for system sizes up to 20 qubits with $N_f = 1,2,3,4$ using the adaptive-variational quantum imaginary time algorithm. In addition, we also classify the dynamical Lie algebras of these relativistic fermionic models and show that they belong to the same isomorphism class. Our work is a concrete step towards the quantum simulation of real-time dynamics of large $N_f$ fermionic quantum field theories models relevant for chiral symmetry breaking, understanding dimensional transmutation, and exploring the conformal window of field theories on near-term and early fault-tolerant quantum computers.

FOS: Physical sciences↗
DOE OSTI2020

QTG-Finder2: A Generalized Machine-Learning Algorithm for Prioritizing QTL Causal Genes in Plants

Linkage mapping has been widely used to identify quantitative trait loci (QTL) in many plants and usually requires a time-consuming and labor-intensive fine mapping process to find the causal gene underlying the QTL. Previously, we described QTG-Finder, a machine-learning algorithm to rationally prioritize candidate causal genes in QTLs. Although it showed good performance, QTG-Finder could only be used in Arabidopsis and rice because of the limited number of known causal genes in other species. Here we tested the feasibility of enabling QTG-Finder to work on species that have few or no known causal genes by using orthologs of known causal genes as training set. The model trained with orthologs could recall about 64% of Arabidopsis and 83% of rice causal genes when the top 20% ranked genes were considered, which is similar to the performance of models trained with known causal genes. The average precision was 0.027 for Arabidopsis and 0.029 for rice. We further extended the algorithm to include polymorphisms in conserved non-coding sequences and gene presence/absence variation as additional features. Using this algorithm, QTG-Finder2, we trained and cross-validated Sorghum bicolor and Setaria viridis models. The S. bicolor model was validated by causal genes curated from the literature and could recall 70% of causal genes when the top 20% ranked genes were considered. Furthermore, we applied the S. viridis model and public transcriptome data to prioritize a plant height QTL and identified 13 candidate genes. QTL-Finder2 can accelerate the discovery of causal genes in any plant species and facilitate agricultural trait improvement.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Mutual information-assisted adaptive variational quantum eigensolver

Adaptive construction of ansatz circuits offers a promising route towards applicable variational quantum eigensolvers on near-term quantum hardware. Those algorithms aim to build up optimal circuits for a certain problem and ansatz circuits are adaptively constructed by selecting and adding entanglers from a predefined pool. In this work, we propose a way to construct entangler pools with reduced size by leveraging classical algorithms. Our method uses mutual information between the qubits in classically approximated ground state to rank and screen the entanglers. The density matrix renormalization group method is employed for classical precomputation in this work. We corroborate our method numerically on small molecules. Our numerical experiments show that a reduced entangler pool with a small portion of the original entangler pool can achieve same numerical accuracy. Here, we believe that our method paves a new way for adaptive construction of ansatz circuits for variational quantum algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Adaptive variational simulation for open quantum systems

Emerging quantum hardware provides new possibilities for quantum simulation. While much of the research has focused on simulating closed quantum systems, the real-world quantum systems are mostly open. Therefore, it is essential to develop quantum algorithms that can effectively simulate open quantum systems. Here we present an adaptive variational quantum algorithm for simulating open quantum system dynamics described by the Lindblad equation. The algorithm is designed to build resource-efficient ansatze through the dynamical addition of operators by maintaining the simulation accuracy. We validate the effectiveness of our algorithm on both noiseless simulators and IBM quantum processors and observe good quantitative and qualitative agreement with the exact solution. We also investigate the scaling of the required resources with system size and accuracy and find polynomial behavior. Our results demonstrate that near-future quantum processors are capable of simulating open quantum systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Model and Standard Operating Procedures Supporting Signal Variation Flow Graph Analysis

This document will describe the principles of the Signal Variation Flow Technique, and the uncertainty models generated using it. We focus on the capture of the variation between the ideal signal and the measured signal. The ideal signal is defined to represent the signal output of a system whose full state behavior is known, with no variation in environment or during operation, and whose photons trajectories are not modified by the object. A CT uncertainty analysis is the result of two main steps. First, the radiography regime extends from the source to the collected image, which is 2D in the case of standard CT. This maps all upstream uncertainties into the variation observed on the radiograph and captures all variation in the physical domain. Second, the reconstruction regime extends from the captured images to the reconstructed 3D image. This regime is purely in the mathematical domain and corrects reconstruction algorithm artifacts/anomalies. The present work focuses on building the model through the radiography regime. The reconstruction regime is expected to be largely a study of algorithmic sensitivity, requiring the definition of a range of standardized tests through which the algorithms would be run. Radiographic variation would then be mapped through reconstruction sensitivities to predict the signal variation in the final image. An incomplete list for the reconstructed image variation output basis includes voxel density, edge blur and length variation, in analogous fashion to the basis functions presented in this work. The signal variation occurs in several forms at the radiograph. These forms are gathered into a complete basis set of functions describing all variation on the radiograph. The scale of each basis function is calculated independently via a specific SVFG. This includes 0D pixel noise (0DI), 0D energy noise (0DE), 1D blur (1DB), 1D length (1DL) or 2D position (2DP). These models are orthogonal in that they each explore a space in the signal variation domain that cannot be reached by the other basis functions. The variation basis functions, and associated SVFG models are split by output dimensionality, a term loosely used for categorization, and explained further below.

42 ENGINEERING↗
DOE OSTI2022

Solving Unit Commitment Problems with Demand Responsive Loads: Preprint

This paper focuses on using variations of the Frank-Wolfe algorithm for solving unit commitment problems with high volumes of demand responsive loads on the power grid. We present a formulation of the unit commitment problem with demand responsive loads. We then show through reformulation and relaxations of the problem that variations of the Frank-Wolfe algorithm can be used to determine the time series decisions for the demand responsive loads. We show through computational experiments on the RTS-GMLC test system that the time series of demand responsive load decisions obtained through our approach are near optimal and provide details regarding how large scale parallel implementations of our approach can be highly computationally efficient.

demand response↗
DOE OSTI2021

Stellar and Accretion Disk Parameters of the Close Binary HD 50526

We present a photometric and spectroscopic study of HD 50526, an ellipsoidal binary member of the group Double Periodic Variable stars. Performing data mining in photometric surveys and conducting new spectroscopic observations with several spectrographs during 2008–2015, we obtained orbital and stellar parameters of the system. The radial velocities were analyzed with the genetic PIKAIA algorithm, whereas Doppler tomography maps for the Hα and Hβ lines were constructed with the Total Variation Minimization code. An optimized simplex algorithm was used to solve the inverse problem adjusting the light curve with the best stellar parameters for the system. We find an orbital period of 6.ͩ701 ± 0.ͩ001 and a long photometric cycle of 191 ± 2 days. We detected the spectral features of the coldest star and modeled it with a logg=2.79±0.02 dex giant of mass 1.13 ± 0.02 M {sub ⊙} and effective temperature 10500 ± 125 K. In addition, we determine a mass ratio q = 0.206 ± 0.033 and that the hot star is a B-type dwarf of mass 5.48 ± 0.02 M {sub ⊙}. The V-band orbital light curve can be modeled including the presence of an accretion disk around the hotter star. This fills the Roche lobe of the hotter star and has a radius 14.74 ± 0.02 R {sub ⊙} and the temperature at the outer edge is 9400 K. Two bright spots located in the disk account for the global morphology of the light curve. The Doppler tomography maps of Hα and Hβ reveal complex structures of mass fluxes in the system.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Enhancing Cyber Resilience of Networked Microgrids using Vertical Federated Reinforcement Learning

This paper presents a novel federated reinforcement learning (Fed-RL) methodology to inject sufficient resiliency into the operations of the network of microgrids. We consider adversarial actions to the voltage and power control loop reference signals at the grid forming (GFM) inverters in the microgrids which are essential to integrate renewable resources. Therefore, we formulate a resilient reinforcement learning training setup that uses these adversarial injections to generate episodic trajectories and train the RL agents to alleviate their impact on performance. To circumvent the concerns about data-sharing and privacy for different owners of the microgrids in the networked setting, we bring in the aspects of the federated operation to propose novel Fed-RL algorithms. As the dynamics of each microgrid are coupled due to electrical interlinks, the conventional federated RL approaches using decoupled independent environments are not applicable, which leads us to propose a multi-agent vertically federated variation of actor-critic algorithms, namely federated soft actor-critic (FedSAC). We have performed numerical simulations on an IEEE 123-bus benchmark test feeder with three microgrids by creating a customized simulation setup by encapsulating the microgrid dynamic simulations in GridLAB-D/HELICS co-simulation platform with the OpenAI Gym environment and validated the proposed resilient and secured learning methodology.

Artificial Intelligence (AI), reinforcement learni↗