Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Quantum machine learning”

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 415 records · Page 23

QuAIL Tools for Benchmarking, Analysis and Quantum Algorithm Development

HybridQ and PySA are open-source tools developed by NASA to support benchmarking, analysis and quantum algorithm development in areas such as simulation, optimization and machine learning. These tools leverage classical hardware acceleration via high-performance computing CPU and GPU architectures and support high-performance computing. HybridQ is a highly extensible platform designed to provide a common framework to integrate multiple state-of-the-art techniques to simulate large scale quantum circuits. PySA is an extensible platform to optimize a classical cost function. We provide an outline of each of these open-source tools and highlight projects using each of these tools in contexts of simulation, optimization and machine learning.

Quantum Computing↗

Application of the variational autoencoder to detect the critical points of the anisotropic Ising model

We generalize the previous study on the application of variational autoencoders to the two-dimensional Ising model to a system with anisotropy. Due to the self-duality property of the system, the critical points can be located exactly for the entire range of anisotropic coupling. This presents an excellent test bed for the validity of using a variational autoencoder to characterize an anisotropic classical model. Furthermore, we reproduce the phase diagram for a wide range of anisotropic couplings and temperatures via a variational autoencoder without the explicit construction of an order parameter. Considering that the partition function of ($d$ + 1)-dimensional anisotropic models can be mapped to that of the $d$-dimensional quantum spin models, the present study provides numerical evidence that a variational autoencoder can be applied to analyze quantum systems via the quantum Monte Carlo method.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Machine learning applied to classifying neutron resonances

The performance of nuclear reactors and other nuclear systems depends on a precise understanding of the neutron interaction cross sections for materials used in these systems. These cross sections exhibit resonance structure whose shape is determined in part by the angular momentum quantum numbers of the resonances. The correct assignment of the quantum numbers of neutron resonances is therefore of paramount importance. In this project, we apply a machine learning technique, namely decision trees, to automate the quantum number assignments. The tree is trained from simulated data generated to mimic the errors found in real data. We explore the use of several physics-motivated features for training our trees, including the nearest neighbor spacing distribution, cumulative level distribution, and channel width distributions. Initial results using random matrix theory motivated fits which demonstrated that we can determine resonance spin groups somewhat reliably. If we use these fits as features in our trees, we can train them to spot outliers corresponding to misassigned resonances. We found that with the large number of features used in this project that the decision tree tended to over t training data resulting in poor performance with respect to the test data. By reducing the number of features, we can achieve nearly perfect assignment of quantum numbers with our training data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Machine learning accelerated prediction of Ce-based ternary compounds involving antagonistic pairs

The discovery of novel quantum materials within ternary phase spaces containing antagonistic pairs such as Fe with Bi, Pb, In, and Ag, presents significant challenges yet holds great potential. In this work, we investigate the stabilization of these immiscible pairs through the integration of Cerium (Ce), an abundant rare-earth and cost-effective element. By employing a machine learning (ML)-guided framework, particularly crystal graph convolutional neural networks (CGCNN), combined with first-principles calculations, we efficiently explore the composition/structure space and predict 9 stable and 37 metastable Ce-Fe-X (X=Bi, Pb, In, and Ag) ternary compounds. Our findings include the identification of multiple new stable and metastable phases, which are evaluated for their structural and energetic properties. These discoveries not only contribute to the advancement of quantum materials but also offer viable alternatives to critical rare earth elements, underscoring the importance of Ce-based intermetallic compounds in technological applications.

36 MATERIALS SCIENCE↗

Geometry and Strings 2023

