SEARCH · Search NASA

Results for “quantum associative memory”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

All sources NASA NTRS DOE OSTI

DOE OSTI2021

Particle track classification using quantum associative memory

Pattern recognition algorithms are commonly employed to simplify the challenging and necessary step of track reconstruction in sub-atomic physics experiments. Aiding in the discrimination of relevant interactions, pattern recognition seeks to accelerate track reconstruction by isolating signals of interest. In high collision rate experiments, such algorithms can be particularly crucial for determining whether to retain or discard information from a given interaction even before the data is transferred to tape. As data rates, detector resolution, noise, and inefficiencies increase, pattern recognition becomes more computationally challenging, motivating the development of higher efficiency algorithms and techniques. Quantum associative memory is an approach that seeks to exploits quantum mechanical phenomena to gain advantage in learning capacity, or the number of patterns that can be stored and accurately recalled. Here, we study quantum associative memory based on quantum annealing and apply it to the particle track classification. We focus on discrimination models based on Ising formulations of quantum associative memory model (QAMM) recall and quantum content-addressable memory (QCAM) recall. We characterize classification performance of these approaches as a function detector resolution, pattern library size, and detector inefficiencies, using the D-Wave 2000Q processor as a testbed. Discrimination criteria is set using both solution-state energy and classification labels embedded in solution states. We find that energy-based QAMM classification performs well in regimes of small pattern density and low detector inefficiency. In contrast, state-based QCAM achieves reasonably high accuracy recall for large pattern density and the greatest recall accuracy robustness to a variety of detector noise sources.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2020

Particle Track Classification Using Quantum Associative Memory (Final Technical Report)

This project explored the use of quantum-assisted algorithms for pattern matching in sub-atomic physics experiments. Pattern matching algorithms are commonly employed to prune data of random noise and to help discriminate between signals generated by particle tracks of interest and signals generated by background events. The quantum-assisted algorithms explored in this project were based on an Ising formulation of quantum associative model (QAMM) recall and quantum content-addressable memory (QCAM) recall. The recall is performed by comparing a probe pattern with those stored in a library of patterns encoded in the QAMM/QCAM model. The classification accuracy of QAMM and QCAM recall was determined as a function of detector resolution, noise, and efficiency and pattern density, where pattern density is defined as the ratio of the number of reference signal patterns encoded in the library to each pattern’s length. We found that QAMM achieved high classification accuracy when applied to datasets with low pattern density. QCAM achieved high classification accuracy for datasets with high pattern density and was found to be more robust to detector noise. The project methodology and results are described in detail in our arXiv preprint (arXiv:2011.11848) . This project was conducted by scientists at the Johns Hopkins University Applied Physics Laboratory and Oak Ridge National Laboratory from August 2018 to August 2020 and was supported by DOE grant DE-SC0019497.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2023

Superconducting Hyperdimensional Associative Memory Circuit for Scalable Machine Learning

Here we propose a generalized architecture for the first rapid-single-flux-quantum (RSFQ) associative memory circuit. The circuit employs hyperdimensional computing (HDC), a machine learning (ML) paradigm utilizing vectors with dimensionality in the thousands to represent information. HDC designs have small memory footprints, simple computations, and simple training algorithms compared to superconducting neural network accelerators (SNNAs), making them a better option for scalable SFQ machine learning (ML) solutions. The proposed superconducting HDC (SHDC) circuit uses entirely on-chip RSFQ memory which is tightly integrated with logic, operates at 33.3 GHz, is applicable to general ML tasks, and is manufacturable at practically useful scales given current SFQ fabrication limits. Tailored to a language recognition task, SHDC consists of ~ 2-20 M Josephson junctions (JJs) and consumes up to three times less power than an analogous CMOS HDC circuit while achieving 78-84% higher throughput. SHDC is capable of outperforming the state of the art RSFQ SNNA, SuperNPU, by 48-99% for all benchmark NN architectures tested while occupying up to 90% less area and consuming up to nine times less power. To the best of the authors' knowledge, SHDC is currently the only superconducting ML approach feasible at practically useful scales for real-world ML tasks and capable of online learning.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2022

