Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer Operations and Hardware”

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 OSTI2020

Demand Response Optimization and Management System for Real-TIme (DROMS-RT)

To design and demonstrate DROMS-RT, a highly distributed Demand Response Optimization and Management System for Real-Time (DROMS-RT) power flow control to support large scale integration of distributed renewable generation into the grid. AutoGrid developed a novel control and communications platform to allow highly dispatchable demand response (DR) services in time frames suitable for providing ancillary services to the transmission grid. These services will be substantially less expensive and more efficient than other forms of ancillary services options currently available to manage the intermittency associated with large-scale renewable integration. DROMSRT successfully leveraged Automated Demand Response (ADR) by fundamentally re-thinking the architecture of the DR platform from the ground up and by developing innovative new technologies in a number of areas related to DR. DROMS-RT leveraged the low-cost, open, interoperable DR signaling technology, OpenADR, and low-cost, internet-protocol based telemetry solutions to reduce the cost of hardware. This allowed DROMS-RT to provide dynamic price signals to millions of OpenADR clients. Statistically rigorous signal processing techniques were developed to reliably detect even small load reductions in the presence of noisy baseline profiles. Novel forecasting engines based on modern online machine learning algorithms enabled accurate individualized forecasts for customer loads in the presence of dynamic pricing signals, and a real-time decision engines enabled continuous optimization and optimal dispatch of DR resources across a large portfolio of heterogeneous loads that respond at varying time-scales. Moreover, the real-time optimization conducted by the decision engine can utilize grid physics to maximize load reduction at the transmission system in addition to the distribution sites, for more efficient grid operation. Finally, the Software-as-a-Service (SaaS) availability of the DROMS-RT platform has reduced the cost of deployment and enable participation of small commercial and residential customers in DR who otherwise would not be able to do so.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

Mitigating Data Center Impact on Grid Stability: A Coordinated Control Strategy Using Verrus StabiliGrid Architecture

Large data centers, which now represent a significant and growing share of the total U.S. grid load, can inadvertently destabilize the electrical grid when they disconnect simultaneously during brief voltage disturbances. The July 10, 2024, Eastern Interconnection incident, in which a sub-100-millisecond transmission fault triggered the cascading loss of approximately 1,500 MW of data center load, illustrates this vulnerability. While commercial battery energy storage systems (BESS) deployed in data centers provide device-level fault ride-through per IEEE 1547, they lack coordination with facility protection logic and uninterruptible power supplies (UPS), limiting their effectiveness as grid-stabilizing assets. This report presents the Verrus StabiliGrid architecture, a coordinated control framework that integrates BESS, UPS, and point-of-interconnection (POI) protection settings to enable data centers to ride through both undervoltage and overvoltage grid contingencies without disconnecting. The four-step strategy encompasses: (1) high-resolution power quality monitoring to detect the grid state during events such as undervoltage, overvoltage, underfrequency, and overfrequency; (2) POI protection settings that allow for extended ride-through and grid-connected operation during grid contingencies; (3) grid state-driven autonomous dispatch of assets to improve grid resilience by reducing power draw during undervoltage or absorbing more power during overvoltage events; and (4) coordinated post-recovery dispatch of data center assets to restore firm load to pre-contingency levels. Validated through controller-hardware-in-the-loop (C-HIL) simulations at the National Laboratory of the Rockies, results show grid import restoration to pre-fault levels within 100 milliseconds of voltage recovery. This work advances the ability of data centers to transition from passive, disturbance-sensitive loads to active participants in grid stability, a capability increasingly required by emerging NERC and ERCOT regulatory frameworks.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Evaluating Variable-Impedance Magnetically-Insulated Transmission Lines as a Risk-Mitigation Measure for Next-Generation Pulsed Power

