SEARCH · Search NASA

Results for “System size”

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 19 records

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Similarity for downscaled kinetic simulations of electrostatic plasmas: Reconciling the large system size with small Debye length

A simple similarity has been proposed for kinetic (e.g., particle-in-cell) simulations of plasma transport that can effectively address the long-standing challenge of reconciling the tiny Debye length with the vast system size. This applies to both transport in unmagnetized plasma and parallel transport in magnetized plasmas, where the characteristics length scales are given by the Debye length, collisional mean free paths, and the system or gradient lengths. The controlled scaled variables are the configuration space, x/L, and an artificial Coulomb Logarithm, L ln Λ, for collisions, while the scaled time, t/L, and electric field, LE, are automatic outcomes. The similarity properties are examined, demonstrating that the macroscopic transport physics is preserved through a similarity transformation while keeping the microscopic physics at its original scale of Debye length. To showcase the utility of this approach, two examples of 1D plasma transport problems were simulated using the VPIC code: the plasma thermal quench in tokamaks [Li et al., Nuclear Fusion 63, 066030 (2023)] and the plasma sheath in the high-recycling regime [Li et al., Physics of Plasmas 30, 063505 (2023)].

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2026

System-size dependence of charged-particle suppression in ultrarelativistic nucleus-nucleus collisions

High-energy partons lose energy while propagating through the hot, strongly interacting medium produced in ultrarelativistic nucleus-nucleus collisions, leading to a suppression of particle production at high transverse momentum (p T ). The dependence of this energy loss on the size of the colliding nuclear system has yet to be firmly established experimentally. This Letter presents a systematic study of charged-particle suppression across four different nucleus-nucleus collision systems using nuclear modification factors (R AA ) measured by the CMS Collaboration at the CERN LHC. Previous CMS measurements of R AA in oxygen-oxygen, xenon-xenon, and lead-lead collisions are recast with identical p T intervals and are complemented by the first measurement of the charged-particle R AA in neon-neon collisions at $\sqrt{S_{NN}}$ = 5.36 Te V . The neon-neon data correspond to an integrated luminosity of 0.76 nb −1 . The R AA in all collision systems examined show similar qualitative trends as a function of p T , but have a magnitude which is ordered with the nucleon number A. The R AA feature a downward slope at low p T , a local minimum at around 5–7 Ge V , and an upward slope with increasing p T . The R AA are also compared in terms of A 1/3 , which is proportional to the nuclear radius. Models including only initial-state nuclear effects fail to reproduce the observed trends, whereas energy loss models reproduce the trends in the region p T > 9.6 Ge V .

CMS↗

DOE OSTI2025

System size and energy dependence of the mean transverse momentum fluctuations at the LHC

Event-by-event fluctuations of the event-wise mean transverse momentum, $\langle$p T $\rangle$, of charged particles produced in proton–proton (pp) collisions at $\sqrt{s}$ = 5.02 TeV, Xe–Xe collisions at $\sqrt{s_{NN}}$ = 5.44 TeV, and Pb–Pb collisions at $\sqrt{s_{NN}}$ = 5.02 TeV are studied using the ALICE detector based on the integral correlator $\langle$$\langle$Δp T Δp T $\rangle$$\rangle$. The correlator strength is found to decrease monotonically with increasing produced charged-particle multiplicity measured at midrapidity in all three systems. In Xe–Xe and Pb–Pb collisions, the multiplicity dependence of the correlator deviates significantly from a simple power-law scaling as well as from the predictions of the HIJING and AMPT models. The observed deviation from power-law scaling is expected from transverse radial flow in semicentral to central Xe–Xe and Pb–Pb collisions. In pp collisions, the correlation strength is also studied by classifying the events based on the transverse spherocity, S 0 , of the particle production at midrapidity, used as a proxy for the presence of a pronounced back-to-back jet topology. Low-spherocity (jetty) events feature a larger correlation strength than those with high spherocity (isotropic). The strength and multiplicity dependence of jetty and isotropic events are well reproduced by calculations with the PYTHIA 8 and EPOS LHC models.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2026

An Anisotropic Yield and Damage Material Model to Improve the Contact Pressure Analysis in a Biomass Shredding System

