Search NASA⌕ Search

SEARCH · Search NASA

Results for “computational complexity”

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 OSTI2021

Computational Complexity of Neuromorphic Algorithms

Neuromorphic computing has several characteristics that make it an extremely compelling computing paradigm for post Moore computation. Some of these characteristics include intrinsic parallelism, inherent scalability, collocated processing and memory, and event-driven computation. While these characteristics impart energy efficiency to neuromorphic systems, they do come with their own set of challenges. One of the biggest challenges in neuromorphic computing is to establish the theoretical underpinnings of the computational complexity of neuromorphic algorithms. In this paper, we take the first steps towards defining the space and time complexity of neuromorphic algorithms. Specifically, we describe a model of neuromorphic computation and state the assumptions that govern the computational complexity of neuromorphic algorithms. Next, we present a theoretical framework to define the computational complexity of a neuromorphic algorithm. We explicitly define what space and time complexities mean in the context of neuromorphic algorithms based on our model of neuromorphic computation. Finally, we leverage our approach and define the computational complexities of six neuromorphic algorithms: constant function, successor function, predecessor function, projection function, neuromorphic sorting algorithm and neighborhood subgraph extraction algorithm.

Date, Prasanna↗
DOE OSTI2018

Computational complexity of the landscape II—Cosmological considerations

We propose a new approach for multiverse analysis based on computational complexity, which leads to a new family of “computational” measure factors. By defining a cosmology as a space–time containing a vacuum with specified properties (for example small cosmological constant) together with rules for how time evolution will produce the vacuum, we can associate global time in a multiverse with clock time on a supercomputer which simulates it. We argue for a principle of “limited computational complexity” governing early universe dynamics as simulated by this supercomputer, which translates to a global measure for regulating the infinities of eternal inflation. The rules for time evolution can be thought of as a search algorithm, whose details should be constrained by a stronger principle of “minimal computational complexity”. Unlike previously studied global measures, ours avoids standard equilibrium considerations and the well-known problems of Boltzmann Brains and the youngness paradox. We also give various definitions of the computational complexity of a cosmology, and argue that there are only a few natural complexity classes.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2018

Analyzing the Effects of Water Output Rates on the Strategic Computing Complex

At the Los Alamos National Laboratory, the Strategic Computing Complex (SCC) requires chilled water to properly allow its supercomputers and other systems to properly function. In order to do so, the SCC heavily relies on the use of treated water from the Sanitary Waste Water System (SWWS) and the Sanitary Effluent Reclamation Facility (SERF). Industrial water that can be reused, such as from toilets and sinks, as well as rain and well water, arrives at the SWWS where it is aerated and processed. From there, a portion of the water can evaporate, while some of it is removed in the form of sludge or discharged into the nearby canyon. However, a majority of this reuse water is transported to SERF, where it is further processed and treated. Here is the location where this water becomes “usable” once again. From there, is transported to cooling towers where the water becomes chilled and can properly cool the supercomputers at the SCC. In fact, nearly all of the reuse water utilized by the SCC is treated and processed at SERF. This analysis specifically examines the water that leaves SWWS for SERF.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Computational Spectroscopy of the Cr–Cr Bond in Coordination Complexes

In this work, we report the accurate computational vibrational analysis of the Cr–Cr bond in dichromium complexes using second-order multireference complete active space methods (CASPT2), allowing direct comparison with experimental spectroscopic data both to facilitate interpreting the low-energy region of the spectra and to provide insights into the nature of the bonds themselves. Recent technological development by the authors has realized such computation for the first time. Accurate simulation of the vibrational structure of these compounds has been hampered by their notorious multiconfigurational electronic structure that yields bond distances that do not correlate with bond order. Some measured Cr–Cr vibrational stretching modes, ν(Cr 2 ), have suggested weaker bonding, even for so-called ultrashort Cr–Cr bonds, while others are in line with the bond distance. Here, we optimize geometries and compute ν(Cr 2 ) with CASPT2 for three well-characterized complexes, Cr 2 (O 2 CCH 3 ) 4 (H 2 O) 2 , Cr 2 (mhp) 4 , and Cr 2 (dmp) 4 . We obtain CASPT2 harmonic ν(Cr 2 ) modes in good agreement with experiment at 282 cm –1 for Cr 2 (mhp) 4 and 353 cm –1 for Cr 2 (dmp) 4 , compute 50 Cr and 54 Cr isotope shifts, and demonstrate that the use of the so-called IPEA shift leads to improved Cr–Cr distances. Additionally, normal mode sampling was used to estimate anharmonicity along ν(Cr 2 ), leading to an anharmonic mode of 272 cm –1 for Cr 2 (mhp) 4 and 333 cm –1 for Cr 2 (dmp) 4 .

