Search NASA⌕ Search

SEARCH · Search NASA

Results for “error correction.”

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 271 records · Page 15

Counting Kmers for Biological Sequences at Large Scale

Counting the abundance of all the distinct kmers in biological sequence data is a fundamental step in bioinformatics. These applications include de novo genome assembly, error correction, etc. With the development of sequencing technology, the sequence data in a single project can reach Petabyte-scale or Terabyte-scale nucleotides. Counting demand for the abundance of these sequencing data is beyond the memory and computing capacity of single computing node, and how to process it efficiently is a challenge on a high-performance computing cluster. As such, we propose SWAPCounter, a highly scalable distributed approach for kmer counting. This approach is embedded with an MPI streaming I/O module for loading huge data set at high speed, and a counting bloom filter module for both memory and communication efficiency. By overlapping all the counting steps, SWAPCounter achieves high scalability with high parallel efficiency. In this work, the experimental results indicate that SWAPCounter has competitive performance with two other tools on shared memory environment, KMC 2 , and MSPKmerCounter. Moreover, SWAPCounter also shows the highest scalability under strong scaling experiments. In our experiment on Cetus supercomputer, SWAPCounter scales to 32,768 cores with 79% parallel efficiency (using 2048 cores as baseline) when processing 4 TB sequence data of 1000 Genomes. The source code of SWAPCounter is publicly available at https://github.com/mengjintao/SWAPCounter.

59 BASIC BIOLOGICAL SCIENCES↗

Mass Spectral Library Quality Assurance by Inter-Library Comparison

A method to discover and correct errors in mass spectral libraries is described. Comparing across a set of highly curated reference libraries compounds that have the same chemical structure quickly identifies entries that are outliers. In cases where three or more entries for the same compound are compared, the outlier as determined by visual inspection was almost always found to contain the error. These errors were either in the spectrum itself or in the chemical descriptors that accompanied it. The method is demonstrated on finding errors in compounds of forensic interest in the NIST/EPA/NIH Mass Spectral Library. The target list of compounds checked was the Scientific Working Group for the Analysis of Seized Drugs (SWGDRUG) mass spectral library. Some examples of errors found are described. A checklist of errors that curators should look for when performing inter-library comparisons is provided. .

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Compact video content representation for video coding using low multi-linear tensor rank approximation with dynamic core tensor order

Tensor is a multi-way representation of an entity that is widely used in many applications of mathematics and physics. The wide range of tensor algebra operations attract the researchers of graphical and vision field to identify unique methods for various applications such as segmentation, compression, indexing and so on. In this paper, low multi-linear rank approximation of a tensor is used for decomposition so as to perform compression on a video that is represented as a 4D tensor. Thus, the encoder has blocks for (1) multilinear rank approximation method so as to aid decomposition, (2) sparsity removal of residual data to reduce the required memory storage to a small level, (3) quantization on the sparse less residual data and (4) LZ77 dictionary coding for the video. The decoder uses a tensor reconstruction block along with residual error correction block that reduces loss/error in the reconstructed video. The size of core tensor is an important factor in rank approximation. It is identified at run time depending on the video contents. This size is determined adaptively using Tikhonov’s regularization method. The best value of core tensor size is identified with the corner of L-curve which preserves the video contents from heavy loss/error. Experimental results of the proposed work on comparison with H.264/AVC compression method indicate that the proposed method achieves up to 10% improvement in compression ratio with the least amount of loss and a maximum signal to noise ratio of 0.14. The proposed system gives better compression ratio than H.265 for videos with more number of frames without compromising quality.

97 MATHEMATICS AND COMPUTING↗

Causality-respecting adaptive refinement for PINNs: enabling precise interface evolution in phase field modeling