This project has produced the first detailed characterizations of power flow resulting from applying the “variable-impedance MITL” concept to real-life systems in Sandia’s pulsed power program (Z and next-generation pulsed power (NGPP)). We present simulation results and analyses for constant-impedance versions of both Z and NGPP and survey the operational viability of several variable-impedance re-designs in the parameter space of linear tapers. Circuit modeling (SCREAMER/Bertha) was used to pinpoint promising candidate designs, and EM-PIC (Empire) simulations were used to evaluate these candidates more rigorously. This approach was particularly successful in the Z regime which resulted in the identification of several viable variable-impedance MITL designs for each level. The approach was more challenged in the operating space NGPP occupies, producing data points that speak to a more restrictive design space due to anode plasma turn-on. In the end, we were able to converge on one viable variable-impedance design for the highest inductance line (level “F”) and one for the highest current line (level “A”). Altogether, the body of simulation evidence presented in this report suggest there does exist flexibility in operating space for magnetically-insulated transmission lines (MITLs) having variable geometric impedance to be a potential enabling technology for safely increasing current delivery (and potentially lowering stack voltage) in pulsed-power drivers by manipulating electron losses; however, operating points for a particular design must be carefully screened. Circuit and EM-PIC modeling provided consistent verdicts in safe operating regimes for operational viability, but additional physics such as anode plasma turn-on which is included in Empire but not in SCREAMER/Bertha was found to be a critical factor affecting power flow that lead to different assessments between the codes. It is not always the case that the occurrence of anode plasma caused a design to fail (some designs turned on anode plasma yet still delivered load currents meeting design targets); the details matter such as how early in the pulse anode surfaces break down (and how large a region). However, in every case that it did fail it was found that the feedback from anode plasma was the cause (i.e., turning off the anode plasma model in Empire restored agreement with the circuit model prediction). As circuit simulations represent an efficient and practical means of surveying design space compared to more computationally-expensive approaches such as EM-PIC, it could be prudent to invest in the research and development of models to include the effects of anode plasma such as ion emission in circuit codes. The variable-impedance MITL design is a new concept that enables controlled manipulation of the initial electron losses in the outer MITL and can be tested on Z today. We encourage follow-on work to explore further optimization (including alternative variable-impedance profiles, e.g., having constant dZ/dR), and to confirm the major findings presented in this report by fielding test hardware on actual Z shots.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

EV SALaD 2023 Demonstration: Best Practices and Mitigations for Protecting EVSE Infrastructure

The Electric Vehicle Secure Architecture Laboratory Demonstration (EV SALaD) program is a demonstration of cybersecurity best practices for high-power electric vehicle (EV) charging infrastructure led by Idaho National Laboratory (INL), in collaboration with other DOE National Laboratories participating in the EVs at Scale Consortium.a Sandia National Laboratories (SNL) and Pacific Northwest National Laboratory (PNNL) participated in the first 2-year (FY22-23) demonstration cycle for EV SALaD. This report documents the FY23 demonstration, the second in a series of demonstrations and collaborations in deploying and operating cybersecure EV charging infrastructure. It includes a summary of improvements from the FY22 demonstration, technical analysis of the FY23 demonstration, how the research demonstrates cyber-physical and cybersecurity best practices for high-power EV charging infrastructure, and related impacts to national and energy security. For EV SALaD, the FY22 demonstration focused on the detection, ranking, and prioritization of anomalous events for high-power EV charging. The FY23 demonstration additionally included the demonstration of cybersecurity best practices, which included protection and mitigation solutions to prevent, respond, and recover from anomalous events. During the demonstrations, the multi-lab EV SALaD team conducted a Test Effect Payload (TEP)b evaluation on extreme fast charger (XFC) hardware equipped with Cerberus, a detection and response solution, to demonstrate anomaly detection and mitigation cybersecurity best practices against cyber-enabled events.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2021

Search for efficient formulations for Hamiltonian simulation of non-Abelian lattice gauge theories

