Search NASA⌕ Search

SEARCH · Search NASA

Results for “lower bounds”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations

In this article, we focus on the communication costs of three symmetric matrix computations: (i) multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK) (ii) adding the result of the multiplication of a matrix with the transpose of another matrix and the transpose of that result, known as a symmetric rank-2k update (SYR2K) (iii) performing matrix multiplication with a symmetric input matrix (SYMM). All three computations appear in the Level 3 Basic Linear Algebra Subroutines (BLAS) and have wide use in applications involving symmetric matrices. We establish communication lower bounds for these kernels using sequential and distributed-memory parallel computational models, and we show that our bounds are tight by presenting communication-optimal algorithms for each setting. Our lower bound proofs rely on applying a geometric inequality for symmetric computations and analytically solving constrained nonlinear optimization problems. As a result, the symmetric matrix and its corresponding computations are accessed and performed according to a triangular block partitioning scheme in the optimal algorithms.

Al Daas, Hussam [Rutherford Appleton Laboratory, D↗
DOE OSTI2025

Universal lower bound on the axion decay constant from free streaming effects

We show that enhancement of the axion relic abundance compared to the standard misalignment contribution generically leads to the production of nonzero momentum axion modes, resulting in warm dark matter behavior and enhanced isocurvature perturbations. It leads to universal constraints on the axion parameter space that are independent of detailed model assumptions and cosmological history. For models enhancing relic abundance with gradient axion modes, observations of the Lyman-$α$ forest impose a lower bound on the axion decay constant, $f_a \gtrsim 10^{15} {\rm GeV}\,(10^{-18}{\rm eV}/m_a)$, from the free-streaming effect. For models relying on the delay of coherent axion oscillations, we obtain a slightly weaker bound, $f_a \gtrsim 10^{14} {\rm GeV}\,(10^{-18}{\rm eV}/m_a)$. We make relatively conservative choices to establish these universal bounds but also provide scaling parameters that can be calibrated for stronger constraints in concrete models and updated as observations improve.

Harigaya, Keisuke [Chicago U., EFI; Tokyo U., IPMU↗
DOE OSTI2025

Lower bounds on entanglement entropy without twin copy

We discuss the possibility of estimating experimentally the von Neumann entanglement entropy S A v N of a symmetric bipartite quantum system A B by using the basic measurement counts (bitstrings) for a single copy of a prepared state. Using exact diagonalization and analog simulations performed with the publicly available QuEra facilities for chains and ladders of Rydberg atoms, we calculate the Shannon entropy S A B X associated with the bitstrings of adiabatically prepared ground states and the reduced entropies S A X and S B X obtained from the marginal probabilities in A and B . We then calculate the classical mutual information I A B X = S A X + S B X − S A B X , which is a lower bound on S A v N . We show that for a broad range of lattice spacing and detuning, I A B X is typically 20% below S A v N in regions where S A v N is large and a less close bound in regions where S A v N is low. We argue that this use of the easily available bitstrings provides a robust and efficient way to explore empirically the phase diagram of qubit-based quantum simulators and identify critical regions. Published by the American Physical Society 2025

Meurice, Yannick (ORCID:0000000209959694)↗
DOE OSTI2026

Quantum Time-Space Tradeoffs for Matrix Problems

We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra problems—including matrix-vector product, matrix inversion, matrix multiplication and powering—existing classical time-space tradeoffs, several of which are tight for every space bound, also apply to quantum algorithms with at most a constant factor loss. For example, for almost all fixed matrices 𝐴, including the discrete Fourier transform matrix, we prove that quantum circuits with at most 𝑇 input queries and 𝑆 qubits of memory require 𝑇 = Ω⁢(𝑛 2 /𝑆) to compute matrix-vector product 𝐴⁢𝑥 for 𝑥 ∈{0,1 𝑛 . We similarly prove that matrix multiplication for 𝑛 ×𝑛 binary matrices requires 𝑇 = Ω⁢(𝑛 3 /$\sqrt{𝑆}$). Because many of our lower bounds are matched by deterministic algorithms with the same time and space complexity, our results show that quantum computers cannot provide any asymptotic advantage for these problems with any space bound. We obtain matching lower bounds for the stronger notion of quantum cumulative memory complexity—the sum of the space per layer of a circuit. We also consider Boolean (i.e., AND-OR) matrix multiplication and matrix-vector products, improving the previous quantum time-space tradeoff lower bounds for 𝑛 × 𝑛 Boolean matrix multiplication to 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/4 ) from 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/2 ). Our improved lower bound for Boolean matrix multiplication is based on a new coloring argument that extracts more from the strong direct product theorem that was the basis for prior work. To obtain our tight lower bounds for linear algebra problems, we require much stronger bounds than strong direct product theorems. We obtain these bounds by adding a new bucketing method to the quantum recording-query technique of Zhandry that lets us apply classical arguments to upper bound the success probability of quantum circuits.

lower bounds↗
DOE OSTI2026

Testing Classical Properties from Quantum Data

Many properties of Boolean functions can be tested far more efficiently than the function itself can be learned. However, this dramatic advantage often disappears when testers are limited to random samples of ƒ instead of adaptively chosen queries to f. In this work we investigate the quantum version of this restriction: quantum algorithms that test properties of a Boolean function f solely from copies of either the function state |ƒ⟩ ∝ ∑ x |x, ƒ(x)⟩ or the phase state |(-1) ƒ ⟩ ∝ ∑ x (-1) ƒ(x) |x⟩. For monotonicity, symmetry, and triangle-freeness, we show passive quantum testers are unboundedly or super-polynomially better than their classical passive testing counterparts. They are competitive with classic query -based testers in each case. Our new testers use techniques beyond quantum Fourier sampling, and it turns out this is necessary: we show a certain class of bent functions can be tested from 𝒪(1) function states but has a sample complexity lower bound of 2 Ω(n) for any tester relying exclusively on Fourier and classical samples. Our passive quantum testers are competitive with classical query -based testers, but this isn't universal: we exhibit a testing problem that can be solved from 𝒪(1) classical queries but requires Ω(2 n/2 ) function state copies. The Forrelation problem provides a separation of the same magnitude in the opposite direction, so we conclude that quantum data and classical queries are "maximally incomparable" resources for testing. We also begin the study of lower bounds for testing from quantum data. For quantum monotonicity testing, we prove that the ensembles of [Goldreich et al., 2000; Black, 2024], which give exponential lower bounds for classical sample-based testing, do not yield any nontrivial lower bounds for testing from quantum data. New insights specific to quantum data will be required for proving copy complexity lower bounds for testing in this model.

Boolean Functions↗
DOE OSTI2026

Quantum Routing and Entanglement Dynamics Through Bottlenecks

To implement arbitrary quantum circuits in architectures with restricted interactions, one may effectively simulate all-to-all connectivity by routing quantum information. We consider the entanglement dynamics and routing between two regions only connected through an intermediate “bottleneck” region with few qubits. In such systems, where the entanglement rate is restricted by a vertex boundary rather than an edge boundary of the underlying interaction graph, existing results such as the small incremental entangling theorem give only a trivial constant lower bound on the routing time (the minimum time to perform an arbitrary permutation). We significantly improve the lower bound on the routing time in systems with a vertex bottleneck. Specifically, for any system with two regions 𝐿,𝑅 with 𝑁 𝐿 ,𝑁 𝑅 qubits, respectively, coupled only through an intermediate region 𝐶 with 𝑁 𝐶 qubits, for any 𝛿 > 0 we show a lower bound of Ω⁢(𝑁$^{1−𝛿}_{𝑅}$/√𝑁 𝐿⁢ 𝑁 𝐶 ) on the Hamiltonian quantum routing time when using piecewise time-independent Hamiltonians, or time-dependent Hamiltonians subject to a smoothness condition. We also prove an upper bound on the average amount of bipartite entanglement between 𝐿 and 𝐶,𝑅 that can be generated in time 𝑡 by such architecture-respecting Hamiltonians in systems constrained by vertex bottlenecks, improving the scaling in the system size from 𝑂⁡(𝑁 𝐿⁢ 𝑡) to 𝑂⁡(√𝑁 𝐿⁢ 𝑡). As a special case, when applied to the star graph (i.e., one vertex connected to 𝑁 leaves), we obtain an Ω⁡(√𝑁 1−𝛿 ) lower bound on the routing time and on the time to prepare 𝑁/2 Bell pairs between the vertices. We also show that, in systems of free particles, we can route optimally on the star graph in time Θ⁡(√𝑁) using Hamiltonian quantum routing, obtaining a speedup over gate-based routing, which takes time Θ⁡(𝑁).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Asymptotic Relaxation of Moment Equations for a Multi-species, Homogeneous BGK Model

Multi-species BGK models describe the dynamics of rarefied gases with constituent particles of different elements or compounds with potentially nontrivial velocity distributions. Here, in this paper, moment equations for the bulk velocities, energies, and temperatures of a spatially homogeneous multi-species BGK model are examined. A key challenge in analyzing these equations is the fact that the collision frequencies are allowed to depend on the species temperatures, which allows for more realistic simulations of dilute gas flow. Therefore, a positive lower bound is established for the species temperatures. With this lower bound, a global existence and uniqueness of solutions to the coupled velocity-energy ODE system is established. The lower bound also enables a proof of exponential decay to a unique steady-state solution. Numerical results are presented to demonstrate how the bulk velocities and temperatures relax for large times.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Scalable Experimental Bounds for Entangled Quantum State Fidelities

Estimating the state preparation fidelity of highly entangled states on noisy intermediate-scale quantum (NISQ) devices is important for benchmarking and application considerations. Unfortunately, exact fidelity measurements quickly become prohibitively expensive, as they scale exponentially as O(3 N for N-qubit states, using full state tomography with measurements in all Pauli bases combinations. However, Somma et al.established that the complexity could be drastically reduced when looking at fidelity lower bounds for states that exhibit symmetries, such as Dicke states and GHZ states. These bounds must still be tight enough for larger states to provide reasonable estimations on NISQ devices. For the first time and more than 15 years after the theoretical introduction, we report meaningful lower bounds for the state preparation fidelity of all Dicke states up to N=10 and all GHZ states up to N=20 on Quantinuum H1 ion-trap systems using efficient implementations of recently proposed scalable circuits for these states. Our achieved lower bounds match or exceed previously reported exact fidelities on superconducting systems for much smaller states. Furthermore, we provide evidence that for large Dicke states |$D^{N}_{N/2}\rangle$, we may resort to a GHZ-based approximate state preparation to achieve better fidelity. This work provides a path forward to benchmarking entanglement as NISQ devices improve in size and quality.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Trajectory-independent speed limits for controlled open quantum systems

Existing quantum speed limits for controlled open quantum systems depend on the specified trajectory. For example, lower bounds on quantum annealing times in the presence of dissipation depend explicitly on the chosen annealing schedule. Recently, schedule-independent speed limits have been derived for annealing in the closed quantum system setting [L. P. García-Pintos et al ., SciPost Phys. 18 , 159 (2025)]. In this work, we generalize these results to open quantum systems, deriving schedule-independent lower bounds for quantum annealing times in systems described by a Lindblad master equation. We analyze the interplay between coherent control and dissipation in single- and two-qubit examples, demonstrating that the derived lower bounds capture key scaling behavior with respect to the strength of the dissipator. Finally, we apply the bound to thermal state preparation and show that the bound matches the expected asymptotic behavior for an Ising model in the high-temperature limit.

open quantum systems & decoherence↗
DOE OSTI2025

Mutual information bounded by Fisher information

We derive a general upper bound to mutual information in terms of the Fisher information. The bound may be further used to derive a lower bound for the Bayesian quadratic cost. These two provide alternatives to other inequalities in the literature (e.g., the van Trees inequality) that are useful also for cases where the latter ones give trivial bounds. We then generalize them to the quantum case, where they bound the Holevo information in terms of the quantum Fisher information. We illustrate the usefulness of our bounds with a case study in quantum phase estimation. Here, they allow us to adapt to mutual information (useful for global strategies where the prior plays an important role), the known and highly nontrivial bounds for the Fisher information in the presence of noise. The results are also useful in the context of quantum communication, both for continuous and discrete alphabets. Published by the American Physical Society 2025

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Hydroboost

HydroBoost is the most realistic revenue optimization tool for the hybridization of hydropower and battery energy storage systems to date. The innovative representation of how operators actually schedule hydropower in practice results in more realistic predictions of revenue and operations. Unlike other optimization tools, HydroBoost generates forecast energy prices with uncertainty to use in the optimization. This allows HydroBoost to give users a range of potential revenue with an upper bound using the perfect foresight pricing and a lower bound using a naive persistence forecast model. Additional forecast can be generated and used in the optimization, such as additive models, random forest, and neural networks to give further insight into potential revenue. HydroBoost has been designed to be applicable for both run-of-river and reservoir storage sites. The primary focus is on the day-ahead market and requires year-long data with an hour time-step. All time-series input and constraints are contained in an Excel worksheet for convince. The user will run the forecasting generation first with a Python script to give the optimization model the necessary requirements. Next the optimization is ran using Julia and results are generated and stored into a directory as csv files. HydroBoost includes an additional module to generate figures based on the results of the optimization simulation. The results help analyze the results and users to draw insights into how the hydro and battery systems are operated and the revenue each is producing. Additionally, the difference between the perfect foresight model and models that include forecast can easily be inspected.

Phillips, TylerB. [Idaho National Laboratory (INL)↗
DOE OSTI2026

Boomerang mechanism explaining the excess radio background

We propose a boomerang mechanism for the explanation of the excess radio background detected by ARCADE 2. In an early stage of the Universe, at a temperature 𝑇 in the range ∼ 0.1 keV−⁢1 MeV, a fraction of relic neutrinos is resonantly converted into dark neutrinos by mixing induced by a preexisting lepton asymmetry. Dark neutrinos decay much later into a dark-standard photon state and a dark fermion, with a lifetime longer than the age of the Universe, as required by a solution to the excess radio background. This scenario circumvents the upper bound on the neutrino magnetic moment but still implies a testable lower bound.

Dev, P. S. Bhupal [Washington Univ., St. Louis, MO↗
DOE OSTI2026

Testing Scale-Dependent Modified Gravity with DESI DR1

The Dark Energy Spectroscopic Instrument (DESI) provides an unprecedented opportunity to test deviations from general relativity (GR) that introduce a new physical scale within its redshift range. Using the connection between a Yukawa-like potential and the Hu-Sawicki $f(R)$ model, we place strong constraints on the range of a hypothetical fifth force mediated by a massive scalar field. We analyze the power spectrum measurements from DESI Data Release 1 using a baseline EFT model that employs the fkpt approach for the loop integrals. We find no evidence for deviations from GR and obtain the constraint $\log_{10} |f_{R_0}| < -4.59$ (95% C.L.). This corresponds to an upper bound at redshift zero on the scale at which corrections to GR become important, $λ< 17.81$ Mpc, or equivalently, a lower bound on the mass of the additional gravitational mediator of $m_ϕ> 3.60 \times 10^{-31}$ eV. We find that the modified gravity parameter $f_{R_0}$ is largely orthogonal to the cosmological parameters in the model, such that no additional projection effects relative to the GR case are introduced in this Full-Shape analysis. Furthermore, a second modified gravity parameter, the power index $n$, which modulates the time-variation of the associated mass, is found to be consistent with previous analyses that fixed it to unity. Adding DESI BAO data or other cosmological probes does not significantly change these results. The conclusions remain similar if the background evolution is described by evolving dark energy instead of a cosmological constant. Additionally, we test the robustness of the baseline model by varying the maximum wavenumber used in the Full-Shape analysis and analyzing the DESI targets separately. Finally, we analyze the degeneracies between the modified-gravity parameters and the sum of neutrino masses.

Gonzalez, D. [Guanajuato U.; UNAM, CCF] (ORCID:000↗
DOE OSTI2026

Optimal sensing on an asymmetric exceptional surface

We study the connection between exceptional points (EPs) and optimal parameter estimation, in a simple system consisting of two counterpropagating traveling wave modes in a microring resonator. The unknown parameter to be estimated is the strength of a perturbing cross-coupling between the two modes. Partially reflecting the output of one mode into the other creates a non-Hermitian Hamiltonian that exhibits a family of EPs, creating an exceptional surface (ES). We use a fully quantum treatment of field inputs and noise sources to obtain a quantitative bound on the estimation error by calculating the quantum Fisher information (QFI) in the output fields, whose inverse gives the Cramér-Rao lower bound on the mean-squared error of any unbiased estimator. We determine the bounds for two input states, namely, a semiclassical coherent state and a highly nonclassical NOON state. We find that the QFI is enhanced in the presence of an EP for both of these input states and that both states can saturate the Cramér-Rao bound. We then identify idealized yet experimentally feasible measurements that achieve the minimum bound for these two input states. We also investigate how the QFI changes for parameter values that do not lie on the ES, finding that these can have a larger QFI, suggesting alternative routes to optimize the parameter estimation for this problem.

Exceptional points↗
DOE OSTI2025

Resource Adequacy and Capital Cost Considerations Pertaining to Large Electric Grids Powered by Wind, Solar, Storage, Gas, and Nuclear

The capacity and generation of wind, solar, storage, nuclear, and gas are estimated for large, idealized copper-plate electric grids. Wind and solar penetrations of 30% to 80% are considered together with different storage systems such as vanadium and lithium-ion batteries, pumped hydroelectric, compressed air, and hydrogen. In addition to a baseline dispatchable fleet without wind/solar, two bounding cases with wind/solar are analyzed: one without storage and one where the whole wind/solar fleet is connected to the storage system, hence providing a buffer between the wind/solar fleet and the grid. The reality will likely be somewhere between these bounding cases. The viability of a power grid with a large wind/solar penetration and no storage is not guaranteed but was nonetheless considered to provide a lower-bound capital cost estimate. Overall, the options that rely strongly on wind, solar, and storage could be significantly more capital-intensive than those that rely strongly on nuclear, depending on the amount of storage necessary to ensure grid stability. This is especially true in the long run because wind, solar, and storage assets have shorter lifetimes than nuclear plants and, consequently, need to be replaced more frequently. More analyses (e.g., grid stability and public acceptance) are necessary to determine which option is most likely to provide the path of least resistance to powering a clean, affordable, and reliable grid in a timely manner. Depending on the priorities, the path of least resistance may not necessarily be the one that is less capital intensive.

adequacy↗
DOE OSTI2025

Features of mid- and high-latitude low-level clouds and their relation to strong aerosol effects in the Energy Exascale Earth System Model version 2 (E3SMv2)

The E3SMv2 model, like various other global models that include representations of aerosol–cloud interactions, uses an empirically chosen lower bound on the simulated in-cloud cloud droplet number concentration (CDNC) to help constrain the effective radiative forcing of anthropogenic aerosols, ERFaer. This study identifies where ultra-low CDNCs (i.e., concentrations lower than 10 cm−3) occur in the stratiform and shallow convective clouds simulated by E3SMv2 and which of the occurrences have the strongest impact on ERF aer . Process-level analyses are presented to reveal characteristics of the cloud droplet formation and removal processes associated with impactful ultra-low CDNCs. Simulations performed with present-day emissions show that ultra-low CDNCs are most frequently found over the mid- and high-latitude oceans in both hemispheres, while the occurrences are also frequent in polluted continental regions despite the high aerosol concentrations. Ultra-low CDNCs with the largest impacts on the simulated regional and global mean ERF aer are found in the lower troposphere in the Northern Hemisphere middle and high latitudes. These cases are typically associated with large cloud fractions, strong water vapor condensation, weak turbulence, and lack of cloud droplet nucleation from aerosol activation. Under such atmospheric conditions, boosting aerosol activation and enhancing turbulent mixing of cloud droplet number can increase the simulated CDNCs, although the magnitude of the global mean ERF aer increases undesirably. The reason for this model behavior is discussed. Overall, our study suggests that mid- and high-latitude low-level stratus occurring under weak turbulence is a cloud regime worth further investigating for the purpose of identifying and addressing the root causes of ultra-low CDNCs and strong ERF aer in E3SM.

Aerosol-Cloud Interaction↗
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

Thermal energy mitigation and toroidal peaking effects in JET disruptions

Previous investigations on JET suggest half or less of plasma stored thermal energy W th is radiated (f rad,th ≲ 0.5) using either massive gas injection (MGI) or shattered pellet injection (SPI) disruption mitigation. We investigate whether the apparent incomplete f rad,th is explained by radiation peaking near the injection plume. High toroidal peaking throughout the pre-thermal quench is found in argon–deuterium MGI on JET, with typically >3× higher radiation near the injector than toroidally distant. Previously unexplained toroidal bolometry measurements in neon–deuterium SPI are reproduced with similar peaking using the Emis3D radiation analysis code. These observations align with results from Alcator C-Mod and KSTAR. This peaking is not captured by previous JET studies that found poor thermal mitigation. Two sets of neon–deuterium SPI and two sets of argon–deuterium MGI are analyzed using Emis3D. In SPI, f rad,th rises from no-plume estimates of 0.31 and 0.66 to lower bounds of 0.84 and 0.92, respectively, and f rad,th ∼ 1 is possible. In MGI, the toroidal spread of the peaking feature is poorly constrained. f rad,th up to 0.85 and 0.65 are possible using the largest possible spread, increasing from 0.42 and 0.28, although f rad,th ∼ 1 does not appear to be reached. Revised mitigation estimates on JET suggest a lower melt risk to the divertor in mitigated disruptions on ITER and SPARC than previously thought. However, peaking near injectors could increase flash melting risk on nearby plasma facing components.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