Physics-informed neural networks (PINNs) have emerged as a powerful tool for solving physical systems described by partial differential equations (PDEs). However, their accuracy in dynamical systems, particularly those involving sharp moving boundaries with complex initial morphologies, remains a challenge. Here, this study introduces an approach combining residual-based adaptive refinement (RBAR) with causality-informed training to enhance the performance of PINNs in solving spatio-temporal PDEs. Our method employs a three-step iterative process: initial causality-based training, RBAR-guided domain refinement, and subsequent causality training on the refined mesh. Applied to the Allen-Cahn equation, a widely-used model in phase field simulations, our approach demonstrates significant improvements in solution accuracy and computational efficiency over traditional PINNs. Notably, we observe an ‘overshoot and relocate’ phenomenon in dynamic cases with complex morphologies, showcasing the method’s adaptive error correction capabilities. This synergistic interaction between RBAR and causality training enables accurate capture of interface evolution, even in challenging scenarios where traditional PINNs fail. Our framework not only resolves the limitations of uniform refinement strategies but also provides a generalizable methodology for solving a broad range of spatio-temporal PDEs. The enhanced performance of the RBAR–causality combined framework demonstrates its strong potential for advancing PINN-based modeling of physical systems characterized by complex, evolving interfaces.

Allen-Cahn equations↗

Gauge structures: From stabilizer codes to continuum models

Stabilizer codes are a powerful method for implementing fault-tolerant quantum memory and in the case of topological codes, they form useful models for topological phases of matter. In this paper, we discuss the theory of stabilizer codes as a discrete version of a linear gauge structure, a concept we introduce here. A linear gauge structure captures all the familiar ingredients of U(1) gauge theory including a generalization of charge conservation, Maxwell equations and topological terms. Using this connection, we prove some important results for stabilizer codes which can be used to characterize their error-correction properties. However, this perspective does not depend on any particular Hamiltonian or Lagrangian, which as a consequence is agnostic to the source of the gauge redundancy. Based upon the connection to stabilizer codes, we view the source of the gauge redundancy as an ambiguity in the tensor product structure of the Hilbert space. That is, the gauge provides a set of equivalent but arbitrary ways to factorize the Hilbert space. We apply this formalism to the d=2 and 3 toric code as well as the paradigm fracton models, X-Cube and Haah’s cubic code. From this perspective, we are able to map all these models to some continuum version which captures all or some of the fractonic and topological features of their parent discrete models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Geometry and entanglement in the scattering matrix

A formulation of nucleon–nucleon scattering is developed in which the S-matrix, rather than an effective-field theory (EFT) action, is the fundamental object. Spacetime plays no role in this description: the S-matrix is a trajectory that moves between RG fixed points in a compact theory space defined by unitarity. This theory space has a natural operator definition, and a geometric embedding of the unitarity constraints in four-dimensional Euclidean space yields a flat torus, which serves as the stage on which the S-matrix propagates. Trajectories with vanishing entanglement are special geodesics between RG fixed points on the flat torus, while entanglement is driven by an external potential. The system of equations describing S-matrix trajectories is in general complicated, however the very-low-energy S-matrix –that appears at leading-order in the EFT description– possesses a UV/IR conformal invariance which renders the system of equations integrable, and completely determines the potential. In this geometric viewpoint, inelasticity is in correspondence with the radius of a three-dimensional hyperbolic space whose two-dimensional boundary is the flat torus. This space has a singularity at vanishing radius, corresponding to maximal violation of unitarity. The trajectory on the flat torus boundary can be explicitly constructed from a bulk trajectory with a quantifiable error, providing a simple example of a holographic quantum error correcting code.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The role of quantum computing in advancing scientific high-performance computing: A perspective from the ADAC institute