Hamiltonian formulation of lattice gauge theories (LGTs) is the most natural framework for the purpose of quantum simulation, an area of research that is growing with advances in quantum-computing algorithms and hardware. It, therefore, remains an important task to identify the most accurate, while computationally economic, Hamiltonian formulation(s) in such theories, considering the necessary truncation imposed on the Hilbert space of gauge bosons with any finite computing resources. This paper is a first step toward addressing this question in the case of non-Abelian LGTs, which further require the imposition of non-Abelian Gauss’s laws on the Hilbert space, introducing additional computational complexity. Focusing on the case of SU(2) LGT in 1+1 dimensions coupled to one flavor of fermionic matter, a number of different formulations of the original Kogut-Susskind framework are analyzed with regard to the dependence of the dimension of the physical Hilbert space on boundary conditions, system’s size, and the cutoff on the excitations of gauge bosons. The impact of such dependencies on the accuracy of the spectrum and dynamics obtained from a Hamiltonian computation is examined, and the (classical) computational-resource requirements given these considerations are studied. Besides the well-known angular-momentum formulation of the theory, the cases of purely fermionic and purely bosonic formulations (with open boundary conditions), and the Loop-String-Hadron formulation are analyzed, along with a brief discussion of a Quantum-Link-Model formulation of the same theory. Clear advantages are found in working with the Loop-String-Hadron framework which implements non-Abelian Gauss’s laws a priori using a complete set of gauge-invariant operators. Although small lattices are studied in the numerical analysis of this work, and only the simplest algorithms are considered, a range of conclusions will be applicable to larger systems and potentially to higher dimensions. Future studies will extend this investigation to the analysis of resource requirements for quantum simulations of non-Abelian LGT, with the goal of shedding light on the most efficient Hamiltonian formulation of gauge theories of relevance in nature

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Are Lock-Free Concurrent Algorithms Practically Wait-Free?

Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers prefer to treat concurrent code as if it were wait-free, guaranteeing that all operations always make progress. Unfortunately, designing wait-free algorithms is generally a very complex task, and the resulting algorithms are not always efficient. Although obtaining efficient wait-free algorithms has been a long-time goal for the theory community, most nonblocking commercial code is only lock-free. This article suggests a simple solution to this problem. We show that for a large class of lock-free algorithms, under scheduling conditions that approximate those found in commercial hardware architectures, lock-free algorithms behave as if they are wait-free. In other words, programmers can continue to design simple lock-free algorithms instead of complex wait-free ones, and in practice, they will get wait-free progress. Our main contribution is a new way of analyzing a general class of lock-free algorithms under a stochastic scheduler. Our analysis relates the individual performance of processes to the global performance of the system using Markov chain lifting between a complex per-process chain and a simpler system progress chain. We show that lock-free algorithms are not only wait-free with probability 1 but that in fact a general subset of lock-free algorithms can be closely bounded in terms of the average number of steps required until an operation completes. Here, to the best of our knowledge, this is the first attempt to analyze progress conditions, typically stated in relation to a worst-case adversary, in a stochastic model capturing their expected asymptotic behavior.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Dynamic, symmetry-preserving, and hardware-adaptable circuits for quantum computing many-body states and correlators of the Anderson impurity model

We present a hardware-reconfigurable ansatz on N q -qubits for the variational preparation of many-body states of the Anderson impurity model (AIM) with N imp + N bath = N q /2 sites, which conserves total charge and spin z component within each variational search subspace. The many-body ground state of the AIM is determined as the minimum over all minima of O(N$^2_ q$) distinct charge-spin sectors. Hamiltonian expectation values are shown to require ω(N q ) < N meas. $\leqslant$ O(N imp N bath ) symmetry-preserving, parallelizable measurement circuits, each amenable to postselection. To obtain the one-particle impurity Green’s function we show how initial Krylov vectors can be computed via midcircuit measurement and how Lanczos iterations can be computed using the symmetry-preserving ansatz. For a single-impurity Anderson model with a number of bath sites increasing from one to seven, we show using numerical emulation that the ease of variational ground-state preparation is suggestive of linear scaling in circuit depth and subquartic scaling in optimizer complexity. We therefore expect that, combined with time-dependent methods for Green’s function computation, our ansatz provides a useful tool to account for electronic correlations on early fault-tolerant processors. Finally, with a view towards computing real materials properties of interest like magnetic susceptibilities and electron-hole propagators, we provide a straightforward method to compute many-body, time-dependent correlation functions using a combination of time evolution, midcircuit measurement-conditioned operations, and the Hadamard test.

