Search NASA⌕ Search

SEARCH · Search NASA

Results for “deterministic”

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 649 records · Page 36

Teleportation is necessary for faithful quantum state transfer through noisy channels of maximal rank

Quantum teleportation enables deterministic and faithful transmission of quantum states, provided a maximally entangled state is preshared between sender and receiver, and a one-way classical channel is available. Here, we prove that these resources are not only sufficient, but also necessary, for deterministically and faithfully sending quantum states through any fixed noisy channel of maximal rank, when a single use of the cannel is admitted. In other words, for this family of channels, there are no other protocols, based on different (and possibly cheaper) sets of resources, capable of replacing quantum teleportation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Entanglement requirements for implementing bipartite unitary operations

We prove, using a method based on map-state duality, lower bounds on entanglement resources needed to deterministically implement a bipartite unitary using separable (SEP) operations, which include LOCC (local operations and classical communication) as a particular case. It is known that the Schmidt rank of an entangled pure state resource cannot be less than the Schmidt rank of the unitary. We prove that if these ranks are equal the resource must be uniformly (maximally) entangled: equal nonzero Schmidt coefficients. Higher rank resources can have less entanglement: we have found numerical examples of Schmidt rank 2 unitaries, which can be deterministically implemented, by either SEP or LOCC, using an entangled resource of two qutrits with less than one ebit of entanglement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Engineering arbitrary pure and mixed quantum states

Controlled manipulation by atomic- and molecular-scale quantum systems has attracted a lot of research attention in recent years. A fundamental problem is to provide deterministic methods for controlled engineering of arbitrary quantum states. This work proposes a deterministic method for engineering arbitrary pure and mixed states of a wide class of quantum systems. The method exploits a special combination of incoherent and coherent controls (incoherent and coherent radiation) and has two properties which are specifically important for manipulating by quantum systems: it realizes the strongest possible degree of their state control, complete density matrix controllability, meaning the ability to steer arbitrary pure and mixed initial states into any desired pure or mixed final state, and it is all-to-one, such that each particular control transfers all initial system states into one target state.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Observation of Defect-Assisted Magnetic Vortex Core Reversal at Ultralow Critical Velocity

The stability of structures with nontrivial topology is a subject of great interest, both from fundamental and technological perspectives. The topology of a magnetic vortex, for example, results in high stability of the vortex core polarity, which is attractive for applications. This high stability, however, greatly impedes the required deterministic polarity switching, which is typically only achieved with large magnetic fields or strong dynamic driving. Here, we show that the interaction between the vortex core and manufactured nanoscale defects in the magnetic material lowers the required driving strength for core polarity reversal by more than an order of magnitude. We excite vortex dynamics in thin permalloy disks, and map the twodimensional (2D) vortex core trajectory using 3D time-resolved Kerr microscopy. In pristine samples, we observe normal gyrotropic motion of the vortex core. After laser-induced generation of defects, however, we observe repeated vortex core reversal at much-reduced driving strength. Micromagnetic simulations reveal how local reduction of exchange coupling and saturation magnetization can create vortex core reversal sites for deterministic vortex core switching.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Transition to metallization in warm dense helium-hydrogen mixtures using stochastic density functional theory within the Kubo-Greenwood formalism

The Kubo-Greenwood (KG) formula is often used in conjunction with Kohn-Sham (KS) density functional theory (DFT) to compute the optical conductivity, particularly for warm dense matter. For applying the KG formula, all KS eigenstates and eigenvalues up to an energy cutoff are required and thus the approach becomes expensive, especially for high temperatures and large systems, scaling cubically with both system size and temperature. Here, we develop an approach to calculate the KS conductivity within the stochastic DFT framework, which requires knowledge only of the KS Hamiltonian but not its eigenstates and values. We show that the computational effort associated with the method scales linearly with system size and reduces in proportion to the temperature, unlike the cubic increase with traditional deterministic approaches. In addition, we find that the method allows an accurate description of the entire spectrum, including the high-frequency range, unlike the deterministic method which is compelled to introduce a high-frequency cutoff due to memory and computational time constraints. Finally, we apply the method to helium-hydrogen mixtures in the warm dense matter regime at temperatures of ~60 kK and find that the system displays two conductivity phases, where a transition from nonmetal to metal occurs when hydrogen atoms constitute ~0.3 of the total atoms in the system.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Fast and Universal Kohn-Sham Density Functional Theory Algorithm for Warm Dense Matter to Hot Dense Plasma