Quantum computing (QC) has gained significant attention over the past two decades due to its potential for speeding up classically demanding tasks. This transition from an academic focus to a thriving commercial sector is reflected in substantial global investments. While advancements in qubit counts and functionalities continue at a rapid pace, current quantum systems still lack the scalability for practical applications, facing challenges such as too high error rates and limited coherence times. Here, this perspective paper examines the relationship between QC and high-performance computing (HPC), highlighting their complementary roles in enhancing computational efficiency. It is widely acknowledged that even fully error-corrected QC will not be suited for all computational tasks. Rather, future compute infrastructures are anticipated to employ quantum acceleration within hybrid systems that integrate HPC and QC. While QC can enhance classical computing, traditional HPC remains essential for maximizing quantum acceleration. This integration is a priority for supercomputing centers and companies, sparking innovation to address the challenges of merging these technologies. The novelty of this work lies in its unique perspective, reflecting the collective insights of the Accelerated Data Analytics and Computing (ADAC) Institute, a global consortium of over 20 leading HPC centers. Recognizing the growing importance of QC, ADAC established a Quantum Computing Working Group in 2023 to foster collaboration and knowledge-sharing among its members. This paper synthesizes insights from the group’s collaborative efforts and incorporates findings from a member survey that captures shared experiences, ongoing projects, and strategic directions. By outlining the current landscape and challenges of QC integration into HPC ecosystems, this work offers HPC specialists practical and forward-looking guidance on the opportunities and implications of QC in computationally intensive endeavors.

Accelerated Data Analytics and↗

Comparison of continuum and cross-core theories of dynamic strain aging

Dynamic strain aging (DSA) is the process of solute atoms segregating around dislocations on the timescale of loading. Continuum theories of DSA derived from elasticity theory have been shown to severely overpredict both the timescale and strengthening of DSA. Recently, cross-core theory was developed to reconcile this gap, invoking a special single-atomic-hop diffusion mechanism across the core of an extended dislocation. In this work, we show that the classical continuum theory expression for the rate of solute segregation is in error. After correcting this error, we show that continuum theory predictions match cross-core theory when the elevated diffusivity near the dislocation core is accounted for. Finally, our findings indicate that continuum theory is still a useful tool for studying dislocation-solute interactions.

36 MATERIALS SCIENCE↗

Computing with a single qubit faster than the computation quantum speed limit

Here, the possibility to save and process information in fundamentally indistinguishable states is the quantum mechanical resource that is not encountered in classical computing. I demonstrate that, if energy constraints are imposed, this resource can be used to accelerate information-processing without relying on entanglement or any other type of quantum correlations. In fact, there are computational problems that can be solved much faster, in comparison to currently used classical schemes, by saving intermediate information in nonorthogonal states of just a single qubit. There are also error correction strategies that protect such computations.

97 MATHEMATICS AND COMPUTING↗

Pathway Complexity in the Stacking of Imine-Linked Macrocycles Related to Two-Dimensional Covalent Organic Frameworks

Interlayer interactions play an important role in the formation of two-dimensional covalent organic frameworks (2D COFs), yet the effects of monomer structure on COF formation, crystallinity, and susceptibility to exfoliation are not well understood. Here we probe these effects by studying the stacking behavior of imine-linked macrocycles that represent discrete models of 2D COFs. Specifically, macrocycles based on terephthaldehyde (PDA) or 2,5-dimethoxyterephthaldehyde (DMPDA) stack upon cooling molecularly dissolved solutions. Both macrocycles assemble cooperatively with similar Delta H-e values of -97 kJ/mol and -101 kJ/mol, respectively, although the DMPDA macrocycle assembly process showed a more straightforward temperature dependence. Density functional theory calculations of the stacking of PDA macrocycles suggested two stable configurations that were close in energy. Circular dichroism spectroscopy performed on macrocycles bearing chiral side chains revealed a helix reversion process for the PDA macrocycles that was not observed for the DMPDA macrocycles. Given the structural similarity of these monomers, these findings demonstrate that the stacking processes associated with nanotubes derived from these macrocycles, as well as for the corresponding COFs, are complex and susceptible to kinetic traps, casting doubt on the relevance of thermodynamic arguments for improving materials quality. Rather, a deeper understanding of the mechanism of supramolecular polymerization and its interplay with polymerization and error correction during COF synthesis is needed for improved control of the crystallinity and morphology of these emerging materials.

Wang, Shiwei↗

Determining the Ensemble N -Representability of Reduced Density Matrices