36 MATERIALS SCIENCE↗
DOE OSTI2022

A Review of Technologies that can Provide a 'Root of Trust' for Operational Technologies

The supply chain attack pathway is being increasingly used by adversaries to bypass security controls and gain unauthorized access to sensitive networks and equipment (e.g., Critical Digital Assets). Cyber-attacks targeting supply chain generally aim to compromise the environments, products, or services of vendors and suppliers to inject, add, or substitute authentic software and hardware with malicious elements. These malicious elements are deemed to be authentic as they arise from the vendor or supplier (i.e., the supply chain). This research aims at providing a survey of technologies that have the potential to reduce exposure of sensitive networks and equipment to these attacks, thereby improving tamper resistance. The recent advances in the performance and capabilities of these technologies in recent years has increased their potential applications to reduce or mitigate exposure of the supply chain attack pathway. The focus being on providing an analysis of the benefits and disadvantages of smart cards, secure tokens, and elements to provide root of trust. This analysis provides evidence that these roots of trust can increase the technical capability of equipment and networks to authenticate changes to software and configuration thereby increasing resilience to some supply chain attacks, such as those related to logistics and ICT channels, but not development environment attacks.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2022

EdgeAI: Machine learning via direct attached accelerator for streaming data processing at high shot rate x-ray free-electron lasers

We present a case for low batch-size inference with the potential for adaptive training of a lean encoder model. We do so in the context of a paradigmatic example of machine learning as applied in data acquisition at high data velocity scientific user facilities such as the Linac Coherent Light Source-II x-ray Free-Electron Laser. We discuss how a low-latency inference model operating at the data acquisition edge can capitalize on the naturally stochastic nature of such sources. We simulate the method of attosecond angular streaking to produce representative results whereby simulated input data reproduce high-resolution ground truth probability distributions. By minimizing the mean-squared error between the decoded output of the latent representation and the ground truth distributions, we ensure that the encoding layers and resulting latent representation maintains full fidelity for any downstream task, be it classification or regression. We present throughput results for data-parallel inference of various batch sizes, some with throughput exceeding 100 k images per second. We also show in situ training below 10 s per epoch for the full encoder–decoder model as would be relevant for streaming and adaptive real-time data production at our nation’s scientific light sources.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Embedded Hardware Solution for Cybersecurity in Industrial Control Systems

Industrial Control Systems are the backbone of manufacturing, power, and critical infrastructure. These systems are made up of electronic and mechanical devices that operate on complex feedback systems that allow the production of consumer products, electricity, clean water, and nuclear industries. This broad reach of cybersecurity has earned it a place in the strategic roadmaps for many government agencies, including the Department of Energy. Their efforts stem from two general initiatives which are to improve cybersecurity in the energy sector and to strengthen effectiveness of Department of Energy incident management capabilities. Particular emphasis is in improving learning and preservations of knowledge at the labs, and to encourage collaboration between the labs. This project aims to develop Savannah River National Laboratory’s knowledge of industrial control systems cybersecurity by providing our engineers the opportunity to learn and execute advanced concepts in cybersecurity to real problems in industrial control systems. Successful execution of this project will enhance Savannah River National Laboratory’s knowledge and capability in the realm of Industrial Control System and Operational Technology cybersecurity as well as advance understanding of defensive needs in these environments. This will directly impact Savannah River National Laboratory’s capability to contribute and collaborate with Department of Energy, other Labs, and commercial partners in meeting Department of Energy national industrial control systems/Operations Technology cybersecurity goals.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Performance of the CMS high-level trigger during LHC Run 2