Size reduction systems used in biomass processing break biomass into smaller pieces by utilizing the kinetic energy from the sharp rotating blades. Abrasive and/or erosive wear caused by biomass comminution results in blade wear of the sharp edged cutters, deteriorating the process efficiency. Here, this study aims to optimize the blade design and improve the system efficiency by attempting to understand the interactions between the blades and biomass particles. Since real-time monitoring of these interactions is impractical during operation, mechanical simulations offer a viable alternative for investigating the shredding process. Yet, the irregular geometry and complex mechanical properties of biomass—such as the anisotropic nature of woodchips and their nonlinear fracture behavior—pose significant challenges for accurately simulating contact pressure. In this work an anisotropic yield material model, along with a damage initiation and evolution function, is applied to the woodchip particle to study the contact pressure on shredder blade, offering a scientific basis for improved blade design and process efficiency. This approach can be extended to other biomass processing systems with similar anisotropic feedstocks, making it a valuable tool for advancing sustainable biomass utilization.

09 - BIOMASS FUELS↗

DOE OSTI2025

Optimal sizing of battery energy storage systems for peak shaving and demand response using a degradation-aware Bayesian Optimization-Mixed-Integer Linear Programming framework

The increasing integration of renewable energy and rising electricity demand highlight the importance of battery energy storage systems for peak shaving and demand response. Unlike prior approaches that overlook operational impacts on degradation, this study proposes a Bayesian Optimization–Mixed Integer Linear Programming framework for optimal battery energy storage system sizing. In this framework, Mixed Integer Linear Programming determines short-term scheduling while a calibrated electrochemical model iteratively evaluates degradation. The central hypothesis is that the framework can efficiently identify optimal sizes that yield realistic and economically robust outcomes. The method is tested across three scenarios: peak shaving, peak shaving with energy-reduction demand response, and peak shaving with power-reduction demand response. Results show that the framework converge to the optimum within 20 iterations out of 150 possible sizes. Under baseline conditions, the framework consistently selects the smallest feasible system, minimizing unnecessary degradation costs from oversized storage. Sensitivity analyses reveal that larger systems are favored as demand rates or incentives increase. Comparisons of demand response programs indicate that power-reduction demand response offers greater economic benefits than energy-reduction demand response, although demand savings from peak shaving remain the dominant contributor to overall performance. This study demonstrates that the proposed framework balances computational tractability with degradation fidelity, identifies critical economic thresholds for investment, and offers a practical, flexible tool to guide industrial stakeholders in cost-effective battery energy storage system deployment.

Batteries↗

DOE OSTI2026

Rapid Quantum Ground State Preparation via Dissipative Dynamics

Inspired by natural cooling processes, dissipation has become a promising approach for preparing low-energy states of quantum systems. However, the potential of dissipative protocols remains unclear beyond certain commuting Hamiltonians. This work provides significant analytical and numerical insights into the power of dissipation for preparing the ground state of noncommuting Hamiltonians. For quasi-free dissipative dynamics, including certain 1D spin systems with boundary dissipation, our results reveal a new connection between the mixing time in trace distance and the spectral properties of a non-Hermitian Hamiltonian, leading to an explicit and sharp bound on the mixing time that scales polynomially with system size. For more general spin systems, we develop a tensor network-based algorithm for constructing the Lindblad jump operator and for simulating the dynamics. Using this algorithm, we demonstrate numerically that dissipative ground state preparation protocols can achieve rapid mixing for certain 1D local Hamiltonians under bulk dissipation, with a mixing time that scales logarithmically with the system size. We then prove the rapid mixing result for certain weakly interacting spin and fermionic systems in arbitrary dimensions, extending recent results for high-temperature quantum Gibbs samplers to the zero-temperature regime. Together, these results show that dissipation can be a powerful tool for ground state preparation, with potential applications across condensed matter physics, quantum materials science, and beyond.

decoherence↗

DOE OSTI2024

Efficient quantum circuits based on the quantum natural gradient

Efficient preparation of arbitrary entangled quantum states is crucial for quantum computation. This is particularly important for noisy intermediate-scale quantum simulators relying on variational hybrid quantum-classical algorithms. To that end, we propose symmetry-conserving modified quantum approximate optimization algorithm (SCom-QAOA) circuits. The depths of these circuits depend not only on the desired fidelity to the target state but also on the amount of entanglement the state contains. The parameters of the SCom-QAOA circuits are optimized using the quantum natural gradient method based on the Fubini-Study metric. The SCom-QAOA circuit transforms an unentangled state into a ground state of a gapped one-dimensional Hamiltonian with a circuit depth that depends not on the system size but rather on the finite correlation length. In contrast, the circuit depth grows proportionally to the system size for preparing low-lying states of critical one-dimensional systems. Even in the latter case, SCom-QAOA circuits with depth less than the system size were sufficient to generate states with fidelity in excess of 99%, which is relevant for near-term applications. The proposed scheme enlarges the set of the initial states accessible for variational quantum algorithms and widens the scope of investigation of nonequilibrium phenomena in quantum simulators. Published by the American Physical Society 2024

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2024