Understanding many processes, e.g., fusion experiments, planetary interiors, and dwarf stars, depends strongly on microscopic physics modeling of warm dense matter and hot dense plasma. This complex state of matter consists of a transient mixture of degenerate and nearly free electrons, molecules, and ions. This regime challenges both experiment and analytical modeling, necessitating predictive ab initio atomistic computation, typically based on quantum mechanical Kohn-Sham density functional theory (KS-DFT). However, cubic computational scaling with temperature and system size prohibits the use of DFT through much of the warm dense matter regime. A recently developed stochastic approach to KS-DFT can be used at high temperatures, with the exact same accuracy as the deterministic approach, but the stochastic error can converge slowly and it remains expensive for intermediate temperatures (< 50 eV). Here we have developed a universal mixed stochastic-deterministic algorithm for DFT at any temperature. This approach leverages the physics of KS-DFT to seamlessly integrate the best aspects of these different approaches. We demonstrate that this method significantly accelerated self-consistent field calculations for temperatures from 3 to 50 eV, while producing stable molecular dynamics and accurate diffusion coefficients.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Efficient Estimation of Pauli Observables by Derandomization

In this work, we consider the problem of jointly estimating expectation values of many Pauli observables, a crucial subroutine in variational quantum algorithms. Starting with randomized measurements, we propose an efficient derandomization procedure that iteratively replaces random single-qubit measurements by fixed Pauli measurements; the resulting deterministic measurement procedure is guaranteed to perform at least as well as the randomized one. In particular, for estimating any L low-weight Pauli observables, a deterministic measurement on only of order log(L) copies of a quantum state suffices. In some cases, for example, when some of the Pauli observables have high weight, the derandomized procedure is substantially better than the randomized one. Specifically, numerical experiments highlight the advantages of our derandomized protocol over various previous methods for estimating the ground-state energies of small molecules.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

New figuring model based on surface slope profile for grazing-incidence reflective optics

Surface slope profile is widely used in the metrology of grazing-incidence reflective optics instead of surface height profile. Nevertheless, the theoretical and experimental model currently used in deterministic optical figuring processes is based on surface height, not on surface slope. This means that the raw slope profile data from metrology need to be converted to height profile to perform the current height-based figuring processes. The inevitable measurement noise in the raw slope data will introduce significant cumulative error in the resultant height profiles. As a consequence, this conversion will degrade the determinism of the figuring processes, and will have an impact on the ultimate surface figuring results. To overcome this problem, an innovative figuring model is proposed, which directly uses the raw slope profile data instead of the usual height data as input for the deterministic process. In this article, first the influence of the measurement noise on the resultant height profile is analyzed, and then a new model is presented; finally a demonstration experiment is carried out using a one-dimensional ion beam figuring process to demonstrate the validity of our approach.

36 MATERIALS SCIENCE↗

Scalable Replay with Partial-Order Dependencies for Message-Logging Fault Tolerance

Deterministic replay of a parallel application is commonly used for discovering bugs or to recover from a hard fault with message-logging fault tolerance. For message passing programs, a major source of overhead during forward execution is recording the order in which messages are sent and received. During replay, this ordering must be used to deterministically reproduce the execution. Previous work in replay algorithms often makes minimal assumptions about the programming model and application in order to maintain generality. However, in many cases, only a partial order must be recorded due to determinism intrinsic in the code, ordering constraints imposed by the execution model, and events that are commutative (their relative execution order during replay does not need to be reproduced exactly). In this paper, we present a novel algebraic framework for reasoning about the minimum dependencies required to represent the partial order for different concurrent orderings and interleavings. By exploiting this theory, we improve on an existing scalable message-logging fault tolerance scheme. The improved scheme scales to 131,072 cores on an IBM BlueGene/P with up to 2x lower overhead than one that records a total order.

fault tolerance↗

Distributed Order Recording Techniques for Efficient Record-and-Replay of Multi-threaded Programs

After all these years and all these other shared memory programming frameworks, OpenMP is still the most popular one. However, its greater levels of non-deterministic execution makes debugging and testing more challenging. The ability to record and deterministically replay the program execution is key to address this challenge. However, scalably replaying OpenMP programs is still an unresolved problem. In this paper, we propose two novel techniques that use Distributed Clock (DC) and Distributed Epoch (DE) recording schemes to eliminate excessive thread synchronization for OpenMP record and replay. Our evaluation on representative HPC applications with ReOMP, which we used to realize DC and DE recording, shows that our approach is 2-5x more efficient than traditional approaches that synchronize on every shared-memory access. Furthermore, we demonstrate that our approach can be easily combined with MPI-level replay tools to replay non-trivial MPI+OpenMP applications. We achieve this by integrating ReOMP into ReMPI, an existing scalable MPI record-and-replay tool, with only a small MPI-scale-independent runtime overhead.

