Machine learning the quantum-chemical properties of metal–organic frameworks for accelerated materials discovery
Not Available
36 MATERIALS SCIENCE↗
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.
Quantum Chemistry-Driven Machine Learning Approach for the Prediction of the Surface Tension and Speed of Sound in Ionic Liquids
Ionic liquids (ILs) have unique solvent properties and have thus garnered significant interest. However, exhaustive experimental determination of the physicochemical properties of ILs is unrealistic due to the large structural diversity of anions and cations, their high cost, the requirements of elevated temperature and pressure, and the time required. To circumvent these experimental costs, computational approaches to accurately calculate these properties have emerged. Here in the present study, we present a demonstration of two machine learning (ML) models for the prediction of two critical IL physical properties, the surface tension and the speed of sound, across a wide range of temperatures and pressures. The models make use of molecular descriptors derived from the COSMO-RS, a quantum chemical-based model. The ML models show excellent agreement with experimental observations, with an R2 value of 0.96–0.99 and RMSE of 1.71 mN/m and 16.12 m/s for the surface tension and speed of sound, respectively. This work paves the way for the development of COSMO-RS-informed ML models for the prediction of IL properties which can help to further optimize and accelerate technology development for ILs.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Generalizable machine learning potentials for quantum-accurate predictions of non-equilibrium behavior in 2D materials
Machine learning interatomic potentials (ML-IAPs) are emerging as transformative tools in materials modeling, promising quantum-level accuracy at a fraction of the computational cost. However, their ability to generalize beyond equilibrium configurations and to reliably capture defect- and temperature-driven behavior remains underexplored. Here, we develop and benchmark two state-of-the-art ML-IAPs, Spectral Neighbor Analysis Potential (SNAP) and Allegro, on a comprehensive dataset for monolayer MoSe₂. Using density functional theory (DFT) as the reference, we evaluate their performance in capturing stress–strain behavior, phase transition energetics, defect evolution, edge stability, and fracture toughness. Allegro, a deep equivariant neural network potential, surpasses both SNAP and the classical Tersoff potential in accuracy, efficiency, and transferability. Importantly, both ML potentials accurately reproduce experimental fracture measurements and ab initio predictions of inversion domain formation—phenomena well beyond their training sets. Our findings establish ML-IAPs as viable replacements for traditional force fields in the study of non-equilibrium mechanical phenomena, enabling large-scale, high-fidelity simulations in 2D materials and beyond. In conclusion, this work provides a broadly applicable framework for data-driven modeling of structural and functional transformations under extreme conditions.
2D materials↗
Noisy intermediate-scale quantum algorithms
A universal fault-tolerant quantum computer that can efficiently solve problems such as integer factorization and unstructured database search requires millions of qubits with low error rates and long coherence times. While the experimental advancement toward realizing such devices will potentially take decades of research, noisy intermediate-scale quantum (NISQ) computers already exist. These computers are composed of hundreds of noisy qubits, i.e., qubits that are not error corrected, and therefore perform imperfect operations within a limited coherence time. In the search for achieving quantum advantage with these devices, algorithms have been proposed for applications in various disciplines spanning physics, machine learning, quantum chemistry, and combinatorial optimization. The overarching goal of such algorithms is to leverage the limited available resources to perform classically challenging tasks. In this review, a thorough summary of NISQ computational paradigms and algorithms is provided. The key structure of these algorithms and their limitations and advantages are discussed. Finally, a comprehensive overview of various benchmarking and software tools useful for programming and testing NISQ devices is additionally provided.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Resolving the Coverage Dependence of Surface Reaction Kinetics with Machine Learning and Automated Quantum Chemistry Workflows
Microkinetic models for catalytic systems require estimation of many thermodynamic and kinetic parameters that can be calculated for isolated species and transition states using ab initio methods. However, the presence of nearby coadsorbates on the surface can dramatically alter these thermodynamic and kinetic parameters causing them to be dependent on species coverage fractions. As there are combinatorially many coadsorbed configurations on the surface, computing the coverage dependence of these parameters is far less straightforward. We present a framework for generating and applying machine learning models to predict coverage-dependent parameters for microkinetic models. Our toolkit enables automatic calculation and evaluation of coadsorbed configurations allowing us to sample 2,000 coadsorbed adsorbates and transition states (TSs) for a diverse set of 9 reactions on Cu(111), a challenging surface, with four possible coadsorbates. This dataset was then used to train subgraph isomorphic decision trees (SIDTs) to predict the stability and association energy of configurations. We were able to achieve mean absolute errors (MAEs) of 0.106 eV on adsorbates, 0.172 eV on TSs, and due to natural error cancellation in SIDTs for relative properties, 0.130 eV on reaction energies and 0.180 eV on activation barriers. In conclusion, we describe how to use these models to predict coverage-dependent corrections for adsorbates and TSs and demonstrate on H*, HO*, and O* comparing the generated SIDT model with an iteratively refined version.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Machine Learning Models for Predicting Molecular UV–Vis Spectra with Quantum Mechanical Properties
Accurate understanding of Ultraviolet–visible (UV–Vis) spectra is critical for highthroughput design of compounds for drug discovery. Experimentally determining UV–Vis spectra can become expensive when dealing with a large quantity of novel molecules. This provides us an opportunity to drive computational advances in molecular property predictions using quantum mechanics and machine learning. In this work, we use both Quantum Mechanically (QM) predicted and measured UV–Vis spectra as input to modify four different machine learning architectures: UVvis-SchNet, UVvis- DTNN, UVvis-Transformer, and UVvis-MPNN. Here we find that the UVvis-MPNN model outperforms the other models when using optimized 3D coordinates and QM predicted spectra as input features. This model has the highest performance for predicting UVVisible spectra with a training RMSE of 0.06 and validation RMSE of 0.08.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Does provable absence of barren plateaus imply classical simulability?
A large amount of effort has recently been put into understanding the barren plateau phenomenon. In this perspective article, we face the increasingly loud elephant in the room and ask a question that has been hinted at by many but not explicitly addressed: Can the structure that allows one to avoid barren plateaus also be leveraged to efficiently simulate the loss classically? We collect evidence-on a case-by-case basis-that many commonly used models whose loss landscapes avoid barren plateaus can also admit classical simulation, provided that one can collect some classical data from quantum devices during an initial data acquisition phase. This follows from the observation that barren plateaus result from a curse of dimensionality, and that current approaches for solving them end up encoding the problem into some small, classically simulable, subspaces. Thus, while stressing that quantum computers can be essential for collecting data, our analysis sheds doubt on the information processing capabilities of many parametrized quantum circuits with provably barren plateau-free landscapes. We end by discussing the (many) caveats in our arguments including the limitations of average case arguments, the role of smart initializations, models that fall outside our assumptions, the potential for provably superpolynomial advantages and the possibility that, once larger devices become available, parametrized quantum circuits could heuristically outperform our analytic expectations.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Building spatial symmetries into parameterized quantum circuits for faster training
Abstract Practical success of quantum learning models hinges on having a suitable structure for the parameterized quantum circuit. Such structure is defined both by the types of gates employed and by the correlations of their parameters. While much research has been devoted to devising adequate gate-sets, typically respecting some symmetries of the problem, very little is known about how their parameters should be structured. In this work, we show that an ideal parameter structure naturally emerges when carefully considering spatial symmetries (i.e. the symmetries that are permutations of parts of the system under study). Namely, we consider the automorphism group of the problem Hamiltonian, leading us to develop a circuit construction that is equivariant under this symmetry group. The benefits of our novel circuitstructure, called ORB, are numerically probed in several ground-state problems. We find a consistent improvement (in terms of circuit depth, number of parameters required, and gradient magnitudes) compared to literature circuit constructions.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Machine learning methods for quantum mechanics
Exploratory implementations of possible algorithms for simulating small quantum mechanical systems on a classical computer.
Lawerence, Scott↗
Quantum enhanced metrology in the search for fundamental physical phenomena
These notes summarize lectures given at the 2019 Les Houches summer school on Quantum Information Machines. They describe and review an application of quantum metrology concepts to searches for ultralight dark matter. In particular, for ultralight dark matter that couples as a weak classical force to a laboratory harmonic oscillator, quantum squeezing benefits experiments in which the mass of the dark matter particle is unknown. This benefit is present even if the oscillatory dark matter signal is much more coherent than the harmonic oscillator that it couples to, as is the case for microwave frequency searches for dark matter axion particles.
Lehnert, Konrad↗
Building spatial symmetries into parameterized quantum circuits for faster training
Practical success of quantum learning models hinges on having a suitable structure for the parameterized quantum circuit. Such structure is defined both by the types of gates employed and by the correlations of their parameters. While much research has been devoted to devising adequate gate-sets, typically respecting some symmetries of the problem, very little is known about how their parameters should be structured. In this work, we show that an ideal parameter structure naturally emerges when carefully considering spatial symmetries (i.e. the symmetries that are permutations of parts of the system under study). Namely, we consider the automorphism group of the problem Hamiltonian, leading us to develop a circuit construction that is equivariant under this symmetry group. The benefits of our novel circuitstructure, called ORB, are numerically probed in several ground-state problems. We find a consistent improvement (in terms of circuit depth, number of parameters required, and gradient magnitudes) compared to literature circuit constructions.
97 MATHEMATICS AND COMPUTING↗
A physics-based machine learning approach to quantum device characterization
Explore the source record for details and available documents.
Hothem, Daniel George↗
ExaTN: Scalable GPU-Accelerated High-Performance Processing of General Tensor Networks at Exascale
We present ExaTN (Exascale Tensor Networks), a scalable GPU-accelerated C++ library which can express and process tensor networks on shared- as well as distributed-memory high-performance computing platforms, including those equipped with GPU accelerators. Specifically, ExaTN provides the ability to build, transform, and numerically evaluate tensor networks with arbitrary graph structures and complexity. It also provides algorithmic primitives for the optimization of tensor factors inside a given tensor network in order to find an extremum of a chosen tensor network functional, which is one of the key numerical procedures in quantum many-body theory and quantum-inspired machine learning. Numerical primitives exposed by ExaTN provide the foundation for composing rather complex tensor network algorithms. We enumerate multiple application domains which can benefit from the capabilities of our library, including condensed matter physics, quantum chemistry, quantum circuit simulations, as well as quantum and classical machine learning, for some of which we provide preliminary demonstrations and performance benchmarks just to emphasize a broad utility of our library.
97 MATHEMATICS AND COMPUTING↗
Recent developments in the PySCF program package
PySCF is a Python-based general-purpose electronic structure platform that supports first-principles simulations of molecules and solids as well as accelerates the development of new methodology and complex computational workflows. Here, we explain the design and philosophy behind PySCF that enables it to meet these twin objectives. With several case studies, we show how users can easily implement their own methods using PySCF as a development environment. We then summarize the capabilities of PySCF for molecular and solid-state simulations. Finally, we describe the growing ecosystem of projects that use PySCF across the domains of quantum chemistry, materials science, machine learning, and quantum information science.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
TQEA: Temporal Quantum Error Analysis
For the last few years quantum computers have captured researchers’ interest in solving complicated problems in finance, chemistry, machine learning, and many other NP problems. Quantum computing benefits from parallel computation, entanglement, and calculation speedup compared to classical computing. Even though the operations and number of qubits in quantum computers are limited, previous research showed that using quantum computers can be beneficial. These benefits gained researchers’ interest to work on the improvement of quantum computers and overcome the limitations by building more advanced quantum computers with fault tolerance capability, more physical qubits, and better operational gates. In practice, Quantum applications would be translated into Quantum Circuits and each circuit can contain one or many entanglements (s), single qubits operations, and readouts. The importance of running Quantum applications with controlled errors or without errors is critical to the desired result from Quantum readout. In this paper, we study the characteristics of superconducting quantum machines along with the previously proposed methods of Quantum error detection/correction and in order to build a better error model we propose a temporal method for analyzing the the behavior of qubits errors (T1 and T2), frequency of operation, entanglement errors, and readout errors. In order to detect and predict the behavior of each machine, we use simple exponential smoothing analysis on heuristic calibration data. Finally, based on observation, we show that based on frequency, qubits, readout and single operation errors we can build a temporal based model to study and predict the outcome of runs on each Quantum machine.
Baheri, Betis↗
Random circuit block-encoded matrix and a proposal of quantum LINPACK benchmark
The LINPACK benchmark reports the performance of a computer for solving a system of linear equations with dense random matrices. Although this task was not designed with a real application directly in mind, the LINPACK benchmark has been used to define the list of TOP500 supercomputers since the debut of the list in 1993. We propose that a similar benchmark, called the quantum LINPACK benchmark, could be used to measure the whole machine performance of quantum computers. The success of the quantum LINPACK benchmark should be viewed as the minimal requirement for a quantum computer to perform a useful task of solving linear algebra problems, such as linear systems of equations. We propose an input model called the Random Circuit Block-Encoded Matrix (RACBEM), which is a proper generalization of a dense random matrix in the quantum setting. The RACBEM model is efficient to be implemented on a quantum computer and can be designed to optimally adapt to any given quantum architecture, with relying on a black-box quantum compiler. Besides solving linear systems, the RACBEM model can be used to perform a variety of linear algebra tasks relevant to many physical applications, such as computing spectral measures, time series generated by a Hamiltonian simulation, and thermal averages of the energy. We implement these linear algebra operations on IBM Q quantum devices as well as quantum virtual machines, and demonstrate their performance in solving scientific computing problems.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
On the hardness of learning ground state entanglement of geometrically local Hamiltonians
Characterizing the entanglement structure of ground states of local Hamiltonians is a fundamental problem in quantum information. In this work we study the computational complexity of this problem, given the Hamiltonian as input. Our main result is that to show it is cryptographically hard to determine if the ground state of a geometrically local, polynomially gapped Hamiltonian on qudits (d=O(1)) has near-area law vs near-volume law entanglement. This improves prior work of Bouland et al. (arXiv:2311.12017) showing this for non-geometrically local Hamiltonians. In particular we show this problem is roughly factoring-hard in 1D, and LWE-hard in 2D. Our proof works by constructing a novel form of public-key pseudo-entanglement which is highly space-efficient, and combining this with a modification of Gottesman and Irani's quantum Turing machine to Hamiltonian construction. Our work suggests that the problem of learning so-called "gapless" quantum phases of matter might be intractable.
Computational Complexity (cs.CC)↗