The N-representability problem for reduced density matrices remains a fundamental challenge in electronic structure theory. Following our previous work that employs a unitary-evolution algorithm based on an adaptive derivative-assembled pseudo-Trotter variational quantum algorithm to probe pure-state N-representability of reduced density matrices [J. Chem. Theory Comput. 2024, 20, 9968], in this work we propose a practical framework for determining the ensemble N-representability of a p-body matrix. This is accomplished using a purification strategy that embeds an ensemble state into a pure state defined on an extended Hilbert space, such that the reduced density matrices of the purified state reproduce those of the original ensemble. By iteratively applying variational unitaries to an initial purified state, the proposed algorithm minimizes the Hilbert-Schmidt distance between its p-body reduced density matrix and a specified target p-body matrix, which serves as a measure of the N-representability of the target. This methodology facilitates both error correction of defective ensemble reduced density matrices and quantum-state reconstruction on a quantum computer, offering a route for density-matrix refinement. We validate the algorithm with numerical simulations on systems of two, three, and four electrons in both simple models as well as molecular systems at finite temperature, demonstrating its robustness.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Stable Surfaces That Bind Too Tightly: Can Range-Separated Hybrids or DFT+U Improve Paradoxical Descriptions of Surface Chemistry?

Approximate, semilocal density functional theory (DFT) suffers from delocalization error that can lead to a paradoxical model of catalytic surfaces that both overbind adsorbates yet are also too stable. We investigate the effect of two widely applied approaches for delocalization error correction, (i) affordable DFT+U (i.e., semilocal DFT augmented with a Hubbard U) and (ii) hybrid functionals with an admixture of Hartree–Fock (HF) exchange, on surface and adsorbate energies across a range of rutile transition metal oxides widely studied for their promise as water-splitting catalysts. We observe strongly row- and period-dependent trends with DFT+U, which increases surface formation energies only in early transition metals (e.g., Ti and V) and decreases adsorbate energies only in later transition metals (e.g., Ir and Pt). Both global and local hybrids destabilize surfaces and reduce adsorbate binding across the periodic table, in agreement with higher-level reference calculations. Density analysis reveals why hybrid functionals correct both quantities, whereas DFT+U does not. We recommend local, range-separated hybrids for the accurate modeling of catalysis in transition metal oxides at only a modest increase in computational cost over semilocal DFT.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Harnessing Quantum Computing for Energy Materials: Opportunities and Challenges

Developing high-performance materials is critical for diverse energy applications to increase efficiency, improve sustainability and reduce costs. Classical computational methods have enabled important breakthroughs in energy materials development, but they face scaling and time-complexity limitations, particularly for high-dimensional or strongly correlated material systems. Quantum computing (QC) promises to offer a paradigm shift by exploiting quantum bits with their superposition and entanglement to address challenging problems intractable for classical approaches. This Perspective discusses the opportunities in leveraging QC to advance energy materials research and the challenges QC faces in solving complex and high-dimensional problems. We present cases on how QC, when combined with classical computing methods, can be used for the design and simulation of practical energy materials. We also outline the outlook for error-corrected, fault-tolerant QC capable of achieving predictive accuracy and quantum advantage for complex material systems.

Algorithms↗

Scalable Synthesis and Characterization of Multilayer γ-Graphyne, New Carbon Crystals with a Small Direct Band Gap

γ-Graphyne is the most symmetric sp 2 /sp 1 allotrope of carbon, which can be viewed as graphene uniformly expanded through the insertion of two-carbon acetylenic units between all the aromatic rings. To date, synthesis of bulk γ-graphyne has remained a challenge. In this work, we report the synthesis of multilayer γ-graphyne through crystallization-assisted irreversible cross-coupling polymerization. A comprehensive characterization of this new carbon phase is described, including synchrotron powder X-ray diffraction, electron diffraction, lateral force microscopy, Raman spectroscopy, infrared spectroscopy, and cyclic voltammetry. Experiments indicate that γ-graphyne is a 0.48 eV band gap semiconductor, with a hexagonal a-axis spacing of 6.88 Å and an interlayer spacing of 3.48 Å, which is consistent with theoretical predictions. The observed crystal structure has an aperiodic sheet stacking. The material is thermally stable up to 240 °C but undergoes transformation at higher temperatures. While conventional 2D polymerization and reticular chemistry rely on error correction through reversibility, we demonstrate that a periodic covalent lattice can be synthesized under purely kinetic control. The reported methodology is scalable and inspires extension to other allotropes of the graphyne family.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Generalization in quantum machine learning from few training data

