SEARCH · Engineering Papers

Results for “analog computation”

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 73 records · Page 4

All sources NASA NTRS DOE OSTI

DOE OSTI2021

Towards memristor supremacy with novel machine learning algorithms

The von Neumann architecture for current computers is slowly showing signs of limitations, due to the finite bus rate between the RAM (memory) and the CPU (computing unit). In-Memory computing is an alternative to this architecture, which however is still in the early stages of development. Memristors are an analog and classical alternative, as these components can act both as a memory, or as a simple computing unit. When wired together, these can in fact be used for a variety of applications. During the course of our research, we have developed an in-depth experimental understanding of both the limitations and the real possibilities of these devices, and developed automated algorithms for their characterization; at the theoretical level, we have incorporated the experimental features to implement novel analog computing units for specific tasks. We have shown that memristors can tackle QUBO and cubic optimization problems, and exhibit tunneling phenomena.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Report for the ASCR Workshop on Basic Research Needs in Quantum Computing and Networking - 2023

Employing quantum mechanical resources in computing and networking opens the door to new computation and communication models and potential disruptive advantages over classical counterparts. However, quantifying and realizing such advantages face extensive scientific and engineering challenges. Investments by the Department of Energy (DOE) have driven progress toward addressing such challenges. Quantum algorithms have been recently developed, in some cases offering asymptotic exponential advantages in speed or accuracy, for fundamental scientific problems such as simulating physical systems, solving systems of linear equations, or solving differential equations. Empirical demonstrations on nascent quantum hardware suggest better performance than classical analogs on specialized computational tasks favorable to the quantum computing systems. However, demonstration of an end-to-end, substantial and rigorously quantifiable quantum performance advantage over classical analogs remains a grand challenge, especially for problems of practical value. The definition of requirements for quantum technologies to exhibit scalable, rigorous, and transformative performance advantages for practical applications also remains an outstanding open question, namely, what will be required to ultimately demonstrate practical quantum advantage?

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Report for the ASCR Workshop on Basic Research Needs in Quantum Computing and Networking - 2023

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Hybrid quantum-classical approach for coupled-cluster Green's function theory

The three key elements of a quantum simulation are state preparation, time evolution, and measurement. While the complexity scaling of time evolution and measurements are well known, many state preparation methods are strongly system-dependent and require prior knowledge of the system's eigenvalue spectrum. Here, we report on a quantum-classical implementation of the coupled-cluster Green's function (CCGF) method, which replaces explicit ground state preparation with the task of applying unitary operators to a simple product state. While our approach is broadly applicable to many models, we demonstrate it here for the Anderson impurity model (AIM). The method requires a number of T gates that grows as O ( N 5 ) per time step to calculate the impurity Green's function in the time domain, where N is the total number of energy levels in the AIM. Since the number of T gates is analogous to the computational time complexity of a classical simulation, we achieve an order of magnitude improvement over a classical CCGF calculation of the same order, which requires O ( N 6 ) computational resources per time step.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Dual-ion ECRAM as a stable and accurate analog synapse

Electrochemical random-access memory (ECRAM) works by tuning the bulk electronic conductance of functional materials via reversible, electrochemical insertion of ions, resulting in stable analog resistive switching, attractive for analog in-memory and neuromorphic computing. However, achieving fast programming for training and long retention for inference has been elusive. Protonic ECRAM demonstrates fast programming but insufficient retention, while oxygen-based ECRAM with excellent retention requires elevated programming temperatures. Cu-based ECRAM offers a compromise, with an activation energy (E A ) of ≈0.76 eV between protons (E A ≈ 0.4 eV) and oxygen (E A > 1 eV), enabling extensive retention and room temperature programming. Combining Cu 2+ ions with protons to form a dual-ion ECRAM, we demonstrate two distinct switching behaviors: fast switching at ≤5 V, (E A ≈ 0.45 eV) via protons, and nonvolatile, room temperature switching at ≥8 V, with E A ≈ 0.76 eV via Cu 2+ ions. In conclusion, the Cu-based state exhibits a wide conductance range, with excellent retention, low noise, and linear current-voltage behavior, achieving digital-equivalent ImageNet inference accuracy.

analog in-memory computing↗

DOE OSTI2024

Computing with a Chemical Reservoir