The proposal details plans for an upcoming meeting as part of the annual Geometry and Strings conference series. This series was formerly known as the ``F-theory'' conference series and has since broadened to include more general approaches to high energy physics centered on geometry, quantum field theory and string theory. The University of Pennsylvania has agreed to host the 2023 installment of the conference, which will take place on the UPenn campus in March 2023. The main thrust of the activities will center on several interconnected areas within the subject, including: The Swampland Program in quantum gravity and its geometric manifestations. The Geometric Engineering Program in string theory and its application to numerous question in quantum field theory. The Generalized Symmetries Program in quantum field theory and string theory. The Machine Learning Program aimed at understanding the large number of vacua present in string theory. The conference will adhere to a code of conduct aimed at making the event accessible to all participants. Additionally, particular attention will be paid to having a balanced mix of junior, mid-level and senior speakers from diverse backgrounds.

Lust, Dieter↗

Real-time dynamics of the Schwinger model as an open quantum system with Neural Density Operators

Ab-initio simulations of multiple heavy quarks propagating in a Quark-Gluon Plasma are computationally difficult to perform due to the large dimension of the space of density matrices. This work develops machine learning algorithms to overcome this difficulty by approximating exact quantum states with neural network parametrisations, specifically Neural Density Operators. As a proof of principle demonstration in a QCD-like theory, the approach is applied to solve the Lindblad master equation in the 1 + 1d lattice Schwinger Model as an open quantum system. Neural Density Operators enable the study of in-medium dynamics on large lattice volumes, where multiple-string interactions and their effects on string-breaking and recombination phenomena can be studied. Thermal properties of the system at equilibrium can also be probed with these methods by variationally constructing the steady state of the Lindblad master equation. Scaling of this approach with system size is studied, and numerical demonstrations on up to 32 spatial lattice sites and with up to 3 interacting strings are performed.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Convex Optimization for Nonequilibrium Steady States on a Hybrid Quantum Processor

Finding the transient and steady state properties of open quantum systems is a central problem in various fields of quantum technologies. Here, in this work, we present a quantum-assisted algorithm to determine the steady states of open system dynamics. By reformulating the problem of finding the fixed point of Lindblad dynamics as a feasibility semidefinite program, we bypass several well-known issues with variational quantum approaches to solving for steady states. We demonstrate that our hybrid approach allows us to estimate the steady states of higher dimensional open quantum systems and discuss how our method can find multiple steady states for systems with symmetries.

97 MATHEMATICS AND COMPUTING↗

Quantum-Compatible Variational Segmentation for Image-to-Image Wildfire Detection Using Satellite Data

Wildfire occurrences have been increasing for the past decade, leaving devastating traces across the world. In the recent efforts, remote sensing and airborne missions have been utilized to better understand and manage wildfires. This has resulted in an exponential increase in volume of remote sensing data, which has pushed the need for intelligent automation of data extraction for wildfire studies. Machine learning offers accurate automation in detecting such natural anomalies and enable decision-makers to take actions in a timely manner. Recent advances in machine learning algorithms, namely probabilistic generative methods, allow researchers and decisionmakers to step beyond detection and study “what-if” scenarios for wildfire occurrences. Additionally, they offer better imitations to the stochastic behavior of nature, and wildfire events. However, optimizing the performance of these probabilistic generative models is a computationally expensive process, specially using digital computers. On the other hand, quantum computers have recently shown a promise to reduce computationally costly training of such models and provide performance improvements. There is a body of research investigating the potential for improved machine learning methods in which key operations are performed on a quantum computer. In this study, we propose a probabilistic image-toimage segmentation approach combining a very well-known segmentation method, U-NET, with a Conditional Variational Auto-Encoder (CVAE) to not only detect wildfires but also describe the stochasticity of the phenomenon and be capable of running “what-if” scenarios. Our proposed model is compatible with training on quantum computers, which results in a quantum-assisted image-to-image segmentation approach and can be used to benchmark the potential benefit of quantum computing over the classical one.

quantum↗

QuTree: A tree tensor network package