Optimized low-depth quantum circuits for molecular electronic structure using a separable-pair approximation

We present a classically tractable model that leads to optimized low-depth quantum circuits leveraging separable-pair approximations. The obtained circuits are well suited as a baseline circuit for emerging quantum hardware and can, in the long term, provide significantly improved initial states for quantum algorithms. The associated wave functions can be represented with linear memory requirement, which allows classical optimization of the circuits and naturally defines a minimum benchmark for quantum algorithms. In this work we employ directly determined pair-natural orbitals within a basis-set-free approach. This leads to accurate representation of the one- and many-body parts for weakly correlated systems and we explicitly illustrate how the model can be integrated into other quantum algorithms for stronger correlated systems.

74 ATOMIC AND MOLECULAR PHYSICS↗

DOE OSTI2024

Distributed-Memory Sparse Deep Neural Network Inference Using Global Arrays

Partitioned Global Address Space (PGAS) models exhibit tremendous promise in developing efficient and productive distributed-memory parallel applications. They have been used extensively in scientific computations due to conveniently offering a ``shared-memory''-like model and convenient interfaces that separate communication with synchronization. Traditionally, PGAS communication models have been applied to dense/contiguously distributed data, but most modern applications depict varied levels of sparsity. Existing PGAS models require certain adaptations to support distributed sparse computations, since associated computations often require matrix arithmetic, in addition to data movement. The Global Arrays toolkit from Pacific Northwest National Laboratory (PNNL) is one of the earliest PGAS models to combine one-sided data communication and distributed matrix operations and is still used in the popular NWChem quantum chemistry suite. Recently, we have expanded the Global Arrays toolkit to support common sparse operations, like sparse matrix-dense matrix multiplies (SpMM), sparse matrix-sparse matrix multiplication (SpGEMM) and Sampled Dense-Dense Matrix Multiplication (SDDMM). As it turns out, these operations are the bedrock of sparse Deep Learning (DL); sparse deep neural networks and Graph Neural Networks (GNNs) have gained increasing attention recently in achieving speedups on training and inference with reduced memory footprints. Unlike scientific applications in High Performance Computing (HPC), modern (distributed-memory capable) DL toolkits often rely on non-standardized and closed-source vendor software optimizations, creating challenges in software-hardware co-design at scale. Our goal is to support a variety of distributed-memory sparse matrix operations and helper functions in the newly created Sparse Global Arrays (SGA), such that it is possible to build portable and productive Machine Learning scenarios for algorithm/software and hardware codesign purposes. Contemporary data-parallel schemes for training/inference are undergoing a major overhaul since model replication limits scalability and causes resource inefficiencies. As such, we have adopted tensor parallelism in decomposing the model and inputs, to mitigate memory issues. Current implementation is built on top of MPI and uses CPUs to maximize the portability across the platforms.

Distributed computing, machine learning↗

DOE OSTI2020

Nature of the nonequilibrium phase transition in the non-Markovian driven Dicke model

The Dicke model famously exhibits a phase transition to a superradiant phase with a macroscopic population of photons and is realized in multiple settings in open quantum systems. In this paper, we study a variant of the Dicke model where the cavity mode is lossy due to the coupling to a Markovian environment while the atomic mode is coupled to a colored bath. We analytically investigate this model by inspecting its low-frequency behavior via the Schwinger-Keldysh field theory and carefully examine the nature of the corresponding superradiant phase transition. Integrating out the fast modes, we can identify a simple effective theory allowing us to derive analytical expressions for various critical exponents including the dynamical exponent. We find excellent agreement with previous numerical results when the non-Markovian bath is at zero temperature; however, contrary to these studies, our low-frequency approach reveals that the same exponents govern the critical behavior when the colored bath is at finite temperature unless the chemical potential is zero. Furthermore, we show that the superradiant phase transition is classical in nature, while it is genuinely nonequilibrium. In this work, we derive a fractional Langevin equation and conjecture the associated fractional Fokker-Planck equation that captures the system's long-time memory as well as its nonequilibrium behavior. Finally, we consider finite-size effects at the phase transition and identify the finite-size scaling exponents, unlocking a rich behavior in both statics and dynamics of the photonic and atomic observables.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Design of Hopfield Networks Based on Superconducting Coupled Oscillators