Fu, Xiang↗

An Efficient Bayesian Method for Advancing the Application of Deep Learning in Earth Science

Despite their wide and successful applications, deep learning (DL) models are prone to overfitting for small training datasets, produce a poor predictive performance for uncertain data, and provide point estimations without any indication of the accuracy and credibility. These limitations of the deterministic DL models hinder their effective application in Earth system science where the labelled data are sparse, noisy and incomplete with large uncertainty and where the predictive uncertainty quantification is needed for scientific understanding and policy decision making. Integration of Bayesian inference into DL models adds an estimate of uncertainty and regularization in the predictions. However, traditional Bayesian methods are computationally unaffordable and inflexible for high-dimensional problems, which limits their application to DL systems that typically have millions of model parameters. In this effort, we propose an efficient and general-purpose Bayesian inference method to advance DL model optimization and uncertainty quantification, so as to facilitate the adoption of DL in Earth sciences. In a demonstration, we integrate the proposed Bayesian method with a feedforward neural network (NN) to build a fast-to-evaluate surrogate of the complex Energy Exascale Earth System Land Model for efficient modeling. The formulated Bayesian NN, using a small number of training data, produces an accurate prediction with high credibility, whereas with the same small training size, the deterministic NN cannot yield a reasonable estimation and does not provide confidence information. The proposed Bayesian method is computationally efficient and flexible, capable of integration with diverse network variants such as convolutional NNs and recurrent NNs to advance the application of DL in Earth sciences.

Lu, Dan↗

Volt-VAR Optimization in Distribution Networks Using Twin Delayed Deep Reinforcement Learning

Modern distribution grids are undergoing new challenges due to the stochastic nature of distributed energy resources (DERs). High penetration of DERs has a significant impact on Volt-VAR profile and system power losses. This work proposes a deep reinforcement learning (DRL)-based Volt-VAR optimization approach for improving voltage profile and reducing system power loss under high penetration of distributed energy resources, such as battery energy storage and solar photovoltaic units in distribution grids. The twin delayed deep deterministic policy gradient (TD3) method-based DRL agent is proposed to configure optimal set-points of reactive power outputs of fast responding smart inverters. The agent schedules the reactive power of inverters according to their physical capabilities, such as minimum allowed power factor, e.g., 0.9 leading/lagging. The reward function of the proposed DRL scheme is designed carefully to ensure a proper voltage profile of the grids with effective scheduling of reactive power outputs from inverters. The performance of the proposed model is verified on modified IEEE 34- and 123-bus systems and compared with base case with no reactive supply by inverters, and local droop Volt-VAR control approach. The results show that the proposed method performs better than the local droop control and deep deterministic policy gradient (DDPG)-based DRL method for reducing voltage fluctuation and minimizing power loss.

Hossain, Rakib↗

Stochastic Pricing Game for Aggregated Demand Response Considering Comfort Level

In recent years, demand response (DR) has been explored as a fundamental strategy for demand-side management due to its advantages in mediating intermittency of renewable energy generation, load shifting, etc. To engage customers in DR programs, several deterministic price-based DR strategies have been developed and implemented. However, the stochastic weather conditions and occupants' consumption behaviors often make the deterministic solution less robust to uncertainties. In this paper, with the consideration of the uncertainties, a stochastic Stackelberg game is proposed to model the price-demand negotiation between a distributed system operator and load aggregators, where the virtual battery constraints are extracted from the building thermostatically controlled loads (TCLs)‘ characteristics to guarantee comfortable TCLs' levels. Following the negotiation, a priority-based control method is used to allocate the optimal aggregated power DR profile at the building level and track the power signal. Several groups of experiments have demonstrated the effectiveness and robustness of the stochastic solutions.

Chen, Yang↗

Short-Term Load Forecasting Considering EV Charging Loads with Prediction Interval Evaluation