36 MATERIALS SCIENCE↗
DOE OSTI2022

Charge-Transfer Luminescence in a Molecular Donor–Acceptor Complex: Computational Insights

Donor–acceptor molecular complexes are a popular class of materials utilizing charge-transfer states for practical applications. A recent class of donor–acceptor dyads based on the fluorescent BODIPY functionalized with triphenylamine (TPA) shows the peculiar property of dual fluorescence. It is hypothesized that instead of the sensitized charge-transfer state being optically dark, it provides an additional bright radiative pathway. In this study, we use time-dependent density functional theory to characterize the energetic alignment of excitonic and charge-transfer states in a BODIPY-TPA molecular complex. We observe that using a long-range exchange corrected functional in combination with state-specific solvation scheme gives a qualitatively correct alignment of the exciton and charge-transfer states and an enhancement in oscillator strength for the equilibrium solvated charge-transfer state, in agreement with experiment. Furthermore, this work provides rationalization of charge-transfer state emission and provides a foundation to explore charge-transfer using ab initio excited-state nonadiabatic dynamics.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Quantum magic and computational complexity in the neutrino sector

We consider the quantum magic in systems of dense neutrinos undergoing coherent flavor transformations, relevant for supernova and neutron-star binary mergers. Mapping the three-flavor-neutrino system to qutrits, the evolution of quantum magic is explored in the single scattering angle limit for a selection of initial tensor-product pure states for 𝑁 𝜈 ≤ 8 neutrinos. For |𝜈𝑒⟩ ⊗𝑁𝜈 initial states, the magic, as measured by the 𝛼 = 2 stabilizer Renyi entropy ℳ 2 , is found to decrease with radial distance from the neutrino sphere, reaching a value that lies below the maximum for tensor-product qutrit states. Further, the asymptotic magic per neutrino, ℳ 2 /𝑁 𝜈 , decreases with increasing 𝑁 𝜈 . In contrast, the magic evolving from states containing all three flavors reaches values only possible with entanglement, with the asymptotic ℳ 2 /𝑁 𝜈 increasing with 𝑁 𝜈 . These results highlight the connection between the complexity in simulating quantum physical systems and the parameters of the Standard Model.

computational complexity↗
DOE OSTI2024

Glassy Word Problems: Ultraslow Relaxation, Hilbert Space Jamming, and Computational Complexity

We introduce a family of local models of dynamics based on “word problems” from computer science and group theory, for which we can place rigorous lower bounds on relaxation timescales. These models can be regarded either as random circuit or local Hamiltonian dynamics and include many familiar examples of constrained dynamics as special cases. The configuration space of these models splits into dynamically disconnected sectors, and for initial states to relax, they must “work out” the other states in the sector to which they belong. When this problem has a high time complexity, relaxation is slow. In some of the cases we study, this problem also has high space complexity. When the space complexity is larger than the system size, an unconventional type of jamming transition can occur, whereby a system of a fixed size is not ergodic but can be made ergodic by appending a large reservoir of sites in a trivial product state. This finding manifests itself in a new type of Hilbert space fragmentation that we call fragile fragmentation. We present explicit examples where slow relaxation and jamming strongly modify the hydrodynamics of conserved densities. In one example, density modulations of wave vector q exhibit almost no relaxation until times O ( exp ( 1 / q ) ) , at which point they abruptly collapse. We also comment on extensions of our results to higher dimensions. Published by the American Physical Society 2024

Physics↗
DOE OSTI2019

Entanglement entropy and computational complexity of the periodically driven Anderson impurity model

We study the growth of entanglement entropy and bond dimension with time in density matrix renormalization group simulations of the periodically driven single-impurity Anderson model. The growth of entanglement entropy is found to be related to the ordering of the bath orbitals and to the relation of the driving period T to the convergence radius of the Floquet-Magnus expansion. Furthermore, ordering the bath orbitals by their Floquet quasienergy is found to reduce the exponential growth rate of the computation time at intermediate driving periods, suggesting new ways to optimize matrix product state calculations of driven systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Scalable Approaches to Selecting Key Entities in Large Networked Infrastructure Systems

