Search NASA⌕ Search

SEARCH · Search NASA

Results for “encoding”

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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Variational autoencoders for at-source data reduction and anomaly detection in high energy particle detectors

Detectors in next-generation high-energy physics experiments face several daunting requirements, such as high data rates, damaging radiation exposure, and stringent constraints on power, space, and latency. To address these challenges, machine learning in readout electronics can be leveraged for smart detector designs, enabling intelligent inference and data reduction at-source. Variational autoencoders (VAEs) offer a variety of benefits for front-end readout; an on-sensor encoder can perform efficient lossy data compression while simultaneously providing a latent space representation that can be used for anomaly detection. Results are presented from low-latency and resource-efficient VAEs for front-end data processing in a futuristic silicon pixel detector. Encoder-based data compression is found to preserve good performance of off-detector analysis while significantly reducing the off-detector data rate as compared to a similarly sized data filtering approach. Furthermore, the latent space information is found to be a useful discriminator in the context of real-time sensor defect monitoring. Together, these results highlight the multifaceted utility of autoencoder-based front-end readout schemes and motivate their consideration in future detector designs.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

AstroCLIP: a cross-modal foundation model for galaxies

ABSTRACT We present AstroCLIP, a single, versatile model that can embed both galaxy images and spectra into a shared, physically meaningful latent space. These embeddings can then be used – without any model fine-tuning – for a variety of downstream tasks including (1) accurate in-modality and cross-modality semantic similarity search, (2) photometric redshift estimation, (3) galaxy property estimation from both images and spectra, and (4) morphology classification. Our approach to implementing AstroCLIP consists of two parts. First, we embed galaxy images and spectra separately by pre-training separate transformer-based image and spectrum encoders in self-supervised settings. We then align the encoders using a contrastive loss. We apply our method to spectra from the Dark Energy Spectroscopic Instrument and images from its corresponding Legacy Imaging Survey. Overall, we find remarkable performance on all downstream tasks, even relative to supervised baselines. For example, for a task like photometric redshift prediction, we find similar performance to a specifically trained ResNet18, and for additional tasks like physical property estimation (stellar mass, age, metallicity, and specific-star-formation rate), we beat this supervised baseline by 19 per cent in terms of R2. We also compare our results with a state-of-the-art self-supervised single-modal model for galaxy images, and find that our approach outperforms this benchmark by roughly a factor of two on photometric redshift estimation and physical property prediction in terms of R2, while remaining roughly in-line in terms of morphology classification. Ultimately, our approach represents the first cross-modal self-supervised model for galaxies, and the first self-supervised transformer-based architectures for galaxy images and spectra.

Parker, Liam (ORCID:0009000749521674)↗
DOE OSTI2025

Asymmetric loading of TnsE regulates Tn7 targeting of DNA replication structures

Abstract Tn7 transposable elements are known for their sophisticated target-site selection mechanisms. For the prototypical Tn7 element, dedicated transposon-encoded proteins direct insertions to either a conserved site in the chromosome or replicating DNA structures in conjugal plasmids, ensuring the vertical and horizontal spread of the element. While the pathway targeting the attTn7 site in the bacterial chromosome has been extensively studied, the pathway targeting DNA replication structures remains poorly understood. We have used an integrative structural biology approach to elucidate how the Tn7-encoded protein TnsE recognizes replication sites. Using native mass spectrometry, we found that TnsE forms 1:1 and 2:1 (TnsE:DNA) complexes on 3′-recessed DNA, with gain-of-function TnsE variants favoring the formation of 2:1 complexes. Structural characterization confirms that two TnsE molecules bind to DNA with the C-terminal domain of the protein recognizing duplex DNA, leaving the N-terminal domain to impose DNA substrate specificity and recruit the core transposition machinery. Collectively, our work is consistent with a model where TnsE-mediated target-site selection relies on the formation of an asymmetric TnsE:DNA complex to recruit the Tn7 transposase to DNA replication structures.