The global energy shortage has driven the development of many energy-efficient computational platforms beyond Moore's law, among which brain-inspired neuromorphic computing is one of the promising solutions. Associative memory and pattern recognition are important computations solved by brain-inspired Hopfield networks. Classical Hopfield networks store memories via fixed point attractors of their dynamics. In oscillatory Hopfield networks, these attractors are replaced by periodic orbits. Here, we design an oscillatory Hopfield network based on coupled superconducting oscillators. We first employ a mathematical phase reduction approach to map networks of coupled superconducting rapid single flux quantum (RSFQ) ring oscillators to coupled Kuramoto phase-oscillator networks. We use this theory to numerically optimize the hardware's mutual inductances in order to directly match the phase-reduced superconducting oscillators to a model of phase-oscillator-based Hopfield networks. The resulting network can store multiple oscillatory phase-locked memory patterns and recover the patterns based on the initial phase conditions. As different pattern recognition tasks, or learning, require tunable connectivity strengths between the oscillatory nodes, we further employ a coupler circuit that enables tuning the coupling strength between two oscillators by applying an external flux. We demonstrate the functionality of our design through numerical simulations of a small example network with oscillators operating at 86 GHz and recognizing patterns within 10 ns. Our approach enables the learning and retrieval of dynamical memory patterns with a wide range of applications where rhythmic dynamic output is beneficial.

Cheng, Ran↗

DOE OSTI2022

A 9.2-GHz clock transition in a Lu(II) molecular spin qubit arising from a 3,467-MHz hyperfine interaction

Spins in molecules are particularly attractive targets for next-generation quantum technologies, enabling chemically programmable qubits and potential for scale-up via self-assembly. Here, we report observation of one of the largest hyperfine interactions for a molecular system, A iso = 3467±50 MHz, along with an associated clock transition of unprecedented magnitude. This is achieved through chemical control of the degree of s-orbital mixing into the spin-bearing d-orbital associated with a series of spin-½ La(II) and Lu(II) complexes. Increased s-orbital character reduces spin-orbit coupling and enhances the electron-nuclear Fermi contact interaction. Both outcomes are advantageous for quantum applications: the former reduces spin-lattice relaxation, while the latter maximizes the hyperfine interaction that, in turn, generates a 9 gigahertz clock transition, leading to an increase in phase memory time from 1.0±0.4 to 12±1 microseconds for one of the Lu(II) complexes. Furthermore, these findings suggest strategies for development of molecular quantum technologies, akin to trapped ion systems.

36 MATERIALS SCIENCE↗

DOE OSTI2022

Enhancing scalability of a matrix-free eigensolver for studying many-body localization

We propose several techniques to enhance the parallel scalability of a matrix-free eigensolver designed for studying many-body localization (MBL) of quantum spin chain models with nearest-neighbor interactions and on-site disorder. This type of problem is computationally challenging because the dimension of the associated Hamiltonian matrix grows exponentially with respect to the number of spins L, and we need to average over different realizations of the random disorder to obtain relevant statistical behavior. For each disorder realization, we need to compute eigenvalues from different regions of the spectrum and their corresponding eigenvectors. In previous work, the interior eigenstates for a single eigenvalue problem are computed via the shift-and-invert Lanczos algorithm. Due to the extremely high memory footprint of the LU factorizations, this technique is not well suited for large L’s. For example, we need thousands of compute nodes on modern high performance computing infrastructures to go beyond L = 24. The matrix-free approach does not suffer from this memory bottleneck, however, its scalability is limited by a computation and communication load imbalance. To reduce this imbalance and to significantly enhance the scalability of the matrix-free eigensolver, we reorder the matrix and leverage the consistent space runtime, CSPACER. We also show its efficiency in managing irregular communication patterns at scale compared to optimized MPI non-blocking two-sided and one-sided RMA implementation variants. This effort enables us to study MBL for spin chains with a larger number of spins. The efficiency and effectiveness of the proposed algorithm is demonstrated by computing eigenstates on a massively parallel many-core high performance computer.