Advancing Our Understanding of System Availability through the PV Fleet Performance Data Initiative

The PV Fleet Performance Data Initiative partners with photovoltaic (PV) fleet owners to collect time-series data of PV production data and publishes aggregated anonymized results of system performance metrics. With an extensive dataset drawn from over 2,200 PV systems across the United States, comprising 8.5 GW and 24,000 separate inverter data channels, this initiative aims to ensure that systemic risks in the US PV fleet are detected. The current work explores system availability, revealing a pronounced dependence on time, especially within the initial 6 months of system performance. Following this start-up period, the average system availability stabilizes. Statistical analyses illustrate a median (P5O) monthly availability of 0.991 and a dependence on system size with a negative trend in availability with increasing system size. This finding indicates that larger systems experience lower availability compared to their smaller counterparts.

inverter availability↗

DOE OSTI2026

Observation of Suppressed Charged-Particle Production in Ultrarelativistic Oxygen-Oxygen Collisions

A hot and dense state of nuclear matter, known as the quark-gluon plasma, is created in collisions of ultrarelativistic heavy nuclei. Highly energetic quarks and gluons, collectively referred to as partons, lose energy as they travel through this matter, leading to suppressed production of particles with large transverse momenta (𝑝 T ). Conversely, high-𝑝 T particle suppression has not been seen in proton-lead collisions, raising questions regarding the minimum system size required to observe parton energy loss. Oxygen-oxygen (OO) collisions examine a region of effective system size that lies between these two extreme cases. The CMS detector at the CERN LHC has been used to quantify charged-particle production in inclusive OO collisions for the first time via measurements of the nuclear modification factor (𝑅 AA ). The 𝑅 AA is derived by comparing particle production to expectations based on proton-proton (𝑝⁢𝑝) data and has a value of unity in the absence of nuclear effects. The data for OO and 𝑝⁢𝑝 collisions at a nucleon-nucleon center-of-mass energy $\sqrt{s_{NN}}$ = 5.36 TeV correspond to integrated luminosities of 6.1 nb −1 and 1.02 pb −1 , respectively. The 𝑅 AA is below unity with a minimum of 0.69 ± 0.04 around 𝑝 T = 6 GeV. The data exhibit better agreement with theoretical models incorporating parton energy loss as compared to baseline models without energy loss.

FOS: Physical sciences↗

DOE OSTI2025

Absence of Barren Plateaus and Scaling of Gradients in the Energy Optimization of Isometric Tensor Network States

Abstract Vanishing gradients can pose substantial obstacles for high-dimensional optimization problems. Here we consider energy minimization problems for quantum many-body systems with extensive Hamiltonians and finite-range interactions, which can be studied on classical computers or in the form of variational quantum eigensolvers on quantum computers. Barren plateaus correspond to scenarios where the average amplitude of the energy gradient decreases exponentially with increasing system size. This occurs, for example, for quantum neural networks and for brickwall quantum circuits when the depth increases polynomially in the system size. Here we prove that the variational optimization problems for matrix product states, tree tensor networks, and the multiscale entanglement renormalization ansatz are free of barren plateaus. The derived scaling properties for the gradient variance provide an analytical guarantee for the trainability of randomly initialized tensor network states (TNS) and motivate certain initialization schemes. In a suitable representation, unitary tensors that parametrize the TNS are sampled according to the uniform Haar measure. We employ a Riemannian formulation of the gradient based optimizations which simplifies the analytical evaluation.

Barthel, Thomas↗

DOE OSTI2026

Predicting Adaptively Chosen Observables in Quantum Systems