Biochemistry & Molecular Biology↗
DOE OSTI2024

Putative rhamnogalacturonan-II glycosyltransferase identified through callus gene editing bypasses embryo lethality

Rhamnogalacturonan II (RG-II) is a structurally complex and conserved domain of the pectin present in the primary cell walls of vascular plants. Borate crosslinking of RG-II is required for plants to grow and develop normally. Mutations that alter RG-II structure also affect crosslinking and are lethal or severely impair growth. Thus, few genes involved in RG-II synthesis have been identified. Here we developed a method to generate viable loss-of-function Arabidopsis (Arabidopsis thaliana) mutants in callus tissue via CRISPR/Cas9-mediated gene editing. We combined this with a candidate gene approach to characterize the male gametophyte defective 2 (MPG2) gene that encodes a putative family GT29 glycosyltransferase. Plants homozygous for this mutation do not survive. We showed that in the callus mutant cell walls, RG-II does not crosslink normally because it lacks 3-deoxy-D-manno-octulosonic acid (Kdo) and thus cannot form the α-L-Rhap-(1→5)-α-D-kdop-(1→ sidechain. We suggest that MGP2 encodes an inverting RG-II CMP-β-Kdo transferase (RCKT1). Our discovery provides further insight into the role of sidechains in RG-II dimerization. Our method also provides a viable strategy for further identifying proteins involved in the biosynthesis of RG-II.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2026

The small protein SbtC is a functional component of the CO 2 concentrating mechanism in Synechocystis sp. PCC 6803

Oxygenic phototrophs fix CO 2 via the enzyme ribulose-1,5-bisphosphate carboxylase/oxygenase (RubisCO), which shows relatively low CO 2 affinity and specificity. To circumvent low and fluctuating CO 2 concentrations in aquatic systems, cyanobacteria and algae have evolved sophisticated inorganic carbon (Ci) concentrating mechanisms (CCMs). Bicarbonate transporters such as SbtA play a crucial role in the cyanobacterial CCM and hence display multiple layers of tight regulation. Control of sbtA gene expression and corresponding transporter activity involves the PII-like protein SbtB, whose gene is frequently co-transcribed with sbtA. A previously non-annotated gene located upstream of the sbtAB operon in the model Synechocystis sp. PCC 6803 encodes the small protein SbtC, composed of 80 amino acids. Presence of SbtC was confirmed by immunoblotting of the sbtC-coding sequence fused to a Flag-tag. Similar to sbtAB , transcription of the sbtC locus is induced by low CO 2 availability; however, it is controlled independently. Mutation of the sbtC locus in a wild-type background produced only a mild phenotype, even under low CO 2 , but impaired diurnal growth resembled that of the mutant ΔsbtB . Biochemical analysis indicated a trimeric SbtABC complex in the membrane. Bicarbonate leakage from cells was strongly elevated when either sbtB or sbtC was deleted from recombinant Synechocystis strains harboring only SbtA as single Ci uptake system. Here, our results provide evidence that SbtC contributes to the formation of the SbtAB complex, thereby regulating bicarbonate exchange at the cytoplasmic membrane. Well-conserved SbtC-like proteins encoded in the neighborhood of sbtAB exist in many cyanobacterial genomes, pointing toward an important role in the cyanobacterial CCM.

Walke, Peter [Univ. of Rostock (Germany)] (ORCID:0↗
DOE OSTI2024

Complete genomes of Asgard archaea reveal diverse integrated and mobile genetic elements

Asgard archaea are of great interest as the progenitors of Eukaryotes, but little is known about the mobile genetic elements (MGEs) that may shape their ongoing evolution. Here, we describe MGEs that replicate in Atabeyarchaeia, a wetland Asgard archaea lineage represented by two complete genomes. We used soil depth–resolved population metagenomic data sets to track 18 MGEs for which genome structures were defined and precise chromosome integration sites could be identified for confident host linkage. Additionally, we identified a complete 20.67 kbp circular plasmid and two family-level groups of viruses linked to Atabeyarchaeia, via CRISPR spacer targeting. Closely related 40 kbp viruses possess a hypervariable genomic region encoding combinations of specific genes for small cysteine-rich proteins structurally similar to restriction-homing endonucleases. One 10.9 kbp integrative conjugative element (ICE) integrates genomically into theAtabeyarchaeum deiterrae-1chromosome and has a 2.5 kbp circularizable element integrated within it. The 10.9 kbp ICE encodes an expressed Type IIG restriction-modification system with a sequence specificity matching an active methylation motif identified by Pacific Biosciences (PacBio) high-accuracy long-read (HiFi) metagenomic sequencing. Restriction-modification of Atabeyarchaeia differs from that of another coexisting Asgard archaea, Freyarchaeia, which has few identified MGEs but possesses diverse defense mechanisms, including DISARM and Hachiman, not found in Atabeyarchaeia. Overall, defense systems and methylation mechanisms of Asgard archaea likely modulate their interactions with MGEs, and integration/excision and copy number variation of MGEs in turn enable host genetic versatility.

Biochemistry & Molecular Biology↗
DOE OSTI2025

Randomized Adiabatic Quantum Linear Solver Algorithm with Optimal Complexity Scaling and Detailed Running Costs

Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı et al. [Phys. Rev. Lett. 122, 060504 (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number 𝜅 of the linear system and the target error 𝜖. Here we go beyond these results in several ways. Firstly, using filtering [Lin and Tong, Quantum 4, 361 (2020)] and Poissonization techniques [Cunningham and Roland, ArXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling 𝑂⁡(𝜅⁢log (1/𝜖))—an exponential improvement in 𝜖, and a shaving of a log 𝜅 scaling factor in 𝜅. Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation—which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is 837⁢𝜅 at 𝜖 = 10 −10 for Hermitian matrices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Two-mode bosonic quoctit for high energy physics

In this work, we study a two-mode bosonic encoding of a quoctit inside a non-Abelian group-structured constellation of coherent states. This work is motivated by the importance of non-Abelian symmetry in particle physics and the desire to have transversal non-Abelian logical gates. We use the previously developed 2 T constellation of states used to encode a so-called 2 T qutrit. The fidelity of the 2 T quoctit is benchmarked against other bosonic qudits for different noise models and find it compare favorably when power constraints are considered. This paves the way for the construction of higher-dimensional qudits (e.g., a quicosotetrit with 2 T group structure) in bosonic systems with practical applications in quantum simulations of particle physics.

Kürkçüoglu, Doga Murat [Fermilab] (ORCID:000000031↗
DOE OSTI2025

Learning nuclear cross sections across the chart of nuclides with graph neural networks

We explore the use of deep learning techniques to learn how nuclear cross sections change as we add or remove protons and neutrons. As a proof of principle, we focus on the neutron-induced reactions in the fast energy regime. Our approach follows a two-stage learning framework. First, we apply representation learning to encode cross section data into a latent space using either variational autoencoders (VAEs) or implicit neural representations (INRs). Then, we train graph neural networks (GNNs) on the resulting embeddings to predict missing values across the nuclear chart by leveraging the topological structure of neighboring isotopes. We demonstrate accurate cross section predictions within a 9 × 9 block of missing nuclei. We also find that the optimal GNN training strategy depends on the type of latent representation used, with VAE embeddings performing best under end-to-end optimization in the original space, while INR embeddings achieve better results when the GNN is trained only in the latent space. Furthermore, using clustering algorithms, we map groups of latent vectors into regions of the nuclear chart and show that VAEs and INRs can discover some of the neutron magic numbers. These findings suggest that deep-learning models based on the representation encoding of cross sections combined with graph neural networks hold significant potential in augmenting nuclear theory models, e.g., by providing reliable estimates of covariances of cross sections, including cross-material covariances.

Machine learning↗
DOE OSTI2026

Profusion of symmetry-protected qubits from stable ergodicity breaking

We show how combining a discrete symmetry with topological Hilbert space fragmentation can give rise to exponentially many topologically stable qubits protected by a single discrete symmetry. We illustrate this explicitly with the example of the CZ𝑝 model, where the encoded qubits are prethermally stable to arbitrary symmetry-respecting perturbations for parametrically long times, substantially enhancing the robustness of a recently proposed construction based on nontopological fragmentation. In this model, the encoded qubits naturally come in pairs for which a universal set of transversal logical gates can be performed, ruling out (by the Eastin-Knill theorem) the possibility of using them for quantum error correction. We also comment on the combination of symmetry enrichment and topological fragmentation more generally, and the implications for use of systems exhibiting Hilbert space fragmentation as quantum memories.

kinetically constrained models↗
DOE OSTI2025

Advancing quantum simulations of the nuclear shell model with Gray-code–based resource-efficient protocols

Background: Some of the computational limitations in solving the nuclear many-body problem could be overcome by utilizing quantum computers. The nuclear shell-model calculations providing deeper insights into the properties of atomic nuclei are one such case with high demand for resources, as the size of the Hilbert space grows exponentially with the number of particles involved. Quantum algorithms are being developed to overcome these challenges and advance such calculations. Purpose: To develop quantum circuits for the nuclear shell-model, leveraging the capabilities of noisy intermediate-scale quantum (NISQ) devices. Here, we aim to minimize resource requirements (specifically in terms of qubits and gates) and strive to reduce the impact of noise by employing relevant mitigation techniques. Methods: We achieve noise resilience by designing an optimized Ansatz for the variational quantum eigensolver (VQE) based on Givens rotations and incorporating qubit-ADAPT-VQE in combination with variational quantum deflation (VQD) to compute ground and excited states, incorporating the zero-noise extrapolation mitigation technique. Furthermore, the qubit requirements are significantly reduced by mapping the basis states to qubits using Gray-code encoding and generalizing transformations of fermionic operators to efficiently represent many-body states. Results: By employing the resource-efficient protocols, we achieve the ground and excited state energy levels of 38 Ar and 6 Li with better accuracy. These energy levels are presented for noiseless simulations, noisy conditions, and after applying noise mitigation techniques. Results are compared for Jordan-Wigner and Gray-code encoding using VQE, qubit-ADAPT-VQE, and VQD. Conclusions: Our work highlights the potential of resource-efficient protocols to leverage the full potential of NISQ devices in scaling the nuclear shell model calculations, offering a pathway toward more complex quantum simulations in nuclear physics. This approach establishes a framework for studying other nuclear systems with improved quantum resource efficiency, marking a significant advancement in applying quantum computing to realistic nuclear physics applications.

Physics - Nuclear physics and radiation physics↗
DOE OSTI2026

Spectral Properties and Coding Transitions of Haar-Random Quantum Codes

A quantum error-correcting code with a nonzero error threshold undergoes a mixed-state phase transition when the error rate reaches that threshold. We explore this phase transition for Haar-random quantum codes, in which the logical information is encoded in a random subspace of the physical Hilbert space. We focus on the spectrum of the encoded system density matrix as a function of the rate of uncorrelated, single-qudit errors. For low error rates, this spectrum consists of well-separated bands, representing errors of different weights. As the error rate increases, the bands for high-weight errors merge. The evolution of these bands with increasing error rate is well described by a simple analytic ansatz. Using this ansatz, as well as an explicit calculation, we show that the threshold for Haar-random quantum codes saturates the hashing bound, and thus coincides with that for random stabilizer codes. For error rates that exceed the hashing bound, typical errors are uncorrectable, but postselected error correction remains possible until a much higher detection threshold. Postselection can in principle be implemented by projecting onto subspaces corresponding to low-weight errors, which remain correctable past the hashing bound.

decoherence↗
DOE OSTI2025

Strategies for simulating the time evolution of Hamiltonian lattice field theories

Simulating the time evolution of quantum field theories given some Hamiltonian H requires developing algorithms for implementing the unitary operator e -iHt . A variety of techniques exist that accomplish this task, with the most common technique used so far being Trotterization, which is a special case of the application of a product formula. However, other techniques exist that promise better asymptotic scaling in certain parameters of the theory being simulated, the most efficient of which are based on the concept of block encoding. In this work we study the performance of such algorithms in simulating lattice field theories. We derive and compare the asymptotic gate complexities of several commonly used simulation techniques in application to Hamiltonian lattice field theories. Using the scalar $\hat{φ}$ 4 theory as a test, we also perform numerical studies and compare the gate costs required by product formulas and signal-processing-based techniques to simulate time evolution. For the latter, we use the linear combination of unitaries (LCU) construction augmented with the quantum Fourier transform circuit to switch between the field and momentum eigenbases, which leads to immediate order-of-magnitude improvement in the cost of preparing the block encoding. Further, this paper also includes a pedagogical review of the techniques used, in particular product formulas, LCU, qubitization, quantum signal processing, as well as the technique for simulating geometrically-local Hamiltonians developed by Haah, Hastings, Kothari, and Low.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Systematic input scheme for many-boson Hamiltonians with applications to the two-dimensional 𝜙 4 theory

We develop a novel, systematic input scheme for many-boson Hamiltonians in order to solve field theory problems within the light-front Hamiltonian formalism via quantum computing. We present our discussion of this input scheme based on the light-front Hamiltonian of the two-dimensional ϕ 4 theory. In our input scheme, we employ a set of quantum registers, where each register encodes the occupation of a distinct boson mode as binaries. We squeeze the boson operators of each mode and present the Hamiltonian in terms of unique combinations of the squeezed-boson operators. We design the circuit modules for these unique combinations. Based on these circuit modules, we block encode the many-boson Hamiltonian utilizing the idea of quantum walk. For demonstration purposes, we present the spectral calculations of the Hamiltonian utilizing the hybrid quantum-classical symmetry-adapted quantum Krylov subspace diagonalization algorithm based on our input scheme, where the quantum computations are performed with the IBM Qiskit quantum simulator. The results of the hybrid calculations agree with exact results. Here, we can incorporate the input scheme in this work with the input scheme for many-fermion Hamiltonians; they jointly offer new pathways to solving the structure and dynamics of more general field theory problems on future fault-tolerant quantum computers.

Ab initio calculations↗
DOE OSTI2025

Stabilizing Non-Abelian Topological Order Against Heralded Noise via Local Lindbladian Dynamics

An important open question for the current generation of highly controllable quantum devices is understanding which phases can be realized as stable steady states under local quantum dynamics. In this work, we show how robust steady-state phases with both Abelian and non-Abelian mixed-state topological order can be stabilized, in two spatial dimensions, against generic “heralded” noise using active dynamics that incorporate measurement and feedback, modeled as a fully local Lindblad master equation. These topologically ordered steady states are two-way connected to pure topologically ordered ground states using local quantum channels, and preserve quantum information for a time that is exponentially large in the system size. Specifically, we present explicit constructions of families of local Lindbladians for both Abelian (ℤ 2 ) and non-Abelian (𝐷 4 ) topological order whose steady states host mixed-state topological order when the noise is below a threshold strength. As the noise strength is increased, these models exhibit first-order transitions to intermediate mixed-state phases where they encode robust classical memories, followed by (first-order) transitions to a trivial steady state at high noise rates. When the noise is imperfectly heralded, steady-state order disappears but our active dynamics significantly enhances the lifetime of the encoded logical information. To carry out the numerical simulations for the non-Abelian 𝐷 4 case, we introduce a generalized stabilizer tableau formalism that permits efficient simulation of the non-Abelian Lindbladian dynamics.

Monte Carlo methods↗
DOE OSTI2025

Control-Affine Schrödinger Bridge and Generalized Bohm Potential

From a stochastic control perspective, the Schrödinger bridge is a density-valued continuous curve parameterized by time that connects a given pair of initial and terminal probability densities via minimum effort controlled Brownian motion. The control-affine Schrödinger bridge extends this idea to a generic control-affine Itô diffusion, possibly with an additive state cost. Here, in this letter, we recast the necessary conditions of optimality for the control-affine Schrödinger bridge problem as a two point boundary value problem for a quantum mechanical Schrödinger PDE with complex potential. This complex-valued potential is a generalization of the real-valued Bohm potential in quantum mechanics. Our derived potential is akin to the optical potential in nuclear physics where the real part of the potential encodes elastic scattering (transmission of wave function), and the imaginary part encodes inelastic scattering (absorption of wave function). The key takeaway is that the process noise that drives the evolution of probability densities induces an absorbing medium in the evolution of wave function. These results make new connections between control theory and non-equilibrium statistical mechanics through the lens of quantum mechanics.

Markov processes↗
DOE OSTI2025

Towards a Quantum Algorithm for the Incompressible Nonlinear Navier-Stokes Equations

In this work, we present novel concepts for quantum algorithms to solve transient, nonlinear partial differential equations (PDEs). The challenge lies in how to effectively represent, encode, process, and evolve the nonlinear system of PDEs on quantum computers. We will discuss the new techniques using the incompressible Navier-Stokes equations as an example, because it represents the fundamental nonlinear feature and yet removes certain complexity in physics, allowing us to focus on the design of quantum algorithms. Previous attempts solving nonlinear PDEs in quantum computation have often involved storing multiple copies of solutions or employing linearizations. Neither is practical due to exponential scaling with evolution time or insufficient solution accuracy. We propose a new framework based on matrix product states (MPSs) and matrix product operators (MPOs), in addition to the Krylov subspace methods. For example, the solution variables of the Navier-Stokes equations are represented by MPSs, and the linear and nonlinear terms are processed by MPOs. The time evolution of the operators is attained by a fast-forwarding algorithm using Krylov subspace methods. Furthermore, we discuss various techniques for efficient encoding of MPSs, measurement reduction for MPOs, and use of tensor operations to treat multi-variate, multi-physics characteristics of Navier-Stokes.

Gopalakrishnan Meena, Murali [ORNL] (ORCID:0000000↗
DOE OSTI2026

Same Data, Different Audiences: Using Personas to Scope a Supercomputing Job Queue Visualization

Domain-specific visualizations sometimes focus on narrow, albeit important, tasks for one group of users. This focus limits the utility of a visualization to other groups working with the same data. While tasks elicited from other groups can present a design pitfall if not disambiguated, they also present a design opportunity—namely, the development of visualizations that support multiple groups. This development choice presents a trade-off of broadening the scope but limiting support for the more narrow tasks of any one group, which in some cases can enhance the overall utility of the visualization. We investigate this scenario through a design study where we develop Guidepost, a notebook-embedded visualization of data that helps scientists assess compute wait times, machine learning researchers understand prediction accuracy, and system maintainers analyze usage trends. We adapt the use of personas for visualization design from existing literature in the HCI and design domains, applying them to categorize tasks based on their uniqueness across stakeholder personas. Under this model, tasks shared between all groups should be supported by interactive visualizations and tasks unique to each group can be deferred to scripting with notebook-embedded visualization design. We evaluate our visualization through real-world case studies and a task-focused evaluation with nine participants. We observe that together, Guidepost's visual encodings, interactions, and export capabilities support the tasks of our differing personas.

97 MATHEMATICS AND COMPUTING↗