METIS↗

DOE OSTI2022

Measurement and memory in the periodically driven complex Ginzburg-Landau equation

In the present work we illustrate that classical but nonlinear systems may possess features reminiscent of quantum ones, such as memory, upon suitable external perturbation. As our prototypical example, we use the two-dimensional complex Ginzburg-Landau equation in its vortex glass regime. Here, we impose an external drive as a perturbation mimicking a quantum measurement protocol, with a given “measurement rate” (the rate of repetition of the drive) and “mixing rate” (characterized by the intensity of the drive). Using a variety of measures, we find that the system may or may not retain its coherence, statistically retrieving its original glass state, depending on the strength and periodicity of the perturbing field. The corresponding parametric regimes and the associated energy cascade mechanisms involving the dynamics of vortex waveforms and domain boundaries are discussed.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Exploring the Adoption Challenges of Post-Quantum Cryptography in EV Charging Infrastructure

The rapid evolution of electric vehicle (EV) technology and the corresponding growth of the Electric Vehicle Charging Infrastructure (EVCI) brings to light significant cybersecurity concerns, notably in the context of emerging post-quantum computing capabilities. This report, prepared by Pacific Northwest National Laboratory (PNNL) under the U.S. Department of Energy contract, delves into the challenges associated with integrating Post-Quantum Cryptography (PQC) into EVCI to safeguard against potential quantum computing threats. Post-quantum computers will eventually be able to invalidate technologies secured through public key cryptography. As part of this effort, the primary gaps and challenges in the EVCI were investigated with a focus on comparing traditional algorithms against PQC algorithms. One of the notable findings was that the P-521 algorithm was frequently surpassed in performance by PQC algorithms. This document provides a thorough examination of the hurdles the industry can expect when transitioning to PQC within the EVCI, such as interoperability concerns, the computational and memory demands of PQC algorithms, and the organizational readiness for such a transition. It emphasizes the necessity of a forward-thinking approach to cybersecurity, advocating for early and strategic engagement among EVCI stakeholders to ensure a seamless and cost-effective migration to quantum-resistant cryptographic standards. Through this report, the authors aim to catalyze awareness and action among policymakers, industry leaders, and cybersecurity professionals towards fortifying the EVCI against emerging quantum threats, thereby securing the infrastructure essential for the future of electric mobility.

33 ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2026

Data from: "Towards CONUS-Wide ML-Augmented Conceptually-Interpretable Modeling of Catchment-Scale Precipitation-Storage-Runoff Dynamics"

This data package was generated to support the manuscript “Towards CONUS-Wide Machine Learning-Augmented Conceptually Interpretable Modeling of Catchment-Scale Precipitation-Storage-Runoff Dynamics.” It provides input files, model outputs, plotting data, scripts, notebooks, and documentation used to develop, evaluate, and reproduce Mass-Conserving Perceptron (MCP)-based hydrologic modeling experiments across 513 selected Catchment Attributes and Meteorology for Large-sample Studies in the United States (CAMELS-US) basins. The files are organized by modeling component and analysis purpose, including rainfall–runoff experiments, snow module experiments, coupled hydrologic-snow experiments, Long Short-Term Memory (LSTM) benchmark results, model skill metrics, initialization and epoch records, cell-state normalization files, Akaike Information Criterion (AIC)-based model comparison files, and data used to generate manuscript figures. Tabular files can be opened using standard spreadsheet software or Python/R data-analysis tools. Python scripts, Jupyter notebooks, and selected MATLAB scripts are included for model execution, postprocessing, plotting, and statistical analysis. Quality assurance and quality control were conducted through the source-data selection and modeling workflow. Meteorological forcing, streamflow, and static catchment attributes were derived from the CAMELS-US dataset, and snow water equivalent data were derived from the University of Arizona (UA) Snow Water Equivalent dataset. Selected basins and time periods were screened during the associated research workflow to avoid missing observations or poor-quality cases. Static geospatial features were processed primarily using Quantum Geographic Information System (QGIS) and Geospatial Data Abstraction Library (GDAL) workflows. Additional details are provided in the associated manuscript and documentation.

