SEARCH · Search NASA

Results for “Analog computing”

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 127 records · Page 7

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Playing Nonlocal Games across a Topological Phase Transition on a Quantum Computer

Many-body quantum games provide a natural perspective on phases of matter in quantum hardware, crisply relating the quantum correlations inherent in phases of matter to the securing of quantum advantage at a device-oriented task. In this Letter, we introduce a family of multiplayer quantum games for which topologically ordered phases of matter are a resource yielding quantum advantage. Unlike previous examples, quantum advantage persists away from the exactly solvable point and is robust to arbitrary local perturbations, irrespective of system size. We demonstrate this robustness experimentally on Quantinuum’s H1-1 quantum computer by playing the game with a continuous family of randomly deformed toric code states that can be created with constant-depth circuits leveraging midcircuit measurements and unitary feedback. We are thus able to tune through a topological phase transition—witnessed by the loss of robust quantum advantage—on currently available quantum hardware. This behavior is contrasted with an analogous family of deformed Greenberger-Horne-Zeilinger states, for which arbitrarily weak local perturbations destroy quantum advantage in the thermodynamic limit. Lastly, we discuss a topological interpretation of the game, which leads to a natural generalization involving an arbitrary number of players.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Embedded Fluidic Sensing and Control with Soft Open‐Cell Foams

Abstract The synthesis of soft matter intelligence with circuit‐driven logic has enabled a new class of robots that perform complex tasks or conform to specialized form factors in unique ways that cannot be realized through conventional designs. Translating this hybrid approach to fluidic systems, the present work addresses the need for sheet‐based circuit materials by leveraging the innate porosity of foam—a soft material—to develop pneumatic components that support digital logic, mixed‐signal control, and analog force sensing in wearables and soft robots. Analytical tools and experimental techniques developed in this work serve to elucidate compressible gas flow through porous sheets, and to inform the design of centimeter‐sized foam resistors with fluidic resistances on the order of 10 9 Pa s m −3 . When embedded inside soft robots and wearables, these resistors facilitate diverse functionalities spanning both sensing and control domains, including digital logic using textile logic gates, digital‐to‐analog signal conversion using ladder networks, and analog sensing of forces up to 40 N via compression‐induced changes in resistance. By combining features of both circuit‐based and materials‐based approaches, foam‐enabled fluidic circuits serve as a useful paradigm for future hybrid robotic architectures that fully embody the sensing and computing capabilities of soft fluidic materials.

Rajappan, Anoop↗

DOE OSTI2024

A nonlinear journey from structural phase transitions to quantum annealing

Motivated by an exact mapping between equilibrium properties of a one-dimensional chain of quantum Ising spins in a transverse field (the transverse field Ising (TFI) model) and a two-dimensional classical array of particles in double-well potentials (the “$\phi$ 4 model”) with weak inter-chain coupling, we explore connections between the driven variants of the two systems. Here, we argue that coupling between the fundamental topological solitary waves in the form of kinks between neighboring chains in the classical $\phi$ 4 system is the analog of the competing effect of the transverse field on spin flips in the quantum TFI model. As an example application, we mimic simplified measurement protocols in a closed quantum model system by studying the classical $\phi$ 4 model subjected to periodic perturbations. This reveals memory/loss of memory and coherence/decoherence regimes, whose quantum analogs are essential in annealing phenomena. In particular, we examine regimes where the topological excitations control the thermal equilibration following perturbations. This paves the way for further explorations of the analogy between lower-dimensional linear quantum and higher-dimensional classical nonlinear systems.

74 ATOMIC AND MOLECULAR PHYSICS↗

DOE OSTI2026

Cosmological constraints from a joint DESI DR1 Full-Shape and DR2 BAO

