Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mathematics and Computing, Computer science”

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 469 records · Page 26
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

On the degeneracy of spin ice graphs, and its estimate via the Bethe permanent

The concept of spin ice can be extended to a general graph. We study the degeneracy of spin ice graph on arbitrary interaction structures via graph theory. We map spin ice graphs to the Ising model on a graph and clarify whether the inverse mapping is possible via a modified Krausz construction. From the gauge freedom of frustrated Ising systems, we derive exact, general results about frustration and degeneracy. We demonstrate for the first time that every spin ice graph, with the exception of the one-dimensional Ising model, is degenerate. We then study how degeneracy scales in size, using the mapping between Eulerian trails and spin ice manifolds, and a permanental identity for the number of Eulerian orientations. Furthermore, we show that the Bethe permanent technique provides both an estimate and a lower bound to the frustration of spin ices on arbitrary graphs of even degree. While such a technique can also be used to obtain an upper bound, we find that in all finite degree examples we studied, another upper bound based on Schrijver inequality is tighter.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Dark energy survey year 3 results: Cosmological constraints from cluster abundances, weak lensing, and galaxy clustering

Galaxy clusters provide a unique probe of the late-time cosmic structure and serve as a powerful independent test of the Λ⁢CDM model. This work presents the first set of cosmological constraints derived with ∼16,000 optically selected redMaPPer clusters across nearly 5000 deg 2 using DES year 3 datasets. Our analysis leverages a consistent modeling framework for galaxy cluster cosmology and DES-Y3 joint analyses of galaxy clustering and weak lensing (3 × 2⁢pt), ensuring direct comparability with the DES-Y3 3 × 2⁢pt analysis. Here, we obtain constraints of 𝑆 8 = 0.864 ± 0.035 and Ω m = $0.26⁢5^{+0.019}_{−0.031}$ from the cluster-based data vector. We find that cluster constraints and 3 × 2⁢pt constraints are consistent under the Λ⁢CDM model with a posterior predictive distribution (PPD) value of 0.53. The consistency between clusters and 3 × 2⁢pt provides a stringent test of Λ⁢CDM across different mass and spatial scales. Jointly analyzing clusters with 3 × 2⁢pt further improves cosmological constraints, yielding 𝑆 8 = $0.81⁢1^{+0.022}_{−0.020}$ and Ω m = $0.29⁢4^{+0.022}_{−0.033}$, a 24% improvement in the Ω m − 𝑆 8 figure of merit over 3 × 2⁢pt alone. Moreover, we find no significant deviation from the Planck CMB constraints with a probability to exceed (PTE) value of 0.6, significantly reducing previous 𝑆 8 tension claims. Finally, combining DES 3 × 2⁢pt, DES clusters, and Planck CMB places an upper limit on the sum of neutrino masses of ∑𝑚 𝜈 < 0.26 eV at 95% confidence under the Λ⁢CDM model. These results establish optically selected clusters as a key cosmological probe and pave the way for cluster-based analyses in upcoming stage-IV surveys such as LSST, Euclid, and Roman.

Abbott, T. M. C. [NSF’s National Optical-Infrared ↗
DOE OSTI2020

Recovery of Damaged Information and the Out-of-Time-Ordered Correlators

The evolution with a complex Hamiltonian generally leads to information scrambling. A time-reversed dynamics unwinds this scrambling and thus leads to the original information recovery. In this work, we show that if the scrambled information is, in addition, partially damaged by a local measurement, then such a damage can still be treated by application of the time-reversed protocol. This information recovery is described by the long-time saturation value of a certain out-of-time-ordered correlator of local variables. We also propose a simple test that distinguishes between quantum and reversible classical chaotic information scrambling.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Nonadiabatic Phase Transition with Broken Chiral Symmetry

We explore nonadiabatic quantum phase transitions in an Ising spin chain with a linearly time-dependent transverse field and two different spins per unit cell. Such a spin system passes through critical points with gapless excitations, which support nonadiabatic transitions. Nevertheless, we find that the excitations on one of the chain sublattices are suppressed in the nearly adiabatic regime exponentially. Furthermore, we reveal a coherent mechanism to induce exponentially large density separation for different quasiparticles.

1-dimensional spin chains↗
DOE OSTI2022

Variational quantum algorithm for estimating the quantum Fisher information

The quantum Fisher information (QFI) quantifies the ultimate precision of estimating a parameter from a quantum state and can be regarded as a reliability measure of a quantum system as a quantum sensor. However, estimation of the QFI for a mixed state is in general a computationally demanding task. In this paper we present a variational quantum algorithm called variational quantum Fisher information estimation (VQFIE) to address this task. By estimating lower and upper bounds on the QFI, based on bounding the fidelity, VQFIE outputs a range in which the actual QFI lies. This result can then be used to variationally prepare the state that maximizes the QFI, for the application of quantum sensing. In contrast to previous approaches, VQFIE does not require knowledge of the explicit form of the sensor dynamics. We simulate the algorithm for a magnetometry setup and demonstrate the tightening of our bounds as the state purity increases. For this example, we compare our bounds with literature bounds and show that our bounds are tighter.

97 MATHEMATICS AND COMPUTING↗