Here we present QuTree, a C++ library for tree tensor network approaches. QuTree provides class structures for tensors, tensor trees, and related linear algebra functions that facilitate the fast development of tree tensor network approaches such as the multilayer multiconfigurational time-dependent Hartree approach or the density matrix renormalization group approach and its various extensions. We investigate the efficiency of relevant tensor and tensor network operations and show that the overhead for managing the network structure is negligible, even in cases with a million leaves and small tensors. QuTree focuses on providing simple, high-level routines while retaining easy access to the backend to facilitate novel developments. We demonstrate the capabilities of the package by computing the eigenstates of coupled harmonic oscillator Hamiltonians and performing random circuit simulations on a virtual quantum computer.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Finding Electronic Structure Machine Learning Surrogates without Training

A myriad of phenomena in materials science and chemistry rely on quantum-level simulations of the electronic structure in matter. While moving to larger length and time scales has been a pressing issue for decades, such large-scale electronic structure calculations are still challenging despite modern software approaches and advances in high-performance computing. The silver lining in this regard is the use of machine learning to accelerate electronic structure calculations – this line of research has recently gained growing attention. The grand challenge therein is finding a suitable machine-learning model during a process called hyperparameter optimization. This, however, causes a massive computational overhead in addition to that of data generation. We accelerate the construction of machine-learning surrogate models by roughly two orders of magnitude by circumventing excessive training during the hyperparameter optimization phase. We demonstrate our workflow for Kohn-Sham density functional theory, the most popular computational method in materials science and chemistry.

36 MATERIALS SCIENCE↗

Robust Molecular Predictive Methods for Novel Polymer Discovery and Applications

Polymeric materials are ubiquitous in modern society and they play an instrumental role in almost all industries, undoubtedly including the energy and environment sectors. Increased demand of energy and awareness to sustainability both necessitates the development of novel polymers with enhanced properties. Unfortunately, their structural and behavioral complexity render such discovery challenging and impeded. To address this problem, scientists are developing various computational modeling techniques and leveraging their power to depict the relationship between structural characteristics of polymers and their properties (such as rheological behaviors), and use such prediction to guide the design and syntheses of novel polymeric materials with enhanced performances. Unfortunately, predicting the relationships between polymer structure and composition with rheological properties via atomistic modeling is still a major challenge because of the extended time and length scales involved. Studying dynamic shear viscosity and linear viscoelasticity using molecular models requires capabilities that have been elusive, including representation of large molecular weight chains with an effective internal scale capable of describing entanglement, shear-rates that are in the s-1 scale with accurate quantitative stresses, and chemically-realistic combinations of both homogeneous and heterogeneous systems. Motivated by these unmet challenges, the overall technical objective of this DOE-STTR Phase II project is to develop robust molecular predictive methods for advanced polymer discovery and applications and especially for designing and demonstrating the “smart” polymer-based waterflooding enhanced oil recovery (EOR) process. In particular, we apply state-of-the-art molecular modeling methods developed by our academic partner, Materials Stimulation Center (MSC) at California Institute of Technology (Caltech), to facilitate and accelerate the experimental discovery processes. During the Phase I of this project, we had focused on development and demonstration of the molecular modeling methods to describe rheological properties of non-Newtonian polymer fluids, and to improve our fundamental understandings of shear-thickening mechanism and kinetics. In Phase II, we further apply the theoretical models to guide our experimental programs to improve our design of smart rheology modifier (SRM) polymers and their optimization for EOR. Specifically, we have three objectives in the Phase II study: (1) to further improve out computational modeling methods, coupling with the advanced machine learning algorithms; (2) to develop cost-effective and efficient SRM-flooding process suitable for EOR applications under typical reservoir conditions; and (3) to further explore the application of our molecular predictive models for innovative material discovery in other industrial applications. The recent development of our multiscale predictive framework allows the successful prediction of rheological properties from the chemical structure for polymers of experimentally relevant molecular weights, and provides an in-silico machine learning engine for screening novel compositions and structures with optimized non-Newtonian response, required for both shear-thinning and shear-thickening applications. Our framework provides: (1) procedures and tools for systematic coarsening from atomistic models and reverse mapping of coarse-grain models to atomistic, (2) unique ab initio methods to characterize the atomistic origin of colloidal and interfacial interactions and phenomena, (3) systematic structure and composition builders based on practical descriptors that drive rheological changes in polymer melts and diluted polymer mixtures, (4) a rheological properties engine capable of predicting viscosity in the zero-shear limit and under realistic dynamic conditions (for shear-rates commensurate with experiments) for large heterogeneous systems, (5) coarse-grain force fields with improved non-bond descriptions based on accurate quantum mechanics, (6) an in-silico screening machine learning engine that feeds from the systematic model builders to cover the descriptors search space, computes the rheological properties from converged trajectories spanning sub-milliseconds and ranks them for each structure/composition using an automated viscosity-vs-shear rate fitness function that can be tuned for shear-thickening, shear-thinning and other rheological responses.