Contemporary computation is expensive, with large language models and artificial intelligence becoming more common in daily life. However, high-performance computing is reaching the limits in speed and energy expenditure, and domain science requires ever-increasing computational capacity, with simulations and data analysis pipelines ever-growing in complexity. As we progress towards post-exascale computation, with the associated high energy costs, new methods of energy-conscious computation are required. Novel analog and hybrid digital-analog systems can overcome these challenges, and chemical reactions offer a promising avenue. Computers based on chemistry can provide compact desktop devices with immense computational power. These devices are readily scalable by considering greater reaction systems or vessels, meeting the high-performance requirements for scientific workflows. In this article, we present ChemComp, a compilation pipeline for the conversion of ordinary differential equations into implementable chemical reactions. We then demonstrate the solving capabilities of ChemComp by emulating a potential chemical reservoir device. We leverage the multi-layer intermediate representation (MLIR) compiler framework to implement an expressive chemical reaction abstraction and propose a path for chemical reaction networks (CRNs) to represent mathematical problems effectively. Combined, we demonstrate a potential workflow that can harness chemistry’s computing power to create energy-efficient, high-performance computation systems for contemporary computing needs.

artificial intelligence↗

DOE OSTI2021

Analysis and mitigation of parasitic resistance effects for analog in-memory neural network acceleration

To support the increasing demands for efficient deep neural network processing, accelerators based on analog in-memory computation of matrix multiplication have recently gained significant attention for reducing the energy of neural network inference. However, analog processing within memory arrays must contend with the issue of parasitic voltage drops across the metal interconnects, which distort the results of the computation and limit the array size. This work analyzes how parasitic resistance affects the end-to-end inference accuracy of state-of-the-art convolutional neural networks, and comprehensively studies how various design decisions at the device, circuit, architecture, and algorithm levels affect the system's sensitivity to parasitic resistance effects. Here, a set of guidelines are provided for how to design analog accelerator hardware that is intrinsically robust to parasitic resistance, without any explicit compensation or re-training of the network parameters.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Pareto Optimization of Analog Circuits Using Reinforcement Learning

Analog circuit optimization and design presents a unique set of challenges in the IC design process. Many applications require the designer to optimize for multiple competing objectives, which poses a crucial challenge. Motivated by these practical aspects, we propose a novel method to tackle multi-objective optimization for analog circuit design in continuous action spaces. In particular, we propose to (i) extrapolate current techniques in Multi-Objective Reinforcement Learning to continuous state and action spaces and (ii) provide for a dynamically tunable trained model to query user defined preferences in multi-objective optimization in the analog circuit design context.

99 GENERAL AND MISCELLANEOUS↗

DOE OSTI2024

Heracles: Predictive Tools for Opioid Crisis Intervention - m/q Initiative Project Report

The opioid crisis in the United States is being fueled primarily by fentanyl and its molecular analogs, which can be anywhere from 50 to 1,000 times more potent than morphine. Fentanyl itself is straightforward to synthesize; furthermore, the structure is such that fentanyl’s flexible, rotatable side chains are easy to modify to create new analogs. Reference-free computational techniques to predict and identify new fentanyls have the potential to provide a desperately needed preemptive advantage to regulatory stakeholders and toxicologists. The computational pipeline Heracles was developed with this preemptive advantage in mind. Heracles has two primary components: 1) the creation of an in silico library of putative fentanyl analogs, and 2) a downselection pipeline to prioritize generated fentanyl analogs predicted to be potent and easy to synthesize. Experimental observables were also predicted for prioritized analogs, with validation of the observables begun. Heracles has demonstrated potential to aid in the advancement of reference-free paradigms while providing new tools to first responders and other stakeholders attempting to mitigate the opioid crisis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2022

An Accurate, Error-Tolerant, and Energy-Efficient Neural Network Inference Engine Based on SONOS Analog Memory

In this work, we demonstrate SONOS (silicon-oxide-nitrideoxide- silicon) analog memory arrays that are optimized for neural network inference. The devices are fabricated in a 40nm process and operated in the subthreshold regime for in-memory matrix multiplication. Subthreshold operation enables low conductances to be implemented with low error, which matches the typical weight distribution of neural networks, which is heavily skewed toward near-zero values. This leads to high accuracy in the presence of programming errors and process variations. We simulate the end-to-end neural network inference accuracy, accounting for the measured programming error, read noise, and retention loss in a fabricated SONOS array. Evaluated on the ImageNet dataset using ResNet50, the accuracy using a SONOS system is within 2.16% of floating-point accuracy without any retraining. The unique error properties and high On/Off ratio of the SONOS device allow scaling to large arrays without bit slicing, and enable an inference architecture that achieves 20 TOPS/W on ResNet50, a >10× gain in energy efficiency over state-of-the-art digital and analog inference accelerators.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

