Search NASA⌕ Search

SEARCH · Search NASA

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 325 records · Page 18

Quantum neural networks to simulate many-body quantum systems

We conduct experimental simulations of many-body quantum systems using a hybrid classical-quantum algorithm. In our setup, the wave function of the transverse field quantum Ising model is represented by a restricted Boltzmann machine. This neural network is then trained using variational Monte Carlo assisted by a D -wave quantum sampler to find the ground-state energy. Our results clearly demonstrate that already the first generation of quantum computers can be harnessed to tackle nontrivial problems concerning physics of many-body quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Phase diagram of the lattice G{sub 2} Higgs model

We study the phases and phase transition lines of the finite temperature G{sub 2} Higgs model. Our work is based on an efficient local hybrid Monte-Carlo algorithm which allows for accurate measurements of expectation values, histograms, and susceptibilities. On smaller lattices we calculate the phase diagram in terms of the inverse gauge coupling {beta} and the hopping parameter {kappa}. For {kappa}{yields}0 the model reduces to G{sub 2} gluodynamics and for {kappa}{yields}{infinity} to SU(3) gluodynamics. In both limits the system shows a first order confinement-deconfinement transition. We show that the first order transitions at asymptotic values of the hopping parameter are almost joined by a line of first order transitions. A careful analysis reveals that there exists a small gap in the line where the first order transitions turn into continuous transitions or a crossover region. For {beta}{yields}{infinity} the gauge degrees of freedom are frozen and one finds a nonlinear O(7) sigma model which exhibits a second order transition from a massive O(7) symmetric to a massless O(6) symmetric phase. The corresponding second order line for large {beta} remains second order for intermediate {beta} until it comes close to the gap between the two first order lines. Besides this second order line and the first order confinement-deconfinement transitions we find a line of monopole-driven bulk transitions which do not interfere with the confinement-deconfinment transitions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Simulation of Nonequilibrium Dynamics on a Quantum Computer

We present a hybrid quantum-classical algorithm for the time evolution of out-of-equilibrium thermal states. Here, the method depends on classically computing a sparse approximation to the density matrix and, then, time-evolving each matrix element via the quantum computer. For this exploratory study, we investigate a time-dependent Ising model with five spins on the Rigetti Forest quantum virtual machine and a one spin system on the Rigetti 8Q-Agave quantum processor.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

Parallel-in-time quantum simulation via Page and Wootters quantum time

In the past few decades, researchers have created a veritable zoo of quantum algorithms by drawing inspiration from classical computing, information theory, and even from physical phenomena. Here, we present quantum algorithms for parallel-in-time simulations that are inspired by the Page and Wootters formalism. In this framework, and thus in our algorithms, the classical time variable of quantum mechanics is promoted to the quantum realm by introducing a Hilbert space of “clock” qubits that are then entangled with the “system” qubits. We show that our algorithms can compute temporal properties over 𝑁 different times of many-body systems by only using log⁡(𝑁) clock qubits. As such, we achieve an exponential trade-off between time and spatial complexities. In addition, we rigorously prove that the entanglement created between the system qubits and the clock qubits has operational meaning, as it encodes valuable information about the system’s dynamics. We also provide a circuit depth estimation of all the protocols, showing a running time advantage in computation times over traditional sequential-in-time algorithms. In particular, for the case when the dynamics are determined by the Aubry-Andre model, we present a hybrid method for which our algorithms have a depth that only scales as 𝒪⁡(log⁡(𝑁)⁢𝑛). As a by-product, we can relate the previous schemes to the problem of equilibration of an isolated quantum system, thus indicating that our framework enables a new dimension for studying dynamical properties of many-body systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Demand Response and Smart Buildings: A Survey of Control, Communication, and Cyber-Physical Security

