SmartTensors: Unsupervised and Physics-informed Machine Learning Framework for the Geoscience Applications
Explore the source record for details and available documents.
Computer Science↗
SEARCH · Search NASA
Results for “computational and information science”
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.
An adaptive approach to machine learning for compact particle accelerators
Abstract Machine learning (ML) tools are able to learn relationships between the inputs and outputs of large complex systems directly from data. However, for time-varying systems, the predictive capabilities of ML tools degrade if the systems are no longer accurately represented by the data with which the ML models were trained. For complex systems, re-training is only possible if the changes are slow relative to the rate at which large numbers of new input-output training data can be non-invasively recorded. In this work, we present an approach to deep learning for time-varying systems that does not require re-training, but uses instead an adaptive feedback in the architecture of deep convolutional neural networks (CNN). The feedback is based only on available system output measurements and is applied in the encoded low-dimensional dense layers of the encoder-decoder CNNs. First, we develop an inverse model of a complex accelerator system to map output beam measurements to input beam distributions, while both the accelerator components and the unknown input beam distribution vary rapidly with time. We then demonstrate our method on experimental measurements of the input and output beam distributions of the HiRES ultra-fast electron diffraction (UED) beam line at Lawrence Berkeley National Laboratory, and showcase its ability for automatic tracking of the time varying photocathode quantum efficiency map. Our method can be successfully used to aid both physics and ML-based surrogate online models to provide non-invasive beam diagnostics.
97 MATHEMATICS AND COMPUTING↗
Elucidating the local atomic and electronic structure of amorphous oxidized superconducting niobium films
Qubits made from superconducting materials are a mature platform for quantum information science application, such as quantum computing. However, material-based losses are now a limiting factor in reaching the coherence times needed for applications. In particular, knowledge of the atomistic structure and properties of the circuit materials is needed to identify, understand, and mitigate material-based decoherence channels. Here, we characterize the atomic structure of the native oxide film formed on Nb resonators by comparing fluctuation electron microscopy experiments to density functional theory calculations, finding that an amorphous layer is consistent with an Nb 2 O 5 stoichiometry. Comparing x-ray absorption measurements at the Oxygen K edge with first-principles calculations, we find evidence of d-type magnetic impurities in our sample, known to cause impedance in proximal superconductors. This work identifies the structural and chemical composition of the oxide layer grown on Nb superconductors and shows that soft x-ray absorption can fingerprint magnetic impurities in these superconducting systems.
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
A Roadmap for Quantum Interconnects
Created by Q-NEXT, a U.S. Department of Energy (DOE) National Quantum Information Science Research Center, this document is a roadmap for quantum interconnects research and its impact for quantum information science and technology. It is the outcome of the collective work of a large team of Q-NEXT members and participants from academia, industry and DOE national laboratories. The roadmap addresses the role of quantum interconnects in three emerging areas of quantum information: computing, communication and sensing. It reviews the materials, components and systems used for these purposes; summarizes relevant scientific questions and issues; and addresses the most pressing research needs. The document then distills these considerations into recommendations for strategic science and technology research imperatives for the next decade. In addition to informing Q-NEXT’s internal activities, the roadmap has also been created with a broader objective of developing a guide for key issues and research needed over the next decade for the worldwide scientific and engineering community interested in quantum information.
42 ENGINEERING↗
Establishing capabilities for quantum computing and simulations for energy applications
Quantum information science (QIS) is creating potential transformative opportunities to exploit intricate quantum mechanical phenomena in new ways for obtaining and processing information to advance many areas of science and engineering. Since the National Quantum Initiative Act was signed into law in 2018, developing QIS capability and competency is one of the most urgent tasks of DOE to make sure the US win the quantum race. The QIS contains four pillars: quantum computing, quantum simulations, quantum sensing, and quantum networking. To apply QIS in energy related applications, the key is to develop the capability of quantum computing & simulation tools. In this project, we propose to develop the capability of quantum computing and simulations at NETL to target fossil energy related problems. We will install a simulator (e. g. IBM qiskit) on the NETL supercomputer to simulate the environments of quantum computer. Based on the current available quantum algorithms for quantum chemistry, we will develop quantum computing codes to perform simulation which will focus on fossil energy sector challenges, including CO2 capture & conversion, sensing, and fuel conversion. We then will seek opportunities to run our codes on real quantum computers (such as IBM-Q, google Sycamore, etc.). Through this project, the new capability of quantum computing and simulations will be established at NETL. In addition, the NETL workforce in this area will be trained ready to conduct more complicated tasks in line with NETL missions to enhance the nation’s energy foundation.
97 MATHEMATICS AND COMPUTING↗
Challenges and transformative opportunities in superconductor vortex physics
In superconductors, the motion of vortices introduces unwanted dissipation that is disruptive to applications. Fortunately, material defects can immobilize vortices, acting as vortex pinning centers, which engenders dramatic improvements in superconductor material properties and device operation. This has motivated decades of research into developing methods of tailoring the disorder landscape in superconductors to increase the strength of vortex pinning. Yet, efficacious materials engineering still eludes us. The electromagnetic properties of real (disordered) superconducting materials cannot yet be reliably predicted, such that designing superconductors for applications remains a largely inefficient process of trial and error. This is ultimately due to large gaps in our knowledge of vortex dynamics: the field is challenged by the extremely complex interplay between vortex elasticity, vortex-vortex interactions, and material disorder. Here, we review obstacles and recent successes in understanding and controlling vortex dynamics in superconducting materials and devices. We further identify major open questions and discuss opportunities for transformative research in the field. This includes improving our understanding of vortex creep, determining and reaching the ceiling for the critical current, advanced microscopy to garner accurate structure-property relationships, frontiers in predictive simulations and the benefits of artificial intelligence, as well as controlling and exploiting vortices in quantum information applications.
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
Quantum Computing and Simulations for Energy Applications: Review and Perspective
Not Available
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Physics-informed Machine Learning for Real-time Unconventional Reservoir Management
Explore the source record for details and available documents.
Computer Science↗
Data Summarization and Inference at Scale
This is the final report for the DOE ASCR grant SC-0022260, Data Summarization and Inference at Scale, PI: Alex Pothen, Purdue University. The goal of the project was to solve data-intensive and compute-intensive problems in the physical sciences, engineering, information science, data science, etc. by designing and implementing new algorithms that could work with a subset of the data. The four subgoals were: (a) The solution of problems where the data is too large to be stored in the memory of a computer. In this streaming model of computation, the data arrives as a stream of elements to the computer, each element is processed as it arrives, and a decision is made to discard the data or to store it; only a small subset of the data proportional to the size of the output solution is stored, and when all the data has been streamed, a solution to the problem is computed from the stored subset. (b) The use of machine learning methods to compute solutions to data-intensive problems. The use of GPUs is critical to obtain high performance on machine learning tasks, but their memory sizes are smaller relative to that of CPUs. For large-scale problems, the data is sampled many times, and small samples are used with repetition, for robustness, to compute solutions to inference tasks. This sampling reduces the memory required to solve the problem, but attention is needed to avoid slow convergence to the solutions, and reduced accuracy of inference. We propose submodular optimization, Large Language Models, and physics-informed neural networks to enable GPU computations here. (c) Modeling and visualization of high-dimensional data using interpretable features. Clinical proteomic data sets from immunology for the detection of cancer and other diseases are temporal and high-dimensional, and algorithms for visualizing these data sets using clinically interpretable features are lacking. We propose methods that compute distances based on the optimal transportation problem and graph edit distances to address this problem. We also propose the use of optimal transport-based distances, spatial statistics, and network structure to classify image data sets, We apply these algorithms to electron micrographs of the peripheral nervous system in the digestive tract. (d) The design of data-intensive algorithms on emerging architectures, specifically, noisy, intermediate-scale quantum (NISQ) devices. Quantum computers offer the possibility of exploring large solution spaces due to the principle of superposition, but current quantum computers are limited by few qubits, short coherence times due to noise, poor interconections among the qubits, etc. We propose the use of the divide and conquer paradigm to solve large-scale problems, wherein collections of small subproblems are solved on the quantum devices, and the solutions to the subproblems are integrated into a solution for the original problem on a classical computer.
97 MATHEMATICS AND COMPUTING↗
Physics-Informed Machine Learning Models for Predicting the Progress of Reactive-Mixing
This paper presents a physics-informed machine learning (ML) framework to construct reduced-order models (ROMs) for reactive-transport quantities of interest (QoIs) based on high-fidelity numerical simu-lations. QoIs include species decay, product yield, and degree of mixing. The ROMs for QoIs are applied to quantify and understand how the chemical species evolve over time. First, high-resolution datasets for constructing ROMs are generated by solving anisotropic reaction-di?usion equations using a non-negative finite element formulation for di?erent input parameters. The reactive-mixing model input parameters are: time-scale associated with flipping of velocity, spatial-scale controlling small/large vortex structures of velocity, perturbation parameter of the vortex-based velocity, anisotropic dispersion strength/contrast, and molecular diffusion. Second, random forests, F-test, and mutual information criterion are used to evaluate the importance of model inputs/features with respect to QoIs. We observed that anisotropic dispersion strength/contrast is the most important feature and time-scale associated with flipping of velocity is the least important feature. Third, Support Vector Machines (SVM) and Support Vector Regression (SVR) are used to construct ROMs based on the model inputs. The constructed SVR-ROMs are then used to predict scaling of QoIs. We also present estimates and inequalities on the QoIs, which inform that the species decay, mix, and produce in an exponential fashion. These inequalities also inform that a radial basis function is the most suitable kernel for the SVM/SVR models for QoIs. It is observed that R2-score for SVR-ROMs on unseen data is greater than 0.9, implying that the SVR-ROMs are able to predict the reaction-diffusion system state reasonably well. Finally, in terms of the computational cost, the proposed SVM-ROMs are O(107) times faster than running a high-fidelity finite element simulation for evaluating QoIs. This makes the proposed ML-based ROMs attractive for reactive-transport sensing and real-time monitoring applications as they are significantly faster yet reasonably accurate.
Mudunuru, Maruti K.↗
Variational quantum algorithm for estimating the quantum Fisher information
The quantum Fisher information (QFI) quantifies the ultimate precision of estimating a parameter from a quantum state and can be regarded as a reliability measure of a quantum system as a quantum sensor. However, estimation of the QFI for a mixed state is in general a computationally demanding task. In this paper we present a variational quantum algorithm called variational quantum Fisher information estimation (VQFIE) to address this task. By estimating lower and upper bounds on the QFI, based on bounding the fidelity, VQFIE outputs a range in which the actual QFI lies. This result can then be used to variationally prepare the state that maximizes the QFI, for the application of quantum sensing. In contrast to previous approaches, VQFIE does not require knowledge of the explicit form of the sensor dynamics. We simulate the algorithm for a magnetometry setup and demonstrate the tightening of our bounds as the state purity increases. For this example, we compare our bounds with literature bounds and show that our bounds are tighter.
97 MATHEMATICS AND COMPUTING↗
Quantum Machine Learning Applications in High-Energy Physics
Some of the most significant achievements of the modern era of particle physics, such as the discovery of the Higgs boson, have been made possible by the tremendous effort in building and operating large-scale experiments like the Large Hadron Collider or the Tevatron. In these facilities, the ultimate theory to describe matter at the most fundamental level is constantly probed and verified. These experiments often produce large amounts of data that require storing, processing, and analysis techniques that continually push the limits of traditional information processing schemes. Thus, the High-Energy Physics (HEP) field has benefited from advancements in information processing and the development of algorithms and tools for large datasets. More recently, quantum computing applications have been investigated to understand how the community can benefit from the advantages of quantum information science. Nonetheless, to unleash the full potential of quantum computing, there is a need to understand the quantum behavior and, thus, scale up current algorithms beyond what can be simulated in classical processors. In this work, we explore potential applications of quantum machine learning to data analysis tasks in HEP and how to overcome the limitations of algorithms targeted for Noisy Intermediate-Scale Quantum (NISQ) devices.
Delgado, Andrea↗
Frontiers in divalent $f$-block chemistry
Divalent f-block chemistry has undergone rapid expansion in recent years, driven by advances in the stabilization of low-valent lanthanide and actinide complexes. Although f-elements were historically accessed in the +3 or higher oxidation states, the isolation of +2 species has revealed unusual spectroscopic signatures, distinct bonding motifs, and multiple accessible electronic configurations that influence their chemical and physical properties. These developments have generated opportunities in areas including quantum information science, molecular magnetism, catalysis, and luminescence. Computational chemistry has played a pivotal role in interpreting the electronic structure and reactivity of these systems. However, accurately modeling divalent f-block complexes remains challenging because of strong electronic correlation, multiconfigurational character, and the presence of close-in-energy competing electronic states. As experimental capabilities and theoretical methodologies continue to advance, a comprehensive assessment of divalent chemistry is both timely and needed. In this Review, we integrate experimental and theoretical perspectives to provide a systematic analysis of divalent lanthanide and actinide complexes across the f-block series. We critically assess the role of ligands in determining competing ground-state configurations (f n d 1 vs. f n+1 ) resulting in their distinct spectroscopic, magnetic, and bonding properties. Finally, we discuss emerging strategies for predictive modeling and rational design of low-valent f-block molecular systems, with potential applications ranging from dinitrogen reduction to quantum technologies.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Multi-variance replica exchange SGMCMC for inverse and forward problems via Bayesian PINN
Physics-informed neural network (PINN) has been successfully applied in solving a variety of nonlinear non-convex forward and inverse problems. However, the training is challenging because of the non-convex loss functions and the multiple optima in the Bayesian inverse problem. In this work, we propose a multi-variance replica exchange stochastic gradient Langevin dynamics method to tackle the challenge of the multiple local optima in the optimization and the challenge of the multiple modal posterior distribution in the inverse problem. Replica exchange methods are capable of escaping from the local traps and accelerating the convergence; two chains with different temperatures are designed where the low temperature chain aims for the local convergence, and the target of the high temperature chain is to travel globally and explore the whole loss function entropy landscape. However, it may not be efficient to solve mathematical inversion problems by using the vanilla replica method directly since the method doubles the computational cost in evaluating the forward solvers (likelihood functions) in the two chains. To address this issue, we propose to make different assumptions on the energy function estimation and this facilities one to use solvers of different fidelities in the likelihood function evaluation. More precisely, one can use a solver with low fidelity in the high temperature chain while using a solver with high fidelity in the low temperature chain. Our proposed method significantly lowers the computational cost in the high temperature chain, meanwhile preserving the accuracy and converging very fast. Here we give an unbiased estimate of the swapping rate and give an estimation of the discretization error of the scheme. To verify our idea, we design and solve four inverse problems which have multiple modes. The proposed method is also employed to train the Bayesian PINN to solve the forward and inverse problems; faster and more accurate convergence has been observed when compared to the stochastic gradient Langevin dynamics (SGLD) method and vanilla replica exchange methods.
97 MATHEMATICS AND COMPUTING↗
Mathematical Modeling of Liquid-Phase Alkylation of Benzene with Ethylene Considering the Process Unsteadiness
Ethylbenzene is a key intermediate in the manufacture of styrene that is an important industrial monomer. Ethylbenzene is produced by benzene alkylation using either gas-phase or liquid-phase methods. The liquid-phase alkylation that uses liquid acidic catalysts needs to be improved. We develop a mathematical model for the liquid-phase benzene alkylation. The reaction scheme, designed with a due analysis of desired and side reactions, and with the analysis of the formation of deactivating agents, reflects, in particular, the influence of the concentration of heavy hydrocarbons on the catalyst activity. The account of the catalyst deactivation by heavy alkylaromatics allows predictions of the temporal changes in the outputs of the alkylation process. In particular, the decrease of the ethylbenzene concentration by 2–3 wt % and increase of the polyalkylate outlet concentration by 1.5–2 wt % are the results of the catalyst deactivation. These effects, however, can be compensated by 1.3-time increase of polyalkylate supply and by the temperature increase up to 398 K. Finally, the calculations also show that it is possible to decrease the supply of fresh catalyst from 0.498 to 0.472 t/hour without loss in the yield of ethylbenzene.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Towards large-scale quantum optimization solvers with few qubits
Quantum computers hold the promise of more efficient combinatorial optimization solvers, which could be game-changing for a broad range of applications. However, a bottleneck for materializing such advantages is that, in order to challenge classical algorithms in practice, mainstream approaches require a number of qubits prohibitively large for near-term hardware. Here we introduce a variational solver for MaxCut problems over $m={{\mathcal{O}}}({n}^{k})$ binary variables using only n qubits, with tunable k > 1. The number of parameters and circuit depth display mild linear and sublinear scalings in m , respectively. Moreover, we analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature. Altogether, this leads to high quantum-solver performances. For instance, for m = 7000, numerical simulations produce solutions competitive in quality with state-of-the-art classical solvers. In turn, for m = 2000, experiments with n = 17 trapped-ion qubits feature MaxCut approximation ratios estimated to be beyond the hardness threshold 0.941. Our findings offer an interesting heuristics for quantum-inspired solvers as well as a promising route towards solving commercially-relevant problems on near-term quantum devices.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Variational quantum state eigensolver
Extracting eigenvalues and eigenvectors of exponentially large matrices will be an important application of near-term quantum computers. The variational quantum eigensolver (VQE) treats the case when the matrix is a Hamiltonian. Here, we address the case when the matrix is a density matrix ρ. We introduce the variational quantum state eigensolver (VQSE), which is analogous to VQE in that it variationally learns the largest eigenvalues of ρ as well as a gate sequence V that prepares the corresponding eigenvectors. VQSE exploits the connection between diagonalization and majorization to define a cost function C=Tr(ρ~H) where H is a non-degenerate Hamiltonian. Due to Schur-concavity, C is minimized when ρ~=VρV† is diagonal in the eigenbasis of H. VQSE only requires a single copy of ρ (only n qubits) per iteration of the VQSE algorithm, making it amenable for near-term implementation. We heuristically demonstrate two applications of VQSE: (1) Principal component analysis, and (2) Error mitigation.
97 MATHEMATICS AND COMPUTING↗
Quantum-parallel vectorized data encodings and computations on trapped-ion and transmon QPUs
Compact data representations in quantum systems are crucial for the development of quantum algorithms for data analysis. In this study, we present two innovative data encoding techniques, known as QCrank and QBArt, which exhibit significant quantum parallelism via uniformly controlled rotation gates. The QCrank method encodes a series of real-valued data as rotations on data qubits, resulting in increased storage capacity. On the other hand, QBArt directly incorporates a binary representation of the data within the computational basis, requiring fewer quantum measurements and enabling well-established arithmetic operations on binary data. We showcase various applications of the proposed encoding methods for various data types. Notably, we demonstrate quantum algorithms for tasks such as DNA pattern matching, Hamming weight computation, complex value conjugation, and the retrieval of a binary image with 384 pixels, all executed on the Quantinuum trapped-ion QPU. Furthermore, we employ several cloud-accessible QPUs, including those from IBMQ and IonQ, to conduct supplementary benchmarking experiments.
97 MATHEMATICS AND COMPUTING↗