Recent advances have demonstrated that 𝒪⁡(log 𝑀) measurements suffice to predict 𝑀 properties of arbitrarily large quantum many-body systems. However, these remarkable findings assume that the properties to be predicted are chosen independently of the data. This assumption can be violated in practice, where scientists adaptively select properties after looking at previous predictions. This work investigates the adaptive setting for three classes of observables: local, Pauli, and bounded-Frobenius-norm observables. We prove that Ω⁡(√𝑀) samples of an arbitrarily large unknown quantum state are necessary to predict expectation values of 𝑀 adaptively chosen local and Pauli observables, where the system size scales exponentially and polynomially in 𝑀, respectively. We also present computationally efficient algorithms that achieve this information-theoretic lower bound. In contrast, for bounded-Frobenius-norm observables, we devise an algorithm requiring only 𝒪⁡(log 𝑀) samples, independent of system size. These results highlight the potential pitfalls of adaptivity in analyzing data from quantum experiments and provide algorithmic tools to safeguard against erroneous predictions in quantum experiments.

Machine learning↗

DOE OSTI2025

Techno-economic assessment of residential PV system tariff policies in Jordan

This study assesses the economic and technical performance of four energy policy scenarios for Jordan's residential photovoltaic (PV) systems: net metering, net billing, zero-export with battery storage, and sell-all-buy-all. With the recent introduction of time-of-use (TOU) tariffs and policies addressing the “duck curve” effect, the research focuses on optimizing PV system sizing across different regulatory frameworks. A detailed techno-economic analysis evaluates these scenarios based on energy production, cost savings, payback periods, and energy self-sufficiency. The findings indicate that net metering and net billing offer the highest cost savings and the shortest payback periods (∼3 years). While the zero-export strategy with battery storage enhances energy self-sufficiency by up to 70%, it requires a higher upfront investment. The sell-all-buy-all scenario supports larger system sizes, achieving a low levelized cost of electricity (0.0696 USD/kWh) and a net present value of 619 USD. Additionally, the study identifies a critical feed-in tariff threshold of 0.055 USD/kWh, at which net billing becomes as financially attractive as net metering. Here, these insights offer valuable recommendations for policymakers to optimize net billing rates and TOU tariffs, promoting the expansion of Jordan's renewable energy sector.

Battery storage↗

DOE OSTI2025

Accuracy Guarantees and Quantum Advantage in Analog Open Quantum Simulation with and without Noise

Many-body open quantum systems, described by Lindbladian master equations, are a rich class of physical models that display complex equilibrium and out-of-equilibrium phenomena which remain to be understood. In this paper, we theoretically analyze noisy analog quantum simulation of geometrically local open quantum systems and provide evidence that this problem both is hard to simulate on classical computers and could be approximately solved on near-term quantum devices. First, given a noiseless quantum simulator, we show that the dynamics of local observables and the fixed-point expectation values of rapidly mixing local observables in geometrically local Lindbladians can be obtained to a precision of ϵ in time that is poly ( ϵ − 1 ) and uniform in system size. Furthermore, we establish that the quantum simulator would provide a superpolynomial advantage, in run-time scaling with respect to the target precision and either the evolution time (when simulating dynamics) or the Lindbladian’s decay rate (when simulating fixed points), over any classical algorithm for these problems, assuming BQP ≠ BPP . We then consider the presence of noise in the quantum simulator in the form of additional geometrically local Lindbladian terms. We show that the simulation tasks considered in this paper are stable to errors; i.e., they can be solved to a noise-limited, but system-size independent, precision. Finally, we establish that, assuming BQP ≠ BPP , there are stable geometrically local Lindbladian simulation problems such that, as the noise rate on the simulator is reduced, classical algorithms must take time superpolynomially longer in the inverse noise rate to attain the same precision as the analog quantum simulator. Published by the American Physical Society 2025

Kashyap, Vikram (ORCID:0000000208195207)↗

DOE OSTI2025

Analyzing the Quantum Approximate Optimization Algorithm: Ansätze, Symmetries, and Lie Algebras

The quantum approximate optimization algorithm (QAOA) has been proposed as a method to obtain approximate solutions for combinatorial optimization tasks. In this work, we study the underlying algebraic properties of three QAOA ansätze for the maximum-cut problem on connected graphs, while focusing on the generated Lie algebras as well as their invariant subspaces. Specifically, we analyze the standard QAOA ansatz as well as the orbit and multiangle ansätze. We are able to fully characterize the Lie algebras of the multiangle ansatz across arbitrary connected graphs, finding that they only fall into one of just six families. Aside from the cycle and path graphs, the Lie dimensions for every graph are exponentially large in the system size, meaning that multiangle ansätze are extremely prone to exhibiting barren plateaus. Then, a similar quasi-graph-independent Lie-algebraic characterization beyond the multiangle ansatz is impeded as the circuit exhibits additional “hidden” symmetries besides those naturally arising from a certain parity-superselection operator and all automorphisms of the considered graph. Disregarding the “hidden” symmetries, we can upper bound the dimensions of the orbit and the standard Lie algebras, and the dimensions of the associated invariant subspaces are determined via explicit character formulas. To finish, we conjecture that (for most graphs) the standard Lie algebras have only components that are either exponential or that grow, at most, polynomially with the system size. This would imply that the QAOA is either prone to barren plateaus or classically simulable. More generally, our work provides a symmetry framework and tools to analyze any desired variational quantum algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2026