Modern quantum machine learning (QML) methods involve variationally optimizing a parameterized quantum circuit on a training data set, and subsequently making predictions on a testing data set (i.e., generalizing). In this work, we provide a comprehensive study of generalization performance in QML after training on a limited number N of training data points. We show that the generalization error of a quantum machine learning model with T trainable gates scales at worst as $\sqrt{T/N}$. When only K$\ll$T gates have undergone substantial change in the optimization process, we prove that the generalization error improves to $\sqrt{K/N}$. Our results imply that the compiling of unitaries into a polynomial number of native gates, a crucial application for the quantum computing industry that typically uses exponential-size training data, can be sped up significantly. We also show that classification of quantum states across a phase transition with a quantum convolutional neural network requires only a very small training data set. Other potential applications include learning quantum error correcting codes or quantum dynamical simulation. Our work injects new hope into the field of QML, as good generalization is guaranteed from few training data.

97 MATHEMATICS AND COMPUTING↗

High-fidelity qutrit entangling gates for superconducting circuits

Ternary quantum information processing in superconducting devices poses a promising alternative to its more popular binary counterpart through larger, more connected computational spaces and proposed advantages in quantum simulation and error correction. Although generally operated as qubits, transmons have readily addressable higher levels, making them natural candidates for operation as quantum three-level systems (qutrits). Recent works in transmon devices have realized high fidelity single qutrit operation. Nonetheless, effectively engineering a high-fidelity two-qutrit entanglement remains a central challenge for realizing qutrit processing in a transmon device. In this work, we apply the differential AC Stark shift to implement a flexible, microwave-activated, and dynamic cross-Kerr entanglement between two fixed-frequency transmon qutrits, expanding on work performed for the ZZ interaction with transmon qubits. We then use this interaction to engineer efficient, high-fidelity qutrit CZ † and CZ gates, with estimated process fidelities of 97.3(1)% and 95.2(3)% respectively, a significant step forward for operating qutrits on a multi-transmon device.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Holographic codes from hyperinvariant tensor networks

Holographic quantum-error correcting codes are models of bulk/boundary dualities such as the anti-de Sitter/conformal field theory (AdS/CFT) correspondence, where a higher-dimensional bulk geometry is associated with the code’s logical degrees of freedom. Previous discrete holographic codes based on tensor networks have reproduced the general code properties expected from continuum AdS/CFT, such as complementary recovery. However, the boundary states of such tensor networks typically do not exhibit the expected correlation functions of CFT boundary states. In this work, we show that a new class of exact holographic codes, extending the previously proposed hyperinvariant tensor networks into quantum codes, produce the correct boundary correlation functions. This approach yields a dictionary between logical states in the bulk and the critical renormalization group flow of boundary states. Furthermore, these codes exhibit a state-dependent breakdown of complementary recovery as expected from AdS/CFT under small quantum gravity corrections.

97 MATHEMATICS AND COMPUTING↗

Studying phonon coherence with a quantum sensor

Nanomechanical oscillators offer numerous advantages for quantum technologies. Their integration with superconducting qubits shows promise for hardware-efficient quantum error-correction protocols involving superpositions of mechanical coherent states. Limitations of this approach include mechanical decoherence processes, particularly two-level system (TLS) defects, which have been widely studied using classical fields and detectors. In this manuscript, we use a superconducting qubit as a quantum sensor to perform phonon number-resolved measurements on a piezoelectrically coupled phononic crystal cavity. This enables a high-resolution study of mechanical dissipation and dephasing in coherent states of variable size ($\overline{n}$ ≃ 1 – 10 phonons). We observe nonexponential relaxation and state size-dependent reduction of the dephasing rate, which we attribute to TLS. Using a numerical model, we reproduce the dissipation signatures (and to a lesser extent, the dephasing signatures) via emission into a small ensemble (N = 5) of rapidly dephasing TLS. Our findings comprise a detailed examination of TLS-induced phonon decoherence in the quantum regime.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