We present a cosmological analysis combining full-shape (FS) clustering measurements from the Dark Energy Spectroscopic Instrument (DESI) DR1 with baryon acoustic oscillation (BAO) measurements from DESI DR2. To achieve a robust combination that accounts for the correlation between the two data releases, we employ the ShapeFit compression method and estimate the joint covariance using EZmocks. This compressed approach inherently mitigates the prior volume effects that have previously dominated Bayesian constraints from DESI data with minimal external priors. Consequently, we obtain — for the first time within a Bayesian framework — reliable DESI-only constraints on extensions to ΛCDM using only a Big Bang Nucleosynthesis prior on the baryon density and a wide prior on the spectral index. In flat ΛCDM, we find Ω m = 0.3035 ± 0.0085, h = 0.6876 ± 0.0059, and σ 8 = 0.822 ± 0.034. For the w 0 w a CDM dynamical dark energy model, we measure w 0 = -0.49 ± 0.25 and w a = -1.52 ± 0.77, improving constraints by ∼ 30% relative to the analogous DR1 measurement and reducing the discrepancy with ΛCDM to 1.4σ when compared to BAO only analyses. We also report competitive limits on the sum of neutrino masses and spatial curvature. This work demonstrates that the ShapeFit compression provides a prior-robust and computationally efficient pathway to constrain beyond-ΛCDM physics with large-scale structure.

baryon acoustic oscillations↗

DOE OSTI2025

Why Are 5-Thioglycopyranosyl Donors More Axially Selective than their Glycopyranosyl Counterparts? A Low and Variable Temperature NMR Spectroscopy and Computational Study

5-Thioglycopyranosyl donors differ in reactivity and selectivity from simple glycopyranosyl donors. An extensive study has been conducted on the nature and stability of the reactive intermediates generated on the activation of per-O-acetyl and per-O-methyl 5-thioglucopyranosyl donors and the corresponding glucopyranosyl donors. Variable temperature nuclear magnetic resonance (NMR) studies with per-O-methylated or per-O-acetyl glycosyl sulfoxides and trichloroacetimidates on activation with trifluoromethanesulfonic anhydride or trimethylsilyl triflate are reported. These show that following initial adduct formation with the promoter conversion of the 5-thioglucopyranosyl donors to the 5-thioglucopyranosyl triflates requires higher temperatures than that of the glucopyranosyl donors to the glucopyranosyl triflates. It is demonstrated that neighboring group participation is a less important phenomenon for the peracetylated thioglucosyl donors than for the peracetylated glucosyl donors. A simple thiocarbenium ion was generated by protonation of 2,3-dihydro-4H-thiopyran at low temperature and characterized by NMR spectroscopy. However, the corresponding 5-thioglucopyranosyl thenium ions were not observed in any of the NMR studies of the 5-thiopyranosyl donors: the electron-withdrawing C–O bonds around the thiopyranoside core discourage thiocarbenium ion formation, just as they discourage oxocarbenium ion formation. Density functional theory (DFT) calculations reveal the tetrahydrothiopyranyl thiocarbenium ion to be approximately 2.5 kcal/mol lower in energy than the corresponding tetrahydropyranyl oxocarbenium ion relative to the corresponding covalent triflates. However, the computations reveal a 5.8 kcal/mol activation barrier for conversion of the tetrahydrothiopyranyl triflate to the thiocarbenium ion, while formation of the oxocarbenium ion–triflate ion pair from tetrahydropyranyl triflate requires only 2.6 kcal·mol –1 . Overall, the greater axial selectivity of 5-thioglycopyranosyl donors compared to analogous glycopyranosyl donors derives from (i) the lower kinetic reactivity necessitating higher reaction temperatures, (ii) the greater stability of the thiocarbenium ion over the oxocarbenium ion facilitating equilibration under thermodynamic conditions, (iii) the greater magnitude of the anomeric effect in the 5-thiosugars, and (iv) decreased neighboring group participation in the per-esterified 5-thiosugars.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2024

Sparsity-Independent Lyapunov Exponent in the Sachdev-Ye-Kitaev Model