When in-memory computing meets spiking neural networks—A perspective on device-circuit-system-and-algorithm co-design

This review explores the intersection of bio-plausible artificial intelligence in the form of spiking neural networks (SNNs) with the analog in-memory computing (IMC) domain, highlighting their collective potential for low-power edge computing environments. Through detailed investigation at the device, circuit, and system levels, we highlight the pivotal synergies between SNNs and IMC architectures. Additionally, we emphasize the critical need for comprehensive system-level analyses, considering the inter-dependencies among algorithms, devices, circuit, and system parameters, crucial for optimal performance. An in-depth analysis leads to the identification of key system-level bottlenecks arising from device limitations, which can be addressed using SNN-specific algorithm–hardware co-design techniques. This review underscores the imperative for holistic device to system design-space co-exploration, highlighting the critical aspects of hardware and algorithm research endeavors for low-power neuromorphic solutions.

Physics↗

DOE OSTI2026

Covalency of M–N Bonds in Isomorphous Lanthanide and Actinide 5-(2-Pyridyl)-1H-tetrazolate Complexes

Experimental and computational analyses of [M(pdtz) 3 (H 2 O) 3 ]·3.5H 2 O (M 3+ = Pu 3+ −Cm 3+ , La 3+ −Nd 3+ , and Sm 3+ −Ho 3+ , pdtz− = 5-(2-pyridyl)-1H-tetrazolate) were conducted to understand potential differences in bonding between lanthanide and actinide complexes with a N-donor ligand. Structural analyses show that the An−N bond distances in the Pu 3+ , Am 3+ , and Cm 3+ complexes are within error of one another. Whereas in the lanthanide series, there is a nearly linear decrease in the Ln−N bond lengths from La 3+ to Ho 3+ (excluding Pm 3+ ). The An−N bond lengths are ∼0.015 Å shorter than their similarly-sized lanthanide analogs, in agreement with computational results that suggest greater covalent character in these bonds versus those with lanthanides. QTAIM analysis indicates that the An−N orbital mixing remains essentially unchanged from Pu 3+ to Cm 3+ , consistent with the nearly identical An−N bond lengths. However, upon deconvolution of the NLMOs into orbital compositions, the metal orbital contributions to An−N bonding decreases slightly overall wherein the 6d involvement remains constant, 7s involvement slightly increases, and 5f participation decreases. The molecular orbital energy diagram indicates that energy degeneracy between the 5f metal and 2p ligand orbitals increases from Pu 3+ to Cm 3+ and counteracts the contraction of the 5f orbtials. Together with prior reports of decreasing energy degeneracy between 5f and 3p orbitals from Np 3+ to Cf 3+ , these observations provide guidance on understanding how chemical bonding evolves in the actinide series.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2026

Generative Thermodynamic Computing

Here, we introduce a generative modeling framework for thermodynamic computing, in which structured data are synthesized from noise by the natural time evolution of a physical system governed by Langevin dynamics. While conventional diffusion models use neural networks to perform denoising, here the information needed to generate structure from noise is encoded by the dynamics of a thermodynamic system. Training proceeds by maximizing the probability with which the computer generates the reverse of a noising trajectory, which ensures that the computer generates data with minimal heat emission. We demonstrate this framework within a digital simulation of a thermodynamic computer. If realized in analog hardware, such a system would function as a generative model that produces structured samples without the need for artificially injected noise or active control of denoising.

