Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “representation”

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

Gauge-fixing quantum density operators at scale

We provide a theory, algorithms, and simulations of nonequilibrium quantum systems using a one-dimensional (1D) completely positive (CP), matrix-product (MP) density-operator (𝜌) representation. By generalizing the matrix product state's orthogonality center, to additionally store positive classical mixture correlations, the MP⁢𝜌 factorization naturally emerges. In this setting, we analytically and numerically examine the virtual gauge freedoms associated with the representation of quantum density operators. Based on this perspective, we simplify algorithms in certain limits to speed up the integration of the canonical-form master-equation dynamics. This enables us to quickly evolve under the dynamics of two-body quantum channels without resorting to optimization-based methods. In addition to this technical advance, we also scale up numerical examples and discuss implications for accurately modeling hardware architectures and predicting their performance in the near term. This includes an example of the quantum to classical transition of informationally leaky, i.e., decohering, qubits. In this setting, because of loss from environmental interactions, nonlocal complex coherence correlations are converted into global incoherent classical statistical mixture correlations. Lastly, the representation of both global and local correlations is discussed. We expect this work to have applications in additional nonequilibrium settings, beyond qubit engineering.

Gangapuram, Amit Jamadagni [Oak Ridge National Lab↗
DOE OSTI2023

Quantum algorithm for the linear Vlasov equation with collisions

The Vlasov equation is a nonlinear partial differential equation that provides a first-principles description of the dynamics of plasmas. Its linear limit is routinely used in plasma physics to investigate plasma oscillations and stability. In this paper, we present a quantum algorithm that simulates the linearized Vlasov equation with and without collisions, in the one-dimensional electrostatic limit. Rather than solving this equation in its native spatial and velocity phase space, we adopt an efficient representation in the dual space yielded by a Fourier-Hermite expansion. For a given simulation time, the Fourier-Hermite representation is exponentially more compact, thus yielding a classical algorithm that can match the performance of a previously proposed quantum algorithm for this problem. Further, this representation results in a system of linear ordinary differential equations (ODEs) which can be solved with well-developed quantum algorithms: a Hamiltonian simulation in the collisionless case, and quantum ODE solvers in the collisional case. In particular, we demonstrate that a quadratic speedup in system size is attainable.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

Finite and infinite matrix product states for Gutzwiller projected mean-field wave functions

Matrix product states (MPS) and “dressed” ground states of quadratic mean fields (e.g., Gutzwiller projected Slater determinants) are both important classes of variational wave functions. This latter class has played important roles in understanding superconductivity and quantum spin liquids. We present a method to obtain both the finite and infinite MPS (iMPS) representation of the ground state of an arbitrary fermionic quadratic mean-field Hamiltonian (which in the simplest case is a Slater determinant and in the most general case is a Pfaffian). We also show how to represent products of such states (e.g., determinants times Pfaffians). From this representation one can project to single occupancy and evaluate the entanglement spectra after Gutzwiller projection. We then obtain the MPS and iMPS representation of Gutzwiller projected mean-field states that arise from the variational slave-fermion approach to the S = 1 bilinear-biquadratic quantum spin chain. To accomplish this, we develop an approach to orthogonalize degenerate iMPS to find all the states in the degenerate ground-state manifold. We find the energies of the MPS and iMPS states match the variational energies closely, indicating the method is accurate and there is minimal loss due to truncation error. We then present an exploration of the entanglement spectra of projected slave-fermion states, exploring their qualitative features and finding good qualitative agreement with the respective exact ground-state spectra found from density matrix renormalization group.

1-dimensional spin chains↗
DOE OSTI2024

Quasi-Lindblad pseudomode theory for open quantum systems

Here, we introduce a new framework to study the dynamics of open quantum systems with linearly coupled Gaussian baths. Our approach replaces the continuous bath with an auxiliary discrete set of pseudomodes with dissipative dynamics, but we further relax the complete positivity requirement in the Lindblad master equation and formulate a quasi-Lindblad pseudomode theory. We show that this quasi-Lindblad pseudomode formulation directly leads to a representation of the bath correlation function in terms of a complex weighted sum of complex exponentials, an expansion that is known to be rapidly convergent in practice and thus leads to a compact set of pseudomodes. The pseudomode representation is not unique and can differ by a gauge choice. When the global dynamics can be simulated exactly, the system dynamics is unique and independent of the specific pseudomode representation. However, the gauge choice may affect the stability of the global dynamics, and we provide an analysis of why and when the global dynamics can retain stability despite losing positivity. We showcase the performance of this formulation across various spectral densities in both bosonic and fermionic problems, finding significant improvements over conventional pseudomode formulations.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Singular value decomposition and similarity renormalization group evolution of nuclear interactions

One of the main challenges for ab initio nuclear many-body theory is the growth of computational and storage costs as calculations are extended to heavy, exotic, and structurally complex nuclei. Here, we investigate the factorization of nuclear interactions as a means to address this issue. We perform Singular Value Decompositions of nucleon-nucleon interactions in partial wave representation and study the dependence of the singular value spectrum on interaction characteristics like regularization scheme and resolution scales. We develop and implement the Similarity Renormalization Group (SRG) evolution of the factorized interaction, and demonstrate that this SVD-SRG approach accurately preserves two-nucleon observables. We find that low-resolution interactions allow the truncation of the SVD at low rank, and that a small number of relevant components is sufficient to capture the nuclear interaction and perform an accurate SRG evolution, while the Coulomb interaction requires special consideration. The rank is uniform across all partial waves, and almost independent of the basis choice in the tested cases. This suggests an interpretation of the relevant singular components as mere representations of a small set of abstract operators that can describe the interaction and its SRG flow. Following the traditional workflow for nuclear interactions, we discuss how the transformation between the center-of-mass and laboratory frames creates redundant copies of the partial wave components when implemented in matrix representation, and we discuss strategies for mitigation. Lastly, we test the low-rank approximation to the SRG-evolved interactions in many-body calculations using the In-Medium SRG. By including nuclear radii in our analysis, we verify that the implementation of the SRG using the singular vectors of the interaction does not spoil the evolution of other observables.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Electron and neutrino scattering off the deuteron in a relativistic framework

Here, we build a relativistic model to perform calculations of exclusive, semiexclusive, and inclusive unpolarized cross sections and various polarization observables in electron and neutrino scattering experiments with deuteron targets. The strong interaction dynamics is defined by an explicit dynamical unitary representation of the Poincaré group, where representations of space translations and rotations in the interacting and noninteracting representations are the same. The Argonne V18 potential is used to construct a relativistic nucleon-nucleon interaction reproducing the experimental deuteron binding energy and nucleon-nucleon scattering observables. Our formalism does not include the pion production channel and neglects two-body contributions in the electromagnetic as well as in the weak nuclear current operator. We show that it is applicable to processes at kinematics, where the internal two-nucleon energy remains below the pion production threshold but the magnitude of the three-momentum transfer extends at least to several GeV.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Partially celestial states and their scattering amplitudes

We study representations of the Poincaré group that have a privileged transformation law along a p -dimensional hyperplane, and uncover their associated spinor-helicity variables in D spacetime dimensions. Our novel representations generalize the recently introduced celestial states and transform as conformal primaries of S O ( p , 1 ) , the symmetry group of the p -hyperplane. We will refer to our generalized states as “partially celestial.” Following Wigner’s method, we find the induced representations, including spin degrees of freedom. Defining generalized spinor-helicity variables for every D and p , we are able to construct the little group covariant part of partially celestial amplitudes. Finally, we briefly examine the application of the pairwise little group to partially celestial states with mutually nonlocal charges. Published by the American Physical Society 2024

Astronomy & Astrophysics↗
DOE OSTI2024

Streamlining latent spaces in machine learning using moment pooling

Many machine learning applications involve learning a latent representation of data, which is often high-dimensional and difficult to directly interpret. In this work, we propose “moment pooling,” a natural extension of deep sets networks which drastically decreases the latent space dimensionality of these networks while maintaining or even improving performance. Moment pooling generalizes the summation in deep sets to arbitrary multivariate moments, which enables the model to achieve a much higher effective latent dimensionality for a fixed learned latent space dimension. We demonstrate moment pooling on the collider physics task of quark/gluon jet classification by extending energy flow networks (EFNs) to moment EFNs. We find that moment EFNs with latent dimensions as small as 1 perform similarly to ordinary EFNs with higher latent dimension. This small latent dimension allows for the internal representation to be directly visualized and interpreted, which in turn enables the learned internal jet representation to be extracted in closed form. Published by the American Physical Society 2024

Gambhir, Rikab (ORCID:0000000251080448)↗
DOE OSTI2025

Noble dark matter: Surprising elusiveness of dark baryons

Dark matter could be a baryonic composite of stronglyc upled constituents transforming under SU⁡(2) 𝐿 . We classify the SU⁡(2) 𝐿 representations of baryons in a class of simple confining dark sectors and find that the lightest state can be a pure singlet or a singlet that mixes with other neutral components of SU⁡(2) 𝐿 representations, which strongly suppresses the dark matter candidate’s interactions with the Standard Model. We focus on models with a confining SU⁡(𝑁 𝑐 ) and heavy dark quarks constituting vectorlike 𝑁 𝑓 -plet of SU⁢(2) 𝐿 . For benchmark 𝑁 𝑐 and 𝑁 𝑓 , we calculate baryon mass spectra, incorporating electroweak gauge boson exchange in the nonrelativistic quark model, and demonstrate that above TeV mass scales, dark matter is dominantly a singlet state. The combination of this singlet nature with the recently discovered ℋ-parity results in an inert state analogous to noble gases, hence we coin the term noble dark matter. Our results can be understood in the nonrelativistic effective theory that treats the dark baryons as elementary states, where we find singlets accompanying triplets, 5-plets, or more exotic representations. This generalization of WIMP-like theories is more difficult to find or rule out than dark matter models that include only a single SU⁡(2) 𝐿 multiplet (such as a wino), motivating new searches in colliders and a reanalysis of direct and indirect detection prospects in astrophysical observations.

dark matter direct detection↗
DOE OSTI2023

Spectral-partitioned Kohn-Sham density functional theory

Here we introduce a general, variational scheme for systematic approximation of a given Kohn-Sham free-energy functional by partitioning the density matrix into distinct spectral domains, each of which may be spanned by an independent diagonal representation without requirement of mutual orthogonality. It is shown that by generalizing the entropic contribution to the free energy to allow for independent representations in each spectral domain, the free energy becomes an upper bound to the exact (unpartitioned) Kohn-Sham free energy, attaining this limit as the representations approach Kohn-Sham eigenfunctions. A numerical procedure is devised for calculation of the generalized entropy associated with spectral partitioning of the density matrix. The result is a powerful framework for Kohn-Sham calculations of systems whose occupied subspaces span multiple energy regimes. As a case in point, we apply the proposed framework to warm- and hot-dense matter described by finite-temperature density functional theory, where at high energies the density matrix is represented by that of the free-electron gas, while at low energies it is variationally optimized. We derive expressions for the spectral-partitioned Kohn-Sham Hamiltonian, atomic forces, and macroscopic stresses within the projector-augmented wave (PAW) and the norm-conserving pseudopotential methods. It is demonstrated that at high temperatures, spectral partitioning facilitates accurate calculations at dramatically reduced computational cost. Moreover, as temperature is increased, fewer exact Kohn-Sham states are required for a given accuracy, leading to further reductions in computational cost. Finally, it is shown that standard multiprojector expansions of electronic orbitals within atomic spheres in the PAW method lack sufficient completeness at high temperatures. Spectral partitioning provides a systematic solution for this fundamental problem.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Attention-Augmented Parametric Kernel Graph Neural Network (APKGNN) for Node Classification

We present a new graph neural network, the Attention-based Parametric-Kernel augmented Graph Neural Network (APKGNN), developed for node classification tasks. Despite extensive work on modeling multi-faceted relationships between connected nodes of a graph, the effect of attention on edge features mapped to relationships has not yet been analyzed through learning representation. This study derives such an attention vector by first calculating node features corresponding to endpoints of an edge and then aggregating these with extracted local intrinsic patches of a given graph to generate augmented local patch vectors. This process uses a parametric kernel based on Gaussian mixture models (GMMs) to embed local neighborhoods of the graph in local patches. The patch vectors then convolve with the above node features to produce an updated node representation. We show that this new learning representation (APKGNN) achieves higher node classification accuracy on tasks - both standard benchmarks (Cora, PubMed, Citeseer) and new experimental short text corpora where nodes correspond to text documents and words. This implementation of the GNN convolution layer outperforms state-of-the-art (SOTA) algorithms, achieving higher training, validation, and test accuracy by a significant margin on three standard benchmark data sets under both SOTA experimental settings and those for new testbeds.

Bose, Avishek↗
DOE OSTI2021

Accelerating Multigrid-based Hierarchical Scientific Data Refactoring on GPUs

Rapid growth in scientific data and a widening gap between computational speed and I/O bandwidth make it increasingly infeasible to store and share all data produced by scientific simulations. Instead, we need methods for reducing data volumes: ideally, methods that can scale data volumes adaptively so as to enable negotiation of performance and fidelity tradeoffs in different situations. Multigrid-based hierarchical data representations hold promise as a solution to this problem, allowing for flexible conversion between different fidelities so that, for example, data can be created at high fidelity and then transferred or stored at lower fidelity via logically simple and mathematically sound operations. However, the effective use of such representations has been hindered until now by the relatively high costs of creating, accessing, reducing, and otherwise operating on such representations. We describe here highly optimized data refactoring kernels for GPU accelerators that enable efficient creation and manipulation of data in multigrid-based hierarchical forms. We demonstrate that our optimized design can achieve up to 250 TB/s aggregated data refactoring throughput—83% of theoretical peak—on 1024 nodes of the Summit supercomputer. We showcase our optimized design by applying it to a large-scale scientific visualization workflow and the MGARD lossy compression software.

Data refactoring↗
DOE OSTI2024

eCC++ : A Compiler Construction Framework for Embedded Domain-Specific Languages

eCC++ is a new compiler construction framework for embedding domain-specific programming languages within C++. That is, the host language is C++, the guest language is the DSL to be embedded in C++, and eCC++ is the tool that enables the embedding. The eCC++ framework is composed of three main components: a front-end, an API for program verification based on a functional and declarative intermediate representation (IR), and a Multi-Level Intermediate Representation (MLIR) code generator. The eCC++ front-end consists of a library of C++ classes and operators that can be used to define the guest language. Guest sources are compiled with any standard C++ compiler, and when run, the resulting executable generates an eCC++ IR representation of the program, which can be verified within the eCC++ framework. Finally, eCC++ allows for high-level and domain-specific optimizations before generating MLIR. In summary, eCC++ aims to act as a generic front-end that enables embedding guest languages into C++, and provides necessary compiler technology for program verification, targeting the existing capabilities in the MLIR infrastructure. The paper evaluates the eCC++ expressiveness and usability describing the process of embedding GraphIt, a high-performance graph language in C++.

Gonzalez Tallada, Marc↗
DOE OSTI2023

Geodesic-based relaxation for deep canonical correlation analysis

Deep canonical correlation analysis (DCCA) is often applied to paired data samples from diverse sources to extract meaningful common information. However, when the data sources are heterogeneous, some of the useful information may be complementary but not exactly common. In spite of this fact, existing techniques learn maximally correlated representations from multiple views and are formulated so that they aim to yield identical latent subspaces for each view. This approach is sub-optimal in estimating the true signal subspaces for heterogeneous data sources. We propose a residual relaxation for deep canonical correlation analysis (RDCCA) based on a subspace distance metric, which generalizes the existing problem formulation and extracts representations that are better estimates of the actual, non-identical subspaces. We demonstrate that when using such a relaxation, the learned representations are closer to the true ones and that RDCCA outperforms CCA and DCCA in scenarios with heterogeneous data.

Kuschel, Maurice↗
DOE OSTI2020

Extending XACC for Quantum Optimal Control

Quantum computing vendors are beginning to open up application programming interfaces for direct pulse-level quantum control. With this, programmers can begin to describe quantum kernels of execution via sequences of arbitrary pulse shapes. This opens new avenues of research and development with regards to smart quantum compilation routines that enable direct translation of higher-level digital assembly representations to these native pulse instructions. In this work, we present an extension to the XACC system-level quantum-classical software framework that directly enables this compilation lowering phase via user-specified quantum optimal control techniques. This extension enables the translation of digital quantum circuit representations to equivalent pulse sequences that are optimal with respect to the backend system dynamics. Our work is modular and extensible, enabling third party optimal control techniques and strategies in both C++ and Python. We demonstrate this extension with familiar gradient-based methods like gradient ascent pulse engineering (GRAPE), gradient optimization of analytic controls (GOAT), and Krotov's method. Our work serves as a foundational component of future quantum-classical compiler designs that lower high-level programmatic representations to low-level machine instructions.

Nguyen, Thien↗
DOE OSTI2021

A MLIR Dialect for Quantum Assembly Languages

We demonstrate the utility of the Multi-Level Intermediate Representation (MLIR) for quantum computing. Specifically, we extend MLIR with a new quantum dialect that enables the expression and compilation of common quantum assembly languages. The true utility of this dialect is in its ability to be lowered to the LLVM intermediate representation (IR) in a manner that is adherent to the quantum intermediate representation (QIR) specification recently proposed by Microsoft. We leverage a qcor-enabled implementation of the QIR quantum runtime API to enable a retargetable (quantum hardware agnostic) compiler workflow mapping quantum languages to hybrid quantum-classical binary executables and object code. We evaluate and demonstrate this novel compiler workflow with quantum programs written in OpenQASM 2.0. We provide concrete examples detailing the generation of MLIR from OpenQASM source files, the lowering process from MLIR to LLVM IR, and ultimately the generation of executable binaries targeting available quantum processors.

Mccaskey, Alex↗
DOE OSTI2024

Event-to-Video Conversion for Overhead Object Detection

Collecting overhead imagery using an event camera is desirable due to the energy efficiency of the image sensor compared to standard cameras. However, event cameras complicate downstream image processing, especially for complex tasks such as object detection. In this paper, we investigate the viability of event streams for overhead object detection. We demonstrate that across a number of standard modeling approaches, there is a significant gap in performance between dense event representations and corresponding RGB frames. We establish that this gap is, in part, due to a lack of overlap between the event representations and the pre-training data that the object detectors were initially trained on through a number of experiments. Then, apply an off-the-shelf event-to-video conversion tool that converts event streams into gray-scale video to close this gap. We demonstrate that this approach results in a large performance increase, outperforming even event-specific object detection techniques on our overhead target task. These results suggest that better aligning event representations with existing large pre-trained models may result in greater short-term performance gains compared to end-to-end event-specific architectural improvements.

machine learning (ML), computer vision, Neuromorph↗
DOE OSTI2022

Automating Genetic Algorithm Mutations for Molecules Using a Masked Language Model

Inspired by the evolution of biological systems, genetic algorithms have been applied to generate solutions for optimization problems in a variety of scientific and engineering disciplines. For a given problem, a suitable genome representation must be defined along with a mutation operator to generate subsequent generations. Unlike natural systems which display a variety of complex rearrangements (e.g. mobile genetic elements), mutation for genetic algorithms commonly utilizes only random point-wise changes. Furthermore, generalizing beyond point-wise mutations poses a key difficulty as useful genome rearrangements depend on the representation and problem domain. To move beyond the limitations of manually defined point-wise changes, here we propose the use of techniques from masked language models to automatically generate mutations. As a first step, common subsequences within a given population are used to generate a vocabulary. The vocabulary is then used to tokenize each genome. A masked language model is trained on the tokenized data in order to generate possible rearrangements (i.e. mutations). In order to illustrate the proposed strategy, we use string representations of molecules and use a genetic algorithm to optimize for drug-likeness and synthesizability. Finally, our results show that moving beyond random point-wise mutations accelerates genetic algorithm optimization.

59 BASIC BIOLOGICAL SCIENCES↗