The saturation of a recently proposed universal bound on the Lyapunov exponent has been conjectured to signal the existence of a gravity dual. This saturation occurs in the low-temperature limit of the dense Sachdev-Ye-Kitaev (SYK) model, N Majorana fermions with q body ( q > 2 ) infinite-range interactions. We calculate certain out-of-time-order correlators (OTOCs) for N ≤ 64 fermions for a highly sparse SYK model and find no significant dependence of the Lyapunov exponent on sparsity up to near the percolation limit where the Hamiltonian breaks up into blocks. This provides strong support to the saturation of the Lyapunov exponent in the low-temperature limit of the sparse SYK. A key ingredient to reaching N = 64 is the development of a novel quantum spin model simulation library that implements highly optimized matrix-free Krylov subspace methods on graphical processing units. This leads to a significantly lower simulation time as well as vastly reduced memory usage over previous approaches, while using modest computational resources. Strong sparsity-driven statistical fluctuations require both the use of a much larger number of disorder realizations with respect to the dense limit and a careful finite size scaling analysis. The saturation of the bound in the sparse SYK points to the existence of a gravity analog that would enlarge substantially the number of field theories with this feature. Published by the American Physical Society 2024

Physics↗

DOE OSTI2025

Quantum Information for Fusion Energy Sciences (Final Technical Report)

The simulation of plasma dynamics is a critical area of Fusion Energy Sciences (FES) due to it’s usefulness in predicting, controlling, and confining plasmas in the context of potential fusion reactors. The simulation of plasmas is a computationally difficult problem in both classical and quantum physics, motivating investigation into the potential of quantum computers to simulate these systems. This project took several concrete steps towards this goal by developing tools for improving the control, characterization, and calibration of quantum gates on a superconducting quantum computer, developing error suppression and mitigation tools to reduce errors on the quantum computer, and utilizing these advancements to simulate reduced models of plasma dynamics on the quantum computer. In order to efficiently simulate plasma physics, an optimal control method which synthesizes, directly at the pulse level, any quantum gate on qubit and qutrit systems was developed. Using four superconducting transmon quantum processors at Rigetti and LLNL, it was demonstrated that any arbitrary quantum gate on qubits and qutrits could be implemented with high fidelity, leading to a significantly reduced length of a gate sequence. A problem of interest in FES is the nonlinear optical process of laser pulse compression within a plasma. Since quantum physics is linear, simulating nonlinear operations is not naturally feasible on a quantum computer, however it is possible to simulated a quantized version of the nonlinear process. A quantization approach to convert nonlinear wave-wave interaction problems to Hamiltonian simulation problems was developed and demonstrated using two qubits on a Rigetti device. In this experiment, a number of error suppression and mitigation techniques were investigated to determine how best to utilize the finite quantum resources. This study provides an example of how plasma problems may be solved on near-term, noisy quantum computing platforms and identified a promising set of techniques. Building on the insights of these experiments, the investigation turned to linear electron-plasma wave physics. A connection was identified between a local one-dimensional lattice spin model and linear wave phenomena, allowing a plasma physics problem to be efficiently mapped to the quantum computer. In this framework, reflection and transmission of plasma waves at a sharp boundary was studied, as well as the propagation of waves through an inhomogeneous plasma medium. In addition to the suite of error suppression and mitigation techniques developed, this experiment introduced the use of a digital-analog gate scheme designed to efficiently simulate the plasma Hamiltonian. With hardware available at the conclusion of the project, simulation at the scale of 9 qubits and 15 timesteps (60 entangling layers) was achieved.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2024

A weighted shifted boundary method for immersed moving boundary simulations of Stokes' flow

