Search NASA⌕ Search

SEARCH · Search NASA

Results for “Checking”

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

Low-Density Parity-Check Codes as Stable Phases of Quantum Matter

Phases of matter with robust ground-state degeneracy, such as the quantum toric code, are known to be capable of robust quantum information storage. Here, we address the converse question: given a quantum error-correcting code, when does it define a stable gapped quantum phase of matter, whose ground-state degeneracy is robust against perturbations in the thermodynamic limit? We prove that a low-density parity-check (LDPC) code defines such a phase, robust against all few-body perturbations, if its code distance grows at least logarithmically in the number of degrees of freedom, and it exhibits “check soundness.” Many constant-rate quantum LDPC expander codes have such properties, and define stable phases of matter with a constant zero-temperature entropy density, violating the third law of thermodynamics. Our results also show that quantum toric-code phases are robust to spatially nonlocal few-body perturbations. Similarly, phases of matter defined by classical codes are stable against symmetric perturbations. In the classical setting, we present improved locality bounds on the quasiadiabatic evolution operator between two nearby states in the same code phase.

quantum error correction↗
DOE OSTI2025

Idiomatic Correctness-Checking via Julienne in Fortran 2023

This paper presents a unified approach to unit testing and runtime assertion checking using Fortran 2023. The paper describes the support for our approach in the Julienne framework. Julienne leverages recent Fortran standards to implement object-oriented design patterns, support testing parallel programs, and implement functional programming patterns in order to craft idioms inspired by natural-language expressions. The presented idioms employ novel operators to write expressions that evaluate to a test-diagnosis object encapsulating two components: (1) the test outcome or assertion outcome and (2) an automatically generated diagnostic string. Two other novel aspects of the approach include (1) the ability to enforce assertions inside pure procedures and (2) the ability to output rich diagnostic information inside pure procedures during error termination when assertions fail. The latter capability mitigates against a reason that Fortran programmers commonly cite for not writing pure procedures: difficulty obtaining useful program output inside pure procedures when debugging code. This paper demonstrates how the adoption of the proposed idioms leads naturally to a unifying theme across two otherwise disparate technologies: unit testing and runtime assertion checking. Finally, this paper describes the usage of the Julienne testing framework for writing unit tests and assertions in the Matcha high-performance computing application and the Fiats deep learning library.

Rouson, Damian↗
DOE OSTI2025

Low-Density Parity-Check Stabilizer Codes as Gapped Quantum Phases: Stability under Graph-Local Perturbations

We generalize the proof of stability of topological order, due to Bravyi, Hastings, and Michalakis, to stabilizer Hamiltonians corresponding to low-density parity-check (LDPC) codes without the restriction of geometric locality in Euclidean space. We consider Hamiltonians 𝐻 0 defined by ⟦𝑁,𝐾,𝑑⟧ LDPC codes, which obey certain topological quantum order conditions: (i) code distance 𝑑 ≥ 𝑐⁢log (𝑁), implying local indistinguishability of ground states, and (ii) a mild condition on local and global compatibility of ground states—these include good quantum LDPC codes and the toric code on a hyperbolic lattice, among others. We consider stability under weak perturbations that are quasilocal on the interaction graph defined by 𝐻 0 and that can be represented as sums of bounded-norm terms. As long as the local perturbation strength is smaller than a finite constant, we show that the perturbed Hamiltonian has well-defined spectral bands originating from the 𝑂⁡(1) smallest eigenvalues of 𝐻 0 . The band originating from the smallest eigenvalue has 2 𝐾 states, is separated from the rest of the spectrum by a finite energy gap, and has exponentially narrow bandwidth 𝛿 =𝐶⁢𝑁⁢𝑒 −Θ⁡(𝑑) , which is tighter than the best-known bounds even in the Euclidean case. We also obtain that the new ground-state subspace is related to the initial-code subspace by a quasilocal unitary, allowing one to relate their physical properties. Our proof uses an iterative procedure that performs successive rotations to eliminate non-frustration-free terms in the Hamiltonian. Our results extend to quantum Hamiltonians built from classical LDPC codes, which give rise to stable symmetry-breaking phases. These results show that LDPC codes very generally define stable gapped quantum phases, even in the non-Euclidean setting, initiating a systematic study of such phases of matter.

mathematical physics↗
DOE OSTI2025

Architecture for fast implementation of quantum low-density parity-check codes with optimized Rydberg gates

