Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computers”

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.

At least 595 records · Page 33
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Quantum embedding theories to simulate condensed systems on quantum computers.

Quantum computers hold promise to improve the efficiency of quantum simulations of materials and to enable the investigation of systems and properties that are more complex than tractable at present on classical architectures. Here, we discuss computational frameworks to carry out electronic structure calculations of solids on noisy intermediate-scale quantum computers using embedding theories, and we give examples for a specific class of materials, that is, solid materials hosting spin defects. These are promising systems to build future quantum technologies, such as quantum computers, quantum sensors and quantum communication devices. Although quantum simulations on quantum architectures are in their infancy, promising results for realistic systems appear to be within reach.

Vorwerk, Christian↗
DOE OSTI2024

Operational Analytics Studies for ATLAS Distributed Computing: Data Popularity Forecast and Utilization of the WLCG Centers

Operational analytics is the direction of research related to the analysis of the current state of computing processes and the prediction of future states in order to anticipate imbalances and take timely measures to stabilize a complex system. There are two relevant areas in ATLAS Distributed Computing that are currently the focus of studies: user physics analysis including the forecast of popularity of data samples among users, and evaluating WLCG centers for their readiness to process user analysis payloads. Studying these areas is challenging due to the complexity involved, as it requires a comprehensive understanding of numerous boundary conditions typically found in large-scale distributed computing infrastructures. Forecasts of data popularity are problematic without the categorization of user tasks by their types (data transformation or physics analysis), which do not always appear on the surface but may induce noise, which introduces significant distortions for predictive analysis. Evaluating the WLCG resources by their analysis workloads is also a challenging task as it is necessary to find a balance between the workload of the resource, its performance, the waiting time for jobs on it, as well as the volume of jobs that it processes. This is especially difficult in a heterogeneous computing environment, where legacy resources are used along with modern high-performance machines. We will look at these areas of research in detail and discuss what tools and methods are used in our work, demonstrating results already obtained.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Towards an Introspective Dynamic Model of Globally Distributed Computing Infrastructures

Large-scale scientific collaborations like ATLAS, Belle II, CMS, DUNE, and others involve hundreds of research institutes and thousands of researchers spread across the globe. These experiments generate petabytes of data, with volumes soon expected to reach exabytes. Consequently, there is a growing need for computation, including structured data processing from raw data to consumer-ready derived data, extensive Monte Carlo simulation campaigns, and a wide range of end-user analysis. To manage these computational and storage demands, centralized workflow and data management systems are implemented. However, decisions regarding data placement and payload allocation are often made disjointly and via heuristic means. A significant obstacle in adopting more effective heuristic or AI-driven solutions is the absence of a quick and reliable introspective dynamic model to evaluate and refine alternative approaches. In this study, we aim to develop such an interactive system using real-world data. By examining job execution records from the PanDA workflow management system, we have pinpointed key performance indicators such as queuing time, error rate, and the extent of remote data access. The dataset includes five months of activity. Additionally, we are creating a generative AI model to simulate time series of payloads, which incorporate visible features like category, event count, and submitting group, as well as hidden features like the total computational load—derived from existing PanDA records and computing site capabilities. These hidden features, which are not visible to job allocators, whether heuristic or AI-driven, influence factors such as queuing times and data movement.