ESS-DIVE CSV File Formatting Guidelines Reporting ↗

DOE OSTI2025

Efficient Hamiltonian encoding algorithms for extracting quantum control mechanism as interfering pathway amplitudes in the Dyson series

Hamiltonian encoding is a methodology for revealing the mechanism behind the dynamics governing controlled quantum systems. In this paper, following Mitra and Rabitz \cite{abhra_1}, we define mechanism via pathways of eigenstates that describe the evolution of the system, where each pathway is associated with a complex-valued amplitude corresponding to a term in the Dyson series. The evolution of the system is determined by the constructive and destructive interference of these pathway amplitudes. Pathways with similar attributes can be grouped together into pathway classes. The amplitudes of pathway classes are computed by modulating the Hamiltonian matrix elements and decoding the subsequent evolution of the system rather than by direct computation of the individual terms in the Dyson series. The original implementation of Hamiltonian encoding was computationally intensive and became prohibitively expensive in large quantum systems. This paper presents two new encoding algorithms that calculate the amplitudes of pathway classes by using techniques from graph theory and algebraic topology to exploit patterns in the set of allowed transitions, greatly reducing the number of matrix elements that need to be modulated. These new algorithms provide an exponential decrease in both computation time and memory utilization with respect to the Hilbert space dimension of the system. To demonstrate the use of these techniques, they are applied to two illustrative state-to-state transition problems.

