Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quantum machine”

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 OSTI2025

High temperature melting of dense molecular hydrogen from machine-learning interatomic potentials trained on quantum Monte Carlo

We present results and discuss methods for computing the melting temperature of dense molecular hydrogen using a machine learned model trained on quantum Monte Carlo data. In this newly trained model, we emphasize the importance of accurate total energies in the training. We integrate a two phase method for estimating the melting temperature with estimates from the Clausius–Clapeyron relation to provide a more accurate melting curve from the model. We make detailed predictions of the melting temperature, solid and liquid volumes, latent heat, and internal energy from 50 to 180 GPa for both classical hydrogen and quantum hydrogen. At pressures of roughly 173 GPa and 1635 K, we observe molecular dissociation in the liquid phase. Here, we compare with previous simulations and experimental measurements.

08 HYDROGEN↗
DOE OSTI2023

Stable Solid Molecular Hydrogen above 900 K from a Machine-Learned Potential Trained with Diffusion Quantum Monte Carlo

Here, we survey the phase diagram of high-pressure molecular hydrogen with path integral molecular dynamics using a machine-learned interatomic potential trained with quantum Monte Carlo forces and energies. Besides the HCP and C2/c–24 phases, we find two new stable phases both with molecular centers in the Fmmm–4 structure, separated by a molecular orientation transition with temperature. The high temperature isotropic Fmmm–4 phase has a reentrant melting line with a maximum at higher temperature (1450 K at 150 GPa) than previously estimated and crosses the liquid-liquid transition line around 1200 K and 200 GPa.

08 HYDROGEN↗
DOE OSTI2020

Accelerating Scientific Computing in the Post-Moore’s Era

Novel uses of graphical processing units for accelerated computation revolutionized the field of high-performance scientific computing by providing specialized workflows tailored to algorithmic requirements. As the era of Moore’s law draws to a close, many new non–von Neumann processors are emerging as potential computational accelerators, including those based on the principles of neuromorphic computing, tensor algebra, and quantum information. While development of these new processors is continuing to mature, the potential impact on accelerated computing is anticipated to be profound. We discuss how different processing models can advance computing in key scientific paradigms: machine learning and constraint satisfaction. Significantly, each of these new processor types utilizes a fundamentally different model of computation, and this raises questions about how to best use such processors in the design and implementation of applications. While many processors are being developed with a specific domain target, the ubiquity of spin-glass models and neural networks provides an avenue for multi-functional applications. Furthermore, this also hints at the infrastructure needed to integrate next-generation processing units into future high-performance computing systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Training a Quantum Annealing Based Restricted Boltzmann Machine on Cybersecurity Data

A restricted Boltzmann machine (RBM) is a generative model that could be used in effectively balancing a cybersecurity dataset because the synthetic data a RBM generates follows the probability distribution of the training data. RBM training can be performed using contrastive divergence (CD) and quantum annealing (QA). QA-based RBM training is fundamentally different from CD and requires samples from a quantum computer. We present a real-world application that uses a quantum computer. Specifically, we train a RBM using QA for cybersecurity applications. The D-Wave 2000Q has been used to implement QA. RBMs are trained on the ISCX data, which is a benchmark dataset for cybersecurity. For comparison, RBMs are also trained using CD. CD is a commonly used method for RBM training. Our analysis of the ISCX data shows that the dataset is imbalanced. We present two different schemes to balance the training dataset before feeding it to a classifier. The first scheme is based on the undersampling of benign instances. The imbalanced training dataset is divided into five sub-datasets that are trained separately. A majority voting is then performed to get the result. Our results show the majority vote increases the classification accuracy up from 90.24% to 95.68%, in the case of CD. For the case of QA, the classification accuracy increases from 74.14% to 80.04%. In the second scheme, a RBM is used to generate synthetic data to balance the training dataset. We show that both QA and CD-trained RBM can be used to generate useful synthetic data. Balanced training data is used to evaluate several classifiers. Among the classifiers investigated, K-Nearest Neighbor (KNN) and Neural Network (NN) perform better than other classifiers. They both show an accuracy of 93%. Our results show a proof-of-concept that a QA-based RBM can be trained on a 64-bit binary dataset. The illustrative example suggests the possibility to migrate many practical classification problems to QA-based techniques. Further, we show that synthetic data generated from a RBM can be used to balance the original dataset.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Quantum Divide and Compute: Exploring the Effect of Different Noise Sources