The CERN LHC provided proton and heavy ion collisions during its Run 2 operation period from 2015 to 2018. Proton-proton collisions reached a peak instantaneous luminosity of 2.1 $\times$ 10$^{34}$ cm$^{-2}$s$^{-1}$, twice the initial design value, at $\sqrt{s}$ = 13 TeV. The CMS experiment records a subset of the collisions for further processing as part of its online selection of data for physics analyses, using a two-level trigger system: the Level-1 trigger, implemented in custom-designed electronics, and the high-level trigger, a streamlined version of the offline reconstruction software running on a large computer farm. This paper presents the performance of the CMS high-level trigger system during LHC Run 2 for physics objects, such as leptons, jets, and missing transverse momentum, which meet the broad needs of the CMS physics program and the challenge of the evolving LHC and detector conditions. Sophisticated algorithms that were originally used in offline reconstruction were deployed online. Highlights include a machine-learning b tagging algorithm and a reconstruction algorithm for tau leptons that decay hadronically.

high energy physics↗
DOE OSTI2025

Preliminary Plan to Inform Testing of a Heat Exchanger Test Article

This report presents a preliminary plan to guide the qualification testing of advanced heat exchanger (HX) components for nuclear-to-industrial heat transfer applications. The objective is to establish a defensible, physics-based methodology that integrates computational modeling, targeted experimentation, and in-service inspection considerations to demonstrate component performance and reliability under representative reactor conditions. The analysis identifies Sodium-cooled Fast Reactor (SFR) and High-Temperature Gas-cooled Reactor (HTGR) systems as reference configurations in terms of temperature, pressure, and chemical environment. Within these operating envelopes, dominant degradation mechanisms— including creep–fatigue interaction, flow-induced vibration, corrosion, and diffusion-bond deterioration—were evaluated to define test requirements. A comprehensive computationalexperimental framework is proposed to support life prediction and qualification activities. The framework couples high-fidelity structural-mechanics, thermal-hydraulic, and fluid-structure interaction models with accelerated degradation testing to produce a traceable linkage between microstructural evolution, mechanical performance, and remaining useful life (RUL). The approach adheres to established Verification, Validation, and Uncertainty Quantification (VVUQ) standards (ASME V&V 10/20; NUREG-2152) and incorporates a digital-twin architecture for continuous model refinement through data assimilation. The plan further outlines testing methodologies, including pre-test analyses, test-loop design parameters, and sensor placement strategies that maximize information yield while maintaining mechanistic fidelity. Complementary sections describe in-service inspection (ISI), on-line monitoring (OLM), and structural-health-monitoring (SHM) techniques applicable to compact HX geometries typical of advanced reactors. Collectively, these activities establish the technical foundation for demonstrating 40-60-year equivalent service life of advanced heat exchangers in support of the U.S. Department of Energy’s Advanced Reactor and Integrated Energy Systems programs. The forthcoming phase will execute the defined pre-test analyses, initiate hardware fabrication, and implement the integrated testing campaign to validate the proposed qualification methodology.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2025

Exact block encoding of imaginary time evolution with universal quantum neural networks

We develop a constructive approach to generate quantum neural networks capable of representing the exact thermal states of all many-body qubit Hamiltonians. The Trotter expansion of the imaginary time propagator is implemented through an exact block encoding by means of a unitary, restricted Boltzmann machine architecture. Marginalization over the hidden-layer neurons (auxiliary qubits) creates the nonunitary action on the visible layer. Then, we introduce a unitary deep Boltzmann machine architecture in which the hidden-layer qubits are allowed to couple laterally to other hidden qubits. We prove that this wave-function is closed under the action of the imaginary time propagator and, more generally, can represent the action of a universal set of quantum gate operations. We provide analytic expressions for the coefficients for both architectures, thus enabling exact network representations of thermal states without stochastic optimization of the network parameters. In the limit of large imaginary time, the yields the ground state of the system. The number of qubits grows linearly with the number of interactions and total imaginary time for a fixed interaction order. Both networks can be readily implemented on quantum hardware via midcircuit measurements of auxiliary qubits. If only one auxiliary qubit is measured and reset, the circuit depth scales linearly with imaginary time and number of interactions, while the width is constant. Alternatively, one can employ a number of auxiliary qubits linearly proportional to the number of interactions, and circuit depth grows linearly with imaginary time only. Every midcircuit measurement has a postselection success probability, and the overall success probability is equal to the product of the probabilities of the midcircuit measurements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Promise of Graph Sparsification and Decomposition for Noise Reduction in QAOA: Analysis for Trapped-Ion Compilations