kilic, Ozgur Ozan [Brookhaven National Laboratory ↗
DOE OSTI2025

Optimization of distributed compute resources utilization in the CMS Global Pool

The CMS Submission Infrastructure is the primary system for managing computing resources for CMS workflows, including data processing, simulation, and analysis. It integrates geographically distributed resources from Grid, HPC, and cloud providers into federated pools managed by HTCondor and Glidein- WMS, for a total of around 500k CPU cores. This system dynamically manages workloads based on priorities defined by the collaboration. Additionally, CMS scheduling strategies must be flexible to handle multiple concurrent workloads while considering changing processing demands and resource availability from various providers.Efficient utilization of vast amounts of distributed compute resources is a key element for the success of the scientific programs of the LHC experiments. Optimizing the system is essential to maximize resource efficiency and fully utilize the distributed computing power. The CMS Submission Infrastructure team thus systematically investigates sources of inefficiency in workload scheduling to reduce their impact. In addition, a strategy of pilot overloading has been introduced to compensate for other inefficiency sources, thereby optimizing resource utilization and enhancing computational throughput.

Mascheroni, Marco [UC, San Diego (main)]↗
DOE OSTI2022

Computational study of runaway electrons in MST tokamak discharges with applied resonant magnetic perturbation

A numerical study of magnetohydrodynamics (MHD) and tracer-particle evolution investigates the effects of resonant magnetic perturbations (RMPs) on the confinement of runaway electrons (REs) in tokamak discharges conducted in the Madison Symmetric Torus. In computational results of applying RMPs having a broad toroidal spectrum but a single poloidal harmonic, m = 1 RMP does not suppress REs, whereas m = 3 RMP achieves significant deconfinement but not the complete suppression obtained in the experiment. MHD simulations with the NIMROD code produce sawtooth oscillations, and the associated magnetic reconnection can affect the trajectory of REs starting in the core region. Simulations with m = 3 RMP produce chaotic magnetic topology over the outer region, but the m = 1 RMP produces negligible changes in field topology, relative to applying no RMP. Using snapshots of the MHD simulation fields, full-orbit relativistic electron test particle computations with KORC show ≈50% loss from the m = 3 RMP compared to the 10%–15% loss from the m = 1 RMP. Here, test particle computations of the m = 3 RMP in the time-evolving MHD simulation fields show correlation between MHD activity and late-time particle losses, but total electron confinement is similar to computations using magnetic-field snapshots.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Supervised learning and the finite-temperature string method for computing committor functions and reaction rates

A central object in the computational studies of rare events is the committor function. Though costly to compute, the committor function encodes complete mechanistic information of the processes involving rare events, including reaction rates and transition-state ensembles. Under the framework of transition path theory, Rotskoff et al. [Proceedings of the 2nd Mathematical and Scientific Machine Learning Conference, Proceedings of Machine Learning Research (PLMR, 2022), Vol. 145, pp. 757–780] proposes an algorithm where a feedback loop couples a neural network that models the committor function with importance sampling, mainly umbrella sampling, which collects data needed for adaptive training. Here, in this work, we show additional modifications are needed to improve the accuracy of the algorithm. The first modification adds elements of supervised learning, which allows the neural network to improve its prediction by fitting to sample-mean estimates of committor values obtained from short molecular dynamics trajectories. The second modification replaces the committor-based umbrella sampling with the finite-temperature string (FTS) method, which enables homogeneous sampling in regions where transition pathways are located. We test our modifications on low-dimensional systems with non-convex potential energy where reference solutions can be found via analytical or finite element methods, and show how combining supervised learning and the FTS method yields accurate computation of committor functions and reaction rates. We also provide an error analysis for algorithms that use the FTS method, using which reaction rates can be accurately estimated during training with a small number of samples. The methods are then applied to a molecular system in which no reference solution is known, where accurate computations of committor functions and reaction rates can still be obtained.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Quantum computing for fusion energy science applications

This is a review of recent research exploring and extending present-day quantum computing capabilities for fusion energy science applications. We begin with a brief tutorial on both ideal and open quantum dynamics, universal quantum computation, and quantum algorithms. Then, we explore the topic of using quantum computers to simulate both linear and nonlinear dynamics in greater detail. Because quantum computers can only efficiently perform linear operations on the quantum state, it is challenging to perform nonlinear operations that are generically required to describe the nonlinear differential equations of interest. In this work, we extend previous results on embedding nonlinear systems within linear systems by explicitly deriving the connection between the Koopman evolution operator, the Perron–Frobenius evolution operator, and the Koopman–von Neumann evolution (KvN) operator. We also explicitly derive the connection between the Koopman and Carleman approaches to embedding. Extension of the KvN framework to the complex-analytic setting relevant to Carleman embedding, and the proof that different choices of complex analytic reproducing kernel Hilbert spaces depend on the choice of Hilbert space metric are covered in the appendixes. Finally, we conclude with a review of recent quantum hardware implementations of algorithms on present-day quantum hardware platforms that may one day be accelerated through Hamiltonian simulation. We discuss the simulation of toy models of wave–particle interactions through the simulation of quantum maps and of wave–wave interactions important in nonlinear plasma dynamics.

Joseph, I. (ORCID:0000000255400840)↗
DOE OSTI2024

Computational electron–phonon superconductivity: from theoretical physics to material science

The search for room-temperature superconductors is a major challenge in modern physics. The discovery of copper-oxide superconductors in 1986 brought hope but also revealed complex mechanisms that are difficult to analyze and compute. In contrast, the traditional electron–phonon coupling (EPC) mechanism facilitated the practical realization of superconductivity (SC) in metallic hydrogen. Since 2015, the discovery of new hydrogen compounds has shown that EPC can enable room-temperature SC under high pressures, driving extensive research. Advances in computational capabilities, especially exascale computing, now allow for the exploration of millions of materials. This paper reviews newly predicted superconducting systems in 2023–2024, focusing on hydrides, boron–carbon systems, and compounds with nitrogen, carbon, and pure metals. Although many computationally predicted high-T c superconductors were not experimentally confirmed, some low-temperature superconductors were successfully synthesized. This paper provides a review of these developments and future research directions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Metal Chalcogenides for Neuromorphic Computing: Emerging Materials and Mechanisms

The approaching end of Moore's Law scaling has significantly accelerated multiple fields of research including neuromorphic-, quantum-, and photonic computing, each of which possesses unique benefits unobtained through conventional binary computers. One of the most compelling arguments for neuromorphic computing systems is power consumption, noting that computations made in the human brain are approximately 106 times more efficient than conventional CMOS logic. This review article focuses on the materials science and physical mechanisms found in metal chalcogenides that are currently being explored for use in neuromorphic applications. We begin by reviewing the key biological signal generation and transduction mechanisms within neuronal components of mammalian brains and subsequently compare with observed experimental measurements in chalcogenides. With robustness and energy efficiency in mind, we will focus on short-range mechanisms such as structural phase changes and correlated electron systems that can be driven by low-energy stimuli, such as temperature or electric field. We aim to highlight fundamental materials research and existing gaps that need to be overcome to enable further integration or advancement of metal chalcogenides for neuromorphic systems.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Domain-specific compilers for dynamic simulations of quantum materials on quantum computers

Abstract Simulation of the dynamics of quantum materials is emerging as a promising scientific application for noisy intermediate-scale quantum (NISQ) computers. Due to their high gate-error rates and short decoherence times, however, NISQ computers can only produce high-fidelity results for those quantum circuits smaller than some given circuit size. Dynamic simulations, therefore, pose a challenge as current algorithms produce circuits that grow in size with each subsequent time-step of the simulation. This underscores the crucial role of quantum circuit compilers to produce executable quantum circuits of minimal size, thereby maximizing the range of physical phenomena that can be studied within the NISQ fidelity budget. Here, we present two domain-specific (DS) quantum circuit compilers for the Rigetti and IBM quantum computers, specifically designed to compile circuits simulating dynamics under a special class of time-dependent Hamiltonians. The compilers outperform state-of-the-art general-purpose compilers in terms of circuit size reduction by around 25%–30% as well as wall-clock compilation time by around 40% (dependent on system size and simulation time-step). Drawing on heuristic techniques commonly used in artificial intelligence, both compilers scale well with simulation time-step and system size. Code for both compilers is open-source and packaged into a full-stack quantum simulation software with tutorials included for ease of use for future researchers wishing to perform dynamic simulations of quantum materials on quantum computers. As our DS compilers provide significant improvements in both compilation time and simulation fidelity, they provide a building block for accelerating progress toward physical quantum supremacy.

Physics↗
DOE OSTI2025

LATTE: open-source, high-performance traveltime computation, tomography and source location in acoustic and elastic media

Traveltime-based tomography and source location are fundamental approaches for imaging subsurface structures and understanding the spatiotemporal distribution of seismicity from local to global scales. We present an open-source, high-performance framework integrating eikonal equation solvers and adjoint-state theory for traveltime computation, velocity tomography, source location and joint tomography-location in 2-D/3-D acoustic and elastic media. We introduce novel regularization schemes based on total generalized p-variation, structural similarity and multitask machine learning to enhance the fidelity and interpretability of inverted models and source locations. Key features of our implementation also include the ability to leverage both absolute-difference and double-difference traveltime misfits for high-fidelity velocity tomography and source parameter estimation; support for traveltime computation and inversion in diverse 2-D/3-D scenarios with arbitrary source and receiver distributions; and a perturbation-based optimal step-size estimation method to reduce computational costs. In addition, our implementation employs shared-memory and distributed-memory parallelization to provide an efficient solution for traveltime computation, tomography, and source location. In conclusion, we validate the efficacy and accuracy of our approach through multiple synthetic data examples.

58 GEOSCIENCES↗
DOE OSTI2022

Computational properties of finite PNmatrices

Abstract Recent compositionality results in logic have highlighted the advantages of enlarging the traditional notion of logical matrix semantics, namely by incorporating non-determinism and partiality. Still, several important properties which are known to be computable for finite logical matrices have not been studied in the wider context of partial non-deterministic matrices (PNmatrices). In this paper, we study how incorporating non-determinism and/or partiality in logical matrices impacts on the computational properties of some natural problems regarding their induced logics and concretely their sets of theorems. We show that, while for some of these problems there is no relevant computational impact, there are problems whose computational complexity increases and still other problems that simply become undecidable. In particular, we show that the problem of checking whether the logics characterized by two finite PNmatrices have the same set of theorems is not decidable. This undecidability result explores the connection between PNmatrices and term-DAG-automata, where the universality problem is known to be undecidable. This link also motivates a final contribution, in the form of a pumping-like lemma, which can be used, in some cases, to show that a given logic cannot be characterized by a finite PNmatrix.

Filipe, Pedro↗
DOE OSTI2021

Indra: a public computationally accessible suite of cosmological N -body simulations

ABSTRACT Indra is a suite of large-volume cosmological N-body simulations with the goal of providing excellent statistics of the large-scale features of the distribution of dark matter. Each of the 384 simulations is computed with the same cosmological parameters and different initial phases, with 10243 dark matter particles in a box of length 1 h−1 Gpc, 64 snapshots of particle data and halo catalogues, and 505 time-steps of the Fourier modes of the density field, amounting to almost a petabyte of data. All of the Indra data are immediately available for analysis via the SciServer science platform, which provides interactive and batch computing modes, personal data storage, and other hosted data sets such as the Millennium simulations and many astronomical surveys. We present the Indra simulations, describe the data products and how to access them, and measure ensemble averages, variances, and covariances of the matter power spectrum, the matter correlation function, and the halo mass function to demonstrate the types of computations that Indra enables. We hope that Indra will be both a resource for large-scale structure research and a demonstration of how to make very large data sets public and computationally accessible.

Falck, Bridget↗
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 OSTI2023

Towards Quantum Computing Phase Diagrams of Gauge Theories with Thermal Pure Quantum States

The phase diagram of strong interactions in nature at finite temperature and chemical potential remains largely theoretically unexplored due to inadequacy of Monte-Carlo–based computational techniques in overcoming a sign problem. Quantum computing offers a sign-problem-free approach, but evaluating thermal expectation values is generally resource intensive on quantum computers. To facilitate thermodynamic studies of gauge theories, we propose a generalization of the thermal-pure-quantum-state formulation of statistical mechanics applied to constrained gauge-theory dynamics, and numerically demonstrate that the phase diagram of a simple low-dimensional gauge theory is robustly determined using this approach, including mapping a chiral phase transition in the model at finite temperature and chemical potential. Quantum algorithms, resource requirements, and algorithmic and hardware error analysis are further discussed to motivate future implementations. Thermal pure quantum states, therefore, may present a suitable candidate for efficient thermal simulations of gauge theories in the era of quantum computing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Accuracy of DFT computed oxygen-vacancy formation energies and high-throughput search of solar thermochemical water-splitting compounds

The enthalpy change involved in metal oxide reduction is a key quantity in various processes related to energy conversion and storage, and is of particular interest for computational prediction. Often this prediction involves the simulation of a high temperature reduction process with a 0K methodology like density functional theory (DFT), and it is not infrequent for the high temperature and 0K stable crystal structures to differ. This introduces a conundrum with regards to the choice of crystal structure to utilize in the computation, with approaches in the literature varying and experimental validation remaining scarce. In this work we address both the crystal structure conundrum and the experimental validation, and then apply the insights we gain to guide a high-throughput search for new materials for solar thermochemical water-splitting applications. By computing the DFT+U oxygen vacancy formation energy (ΔE vf ) of a selection of ABO 3 compounds and comparing different crystal structures for each composition, we highlight the issues that arise when the structure utilized in the computation is dynamically unstable at 0K, namely the presence of an artificial lowering of ΔE vf , and the lack of convergence of ΔE vf with cell size. We solve these limitations by identifying and employing a suitable surrogate dynamically stable structure. We then validate the predictive power of our calculations against appositely generated experimental measurements of reduction enthalpy for a series of Hubbard U values, finding an accuracy ranging between 0.2-0.6 eV/O. In light of such conclusions, we revise and expand a previous a high-throughput DFT study on ABO 3 perovskite oxides. As a result, we provide a list of candidate STCH materials, highlight trends with redox-active cation and structural distortion, and identify Mn 4+ , Mn 3+ and Co 3+ as the most promising redox-active cations.

08 HYDROGEN↗
DOE OSTI2025

Computational Power of Random Quantum Circuits in Arbitrary Geometries

Empirical evidence for a gap between the computational powers of classical and quantum computers has been provided by experiments that sample the output distributions of two-dimensional quantum circuits. Many attempts to close this gap have utilized classical simulations based on tensor network techniques, and their limitations shed light on the improvements to quantum hardware required to frustrate classical simulability. In particular, quantum computers having in excess of approximately 50 qubits are primarily vulnerable to classical simulation due to restrictions on their gate fidelity and their connectivity, the latter determining how many gates are required (and, therefore, how much infidelity is suffered) in generating highly entangled states. Here, we describe recent hardware upgrades to Quantinuum’s H2 quantum computer, enabling it to operate on up to 56 qubits with arbitrary connectivity and 99.843(5)% two-qubit gate fidelity. We define a class of circuits with random geometries that become hard to classically simulate in very low depth and implement them utilizing the flexible connectivity of H2. A careful analysis demonstrating the fast saturation of classical simulation complexity with depth indicates that H2 can yield data well beyond the reach of state-of-the art classical simulation methods at unprecedented fidelities. We find that the considerable difficulty of classically simulating H2 is likely limited only by qubit number, demonstrating the promise and scalability of the quantum charge-coupled device architecture as continued progress is made toward building larger machines. Published by the American Physical Society 2025

DeCross, M.↗
DOE OSTI2025

Practical Introduction to Benchmarking and Characterization of Quantum Computers

Rapid progress in quantum technology has transformed quantum computing and quantum information science from theoretical possibilities into tangible engineering challenges. Breakthroughs in quantum algorithms, quantum simulations, and quantum error correction are bringing useful quantum computation closer to fruition. These remarkable achievements have been facilitated by advances in quantum characterization, verification, and validation (QCVV). QCVV methods and protocols enable scientists and engineers to scrutinize, understand, and enhance the performance of quantum information-processing devices. In this tutorial, we review the fundamental principles underpinning QCVV, and introduce a diverse array of QCVV tools used by quantum researchers. We define and explain QCVV’s core models and concepts—quantum states, measurements, and processes—and illustrate how these building blocks are leveraged to examine a target system or operation. We survey and introduce protocols ranging from simple qubit characterization to advanced benchmarking methods. Along the way, we provide illustrated examples and detailed descriptions of the protocols, highlight the advantages and disadvantages of each, and discuss their potential scalability to future large-scale quantum computers. This tutorial serves as a guidebook for researchers unfamiliar with the benchmarking and characterization of quantum computers, and also as a detailed reference for experienced practitioners.

open quantum systems & decoherence↗