In this paper, we perform a comprehensive survey of the technical aspects related to the implementation of demand response and smart buildings. Specifically, we discuss various smart loads such as heating, ventilating, and air-conditioning (HVAC) systems and plug-in electric vehicles (PEVs); the power architecture with multibus characteristics; different control algorithms such as the hybrid centralized and decentralized control and the distributed coordination among buildings; the communication technologies and network architectures; and the potential cyber-physical security issues and possible mechanisms for enhancing the system security at both cyber and physical layers. Finally, the current status of the demand response in United States, Europe, Japan, and China is reviewed, and the benefits, costs, and challenges of implementing and operating demand response and smart buildings are also discussed.

42 ENGINEERING↗

Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale

The numerical simulation of quantum circuits is an indispensable tool for development, verification, and validation of hybrid quantum-classical algorithms intended for near-term quantum co-processors. The emergence of exascale high-performance computing (HPC) platforms presents new opportunities for pushing the boundaries of quantum circuit simulation. Here, we present a modernized version of the Tensor Network Quantum Virtual Machine (TNQVM) that serves as the quantum circuit simulation backend in the eXtreme-scale ACCelerator (XACC) framework. The new version is based on the scalable tensor network processing library ExaTN (Exascale Tensor Networks). It provides multiple configurable quantum circuit simulators that perform either an exact quantum circuit simulation via the full tensor network contraction or an approximate simulation via a suitably chosen tensor factorization scheme. Upon necessity, stochastic noise modeling from real quantum processors is incorporated into the simulations by modeling quantum channels with Kraus tensors. By combining the portable XACC quantum programming frontend and the scalable ExaTN numerical processing backend, we introduce an end-to-end virtual quantum development environment that can scale from laptops to future exascale platforms. We report initial benchmarks of our framework, which include a demonstration of the distributed execution, incorporation of quantum decoherence models, and simulation of the random quantum circuits used for the certification of quantum supremacy on Google’s Sycamore superconducting architecture.

Nguyen, Thien↗

Localization in Energy Materials (Final Project Report)

The last year of this award we have continued our research on using quantum machine learning to identify phase transitions. By combining quantum machine learning with quantum computing, we extended a hybrid classical-quantum algorithm to capture the metal-insulator quantum phase transition of the Hubbard model. We have also continued our studies of non-equilibrium dynamics of interacting disordered systems. In particular, we studied the non-equilibrium transient dynamics of a system described by the Anderson-Hubbard model following an interaction and disorder quench, and the effect of disorder on the out-of-time-order correlator on the Hubbard model.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Variational Quantum Fidelity Estimation

Computing quantum state fidelity will be important to verify and characterize states prepared on a quantum computer. In this work, we propose novel lower and upper bounds for the fidelity F ( ρ , σ ) based on the ``truncated fidelity'' F ( ρ m , σ ) , which is evaluated for a state ρ m obtained by projecting ρ onto its m -largest eigenvalues. Our bounds can be refined, i.e., they tighten monotonically with m . To compute our bounds, we introduce a hybrid quantum-classical algorithm, called Variational Quantum Fidelity Estimation, that involves three steps: (1) variationally diagonalize ρ , (2) compute matrix elements of σ in the eigenbasis of ρ , and (3) combine these matrix elements to compute our bounds. Our algorithm is aimed at the case where σ is arbitrary and ρ is low rank, which we call low-rank fidelity estimation, and we prove that no classical algorithm can efficiently solve this problem under reasonable assumptions. Finally, we demonstrate that our bounds can detect quantum phase transitions and are often tighter than previously known computable bounds for realistic situations.

97 MATHEMATICS AND COMPUTING↗

Quantum Machine Learning with SQUID

In this work we present the Scaled QUantum IDentifier (SQUID), an open-source framework for exploring hybrid Quantum-Classical algorithms for classification problems. The classical infrastructure is based on PyTorch and we provide a standardized design to implement a variety of quantum models with the capability of back-propagation for efficient training. We present the structure of our framework and provide examples of using SQUID in a standard binary classification problem from the popular MNIST dataset. In particular, we highlight the implications for scalability for gradient-based optimization of quantum models on the choice of output for variational quantum models.