We develop new approximate compilation schemes that significantly reduce the expense of compiling the Quantum Approximate Optimization Algorithm (QAOA) for solving the Max-Cut problem. Our main focus is on compilation with trapped-ion simulators using Pauli-X operations and all-to-all Ising Hamiltonian HIsing evolution generated by Molmer-Sorensen or optical dipole force interactions, though some of our results also apply to standard gate-based compilations. Our results are based on principles of graph sparsification and decomposition; the former reduces the number of edges in a graph while maintaining its cut structure, while the latter breaks a weighted graph into a small number of unweighted graphs. Though these techniques have been used as heuristics in various hybrid quantum algorithms, there have been no guarantees on their performance, to the best of our knowledge. This work provides the first provable guarantees using sparsification and decomposition to improve quantum noise resilience and reduce quantum circuit complexity. For quantum hardware that uses edge-by-edge QAOA compilations, sparsification leads to a direct reduction in circuit complexity. For trapped-ion quantum simulators implementing all-to-all HIsing pulses, we show that for a (1−ϵ) factor loss in the Max-Cut approximation (ϵ>0), our compilations improve the (worst-case) number of HIsing pulses from O(n2) to O(nlog(n/ϵ)) and the (worst-case) number of Pauli-X bit flips from O(n2) to O(nlog(n/ϵ)ϵ2) for n-node graphs. This is an asymptotic improvement for any constant ϵ>0. We demonstrate that significant improvements to the approximation ratio are obtained using decomposition in simulated trapped-ion experiments with dephasing noise. We further present a generic argument showing that sparsification results in an exponentially improved circuit fidelity lower bound in digital computing schemes based on one- and two-qubit gates, which are relevant to a wide variety of hardwares such as superconducting qubits and certain neutral atom or trapped ion setups, and more sophisticated noise models. We anticipate these approximate compilation techniques will be useful tools in a variety of future quantum computing experiments.

Moondra, Jai [Georgia Institute of Technology]↗
DOE OSTI2023

Batched Sparse Linear Algebra (Final Report for Subcontract B648960)

This report finalizes design specifications for developing batched kernels for small tensor operations for unassembled matrix-free iterative solvers, batched solvers for partially assembled operators, and batched solvers with support for various sparse formats. The outcome of the project milestones is a set of interfaces to Batched Sparse LA solvers running on hardware accelerators for use in ECP Libraries and Applications. It is part of the development of sparse batched kernels, solvers/preconditioners as well as creating interoperability in xSDK libraries with sparse and dense batched functions to benefit ECP applications. The participants included representatives from ECP libraries (not limited to the xSDK project), applications, and vendors (AMD, Intel, and NVIDIA). Batched sparse linear algebra solvers form the new frontier for algorithmic development and performance engineering. Many applications (ECP and non-ECP alike) require simultaneous solutions of small linear systems of equations that are structurally sparse. To move towards high hardware utilization, it is important to provide these applications with appropriate interfaces to efficient batched sparse solvers running on modern hardware accelerators. We present interface designs in use by HPC software libraries supporting batched sparse linear algebra and the development of sparse batched kernel codes for solvers and preconditioners. We also address the potential interoperability opportunities to keep the software portable between the major hardware accelerators from AMD, Intel, and NVIDIA. The presented interface specifications includes batched band, sparse iterative, and sparse direct solvers. This report summarizes progress in Kokkos Kernels and the xSDK libraries MAGMA, Ginkgo, hypre, SUNDIALS, and SuperLU_dist.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Matrix-free preconditioning for high-order H (curl) discretizations