Abstract Our recent work (Ayral et al. in Proceedings of IEEE computer society annual symposium on VLSI, ISVLSI, pp 138–140, 2020. 10.1109/ISVLSI49217.2020.00034 ) showed the first implementation of the Quantum Divide and Compute (QDC) method, which allows to break quantum circuits into smaller fragments with fewer qubits and shallower depth. This accommodates the limited number of qubits and short coherence times of quantum processors. This article investigates the impact of different noise sources—readout error, gate error and decoherence—on the success probability of the QDC procedure. We perform detailed noise modeling on the Atos Quantum Learning Machine, allowing us to understand tradeoffs and formulate recommendations about which hardware noise sources should be preferentially optimized. We also describe in detail the noise models we used to reproduce experimental runs on IBM’s Johannesburg processor. This article also includes a detailed derivation of the equations used in the QDC procedure to compute the output distribution of the original quantum circuit from the output distribution of its fragments. Finally, we analyze the computational complexity of the QDC method for the circuit under study via tensor-network considerations, and elaborate on the relation the QDC method with tensor-network simulation methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Noise-Resilient and Reduced Depth Approximate Adders for NISQ Quantum Computing

The "Noisy intermediate-scale quantum" NISQ machine era primarily focuses on mitigating noise, controlling errors, and executing high-fidelity operations, hence requiring shallow circuit depth and noise robustness. Approximate computing is a novel computing paradigm that produces imprecise results by relaxing the need for fully precise output for error-tolerant applications including multimedia, data mining, and image processing. We investigate how approximate computing can improve the noise resilience of quantum adder circuits in NISQ quantum computing. We propose five designs of approximate quantum adders to reduce depth while making them noise-resilient, in which three designs are with carryout, while two are without carryout. We have used novel design approaches that include approximating the Sum only from the inputs (pass-through designs) and having zero depth, as they need no quantum gates. The second design style uses a single CNOT gate to approximate the SUM with a constant depth of O(1). We performed our experimentation on IBM Qiskit on noise models including thermal, depolarizing, amplitude damping, phase damping, and bitflip: (i) Compared to exact quantum ripple carry adder without carryout the proposed approximate adders without carryout have improved fidelity ranging from 8.34% to 219.22%, and (ii) Compared to exact quantum ripple carry adder with carryout the proposed approximate adders with carryout have improved fidelity ranging from 8.23% to 371%. Further, the proposed approximate quantum adders are evaluated in terms of various error metrics.

Gaur, Bhaskar↗
DOE OSTI2023

A PEPS Plugin for TNQVM

This work introduces an extension to the Tensor Network Quantum Virtual Machine (TNQVM) tool, enhancing the existing stack of ExaScale Tensor Network (ExaTN), ExaScale Accelerator (XACC), and TNQVM. It features a new plugin that enables efficient simulation of a Projected Entangled Pair State (PEPS), a 2D tensor network. To improve simulation efficiency for PEPS, we have implemented the snake boundary contraction algorithm. By integrating this capability into the existing stack, we enhance the overall functionality and versatility of the framework. We tested this new PEPS topology for a simple GHZ bell-pair generation quantum circuit and saw that its runtime is very close to that of the MPS topology. We estimate that the real potential of the PEPS topology becomes discernible when quantum circuits with multidimensional entanglement are simulated using tensor networks. In such cases, 1D tensor networks fail to represent or contract them efficiently.

Chundury, Srikar↗
NASA NTRS2020

A Path Towards Quantum Advantage in Training Deep Generative Models with Quantum Annealing

A class of quantum-classical hybrid machine-learning algorithms can be obtained by integrating classical deep generative models with quantum probability distributions as 'priors' over their latent variables. We introduce a hybrid implementation of variational autoencoders (QVAE) and also present a technique to hybridize flow-based invertible generative models. We demonstrate the use of D-Wave quantum annealers as physical simulators of quantum Boltzmann machines (QBM) to perform quantum-assisted training of QVAE. Latent-space QBM develop slowly mixing modes, opening a path to obtain quantum advantage in generative modeling with available quantum devices.

Vinci, Walter↗
DOE OSTI2022

Mode connectivity in the loss landscape of parameterized quantum circuits

Variational training of parameterized quantum circuits (PQCs) underpins many workflows employed on near-term noisy intermediate scale quantum (NISQ) devices. It is a hybrid quantum-classical approach that minimizes an associated cost function in order to train a parameterized ansatz. In this work we adapt the qualitative loss landscape characterization for neural networks introduced in Goodfellow et al. (2014); Li et al. (2017) and tests for connectivity used in Draxler et al. (2018) to study the loss landscape features in PQC training. We present results for PQCs trained on a simple regression task, using the bilayer circuit ansatz, which consists of alternating layers of parameterized rotation gates and entangling gates. Multiple circuits are trained with 3 different batch gradient optimizers: stochastic gradient descent, the quantum natural gradient, and Adam. We identify large features in the landscape that can lead to faster convergence in training workflows.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Developing a complete AI-accelerated workflow for superconductor discovery