02 PETROLEUM↗

Automation of Active Space Selection for Multireference Methods via Machine Learning on Chemical Bond Dissociation

Predicting and understanding the chemical bond is one of the major challenges of computational quantum chemistry. Kohn–Sham density functional theory (KS-DFT) is the most common method, but approximate density functionals may not be able to describe systems where multiple electronic configurations are equally important. Multiconfigurational wave functions, on the other hand, can provide a detailed understanding of the electronic structures and chemical bonds of such systems. In the complete active space self-consistent field (CASSCF) method, one performs a full configuration interaction calculation in an active space consisting of active electrons and active orbitals. However, CASSCF and its variants require the selection of these active spaces. This choice is not black box; it requires significant experience and testing by the user, and thus active space methods are not considered particularly user-friendly and are employed only by a minority of quantum chemists. Our goal is to popularize these methods by making it easier to make good active space choices. Here, we present a machine learning protocol that performs an automated selection of active spaces for chemical bond dissociation calculations of main group diatomic molecules. The protocol shows high prediction performance for a given target system as long as a properly correlated system is chosen for training. Good active spaces are correctly predicted with a considerably better success rate than random guess (larger than 80% precision for most systems studied). Our automated machine learning protocol shows that a “black-box” mode is possible for facilitating and accelerating the large-scale calculations on multireference systems where single-reference methods such as KS-DFT cannot be applied.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Developing machine learning for heterogeneous catalysis with experimental and computational data

Machine learning techniques have emerged as a useful tool for identifying complex patterns and correlations in large datasets, such as associating catalyst performance to its physicochemical properties. In the heterogeneous catalysis communities, machine learning models have mostly been developed using high-throughput quantum chemistry calculations, with only a few case studies resulting in experimentally validated catalyst improvements. This limited success may be due to the use of simplified catalyst structures in computational studies and the lack of comprehensive experimental datasets. In this Review, we bring together studies integrating high-throughput approaches and machine learning for the advancement of solid heterogeneous catalysis, leveraging both experimental and computational data. We systematically analyze trends in the field, based on the descriptors used as model input and output; the materials, devices, or reactions investigated; the dataset size; and the overall achievements. Furthermore, for models reporting unitless R 2 values, we compare the performances based on these mentioned trends.

Computational chemistry↗

A Quantum Algorithm to Simulate Open Quantum Systems

Given the advent of quantum algorithms for a wide array of problems in linear algebra and machine learning, it is important to develop general methods for the simulation of arbitrary (ie non-unitary) operators on quantum hardware. In this talk, we present a novel quantum algorithm based on the quantum singular value transformation (QSVT) to apply an arbitrary operator K to some input state and subsequently estimate the expectation value of some observable. Our construction then immediately yields a route to estimating observables of states undergoing open quantum dynamics, whose effect is captured by a set of non-unitary Kraus operators. Our algorithm succeeds deterministically given the Sz-Nagy dilation, and we provide details on the algorithm's query and gate complexity, numerical verification, and comparisons with prior methods.