This work aims at bringing advances in discrete optimization algorithms to solving practical engineering problems at scale. Often times, in many engineering design problems, there is a need to select a small set of influential or representative elements from a large ground set of entities in an optimal fashion. Submodular optimization provides for a formal way to solve such problems. Common examples with infrastructure systems involve sensor placement and identification of key entities with certain objectives. However, scaling these approaches to large infrastructure systems can be challenging because of the high computational complexity of the overall framework that include the optimization algorithms as well as high-complexity compute-oracles that provide the necessary objective function values. In this work, we explore a well-studied and widely-applicable paradigm, namely leader-selection in a multi-agent networked setting in the context of scalable methodologies. We demonstrate novel frameworks that utilize variations of accelerated submodular optimization algorithms along with linear-algebraic methods that can help accelerate the oracle computations. We further explore this combination in conjunction with graph partitioning paradigms to take advantage of the accelerated algorithms in a distributed setting. Finally we demonstrate the key findings on a practical problem in an operational setting. For this, we leverage an example road network with approximately 18k nodes and 27k edges in a traffic control application, where we seek a limited number of k=200 key intersections. This problem can be solved in a serial setting in just under 5 hours providing more than 2 orders of magnitude speed-up over methods that do not consider acceleration techniques.

Visweswara Sathanur, Arun↗
DOE OSTI2023

Computing the Relative Affinity of Chlorophylls a and b to Light-Harvesting Complex II

In plants and algae, the primary antenna protein bound to photosystem II is light-harvesting complex II (LHCII), a pigment–protein complex that binds eight chlorophyll (Chl) a molecules and six Chl b molecules. Chl a and Chl b differ only in that Chl a has a methyl group (–CH 3 ) on one of its pyrrole rings, while Chl b has a formyl group (–CHO) at that position. This blue-shifts the Chl b absorbance relative to Chl a . It is not known how the protein selectively binds the right Chl type at each site. Knowing the selection criteria would allow the design of light-harvesting complexes that bind different Chl types, modifying an organism to utilize the light of different wavelengths. The difference in the binding affinity of Chl a and Chl b in pea and spinach LHCII was calculated using multiconformation continuum electrostatics and free energy perturbation. Both methods have identified some Chl sites where the bound Chl type ( a or b ) has a significantly higher affinity, especially when the protein provides a hydrogen bond for the Chl b formyl group. However, the Chl a sites often have little calculated preference for one Chl type, so they are predicted to bind a mixture of Chl a and b . The electron density of the spinach LHCII was reanalyzed, which, however, confirmed that there is negligible Chl b in the Chl a -binding sites. Finally, it is suggested that the protein chooses the correct Chl type during folding, segregating the preferred Chl to the correct binding site.

chemical calculations↗
DOE OSTI2019

Systems and methods for rapid processing and storage of data

Systems and methods of building massively parallel computing systems using low power computing complexes in accordance with embodiments of the invention are disclosed. A massively parallel computing system in accordance with one embodiment of the invention includes at least one Solid State Blade configured to communicate via a high performance network fabric. In addition, each Solid State Blade includes a processor configured to communicate with a plurality of low power computing complexes interconnected by a router, and each low power computing complex includes at least one general processing core, an accelerator, an I/O interface, and cache memory and is configured to communicate with non-volatile solid state memory.

Stalzer, Mark A.↗
DOE OSTI2021

Systems and methods for rapid processing and storage of data

Systems and methods of building massively parallel computing systems using low power computing complexes in accordance with embodiments of the invention are disclosed. A massively parallel computing system in accordance with one embodiment of the invention includes at least one Solid State Blade configured to communicate via a high performance network fabric. In addition, each Solid State Blade includes a processor configured to communicate with a plurality of low power computing complexes interconnected by a router, and each low power computing complex includes at least one general processing core, an accelerator, an I/O interface, and cache memory and is configured to communicate with non-volatile solid state memory.

Stalzer, Mark A.↗
DOE OSTI2025

Sign Problem in Tensor-Network Contraction