Whitelam, Stephen [Lawrence Berkeley National Labo↗

DOE OSTI2025

Efficiently Verifiable Quantum Advantage on Near-Term Analog Quantum Simulators

Existing schemes for demonstrating quantum computational advantage are subject to various practical restrictions, including the hardness of verification and challenges in experimental implementation. Meanwhile, analog quantum simulators have been realized in many experiments to study novel physics. In this work, we propose a quantum advantage protocol based on verification of an analog quantum simulation, in which the verifier need only run an O ( λ 2 ) -time classical computation, and the prover need only prepare O ( 1 ) samples of a history state and perform O ( λ 2 ) single-qubit measurements, for a security parameter λ . We also propose a near-term feasible strategy for honest provers and discuss potential experimental realizations. Published by the American Physical Society 2025

Liu, Zhenning (ORCID:000000020794419X)↗

DOE OSTI2025

Toward Mixed Analog-Digital Quantum Signal Processing: Quantum AD/DA Conversion and the Fourier Transform

Signal processing stands as a pillar of classical computation and modern information technology, applicable to both analog and digital signals. Recently, advancements in quantum information science have suggested that quantum signal processing (QSP) can enable more powerful signal processing capabilities. However, the developments in QSP have primarily leveraged digital quantum resources, such as discrete-variable (DV) systems like qubits, rather than analog quantum resources, such as continuous-variable (CV) systems like quantum oscillators. Consequently, there remains a gap in understanding how signal processing can be performed on hybrid CV-DV quantum computers. Here we address this gap by developing a new paradigm of mixed analog-digital QSP. We demonstrate the utility of this paradigm by showcasing how it naturally enables analog-digital conversion of quantum signals—specifically, the transfer of states between DV and CV quantum systems. We then show that such quantum analog-digital conversion enables new implementations of quantum algorithms on CV-DV hardware. This is exemplified by realizing the quantum Fourier transform of a state encoded on qubits via the free-evolution of a quantum oscillator, albeit with a runtime exponential in the number of qubits due to information theoretic arguments. Collectively, this work marks a significant step forward in hybrid CV-DV quantum computation, providing a foundation for scalable analog-digital signal processing on quantum processors.

42 ENGINEERING↗

DOE OSTI2023

Applying an Oriented Divergence Theorem to Swept Face Remap

Here we present a novel oriented divergence theorem and apply the results to a swept face remap method (conservative data transfer between two meshes) in arbitrary Langrangian–Eulerian hydrodynamics. In our setting, we compute the material flux along swept regions between corresponding faces in the source and target meshes. Since the swept region may add material, subtract material, or do both when it intersects itself, we cannot apply the conventional divergence theorem without accounting for orientation and self-overlaps. In this work, we encode the swept region orientation and geometry with a map from the unit n -dimensional cube, and then apply an oriented analog of divergence theorem to compute the material flux. We present efficient implementation strategies for the presented method. We also provide numerical evidence supporting our results and discuss extensions to more general mesh topologies.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

LUNA: LUT-Based Neural Architecture for Fast and Low-Cost Qubit Readout

Qubit readout is a critical operation in quantum computing systems, which maps the analog response of qubits into discrete classical states. Deep neural networks (DNNs) have recently emerged as a promising solution to improve readout accuracy . Prior hardware implementations of DNN-based readout are resource-intensive and suffer from high inference latency, limiting their practical use in low-latency decoding and quantum error correction (QEC) loops. This paper proposes LUNA, a fast and efficient superconducting qubit readout accelerator that combines low-cost integrator-based preprocessing with Look-Up Table (LUT) based neural networks for classification. The architecture uses simple integrators for dimensionality reduction with minimal hardware overhead, and employs LogicNets (DNNs synthesized into LUT logic) to drastically reduce resource usage while enabling ultra-low-latency inference. We integrate this with a differential evolution based exploration and optimization framework to identify high-quality design points. Our results show up to a 10.95x reduction in area and 30% lower latency with little to no loss in fidelity compared to the state-of-the-art. LUNA enables scalable, low-footprint, and high-speed qubit readout, supporting the development of larger and more reliable quantum computing systems.

Farooq, M. A. [Arizona State U., Tempe]↗

DOE OSTI2025

Enhancing Biopolyester Backbone Rigidity with an Asymmetric Furanic Monomer

Biobased furanic polyesters can exhibit performance advantages over petroleum-derived polyesters, primarily due to their rigid furan-containing backbones. Herein, we develop two strategies to polymerize methyl 5-hydroxymethyl furanoate to poly(5-hydroxymethyl furanoate) (PHMF), a furan-based polyester with even greater backbone rigidity than poly(ethylene furanoate). Thermal, spectroscopic, and computational investigations of PHMF alongside analogous furan-based and phenyl-based polyesters suggest that the high furan content of PHMF leads to its high glass transition temperature, slow crystallization kinetics, and low amorphous mobility. Molecular dynamics simulations suggest that while the backbone of PHMF is exceptionally rigid, its amorphous phase is denser than its phenyl analog due to noncovalent interchain interactions. Together, these results highlight how asymmetric furan-based monomers can modulate key properties in biobased polyesters.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