Short-term load forecasting plays a critical role in power system planning and operation. Along with the electrification of various loads, electricity demands are becoming increasingly hard to predict. Notably, the recent rise in electric vehicles (EVs) has further contributed to this unpredictability. To address this issue, this paper proposes a probabilistic load forecasting strategy utilizing Gaussian process regression, structured in a day-ahead manner. While many works focus on deterministic prediction, probabilistic forecasting offers additional insights into variability and uncertainty, enabling more flexible and reliable operation for power systems. To enhance the accuracy of the load forecasting model, the inputs include features related to EV charging habits as well as commonly used weather information. The load forecasting results are evaluated using various metrics, including conventional ones that assess the accuracy of point forecasts, as well as additional metrics that test the reliability of prediction intervals. The proposed load forecasting method is finally tested on real residential power consumption data and EV charging data sampled from real-world sources. The results prove that the new features can greatly improve the performance of the load forecasting method.

electrical vehicle↗

Allocation and Operation of A Hydropneumatic Energy Storage with Building Microgrid

Behind-meter application for a recently invented hydropneumatic Ground-Level Integrated Diverse Energy Storage (GLIDES) is focused in this research. Considering possible uncertainties from solar radiation and electricity load in a building microgrid, two-stage stochastic programming is adopted for 15-min operation and a mixed-integer nonlinear stochastic model is built with integrated energy systems of GLIDES, solar panel and power generating unit. In order to make the model computationally tractable, we use sample average approximate method to decrease associated complexity with sample size and improve solving efficiency. The experimental results in deterministic and stochastic operation indicate that best candidate solution from SAA are superior to the solution from expected value problem in terms of optimality gap and variance.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Occlusion-Perturbed Deep Learning for Probabilistic Solar Forecasting via Sky Images

Solar forecasting is shifting to the probabilistic paradigm due to the inherent uncertainty within the solar resource. Input uncertainty quantification is one of the widely used and best-performing ways to model solar uncertainty. However, compared to other sources of inputs, such as numerical weather prediction models, pure sky image-based probabilistic solar forecasting lags behind. In this research, an occlusion-perturbed convolutional neural network, named the PSolarNet, is developed. The PSolarNet provides very short-term deterministic forecasts, forecast scenarios, and probabilistic forecasts of the global horizontal irradiance from sky image sequences. Case studies based on 6 years of open-source data show that the developed PSolarNet is able to generate accurate 10-minute ahead deterministic forecasts with a 5.62% normalized root mean square error, realistic and diverse forecast scenarios with a 0.966 average correlation with the actual time series, and reliable and sharp probabilistic forecasts with a 2.77% normalized continuous ranked probability score.

Bayesian model averaging↗

Short-Term Probabilistic Solar Forecasting via Reinforcement Learning over ECMWF

In this paper, we present an innovative reinforcement learning approach for short-term solar forecasting, leveraging data from the European Centre for Medium-Range Weather Forecasts (ECMWF). The methodology begins with the application of the System Advisor Model (SAM) to transform various ECMWF numerical weather prediction members into predictive photovoltaic power generation. To enhance the precision of deterministic forecasting, we introduce a dynamic model selection algorithm based on Q-learning. This algorithm dynamically identifies and utilizes the most accurate ensemble member for forecasting purposes. Furthermore, we employ a support vector regression surrogate model with a Gaussian distribution to generate probabilistic forecasts, providing a holistic view of solar energy generation uncertainty. To expedite the training process and make it more practical for real-world applications, we integrate a rolling update workflow. This innovative workflow reduces the training period from months to a mere 19 days, making our method highly efficient. Numerical results of the case study show that in comparison to benchmark models, the proposed method improves the deterministic and probabilistic solar forecasting accuracy by up to 40.84% and 48.42%, respectively.

ensemble forecasting↗

Correlation between EVs and Other Loads in Probabilistic Load Flow for Distribution Systems

To date, most probabilistic studies have assumed independence between the various loads and other inputs on the distribution system. It is well know however, that this is typically not the case. The work presented in the paper expands upon a previous unbalanced three-phase probabilistic load flow study on a residential feeder with a 50 % penetration of electric vehicles, under three different charging schemes where different correlation scenarios between the load flow inputs are considered. The data for the probabilistic load flow study are derived from a voltage dependent time-variant deterministic load flow. Here the deterministic load flow data are examined further to gain a better understanding of the correlation between the customer and electric vehicle charging loads, and how different charging schemes may impact it further. Four different correlation scenarios are then created and details on how the probabilistic load flow inputs are created is also presented; demonstrating the need for better analysis on the correlation between system inputs. This paper hopes to open the discussion and start the push for future research into understanding the correlation and effects of various system inputs on the probabilistic nature of distribution systems, and how to apply this knowledge to future studies.

Melhorn, Alexander C.↗