The Shifted Boundary Method (SBM) belongs to the class of unfitted (or immersed, or embedded) finite element methods, and relies on reformulating the original boundary value problem over a surrogate (approximate) computational domain. The surrogate domain is constructed so as to avoid cut cells and the associated problematic implementation and numerical integration issues. Accuracy is maintained by modifying the original boundary conditions using Taylor expansions: hence the name of the method, that shifts the location and values of the boundary conditions. Here, in this article, we extend the SBM to the simulation of incompressible Stokes flow, by appropriately weighting its variational form with the elemental volume fraction of active fluid. This approach allows to drastically reduce spurious pressure oscillations in time, which are produced if the total volume of active fluid were to change abruptly over a time step. The proposed Weighted SBM (W-SBM) exactly preserves states of hydrostatic equilibrium, and induces small mass and momentum conservation errors, which converge as the grid is refined. This is in analogy to cutFEMs and related unfitted approaches, which rely on an affine representation of cut boundaries. We demonstrate the robustness and accuracy of the proposed method with an extensive suite of two-dimensional tests.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Xyce™ Parallel Electronic Simulator Users' Guide (V.7.9)

This manual describes the use of the Xyce Parallel Electronic Simulator. Xyce has been designed as a SPICE-compatible, high-performance analog circuit simulator, and has been written to support the simulation needs of the Sandia National Laboratories electrical designers. This development has focused on improving capability over the current state-of-the-art in the following areas: • Capability to solve extremely large circuit problems by supporting large-scale parallel computing platforms (up to thousands of processors). This includes support for most popular parallel and serial computers. • A differential-algebraic-equation (DAE) formulation, which better isolates the device model package from solver algorithms. This allows one to develop new types of analysis without requiring the implementation of analysis-specific device models. • Device models that are specifically tailored to meet Sandia’s needs, including some radiation-aware devices (for Sandia users only). • Object-oriented code design and implementation using modern coding practices. Xyce is a parallel code in the most general sense of the phrase — a message passing parallel implementation — which allows it to run efficiently a wide range of computing platforms. These include serial, shared-memory and distributed-memory parallel platforms. Attention has been paid to the specific nature of circuit-simulation problems to ensure that optimal parallel efficiency is achieved as the number of processors grows.

42 ENGINEERING↗

DOE OSTI2025

Xyce™ Parallel Electronic Simulator Users’ Guide, Version 7.10

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Sign Problem in Tensor-Network Contraction

We investigate how the computational difficulty of contracting tensor networks depends on the sign structure of the tensor entries. Using results from computational complexity, we observe that the approximate contraction of tensor networks with only positive entries has lower computational complexity as compared to tensor networks with general real or complex entries. This raises the question of how this transition in computational complexity manifests itself in the hardness of different tensor-network-contraction schemes. We pursue this question by studying random tensor networks with varying bias toward positive entries. First, we consider contraction via Monte Carlo sampling and find that the transition from hard to easy occurs when the tensor entries become predominantly positive; this can be understood as a tensor-network manifestation of the well-known negative-sign problem in quantum Monte Carlo. Second, we analyze the commonly used contraction based on boundary tensor networks. The performance of this scheme is governed by the number of correlations in contiguous parts of the tensor network (which by analogy can be thought of as entanglement). Remarkably, we find that the transition from hard to easy—i.e., from a volume-law to a boundary-law scaling of entanglement—already occurs for a slight bias of the tensor entries toward a positive mean, scaling inversely with the bond dimension D , and thus the problem becomes easy the earlier the larger D occurs. This is in contrast both to expectations and to the behavior found in Monte Carlo contraction, where the hardness at fixed bias increases with the bond dimension. To provide insight into this early breakdown of computational hardness and the accompanying entanglement transition, we construct an effective classical statistical-mechanical model that predicts a transition at a bias of the tensor entries of 1 / D , confirming our observations. We conclude by investigating the computational difficulty of computing expectation values of tensor-network wave functions (projected entangled-pair states, PEPSs) and find that in this setting, the complexity of entanglement-based contraction always remains low. We explain this by providing a local transformation that maps PEPS expectation values to a positive-valued tensor network. This not only provides insight into the origin of the observed boundary-law entanglement scaling but also suggests new approaches toward PEPS contraction based on positive decompositions. Published by the American Physical Society 2025