97 MATHEMATICS AND COMPUTING↗

Optimization of a Unipolar Magnetic Bearing

New designs of unipolar magnetic bearings in electrical industrial machines are optimized by means of genetic algorithms. As a result, the optimal geometric dimensions are determined. On that basis, a design is developed for an electric motor with a unipolar active magnetic bearing.

42 ENGINEERING↗

Pelleting of Pine and Switchgrass Blends: Effect of Process Variables and Blend Ratio on the Pellet Quality and Energy Consumption

The blending of woody and herbaceous biomass can influence pellet quality and the energy consumption of the process. This work aims to understand the pelleting characteristics of 2-inch top-pine residue blended with switchgrass at high moisture content. The process variables tested are blend moisture content, length-to-diameter (L/D) ratio in the pellet die, and the blend ratio. A flat die pellet mill was also used in this study. The pine and switchgrass blend ratios that were tested include: (1) 25% 2-inch top pine residue with 75% switchgrass; (2) 50% 2-inch top pine residue with 50% switchgrass; and (3) 75% 2-inch top pine residue with 25% switchgrass. The pelleting process conditions tested included the L/D ratio in the pellet die (i.e., 1.5 to 2.6) and the blend moisture content (20 to 30%, w.b.). Analysis of experimental data indicated that blending 25% switchgrass with 75% 2-inch top pine residue and 50% switchgrass with 50% 2-inch top pine residue resulted in pellets with a bulk density of > 550 kg/m3 and durability of > 95%. Optimization of the response surface models developed for process conditions in terms of product properties indicated that a higher L/D ratio of 2.6 and a lower blend-moisture content of 20% (w.b.) maximized bulk density and durability. Higher pine in the blends improved the pellet durability and reduced energy consumption.

09 BIOMASS FUELS↗

Hybrid Quantum-Classical Eigensolver without Variation or Parametric Gates

The use of near-term quantum devices that lack quantum error correction, for addressing quantum chemistry and physics problems, requires hybrid quantum-classical algorithms and techniques. Here, we present a process for obtaining the eigenenergy spectrum of electronic quantum systems. This is achieved by projecting the Hamiltonian of a quantum system onto a limited effective Hilbert space specified by a set of computational bases. From this projection, an effective Hamiltonian is obtained. Furthermore, a process for preparing short depth quantum circuits to measure the corresponding diagonal and off-diagonal terms of the effective Hamiltonian is given, whereby quantum entanglement and ancilla qubits are used. The effective Hamiltonian is then diagonalized on a classical computer using numerical algorithms to obtain the eigenvalues. The use case of this approach is demonstrated for ground state and excited states of BeH2 and LiH molecules, and the density of states, which agrees well with exact solutions. Additionally, hardware demonstration is presented using IBM quantum devices for H2 molecule.

Jouzdani, Pejman (ORCID:0000000256470381)↗

Integrating machine learning interatomic potentials with hybrid reverse Monte Carlo structure refinements in RMCProfile

Structure refinement with reverse Monte Carlo (RMC) is a powerful tool for interpreting experimental diffraction data. To ensure that the under-constrained RMC algorithm yields reasonable results, the hybrid RMC approach applies interatomic potentials to obtain solutions that are both physically sensible and in agreement with experiment. To expand the range of materials that can be studied with hybrid RMC, we have implemented a new interatomic potential constraint in RMCProfile that grants flexibility to apply potentials supported by the Large-scale Atomic/Molecular Massively Parallel Simulator ( LAMMPS ) molecular dynamics code. This includes machine learning interatomic potentials, which provide a pathway to applying hybrid RMC to materials without currently available interatomic potentials. To this end, we present a methodology to use RMC to train machine learning interatomic potentials for hybrid RMC applications.