Toward scalable quantum computations of atomic nuclei

We solve the nuclear two-body and three-body bound states via quantum simulations of pionless effective field theory on a lattice in position space. While the employed lattice remains small, the usage of local Hamiltonians including two- and three-body forces ensures that the number of Pauli terms scales linearly with increasing numbers of lattice sites. We use an adaptive ansatz grown from unitary coupled cluster theory to parametrize the ground states of the deuteron and 3 He, compute their corresponding energies, and analyze the scaling of the required computational resources. Our quantum simulations reproduce exact benchmarks for 2 H and 3 He within 100 keV, requiring at most 30 layers in the ansatz and thus resulting in modest circuit depths. Additionally, we find the number of shots required to reach a given precision scales linearly in the lattice size and more mildly in the system size. Furthermore, based on the agreement with exact benchmarks and mild scaling, we conclude that this can be an efficient, scalable approach for quantum computations of nuclear ground states, particularly to prepare initial states for quantum phase estimation or other filtering algorithms.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2026

Stochastic GW -GPU: Rapid Quasi-Particle Energies for Molecules beyond 10,000 Atoms

StochasticGW is a code for computing accurate quasi-particle (QP) energies of molecules and material systems in the GW approximation. StochasticGW utilizes the stochastic Resolution of the Identity (sROI) technique to enable a massively parallel implementation with computational costs that scale semilinearly with system size, allowing the method to access systems with tens of thousands of electrons. Here, we introduce a new implementation, StochasticGW-GPU, for which the main bottleneck steps have been ported to GPUs and give substantial performance improvements over previous versions of the code. We showcase the new code by computing band gaps of hydrogenated silicon clusters (Si x H y ) containing up to 10,001 atoms and 35,144 electrons, and we obtain individual QP energies with a statistical precision of better than ±0.03 eV with times-to-solution of less than 1 h.

Thomas, Phillip S. [Lawrence Berkeley National Lab↗

DOE OSTI2024

Sparse Linear Solvers for Large-scale Electromagnetic Transient Simulations

Linear solvers form the basis for electromagnetic transient (EMT) simulations. There is a need to speed up EMT simulations as larger regions are analyzed using EMT simulations. For the same, the performance of linear solvers plays an important role. Exploiting the sparsity of the matrices generated in EMT simulations could assist with speed-up. Scalability is also crucial as power grids expand, demanding solutions capable of accommodating the increasing system size. Recent studies from the North American Electric Reliability Corporation (NERC) increasingly emphasize that EMT simulation models of the power grid will grow larger with the inclusion of power electronics components. Parallelisms in sparsity patterns exploit modern central processing units (CPUs), multi-core CPUs, and graphics processing units (GPUs) architectures in sparse solver designs. Therefore, this paper explores publicly available existing linear solvers and investigates their efficiency in large-scale power grid simulations. A large-scale power grid is developed by increasing the size of the IEEE 39 bus test system to up to 39000 bus systems.

Hsu, Kuan-Chieh↗

DOE OSTI2025

MCOR User Guide

User guide for the MCOR software package which is currently publicly hosted on Github (https://github.com/pnnl/MCOR). The Microgrid Component Optimization for Resilience (MCOR) tool simulates the operation of a renewable energy, battery, and back-up generator microgrid under a large range of outage conditions to understand how a potential system can meet the resilience goals of a particular site. It is an open-source, command line, Python-based tool that produces an output Excel spreadsheet as well as several types of plots to enable a user to compare different microgrid system sizes and costs. It is intended for high-level system planning and opportunity identification, and not for detailed electric system modeling and design. The tool includes a range of input parameters that can be adjusted or tuned to provide a more custom analysis as needed.

24 POWER TRANSMISSION AND DISTRIBUTION↗