Chen, Jielun (ORCID:0000000178411545)↗

DOE OSTI2026

Toward the “platinum standard” of quantum chemistry on quantum computers: Perturbative quadruple corrections in unitary coupled cluster theory

We propose a non-iterative, post-hoc correction to the unitary coupled cluster theory with the single, double, and triple excitations (UCCSDT) Ansatz, which considers the leading-order effects of neglected quadruple excitations. We present two ways to derive this correction, henceforth referred to as [Q-6], which leads to an improvement in the correlation energy shown to be truncated to sixth-order in many-body perturbation theory. Furthermore, a comparison between the UCC-based [Q-6] correction proposed in this work and analogous, “platinum standard” quadruple corrections proposed in conventional coupled cluster theory recognizes that [Q-6] is distinct from prior corrections since it is constructed entirely from internally connected components. Although trotterized (t) and full operator variants of UCCSDT exhibit errors in scans of small molecule potential energy surfaces that routinely exceed 1.6 mH, we find that t/UCCSDT[Q-6] is, nevertheless, able to achieve chemical accuracy as measured by the mean unsigned error.

Correlation energy↗

DOE OSTI2025

Tough Errors are no Match (TEAM): Optimizing the Quantum Compiler for Noise Resilience

This project builds toward a comprehensive error-mitigating toolkit that makes quantum programming more robust and adaptive to the noisy, resource-limited nature of today’s quantum hardware. To that end, it integrates established error-mitigation methods — such as zero-noise extrapolation and dynamical decoupling — directly into compiler infrastructures. These techniques will be packaged as modules that can automatically adjust and combine based on performance analysis, enabling compilers to explore large design spaces and produce optimized, low-noise quantum programs with minimal manual intervention. In parallel, this project also explores new approaches to analog quantum programming or quantum simulation, and has developed the programming language SimuQ which treats quantum Hamiltonian evolution as the central object.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Quantum Simulations of Radiation Damage in a Molecular Polyethylene Analog

Abstract An atomic‐level understanding of radiation‐induced damage in simple polymers like polyethylene is essential for determining how these chemical changes can alter the physical and mechanical properties of important technological materials such as plastics. Ensembles of quantum simulations of radiation damage in a polyethylene analog are performed using the Density Functional Tight Binding method to help bind its radiolysis and subsequent degradation as a function of radiation dose. Chemical degradation products are categorized with a graph theory approach, and occurrence rates of unsaturated carbon bond formation, crosslinking, cycle formation, chain scission reactions, and out‐gassing products are computed. Statistical correlations between product pairs show significant correlations between chain scission reactions, unsaturated carbon bond formation, and out‐gassing products, though these correlations decrease with increasing atom recoil energy. The results present relatively simple chemical descriptors as possible indications of network rearrangements in the middle range of excitation energies. Ultimately, the work provides a computational framework for determining the coupling between nonequilibrium chemistry in polymers and potential changes to macro‐scale properties that can aid in the interpretation of future radiation damage experiments on plastic materials.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗

DOE OSTI2026

Computational prediction of ferromagnetic 𝐴⁢𝑇 6 ⁢𝑋 6 kagome compounds

We present a systematic high-throughput density-functional-theory investigation of the structural and magnetic stability of 312 substitutional compounds in the magnetic kagome 𝐴⁢𝑇 6⁢ 𝑋 6 family. Our screening confirms the stability of many previously reported structures and predicts several additional stable candidates. Within collinear spin configurations, we find that Fe-based systems predominantly adopt antiferromagnetic ground states, whereas Mn-based analogs exhibit a more balanced distribution between ferromagnetic and antiferromagnetic order. For compounds exhibiting several nearly degenerate collinear configurations, we analyze the nature of their magnetic ground states, assess the possible emergence of noncollinear order, and discuss the limitations and uncertainties inherent to standard density-functional approaches. Our electronic structure analysis further reveals that predicted ferromagnetic kagome systems display characteristic features of topological metals, with rich magnetic configurations that can be tuned by chemical substitution. Altogether, these ferromagnetic kagome compounds constitute a broad and still largely unexplored materials platform for the emergence of exciting magnetotransport phenomena.

