SEARCH · Engineering Papers
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.
In March 2021, DOE’s Advanced Scientific Computing Research convened the Workshop on Reimagining Codesign. The workshop was organized around discussions on eight topic areas. From these, the workshop panelists identified four priority research directions, listed below.
Context: This webinar featured two presentations examining quantum computing and its complex implications across the energy, water, and materials sectors. Olivier Ezratty introduced quantum computing, its anticipated applications and added value, and the hardware required to support these systems. He also discussed their energy demands and the role of the Quantum Energy Initiative in developing an interdisciplinary research field focused on these challenges. David McCollum then explored the opportunities and multisectoral challenges associated with next-generation, quantum-accelerated data centers, including their potential energy and resource impacts and the infrastructure chokepoints that could emerge. Together, the presentations emphasized the need for long-term planning and cross-cutting research collaboration as quantum computing technologies continue to develop. Presenters: Olivier Ezratty (Quantum Energy Initiative); David McCollum (Oak Ridge National Laboratory) Moderator: Patrick M. Reed (MSD CoP Facilitation Team); Gokul Iyer (Pacific Northwest National Laboratory) This webinar was held on: July 9th, 2026 from 1:00–2:30 PM EDT.
Considerable attention has recently focused on the vast energy and water demands of supercomputing, namely large-scale data centers that underpin artificial intelligence (AI), one of the great disruptors of contemporary society. Looking ahead some years from now, quantum computing is poised to disrupt established computing paradigms once again. Scientists and engineers are now working intensely to bring this century-old dream of physicists to fruition. Yet, as quantum computers begin to be integrated with classical supercomputing architectures, the implications for energy and physical resource use also need to be understood, especially how they compare to today’s AI data centers. These impacts have not yet been quantified by the research community – a notable gap in the literature, even if commercial-scale deployment of Quantum-Accelerated Computing Infrastructure (QuACI) is not expected for a few more years. This study is the first to conduct such an assessment. Using publicly available information from academic sources and private industry, we characterize multiple configurations of superconducting qubit-based, fault-tolerant quantum computers (FTQC) that could plausibly be deployed at scale in the 2030s and into the 2040s. By parameterizing these FTQC systems at a process level, we conduct a prospective scenario analysis to quantify their energy and physical resource needs. While these estimates are uncertain, given the current state of quantum technologies and their unknown future trajectories, important insights can already be drawn. One key finding is that while the electricity needs for a fleet of FTQCs are within the bounds of previous modeling studies that have explored high electricity demand futures, the needs for certain physical resources, namely water and helium-3, could pose bottlenecks to QuACI scale-up.
Future quantum computers may serve as a tool to access non-perturbative real-time correlation functions. In this talk, we discuss the prospects of using these to study Compton scattering for arbitrary kinematics. The restriction to a finite-volume spacetime, unavoidable in foreseeable quantum-computer simulations, must be taken into account in the formalism for extracting scattering observables. One approach is to work with a non-zero iϵ-prescription in the Fourier transform to definite momentum and then to estimate an ordered double limit, in which the spacetime volume is sent to infinity before ϵ is sent to 0. For the amplitudes and parameters considered here, we find that significant volume effects arise, making the required limit very challenging. We present a practical solution to this challenge that may allow for future determinations of deeply virtual Compton scattering amplitudes, as well as many other reactions that are presently outside the scope of standard lattice QCD calculations.
Abstract Ferroelectric materials are characterized by the spontaneous polarization switchable by the applied fields, which can act as a “gate” to control various properties of ferroelectric/insulator interfaces. Here we review the recent studies on the modulation of oxide hetero-/homo-interfaces by ferroelectric polarization. We discuss the potential applications of recently developed four-dimensional scanning transmission electron microscopy and how it can provide insights into the fundamental understanding of ferroelectric polarization-induced phenomena and stimulate future computational studies. Finally, we give the outlook for the potentials, the challenges, and the opportunities for the contribution of materials computation to future progress in the area.
Abstract not provided.
We report that in the near-future noisy intermediate-scale quantum (NISQ) era of quantum computing technology, applications of quantum computing will be limited to calculations of very modest scales in terms of the number of qubits used. The need to represent numeric quantities using limited resources leads to digitization errors which must be taken into account. As a first step towards quantum simulations of realistic high-energy physics problems, we explore classically the effects of digitizing elements of the $\mathrm{SU}(2)$ gauge group to a finite set. We consider several methods for digitizing the group, finding the best performance from an action-preserving projection onto a mesh. Working in (3+1) dimensions, we find that using $\sim 7$ (qu)bits to represent each $\mathrm{SU}(2)$ gauge link induces a digitization error on the order of $10\%$ in short-distance observables and $2\%$ in long-distance observables. Promisingly, our results indicate that each $\mathrm{SU}(2)$ gauge link can be represented by $\mathcal{O}(10)$ (qu)bits, from which we estimate that a $16^3$ $\mathrm{SU}(2)$ lattice could be simulated with no more than $\mathcal{O}(10^5)$ (qu)bits. Lastly, our results on digitization are also of interest as a form of lossy compression that could be used in high-performance classical computing to alleviate communications bottlenecks.
Performance tests and analyses are critical to effective high-performance computing software development and are central components in the design and implementation of computational algorithms for achieving faster simulations on existing and future computing architectures for large-scale application problems. In this article, we explore performance and space-time trade-offs for important compute-intensive kernels of large-scale numerical solvers for partial differential equations (PDEs) that govern a wide range of physical applications. We consider a sequence of PDE-motivated bake-off problems designed to establish best practices for efficient high-order simulations across a variety of codes and platforms. We measure peak performance (degrees of freedom per second) on a fixed number of nodes and identify effective code optimization strategies for each architecture. In addition to peak performance, we identify the minimum time to solution at 80% parallel efficiency. The performance analysis is based on spectral and p-type finite elements but is equally applicable to a broad spectrum of numerical PDE discretizations, including finite difference, finite volume, and h-type finite elements.
Quantum information processing is a critical part of the development of future computers, quantum computers, and quantum algorithms, where elementary particles such as photons and electrons can be applied in optomagnetic or optoelectronic devices. The computational physics behind these emerging approaches is also experiencing dramatic developments. In this paper I report on the most recent mathematical basics for quantum algorithms and quantum computing approaches. Some of these described approaches show intriguing methods for determining the states and wavefunction properties for anyons, bosons, and fermions in quantum wells that have been developed in the last years. The study also shows approaches based on N-quantum states and the reduced 1- and 2-fermion picture, which can be used for developing models for anyons and multi-fermionic states in quantum algorithms. Also, antisymmetry and generalized Pauli constraints have been given particular emphasis and include establishing a basis for pinning and quasipinning for exploring the symmetric states of many-fermionic subsets, as a foundation for quantum information processing, and are here briefly revisited. This study summarizes the developments in recent years of an advanced and important field for future computational techniques.
Quantum computing (QC) has gained significant attention over the past two decades due to its potential for speeding up classically demanding tasks. This transition from an academic focus to a thriving commercial sector is reflected in substantial global investments. While advancements in qubit counts and functionalities continue at a rapid pace, current quantum systems still lack the scalability for practical applications, facing challenges such as too high error rates and limited coherence times. Here, this perspective paper examines the relationship between QC and high-performance computing (HPC), highlighting their complementary roles in enhancing computational efficiency. It is widely acknowledged that even fully error-corrected QC will not be suited for all computational tasks. Rather, future compute infrastructures are anticipated to employ quantum acceleration within hybrid systems that integrate HPC and QC. While QC can enhance classical computing, traditional HPC remains essential for maximizing quantum acceleration. This integration is a priority for supercomputing centers and companies, sparking innovation to address the challenges of merging these technologies. The novelty of this work lies in its unique perspective, reflecting the collective insights of the Accelerated Data Analytics and Computing (ADAC) Institute, a global consortium of over 20 leading HPC centers. Recognizing the growing importance of QC, ADAC established a Quantum Computing Working Group in 2023 to foster collaboration and knowledge-sharing among its members. This paper synthesizes insights from the group’s collaborative efforts and incorporates findings from a member survey that captures shared experiences, ongoing projects, and strategic directions. By outlining the current landscape and challenges of QC integration into HPC ecosystems, this work offers HPC specialists practical and forward-looking guidance on the opportunities and implications of QC in computationally intensive endeavors.
Superconducting digital computing (SDC) based on Josephson junctions (JJs) offers significant potential for enhancing compute throughput and reducing energy consumption compared to conventional room-temperature CMOS-based approaches. Current superconducting logic families exhibit diverse characteristics in clocking strategies, power management, and information encoding techniques. This paper reviews recent advancements in unconventional computing methods specifically designed for superconducting digital circuits, emphasizing temporal computing and pulse-train representations. Notable techniques include race logic (RL), temporal pulse train computing (U-SFQ), and temporal multipliers, each offering unique performance and area advantages suited to superconducting implementations. Additionally, this paper reviews innovations in superconducting coarse-grain reconfigurable architectures (CGRA), superconducting-specific on-chip communication architectures, cryogenic sensor interfaces, and quantum computing control electronics. Finally, we highlight research challenges that should be addressed to facilitate the widespread adoption of superconducting digital computing.
Here we provide an overview of the past, present, and a diverse collection of future computer architecture alternatives for HPC. The end of Moore’s Law influenced the current HPC architecture focus on accelerated compute nodes composed of CPU and GPU computing components integrated into massively parallel processor architecture systems. There are many alternatives for future HPC directions, with different technologies, computing ecosystems, opportunities for lead user application-driven customization, and the role of open innovation business models. This paper provides an overview of these different new horizons for HPC, an organizing principle to focus future computing research, different public-private partnership models, and the critical role of workforce development.
Moore’s Law is a techno-economic model that has enabled the information technology industry to double the performance and functionality of digital electronics roughly every 2 years within a fixed cost, power and area. Advances in silicon lithography have enabled this exponential miniaturization of electronics, but, as transistors reach atomic scale and fabrication costs continue to rise, the classical technological driver that has underpinned Moore’s Law for 50 years is failing and is anticipated to flatten by 2025. Here, this article provides an updated view of what a post-exascale system will look like and the challenges ahead, based on our most recent understanding of technology roadmaps. It also discusses the tapering of historical improvements, and how it affects options available to continue scaling of successors to the first exascale machine. Lastly, this article covers the many different opportunities and strategies available to continue computing performance improvements in the absence of historical technology drivers. This article is part of a discussion meeting issue ‘Numerical algorithms for high-performance computational science’.
Conclusions: Emerging computational hardware may fundamentally change optimization algorithm development; Ising Coprocessors are like ALUs or GPUs for optimization!; Based on initial benchmarking efforts D-Wave hardware is not outperforming state-of-the-art alternatives, but seems competitive
Neuromorphic computing is known for its integration of algorithms and hardware elements that are inspired by the brain. Conventionally, this nontraditional method of computing is used for many neural or learning inspired applications. Unfortunately, this has resulted in the field of neuromorphic computing being relatively narrow in scope. In this paper we discuss two research areas actively trying to widen the impact of neuromorphic systems. The first is Fugu, a high-level programming interface designed to bridge the gap between general computer scientists and those who specialize in neuromorphic areas. The second aims to map classical scientific computing problems onto these frameworks through the example of random walks. This elucidates a class of scientific applications that are conducive to neuromorphic algorithms.
The exponential growth in computing demands driven by scientific computing, data analytics, and artificial intelligence is pushing conventional CMOS-based high-performance computing systems to their physical and energy efficiency limits. As we approach the era of post-exascale computing, disruptive approaches are necessary to overcome these barriers and achieve substantial gains in energy efficiency. Analog and hybrid digital-analog computing systems have emerged as promising alternatives, offering the potential for orders-of-magnitude improvements in efficiency. Among these, biochemical computing stands out as a novel paradigm capable of leveraging the natural efficiency of chemical reactions, which have shown promise in solving optimization problems by converging to steady states. By scaling up reaction networks or reaction vessel sizes, biochemical systems present an opportunity to meet the high-performance demands of modern computing tasks. Despite their promise, significant theoretical and practical challenges remain, particularly in formulating and mapping computational problems to chemical reaction networks (CRNs) and designing viable biochemical computing devices. This paper addresses these challenges by introducing new ideas to ChemComp, a compilation and emulation framework for chemical computation. This work describes the mechanisms through which solutions to ordinary differential equations (ODEs) that can be represented as CRN systems can be achieved. Furthermore, we explain the design principles of an ODE dialect implemented as a multi-level intermediate representation (MLIR) compiler extension that will be coupled with existing infrastructure. We demonstrate the potential of our framework through a case study emulating a simplified chemical reservoir computing device. This work establishes foundational tools and methodologies necessary to harness the computational power of chemistry, paving the way for the development of energy-efficient, high-performance computing systems tailored to contemporary and future computational needs.
Neuromorphic computing is a non-von Neumann computing paradigm that performs computation by emulating the human brain. Neuromorphic systems are extremely energy-efficient and known to consume thousands of times less power than CPUs and GPUs. They have the potential to drive critical use cases such as autonomous vehicles, edge computing and internet of things in the future. For this reason, they are sought to be an indispensable part of the future computing landscape. Neuromorphic systems are mainly used for spike-based machine learning applications, although there are some non-machine learning applications in graph theory, differential equations, and spike-based simulations. These applications suggest that neuromorphic computing might be capable of general-purpose computing. However, general-purpose computability of neuromorphic computing has not been established yet. In this work, we prove that neuromorphic computing is Turing-complete and therefore capable of general-purpose computing. Specifically, we present a model of neuromorphic computing, with just two neuron parameters (threshold and leak), and two synaptic parameters (weight and delay). We devise neuromorphic circuits for computing all the μ-recursive functions (i.e., constant, successor and projection functions) and all the μ-recursive operators (i.e., composition, primitive recursion and minimization operators). Given that the μ-recursive functions and operators are precisely the ones that can be computed using a Turing machine, this work establishes the Turing-completeness of neuromorphic computing.