We investigate how the computational difficulty of contracting tensor networks depends on the sign structure of the tensor entries. Using results from computational complexity, we observe that the approximate contraction of tensor networks with only positive entries has lower computational complexity as compared to tensor networks with general real or complex entries. This raises the question of how this transition in computational complexity manifests itself in the hardness of different tensor-network-contraction schemes. We pursue this question by studying random tensor networks with varying bias toward positive entries. First, we consider contraction via Monte Carlo sampling and find that the transition from hard to easy occurs when the tensor entries become predominantly positive; this can be understood as a tensor-network manifestation of the well-known negative-sign problem in quantum Monte Carlo. Second, we analyze the commonly used contraction based on boundary tensor networks. The performance of this scheme is governed by the number of correlations in contiguous parts of the tensor network (which by analogy can be thought of as entanglement). Remarkably, we find that the transition from hard to easy—i.e., from a volume-law to a boundary-law scaling of entanglement—already occurs for a slight bias of the tensor entries toward a positive mean, scaling inversely with the bond dimension D , and thus the problem becomes easy the earlier the larger D occurs. This is in contrast both to expectations and to the behavior found in Monte Carlo contraction, where the hardness at fixed bias increases with the bond dimension. To provide insight into this early breakdown of computational hardness and the accompanying entanglement transition, we construct an effective classical statistical-mechanical model that predicts a transition at a bias of the tensor entries of 1 / D , confirming our observations. We conclude by investigating the computational difficulty of computing expectation values of tensor-network wave functions (projected entangled-pair states, PEPSs) and find that in this setting, the complexity of entanglement-based contraction always remains low. We explain this by providing a local transformation that maps PEPS expectation values to a positive-valued tensor network. This not only provides insight into the origin of the observed boundary-law entanglement scaling but also suggests new approaches toward PEPS contraction based on positive decompositions. Published by the American Physical Society 2025

Chen, Jielun (ORCID:0000000178411545)↗
DOE OSTI2018

On Bellman’s and Knuth’s Problems and their Generalizations

Various generalizations of the classical problem of the fastest raising to a power (or the so-called problem on addition chains) are studied in the asymptotic sense. Under weak restrictions, we demonstrate asymptotically tight solutions of the two best known generalizations, namely, Bellman’s problem on the computational complexity (on the minimal number of multiplication operations) of a normed monomial of several variables and Knuth’s problem on the computational complexity of a power system of one variable. We also briefly review some results on the computational complexity for three problems, namely, the computation of p-element systems of normed monomials in q variables, additive computations for systems of p integer linear forms over q variables, and the computation of p-element systems of the free Abelian group with q generators.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

The Tiny Triplet Finder as a Versatile Track Segment Seeding Engine for Trigger Systems

In high energy physics experiment trigger systems, track segment seeding is a resource consuming function and the primary reason is the computing complexity of the segment finding process. As the Moore's Law is reaching its physical limit, reducing computing complexity should be carefully considered, rather than keep piling up silicon resources. The Tiny Triplet Finder is a scheme that reduces the computing complexity of the segment seeding. As a proof of concept, a 3D track segment seeding engine core based on the Tiny Triplet Finder has been implemented and tested in a low-cost FPGA device. The seeding engine is designed to preselect and group hits (stubs) from detector layers to feed subsequent track fitting stage. The seeding engine consists of a Hough transform space for r-z view and a Tiny Triplet Finder for r-phi view to implement 3D constraints. The seeding engine is organized as a pipeline so that each hit is processed in a single clock cycle. Taking advantage of the register-like storage block scheme which enables effectively resetting of a block RAM within a single clock cycle, clearing or refreshing the seeding engine takes only one clock cycles between two events. The Tiny Triplet Finder is also a generic coincidence finding scheme that can be used for many tasks. As a versatility demonstration, track segment finding performances for two distinctive detector geometries are tested in our seeding engine. In a collider barrel-layer geometry, the fake segment rates are studied for 3D (i.e., both r-phi and r-z views) and 2D (i.e., r-phi or r-z view only) configurations for high hit multiplicity events (>4000 hits/layer in the barrel region). Another detector geometry contains strip plane layers with timing information. The numbers of coincidences, both real or fake, with or without timing ("3D" or "2D") information at various hit multiplicities are studied.

43 PARTICLE ACCELERATORS↗
DOE OSTI2023

Efficient and Robust Jet Tagging at the LHC with Knowledge Distillation

The challenging environment of real-time data processing systems at the Large Hadron Collider (LHC) strictly limits the computational complexity of algorithms that can be deployed. For deep learning models, this implies that only models with low computational complexity that have weak inductive bias are feasible. To address this issue, we utilize knowledge distillation to leverage both the performance of large models and the reduced computational complexity of small ones. In this paper, we present an implementation of knowledge distillation, demonstrating an overall boost in the student models' performance for the task of classifying jets at the LHC. Furthermore, by using a teacher model with a strong inductive bias of Lorentz symmetry, we show that we can induce the same inductive bias in the student model which leads to better robustness against arbitrary Lorentz boost.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