The quest to identify new superconducting materials with enhanced properties is hindered by the prohibitive cost of computing electron-phonon spectral functions, severely limiting the materials space that can be explored. Here, we introduce a Bootstrapped Ensemble of Equivariant Graph Neural Networks (BEE-NET), a machine-learning model trained to predict the Eliashberg spectral function and superconducting critical temperature with a mean-absolute-error of 0.87 K relative to DFT-based Allen-Dynes calculations. Intriguingly, BEE-NET achieves a true-negative-rate of 99.4%, enabling highly efficient screening for the rare property of superconductivity. Integrated into a multi-stage, AI-accelerated discovery pipeline that incorporates elemental-substitution strategies and machine-learned interatomic potentials, our workflow reduced over 1.3 million candidate structures to 741 dynamically and thermodynamically stable compounds with DFT-confirmed T c > 5 K. We report the successful synthesis and experimental confirmation of superconductivity in two of these previously unreported compounds. This study establishes a data-driven framework that integrates machine learning, quantum calculations, and experiments to systematically accelerate superconductor discovery.

Gibson, Jason B. [Quantum Formatics, Cambridge, MA↗
DOE OSTI2022

Equivalence of quantum barren plateaus to cost concentration and narrow gorges

Optimizing parameterized quantum circuits (PQCs) is the leading approach to make use of near-term quantum computers. However, very little is known about the cost function landscape for PQCs, which hinders progress towards quantum-aware optimizers. In this work, we investigate the connection between three different landscape features that have been observed for PQCs: (1) exponentially vanishing gradients (called barren plateaus (BPs)), (2) exponential cost concentration about the mean, and (3) the exponential narrowness of minima (called narrow gorges). Here we analytically prove that these three phenomena occur together, i.e., when one occurs then so do the other two. A key implication of this result is that one can numerically diagnose BPs via cost differences rather than via the computationally more expensive gradients. More broadly, our work shows that quantum mechanics rules out certain cost landscapes (which otherwise would be mathematically possible), and hence our results could be interesting from a quantum foundations perspective.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Time-warping invariant quantum recurrent neural networks via quantum-classical adaptive gating

Adaptive gating plays a key role in temporal data processing via classical recurrent neural networks (RNNs), as it facilitates retention of past information necessary to predict the future, providing a mechanism that preserves invariance to time warping transformations. This paper builds on quantum RNNs (QRNNs), a dynamic model with quantum memory, to introduce a novel class of temporal data processing quantum models that preserve invariance to time-warping transformations of the (classical) input-output sequences. The model, referred to as time warping-invariant QRNN (TWI-QRNN), augments a QRNN with a quantum–classical adaptive gating mechanism that chooses whether to apply a parameterized unitary transformation at each time step as a function of the past samples of the input sequence via a classical recurrent model. The TWI-QRNN model class is derived from first principles, and its capacity to successfully implement time-warping transformations is experimentally demonstrated on examples with classical or quantum dynamics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

An atomic cluster expansion potential for twisted multilayer graphene

Twisted multilayer graphene, characterized by its moiré patterns arising from inter-layer rotational misalignment, serves as a rich platform for exploring quantum phenomena. Machine learning interatomic potentials (MLIPs) are a promising approach to model such systems. Our work develops a method to generate training and test datasets for fitting MLIPs that capture all possible misalignments but remain small-scale to facilitate efficient data generation and parameter estimation. To achieve this, we generate configurations with periodic boundary conditions suitable for density functional theory calculations, and then introduce an internal twist and shift within those supercell structures. Using this technique, supplemented with an active learning workflow, we fit an Atomic Cluster Expansion potential for simulating twisted multilayer graphene and test it for accuracy and robustness on a range of simulation tasks.

2D materials↗
DOE OSTI2023

From Optimization to Sampling Through Gradient Flows

Optimization and sampling algorithms play a central role in science and engineering as they enable finding optimal predictions, policies, and recommendations, as well as expected and equilibrium states of complex systems. The notion of “optimality” is formalized by the choice of an objective function, while the notion of an “expected” state is specified by a probabilistic model for the distribution of states. Optimizing rugged objective functions and sampling multimodal distributions is computationally challenging, especially in high-dimensional problems. Here, for this reason, many optimization and sampling methods have been developed by researchers working in disparate fields such as Bayesian statistics, molecular dynamics, genetics, quantum chemistry, machine learning, weather forecasting, econometrics, and medical imaging.

Trillos, N. García↗
DOE OSTI2021

Universal Compiling and (No-)Free-Lunch Theorems for Continuous-Variable Quantum Learning

Quantum compiling, where a parameterized quantum circuit is trained to learn a target unitary, is an important primitive for quantum computing that can be used as a subroutine to obtain optimal circuits or as a tomographic tool to study the dynamics of an experimental system. While much attention has been paid to quantum compiling on discrete-variable hardware, less has been paid to compiling in the continuous-variable paradigm. Here we motivate several, closely related, short-depth continuous-variable algorithms for quantum compilation. We analyze the trainability of our proposed cost functions and numerically demonstrate our algorithms by learning arbitrary Gaussian operations and Kerr nonlinearities. We further make connections between this framework and quantum learning theory in the continuous-variable setting by deriving no-free-lunch theorems. These generalization bounds demonstrate a linear resource reduction for learning Gaussian unitaries using entangled coherent-Fock states and an exponential resource reduction for learning arbitrary unitaries using two-mode-squeezed states.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

XXVIIth International Conference on Supersymmetry and Unification of Fundamental Interactions (SUSY 2019) (Final Report)

Supersymmetry (SUSY) is one of most elegant extensions of the Standard Model (SM) and explains the puzzles of the SM by providing a candidate to explain the dark matter content of the universe, allowing scientists to understand the origin of the electroweak scale requiring the top mass to be around 170 GeV and leading to the unification of forces at a grand unified scale. Further the minimal supersymmetric standard model (MSSM) predicts the Higgs boson mass to be less than 135 GeV. The discovery of the Higgs Boson with mass around 125 GeV at the LHC has provided a major support to SUSY ideas. Searches for SUSY are ongoing at the Large Hadron Collider (LHC). Direct and indirect dark matter experiments are searching for a particle dark matter candidate which arises most naturally in SUSY models. Proton decay predicted by SUSY grand unified theories is being searched for at deep underground experiments. In addition, recent advances in neutrino and dark matter physics, observational astrophysics, precision cosmology and the promising new window into the cosmos opened by the direct detection of gravitational waves, have brought new ideas on the potential connections between new fundamental particles and our understanding of their impact on the early universe and its evolution. At present, the major questions include: Is SUSY still the best candidate for models beyond the SM? Do we have any well motivated alternative to SUSY? Have we exhausted all possibilities to search for new physics at high and low energy scales? XXVIIth International Conference on Supersymmetry and Unification of Fundamental Interactions (SUSY 2019), hosted by Texas A&M University – Corpus Christi during May 20-24, 2019, provided a unique venue to discus and understand the status of SUSY, connection between particle physics and cosmology, supersymmetry and its alternative, Higgs sector, neutrino sector, flavor sector, dark matter, electroweak phase transition, astroparticle physics, gravitational waves and string theory. Discussion of results from the LHC, recent neutrino experiments and observations, direct and indirect dark matter detection experiments, detection of gravitational waves, data from particle colliders, as well as measurements of the CMB and Large Scale Structure were an integral part of SUSY 2019. To ensure the younger participants will benefit from the conference the most, the conference was preceded by the 4 day long pre-SUSY summer school for graduate students and postdocs. The invited speakers were leading scientists in the fields of SUSY interest. The school took place on Texas A&M University – Corpus Christi campus during the week prior the SUSY 2019 conference (May 15 – 18, 2019). Since its inception in 1993, SUSY has become one of the most important and widely attended international meetings in high energy physics, devoted to new ideas in fundamental particle physics. SUSY 2019 brought together approximately 250 scientists, theorists, phenomenologists, experimentalists and cosmologists, (including over 60 graduate students and 70 postdocs) representing 22 nations: Australia, Belgium, Canada, Chile, China, Colombia, France, Germany, India, Italy, Japan, Mexico, Peru, Portugal, Romania, South Korea, Spain, Sweden, Switzerland, Taiwan, United Kingdom and United States. SUSY 2019 provided a stimulating venue for the exchange of scientific ideas among experts in dark matter, neutrino physics, particle physics, astrophysics and cosmology. The following scientific topics were delivered during SUSY 2019 in form of 44 plenary talks and over 200 parallel talks: Unification of Forces; Electroweak, Top and Higgs Physics; Precision Calculations and MC tools; BSM in Flavor Physics; Neutrino Masses: Models and Phenomenology; Cosmology and Gravitational Waves; Dark Matter, Astroparticle Physics; Formal Field Theory and Strings; Alternatives to Supersymmetry; Quantum Information: Machine Learning/Big Data. 28 talks were given during the pre-SUSY program related to the following topics: Neutrino Physics; Big Data; Collider Physics & SUSY; String Phenomenology; Cosmology; Dark Matter; SUSY Models and Phenomenology

43 PARTICLE ACCELERATORS↗