Density functional calculations↗

DOE OSTI2024

The Toughness of Interlocking Metasurfaces

Interlocking metasurfaces (ILMs) are arrays of autogenous latching unit cells patterned across a surface. These create structural joints similar to bioinspired suture joints but patterned over a 2D surface rather than a 1D seam. This enables ILMs to be an alternative to conventional joining technologies such as bolts, welds, and adhesives. However, compared to conventional joining methods, relatively little is known of the engineering considerations for designing structural ILMs. Herein, the interfacial toughness of an archetypal ILM is examined for the first time. Under the conditions studied here, the ILM is substantially tougher than the material from which it is made, in this case, exhibiting up to a 50% increase in interfacial crack initiation energy over the solid base material, a photocured 3D‐printed polymer. Through experimental tests using in‐situ digital image correlation along with complementary computational analyses, the mechanism of toughening in the ILM structure and the origins of toughness anisotropy are revealed. The increase in toughness is associated with cross‐cell interactions, that is, load‐sharing across unit cells, which give rise to a finite process zone length with different effective material properties. In this way, ILM toughening is analogous to crack blunting in ductile materials or fiber bridging in composites; yet here, the ILM is composed of a single‐phase base material and so the architected toughening is geometric in nature and hence amenable to future topological optimization.

fracture↗

DOE OSTI2024

Scalable Tensor Methods for Nonuniform Hypergraphs

While multilinear algebra appears natural for studying the multiway interactions modeled by hypergraphs, tensor methods for general hypergraphs have been stymied by theoretical and practical barriers. A recently proposed adjacency tensor is applicable to nonuniform hypergraphs, but is prohibitively costly to form and analyze in practice. We develop tensor times same vector (TTSV) algorithms for this tensor which improve complexity from $O(n^r)$ to a low-degree polynomial in $r$, where $n$ is the number of vertices and $r$ is the maximum hyperedge size. Our algorithms are implicit, avoiding formation of the order $r$ adjacency tensor. Here, we demonstrate the flexibility and utility of our approach in practice by developing tensor-based hypergraph centrality and clustering algorithms. We also show these tensor measures offer complementary information to analogous graph-reduction approaches on data, and are also able to detect higher-order structure that many existing matrix-based approaches provably cannot.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Accelerating data acquisition with FPGA-based edge machine learning: a case study with LCLS-II

New scientific experiments and instruments generate vast amounts of data that need to be transferred for storage or further processing, often overwhelming traditional systems. Edge machine learning (EdgeML) addresses this challenge by integrating machine learning (ML) algorithms with edge computing, enabling real-time data processing directly at the point of data generation. EdgeML is particularly beneficial for environments where immediate decisions are required, or where bandwidth and storage are limited. In this paper, we demonstrate a high-speed configurable ML model in a fully customizable EdgeML system using a field programmable gate array (FPGA). Our demonstration focuses on an angular array of electron spectrometers, referred to as the ‘CookieBox,’ developed for the Linac Coherent Light Source II project. The EdgeML system captures 51.2 Gbps from a 6.4 GS s −1 analog to digital converter and is designed to integrate data pre-processing and ML inside an FPGA. Our implementation achieves an inference latency of 0.2 µs for the ML model, and a total latency of 0.4 µs for the complete EdgeML system, which includes pre-processing, data transmission, digitization, and ML inference. The modular design of the system allows it to be adapted for other instrumentation applications requiring low-latency data processing.

97 MATHEMATICS AND COMPUTING↗