Abrams, Erez [Princeton University, Massachusetts ↗

DOE OSTI2021

Model fusion with physics-guided machine learning: Projection-based reduced-order modeling

The unprecedented amount of data generated from experiments, field observations, and large-scale numerical simulations at a wide range of spatiotemporal scales has enabled the rapid advancement of data-driven and especially deep learning models in the field of fluid mechanics. Although these methods are proven successful for many applications, there is a grand challenge of improving their generalizability. This is particularly essential when data-driven models are employed within outer-loop applications like optimization. In this work, we put forth a physics-guided machine learning (PGML) framework that leverages the interpretable physics-based model with a deep learning model. Leveraging a concatenated neural network design from multi-modal data sources, the PGML framework is capable of enhancing the generalizability of data-driven models and effectively protects against or inform about the inaccurate predictions resulting from extrapolation. We apply the PGML framework as a novel model fusion approach combining the physics-based Galerkin projection model and long- to short-term memory (LSTM) network for parametric model order reduction of fluid flows. We demonstrate the improved generalizability of the PGML framework against a purely data-driven approach through the injection of physics features into intermediate LSTM layers. Our quantitative analysis shows that the overall model uncertainty can be reduced through the PGML approach, especially for test data coming from a distribution different than the training data. Moreover, we demonstrate that our approach can be used as an inverse diagnostic tool providing a confidence score associated with models and observations. The proposed framework also allows for multi-fidelity computing by making use of low-fidelity models in the online deployment of quantified data-driven models.

42 ENGINEERING↗

DOE OSTI2025

Differential equations for cosmological correlators

Cosmological fluctuations retain a memory of the physics that generated them in their spatial correlations. The strength of correlations varies smoothly as a function of external kinematics, which is encoded in differential equations satisfied by cosmological correlation functions. In this work, we provide a broader perspective on the origin and structure of these differential equations. As a concrete example, we study conformally coupled scalar fields in a power-law cosmology. The wavefunction coefficients in this model have integral representations, with the integrands being the product of the corresponding flat-space results and “twist factors” that depend on the cosmological evolution. Similar twisted integrals arise for loop amplitudes in dimensional regularization, and their recent study has led to the discovery of rich mathematical structures and powerful new tools for computing multi-loop Feynman integrals in quantum field theory. The integrals of interest in cosmology are also part of a finite-dimensional basis of master integrals, which satisfy a system of first-order differential equations. We develop a formalism to derive these differential equations for arbitrary tree graphs. The results can be represented in graphical form by associating the singularities of the differential equations with a set of graph tubings. Upon differentiation, these tubings grow in a local and predictive fashion. In fact, a few remarkably simple rules allow us to predict — by hand — the equations for all tree graphs. While the rules of this “kinematic flow” are defined purely in terms of data on the boundary of the spacetime, they reflect the physics of bulk time evolution. We also study the analogous structures in tr ϕ 3 theory, and see some glimpses of hidden structure in the sum over planar graphs. This suggests that there is an autonomous combinatorial or geometric construction from which cosmological correlations, and the associated spacetime, emerge.

Cosmological models↗

DOE OSTI2024

Controlling the helicity of light by electrical magnetization switching

Controlling the intensity of emitted light and charge current is the basis of transferring and processing information. By contrast, robust information storage and magnetic random-access memories are implemented using the spin of the carrier and the associated magnetization in ferromagnets. In this study, the missing link between the respective disciplines of photonics, electronics and spintronics is to modulate the circular polarization of the emitted light, rather than its intensity, by electrically controlled magnetization. Here we demonstrate that this missing link is established at room temperature and zero applied magnetic field in light-emitting diodes through the transfer of angular momentum between photons, electrons and ferromagnets. With spin-orbit torque a charge current generates also a spin current to electrically switch the magnetization. This switching determines the spin orientation of injected carriers into semiconductors, in which the transfer of angular momentum from the electron spin to photon controls the circular polarization of the emitted light. The spin-photon conversion with the nonvolatile control of magnetization opens paths to seamlessly integrate information transfer, processing and storage. Our results provide substantial advances towards electrically controlled ultrafast modulation of circular polarization and spin injection with magnetization dynamics for the next-generation information and communication technology, including space-light data transfer. The same operating principle in scaled-down structures or using two-dimensional materials will enable transformative opportunities for quantum information processing with spin-controlled single-photon sources, as well as for implementing spin-dependent time-resolved spectroscopies.

74 ATOMIC AND MOLECULAR PHYSICS↗

DOE OSTI2025

Fracton models from product codes

We explore a deep connection between fracton order and product codes. In particular, we propose and analyze conditions on classical seed codes which lead to fracton order in the resulting quantum product codes. Depending on the properties of the input codes, product codes can realize either Type-I or Type-II fracton models, in both nonlocal and local constructions. For the nonlocal case, we show that a recently proposed model of lineons on nonlocal graphs can be obtained as a hypergraph product code. Interestingly, constrained mobility in this model arises only from energy barriers associated with the graph. For the local case, we introduce a novel type of classical LDPC code defined on a planar aperiodic tiling. By considering the specific example of the pinwheel tiling, we demonstrate the systematic construction of local Type-I and Type-II fracton models as product codes. Our work establishes product codes as a natural setting for exploring fracton order.

Fractons↗

DOE OSTI2025

Potentials of mean force fail to describe chemical bond-breaking in solution

Many liquid phase studies assume that the potential energy surfaces of reacting molecules are the same as in the gas phase, neglecting complex solvent dynamics that can completely alter the nature of chemical reactivity. Even studies that include solvent effects typically only consider them in an average, equilibrium way as part of a potential of mean force (PMF). In this work, we use mixed quantum/classical simulations to compare how equilibrium and non-equilibrium solvent motions affect the photodissociation of a simple diatomic molecule, NaK + , in liquid tetrahydrofuran. A PMF analysis shows that as the excited-state molecule dissociates with the solvent at equilibrium, the bonding electron remains associated with K + at short bond distances but eventually localizes on Na + at the end of dissociation. When we examine non-equilibrium dynamical photodissociation trajectories, however, we find that they fall into three distinct categories: about a quarter of them have the bonding electron mainly associated with Na + , another quarter stay mainly associated with K + , and about half have the bonding electron shared roughly equally between the two ions. The results show that equilibrium PMFs cannot accurately describe the dynamics of bond-breaking chemical reactions in solution because there is insufficient time for the solvent to reach equilibrium on the time scale over which bond dissociation occurs. Furthermore, our analysis shows that the solvent coupling between the electronic energy surfaces is similar at and away from equilibrium, suggesting that other factors, such as solute velocity-driven solvent memory effects, play a more important role in explaining the failure of the equilibrium PMF to predict the non-equilibrium dynamics.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