The greater arithmetic intensity of high-order finite element discretizations makes them attractive for implementation on next-generation hardware, but assembly of high-order finite element operators as matrices is prohibitively expensive. As a result, the development of general algebraic solvers for such operators has been an open research challenge. Fast matrix-free application of high-order operators has received significant attention in the literature in the context of Poisson-type problems, but preconditioners and solvers for inverting more general operators are not very well-developed. In this paper, we consider the problem of preconditioning a definite Maxwell operator at high polynomial order without assembling a matrix. We show that given efficient preconditioners for high-order H 1 finite element problems on the same mesh, efficient H(curl) preconditioners can be constructed in an auxiliary space framework. We demonstrate the resulting preconditioners in a practical setting with tensor-product basis functions on an unstructured mesh of quadrilaterals. Overall, our approach uses a sparsified H 1 solver constructed on a low-order mesh of the nodal points of the underlying high-order space, and we show that the resulting H(curl) preconditioner is effective at very high polynomial orders for two-dimensional model problems with complicated geometry, varying piecewise constant coefficients, and curved elements. The resulting preconditioner scales with nearly optimal O(p d+1 ) floating point operation count and optimal O(p d ) memory transfer requirements, outperforming existing Maxwell preconditioners in the high-order regime.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Schrödinger cat states of a nuclear spin qudit in silicon

High-dimensional quantum systems are a valuable resource for quantum information processing. They can be used to encode error-correctable logical qubits, which has been demonstrated using continuous-variable states in microwave cavities or the motional modes of trapped ions. For example, high-dimensional systems can be used to realize ‘Schrödinger cat’ states, which are superpositions of widely displaced coherent states that can be used to illustrate quantum effects at large scales. Recent proposals have suggested encoding qubits in high-spin atomic nuclei, which are finite-dimensional systems that can host hardware-efficient versions of continuous-variable codes. Here, in this study, we demonstrate the creation and manipulation of Schrödinger cat states using the spin-7/2 nucleus of an antimony atom embedded in a silicon nanoelectronic device. We use a multi-frequency control scheme to produce spin rotations that preserve the symmetry of the qudit, and we constitute logical Pauli operations for qubits encoded in the Schrödinger cat states. Our work demonstrates the ability to prepare and control non-classical resource states, which is a prerequisite for applications in quantum information processing and quantum error correction, using our scalable, manufacturable semiconductor platform.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Aspen-based performance and energy modeling frameworks

Now with the anticipation of exascale architectures, energy consumption is becoming one of the critical design parameters, especially in light of the energy budget of 20-30 Megawatts set by the U.S. Department of Energy. Understanding an application’s execution pattern and its energy footprint is critical to improving application operation on a diverse heterogeneous architecture. Applying application-specific performance optimization can consequently improve energy consumption. However, this approach is only applicable to current systems. As we enter a new era of exascale architectures that is projected to contain more complex memory hierarchies, increased levels of parallelism, heterogeneity in hardware, and complex programming models and techniques, energy and performance management is getting more cumbersome. We therefore propose techniques that predict the energy consumption beforehand or at runtime to enable proactive tuning. Such energy prediction approaches must be generic and adapt themselves at runtime to changing application and hardware configurations. Most existing energy estimation and prediction approaches are empirical in nature and thus tied to current systems. To overcome this limitation, we propose two energy estimation techniques: ACEE (Algorithmic and Categorical Energy Estimation), which uses a combination of analytical and empirical modeling techniques; and AEEM (Aspen’s Embedded Energy Estimation), a system-level analytical energy estimation technique. Both of these models incorporate the Aspen domain specific language for performance modeling. We present the methodologies of these two models and test their accuracy using five proxy applications. We also describe three use cases.

79 ASTRONOMY AND ASTROPHYSICS↗