Cuillier, Paul↗

Synchronous parallel kinetic Monte Carlo Diffusion in Heterogeneous Systems

A new hybrid Molecular Dynamics-kinetic Monte Carlo algorithm has been developed in order to study the basic mechanisms taking place in diffusion in concentrated alloys under the action of chemical and stress fields. Parallel implementation of the k-MC part based on a recently developed synchronous algorithm [1. Compo Phys. 227 (2008) 3804-3823] resorting on the introduction of a set of null events aiming at synchronizing the time for the different subdomains, added to the parallel efficiency of MD, provides the computer power required to evaluate jump rates 'on the flight', incorporating in this way the actual driving force emerging from chemical potential gradients, and the actual environment-dependent jump rates. The time gain has been analyzed and the parallel performance reported. The algorithm is tested on simple diffusion problems to verify its accuracy.

36 MATERIALS SCIENCE↗

Assessing VQLS for Fluid Dynamics on a Hybrid Quantum-HPC Stack

Recent advances in quantum linear solvers offer a promising direction for accelerating extreme scientific computations such as fluid dynamics. However, the deep and complex circuits required by many quantum algorithms limit their practical use on current quantum hardware. The Variational Quantum Linear Solver (VQLS) presents a viable alternative for near-term quantum devices (NISQ), and initial efforts have explored its application to select fluid dynamics problems. In this work, we evaluate the use of VQLS for canonical fluid dynamics problems, aiming to identify pathways for generalizing its implementation across a broader class of systems. We analyze the impact of various circuit ansatz and classical optimizers on solution quality and convergence behavior. Furthermore, we assess the algorithm's feasibility within a hybrid quantum–high-performance computing (HPC) framework by porting it to QFw, a state-of-the-art quantum-HPC software stack. 11This manuscript has been authored by UT-Battelle, LLC, under contract DE-AC05-00OR22725 with the US Department of Energy (DOE). The US government retains and the publisher, by accepting the article for publication, acknowledges that the US government retains a nonexclusive, paid-up, irrevocable, worldwide license to publish or reproduce the published form of this manuscript, or allow others to do so, for US government purposes. DOE will provide public access to these results of federally sponsored research in accordance with the DOE Public Access Plan. This research used resources of the Oak Ridge Leadership Computing Facility at the Oak Ridge National Laboratory, which is supported by the Office of Science of the US DOE under Contract No. DE-AC05-00OR22725.

Gopalakrishnan Meena, Murali [ORNL] (ORCID:0000000↗

A Hybrid Semi-supervised Classification Scheme for Mining Multisource Geospatial Data

Supervised learning methods such as Maximum Likelihood (ML) are often used in land cover (thematic) classification of remote sensing imagery. ML classifier relies exclusively on spectral characteristics of thematic classes whose statistical distributions (class conditional probability densities) are often overlapping. The spectral response distributions of thematic classes are dependent on many factors including elevation, soil types, and ecological zones. A second problem with statistical classifiers is the requirement of large number of accurate training samples (10 to 30 |dimensions|), which are often costly and time consuming to acquire over large geographic regions. With the increasing availability of geospatial databases, it is possible to exploit the knowledge derived from these ancillary datasets to improve classification accuracies even when the class distributions are highly overlapping. Likewise newer semi-supervised techniques can be adopted to improve the parameter estimates of statistical model by utilizing a large number of easily available unlabeled training samples. Unfortunately there is no convenient multivariate statistical model that can be employed for mulitsource geospatial databases. In this paper we present a hybrid semi-supervised learning algorithm that effectively exploits freely available unlabeled training samples from multispectral remote sensing images and also incorporates ancillary geospatial databases. We have conducted several experiments on real datasets, and our new hybrid approach shows over 25 to 35% improvement in overall classification accuracy over conventional classification schemes.

54 ENVIRONMENTAL SCIENCES↗