Quantum computing↗

Investigating 3,4-bis(3-nitrofurazan-4-yl)furoxan detonation with a rapidly tuned density functional tight binding model

In this work, we describe a machine learning approach to rapidly tune density functional tight binding models for the description of detonation chemistry in organic molecular materials. Resulting models enable simulations on the several 10s of ps scales characteristic to these processes, with “quantum-accuracy.” We use this approach to investigate early shock chemistry in 3,4-bis(3-nitrofurazan-4-yl)furoxan, a hydrogen-free energetic material known to form onion-like nanocarbon particulates following detonation. We find that the ensuing chemistry is significantly characterized by the formation of large C x N y O z species, which are likely precursors to the experimentally observed carbon condensates. Beyond utility as a means of investigating detonation chemistry, the present approach can be used to generate quantum-based reference data for the development of full machine-learned interatomic potentials capable of simulation on even greater time and length scales, i.e., for applications where characteristic time scales exceed the reach of methods including Kohn–Sham density functional theory, which are commonly used for reference data generation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits

In the span of four decades, quantum computation has evolved from an intellectual curiosity to a potentially realizable technology. Today, small-scale demonstrations have become possible for quantum algorithmic primitives on hundreds of physical qubits and proof-of-principle error-correction on a single logical qubit. Nevertheless, despite significant progress and excitement, the path toward a full-stack scalable technology is largely unknown. There are significant outstanding quantum hardware, fabrication, software architecture, and algorithmic challenges that are either unresolved or overlooked. These issues could seriously undermine the arrival of utility-scale quantum computers for the foreseeable future. Here, we provide a comprehensive review of these scaling challenges. We show how the road to scaling could be paved by adopting existing semiconductor technology to build much higher-quality qubits, employing system engineering approaches, and performing distributed quantum computation within heterogeneous high-performance computing infrastructures. These opportunities for research and development could unlock certain promising applications, in particular, efficient quantum simulation/learning of quantum data generated by natural or engineered quantum systems. To estimate the true cost of such promises, we provide a detailed resource and sensitivity analysis for classically hard quantum chemistry calculations on surface-code error-corrected quantum computers given current, target, and desired hardware specifications based on superconducting qubits, accounting for a realistic distribution of errors. Furthermore, we argue that, to tackle industry-scale classical optimization and machine learning problems in a cost-effective manner, heterogeneous quantum-probabilistic computing with custom-designed accelerators should be considered as a complementary path toward scalability.

Mohseni, Masoud↗

PhotonIDs: ML-Powered Photon Identification System for Dark Count Elimination

Reliable single photon detection is the foundation for practical quantum communication and networking. However, today's superconducting nanowire single photon detector(SNSPD) inherently fails to distinguish between genuine photon events and dark counts, leading to degraded fidelity in long-distance quantum communication. In this work, we introduce PhotonIDs, a machine learning-powered photon identification system that is the first end-to-end solution for real-time discrimination between photons and dark count based on full SNSPD readout signal waveform analysis. PhotonIDs ~demonstrates: 1) an FPGA-based high-speed data acquisition platform that selectively captures the full waveform of signal only while filtering out the background data in real time; 2) an efficient signal preprocessing pipeline, and a novel pseudo-position metric that is derived from the physical temporal-spatial features of each detected event; 3) a hybrid machine learning model with near 98% accuracy achieved on photon/dark count classification. Additionally, proposed PhotonIDs ~ is evaluated on the dark count elimination performance with two real-world case studies: (1) 20 km quantum link, and (2) Erbium ion-based photon emission system. Our result demonstrates that PhotonIDs ~could improve more than 31.2 times of signal-noise-ratio~(SNR) on dark count elimination. PhotonIDs ~ marks a step forward in noise-resilient quantum communication infrastructure.

Linne, Karl C. [Chicago U.] (ORCID:000900091870358↗