Here, we propose an implementation of bivariate bicycle codes [S. Bravyi et al., Nature (London) 627, 778 (2024)] based on long-range Rydberg gates between stationary neutral atom qubits. An optimized layout of data and ancilla qubits reduces the maximum Euclidean communication distance needed for nonlocal parity-check operators. An optimized Rydberg gate pulse design enables 𝖢𝖹 entangling operations with fidelity $\mathscr{F}$ >0.999 at a distance greater than 12 µ⁢m. The combination of optimized layout and gate design leads to a quantum error correction cycle time of ∼1.2⁢8 ms for a [[144,12,12]] code, which is nearly a factor-of-two improvement over previous designs.

Poole, C. [Univ. of Wisconsin, Madison, WI (United↗
DOE OSTI2025

Toward a 2D Local Implementation of Quantum Low-Density Parity-Check Codes

Geometric locality is an important theoretical and practical factor for quantum low-density parity-check (qLDPC) codes that affects code performance and ease of physical realization. For device architectures restricted to two-dimensional (2D) local gates, naively implementing the high-rate codes suitable for low-overhead fault-tolerant quantum computing incurs prohibitive overhead. In this work, we present an error-correction protocol built on a bilayer architecture that aims to reduce operational overheads when restricted to 2D local gates by measuring some generators less frequently than others. We investigate the family of bivariate-bicycle qLDPC codes and show that they are well suited for a parallel syndrome-measurement scheme using fast routing with local operations and classical communication (LOCC). Through circuit-level simulations, we find that in some parameter regimes, bivariate-bicycle codes implemented with this protocol have logical error rates comparable to the surface code while using fewer physical qubits. Published by the American Physical Society 2025

Berthusen, Noah (ORCID:0000000275862786)↗
DOE OSTI2026

Spot-Checking for Reliable Quantum Communications

We demonstrate a spot-checking approach for real-time drift estimation and mitigation in continuously operating quantum links. Using polarization-entangled photon pairs, we achieve stable 16-hour operation, validating efficient, minimally invasive monitoring of quantum-network performance.

Zhang, Yanbao [ORNL] (ORCID:0000000245530561)↗
DOE OSTI2025

Bell-State Bootstrapping via Spot-Checking

We present a spot-checking method to monitor and mitigate errors in imperfect entangled photon sources from semi-trusted third parties. We demonstrate that our method effectively mitigates polarization drifts and yields high-fidelity polarization-entangled Bell-state generation.

Zhang, Yanbao [ORNL] (ORCID:0000000245530561)↗
DOE OSTI2024

Electrothermal vaporization as a new method for pre-inspection check samples

The use of electrothermal vaporization (ETV) has not been readily applied to nuclear safeguards or pre inspection check (PIC) sample analysis, even though the technique is ideally suited for low level (pg) isotopic quantification due to its high analyte transport efficiency. Here demonstrate the ETV method for PIC safeguard analysis. The ETV system is an automated, commercial of the shelf (COTS) technology, with the capability to introduce solid samples to a mass spectrometer platform. The system has been shown to simultaneously determine uranium assay, and the major isotopic ratios for uranium and plutonium. The ETV unit has demonstrated analysis up to 50 samples a day autonomously. The utilization of this ETV methodology provide a secondary option to the current PIC analysis and offers high throughput, enhanced sensitivity, and broader isotopic detection platform.

Hexel, Cole↗
DOE OSTI2025

Detecting Short Circuits: Post Accident Electric Vehicle Battery Safety Check

Fast and accurate detection of soft short circuits (SCs) in the battery packs of damaged electric vehicles is needed by first responders and mechanics to mitigate the potential risk from battery fires that may occur hours, days, or weeks after an accident. Here, this paper presents an SC-detection algorithm for potentially damaged lithium-ion batteries that works quickly and without a priori knowledge of the battery-pack chemistry, capacity, state of charge, or state of health. The proposed universal SC-detection algorithm is designed to be implemented on an inexpensive handheld device that can connect to and monitor the voltages of all cells in a pack. Transient filtering and linear-quadratic state observation provide estimates of normalized SC current for every cell in the pack. Cells with SC-current estimates outside a sigma-based threshold are detected. Simulations, experiments, and electric vehicle (EV) crash data are used to verify the speed, sensitivity, and accuracy of the method, demonstrating 96% accurate detection of 0.0027 C SCs in under 1 h for 5S cell groups in the lab and no false positives for crashed Volkswagen, Chevrolet, and Tesla vehicles without SCs.

25 - ENERGY STORAGE↗
DOE OSTI2025

When to vaccinate for seasonal influenza: check the peak forecast

Background Seasonal influenza infects 5-20% of people every year in the United States, resulting in hospitalizations, deaths, and adverse economic impacts. To mitigate these impacts, influenza vaccines are developed and distributed annually; however, growing evidence suggests that vaccine effectiveness (VE) wanes over the course of a flu season. Delaying influenza vaccination for older adults has attracted attention as a potential public health strategy. However, given the uncertainties in seasonal peak, vaccine effectiveness, and waning rates, postponing vaccination could also lead to increased morbidity, motivating an evaluation of a range of potential scenarios. The aim of this study was to investigate favorable age group-specific vaccination schedules that could lead to the greatest disease burden reduction. Methods We systematically investigated a broad range of vaccination start times for five age groups under six combinations of initial effectiveness and waning rates, based on influenza cases and vaccine uptake data from 10 influenza seasons. We defined the most favorable vaccination schedule as the one that resulted in the greatest reduction in disease burden. Results In scenarios with fast waning, all age groups benefit from delaying vaccination regardless of initial VE and peak timing. In scenarios with slower waning, results are mixed. For the ≥65 group, high initial VE and slow waning suggests that in early-peaking seasons, early vaccination most effectively reduces disease burden, while in late-peaking seasons delaying vaccination is most effective. For the ≥65 group in medium and low initial VE, and slow waning scenarios, delaying vaccination appears to prevent the greatest number of cases, regardless of whether the season peaks early or late. Conclusion The most favorable vaccination schedule is sensitive to changes in initial VE, waning rate, and peak timing. Given estimates of these quantities from statistical and immunological models and observations, our methods can inform vaccination recommendations in order to most effectively reduce the annual disease burden caused by seasonal influenza. Specifically, accurate peak timing forecasts for the upcoming season have the potential to guide decisions on when to vaccinate.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Technical Track on Biomass Carbon Removal and Storage (BiCRS): Mapping bioresources, phase 1 - Consistency check comparing Mission Innovation’s Data Visualization Tool for Bioresources and the Clean Energy Ministerial Biofuture Initiative Global Biomass data accessible via the US Department of Energy’s Bioenergy Knowledge Discovery Framework (KDF)

The Mission Innovation (MI) Carbon Dioxide Removal (CDR) Mission, Technical Track on Biomass Carbon Dioxide Removal and Storage (BiCRS), has produced a biomass resource database for its members. In parallel, Oak Ridge National Laboratory (ORNL) developed the International Feedstock Reporting data portal—herein referred to as the CEM Biofuture-KDF data—on behalf of the Clean Energy Ministerial Biofuture Initiative (CEM Biofuture), as a specific task under Biofuture’s 2024–25 Action Plan. This work was conducted at the request of CEM Biofuture and funded by the U.S. Department of Energy in support of that initiative, and it is hosted within DOE’s Knowledge Discovery Framework (KDF).

09 BIOMASS FUELS↗
DOE OSTI2026

Checking It Twice: Using [C/N] Masses and Asteroseismic Masses as a Diagnostic of Mass Loss and Transfer on the Red Giant Branch

Red giants experience significant mass loss, but the mechanism is poorly understood. The surface [C/N] of red giants is correlated with birth mass but not directly impacted by mass loss. Exploiting this, we compare asteroseismic masses of red giants with the same [C/N] but different evolutionary states. We find bulk differences between stars at the beginning of the red giant branch (RGB) and in the subsequent evolutionary phase, the red clump, providing a direct constraint on the strength of net RGB mass loss in field stars. We find that net mass loss decreases with metallicity and mass, matching recent studies for field giants but contradicting expectations from the widely used Reimers’s mass-loss formula. We propose a mass- and metallicity-dependent Reimers’s η calibration that reproduces the empirical trends that we see. In addition, we identify 200 stars (3.12% of our sample) that are clear outliers from their population in these birth mass bins, which we believe are likely candidates for mass transfer events. These stars do not show any obvious discrepancies in abundances or binary properties from their counterparts. This population should be accounted for in Galactic archeological studies. Further follow-up is required to quantify their occurrence rate and origin.

Roberts, John D. [The Ohio State Univ., Columbus, ↗
DOE OSTI2024

QED: A Powerful Query Equivalence Decider for SQL

Checking query equivalence is of great significance in database systems. Prior work in automated query equivalence checking sets the first steps in formally modeling and reasoning about query optimization rules, but only supports a limited number of query features. In this paper, we present Qed, a new framework for query equivalence checking based on bag semantics. Qed uses a new formalism called Q-expressions that models queries using different normal forms for efficient equivalence checking, and models features such as integrity constraints and NULLs in a principled way unlike prior work. Our formalism also allows us to define a new query fragment that encompasses many real-world queries with a complete equivalence checking algorithm, assuming a complete first-order theory solver. Empirically, Qed can verify 299 out of 444 query pairs extracted from the Calcite framework and 979 out of 1287 query pairs extracted from CockroachDB, which is more than 2× the number of cases proven by prior state-of-the-art solver.

Computer Science↗