Search NASA⌕ Search

SEARCH · Search NASA

Results for “traversibility”

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 OSTI2024

SAGA1 and MITH1 produce matrix-traversing membranes in the CO2-fixing pyrenoid

Abstract Approximately one-third of global CO 2 assimilation is performed by the pyrenoid, a liquid-like organelle found in most algae and some plants. Specialized pyrenoid-traversing membranes are hypothesized to drive CO 2 assimilation in the pyrenoid by delivering concentrated CO 2 , but how these membranes are made to traverse the pyrenoid matrix remains unknown. Here we show that proteins SAGA1 and MITH1 cause membranes to traverse the pyrenoid matrix in the model alga Chlamydomonas reinhardtii . Mutants deficient in SAGA1 or MITH1 lack matrix-traversing membranes and exhibit growth defects under CO 2 -limiting conditions. Expression of SAGA1 and MITH1 together in a heterologous system, the model plant Arabidopsis thaliana , produces matrix-traversing membranes. Both proteins localize to matrix-traversing membranes. SAGA1 binds to the major matrix component, Rubisco, and is necessary to initiate matrix-traversing membranes. MITH1 binds to SAGA1 and is necessary for extension of membranes through the matrix. Our data suggest that SAGA1 and MITH1 cause membranes to traverse the matrix by creating an adhesive interaction between the membrane and matrix. Our study identifies and characterizes key factors in the biogenesis of pyrenoid matrix-traversing membranes, demonstrates the importance of these membranes to pyrenoid function and marks a key milestone toward pyrenoid engineering into crops for improving yields.

Hennacy, Jessica H.↗
DOE OSTI2024

Orchard: Heterogeneous Parallelism and Fine-grained Fusion for Complex Tree Traversals

Many applications are designed to perform traversals ontree-likedata structures. Fusing and parallelizing these traversals enhance the performance of applications. Fusing multiple traversals improves the locality of the application. The runtime of an application can be significantly reduced by extracting parallelism and utilizing multi-threading. Prior frameworks have tried to fuse and parallelize tree traversals using coarse-grained approaches, leading to missed fine-grained opportunities for improving performance. Other frameworks have successfully supported fine-grained fusion on heterogeneous tree types but fall short regarding parallelization. We introduce a new frameworkOrchardbuilt on top ofGrafter.Orchard’s novelty lies in allowing the programmer to transform tree traversal applications by automatically applyingfine-grainedfusion and extractingheterogeneousparallelism.Orchardallows the programmer to write general tree traversal applications in a simple and elegant embedded Domain-Specific Language (eDSL). We show that the combination of fine-grained fusion and heterogeneous parallelism performs better than each alone when the conditions are met.

Computer Science↗
DOE OSTI2022

Traversable wormhole dynamics on a quantum processor

The holographic principle, theorized to be a property of quantum gravity, postulates that the description of a volume of space can be encoded on a lower-dimensional boundary. The anti-de Sitter (AdS)/conformal field theory correspondence or duality is the principal example of holography. The Sachdev–Ye–Kitaev (SYK) model of N >> 1 Majorana fermions has features suggesting the existence of a gravitational dual in AdS 2 , and is a new realization of holography. Here, we invoke the holographic correspondence of the SYK many-body system and gravity to probe the conjectured ER=EPR relation between entanglement and spacetime geometry through the traversable wormhole mechanism as implemented in the SYK model. A qubit can be used to probe the SYK traversable wormhole dynamics through the corresponding teleportation protocol. This can be realized as a quantum circuit, equivalent to the gravitational picture in the semiclassical limit of an infinite number of qubits. Here we use learning techniques to construct a sparsified SYK model that we experimentally realize with 164 two-qubit gates on a nine-qubit circuit and observe the corresponding traversable wormhole dynamics. Despite its approximate nature, the sparsified SYK model preserves key properties of the traversable wormhole physics: perfect size winding, coupling on either side of the wormhole that is consistent with a negative energy shockwave, a Shapiro time delay, causal time-order of signals emerging from the wormhole, and scrambling and thermalization dynamics. Our experiment was run on the Google Sycamore processor. By interrogating a two-dimensional gravity dual system, our work represents a step towards a program for studying quantum gravity in the laboratory. Future developments will require improved hardware scalability and performance as well as theoretical developments including higher-dimensional quantum gravity duals and other SYK-like models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Revising Apetrei’s bounding volume hierarchy construction algorithm to allow stackless traversal

Stackless traversal is a technique to speed up range queries by avoiding usage of a stack during the tree traversal. One way to achieve that is to transform a given binary tree to store a left child and a skip-connection (also called an escape index). In general, this operation requires an additional tree traversal during the tree construction. For some tree structures, however, it is possible to achieve the same result at a reduced cost. We propose one such algorithm for a GPU hierarchy construction algorithm proposed by Karras in Karras 2012. Furthermore, we show that our algorithm also works with the improved algorithm proposed by Apetrei in Apetrei 2014, despite a different ordering of the internal nodes. We achieve that by modifying Apetrei’s algorithm to restore the original Karras’ ordering of the internal nodes. Using the modified algorithm, we show how to construct a hierarchy suitable for a stackless traversal in a single bottom-up pass.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A traversable wormhole teleportation protocol in the SYK model

In this paper, we propose a concrete teleportation protocol in the SYK model based on a particle traversing a wormhole. The required operations for the communication, and insertion and extraction of the qubit, are all simple operators in terms of the basic qubits. We determine the effectiveness of this protocol, and find a version achieves almost perfect fidelity. Many features of semiclassical traversable wormholes are manifested in this setup.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Sixfold Way of Traversable Wormholes in the Sachdev-Ye-Kitaev Model

In the infrared limit, a nearly anti–de Sitter spacetime in two dimensions ( AdS 2 ) perturbed by a weak double trace deformation and a two-site ( q > 2 )-body Sachdev-Ye-Kitaev (SYK) model with N Majoranas and a weak 2 r -body intersite coupling share the same near-conformal dynamics described by a traversable wormhole. We exploit this relation to propose a symmetry classification of traversable wormholes depending on N , q , and r , with q > 2 r , and confirm it by a level statistics analysis using exact diagonalization techniques. Intriguingly, a time-reversed state never results in a new state, so only six universality classes occur—A, AI, BDI, CI, C, and D—and different symmetry sectors of the model may belong to distinct universality classes. Published by the American Physical Society 2024

Physics↗
DOE OSTI2024

FuseIM: Fusing Probabilistic Traversals for Influence Maximization on Exascale Systems

Probabilistic breadth-first traversals (BPTs) are used in many network science and graph machine learning applications. In this paper, we are motivated by the application of BPTs in stochastic diffusion-based graph problems such as influence maximization. These applications heavily rely on BPTs to implement a Monte-Carlo sampling step for their approximations. Given the large sampling complexity, stochasticity of the diffusion process, and the inherent irregularity in real-world graph topologies, efficiently parallelizing these BPTs remains significantly challenging. In this paper, we present a new algorithm to fuse massive number of concurrently executing BPTs with random starts on the input graph. Our algorithm is designed to fuse BPTs by combining separate traversals into a unified frontier on distributed multi-GPU systems. To show the general applicability of the fused BPT technique, we have incorporated it into two state-of-the-art influence maximization parallel implementations (gIM and Ripples). Our experiments on up to 4K nodes of the OLCF Frontier supercomputer (32,768 GPUs and 196K CPU cores) show strong scaling behavior, and that fused BPTs can improve the performance of these implementations up to 34x (for gIM) and ~360x (for Ripples).

Neff, Reece W.↗
DOE OSTI2020

Traversing large graphs on GPUs with unified memory

Due to the limited capacity of GPU memory, the majority of prior work on graph applications on GPUs has been restricted to graphs of modest sizes that fit in memory. Recent hardware and software advances make it possible to address much larger host memory transparently as a part of a feature known as unified virtual memory. While accessing host memory over an interconnect is understandably slower, the problem space has not been sufficiently explored in the context of a challenging workload with low computational intensity and an irregular data access pattern such as graph traversal. We analyse the performance of breadth first search (BFS) for several large graphs in the context of unified memory and identify the key factors that contribute to slowdowns. Next, we propose a lightweight offline graph reordering algorithm, HALO (Harmonic Locality Ordering), that can be used as a pre-processing step for static graphs. HALO yields speedups of 1.5x-1.9x over baseline in subsequent traversals. Our method specifically aims to cover large directed real world graphs in addition to undirected graphs whereas prior methods only account for the latter. Additionally, we demonstrate ties between the locality ordering problem and graph compression and show that prior methods from graph compression such as recursive graph bisection can be suitably adapted to this problem.

Gera, Prasun↗
DOE OSTI2021

Traversable wormhole solution with a background Kalb–Ramond field

Highlights: • Wormhole solutions of gravity in a Lorentz breaking symmetry scenario are found. • Light deflection by the wormhole in a Lorentz breaking symmetry scenario is calculated. • It is shown the influence of the vacuum expectation value of a Kalb–Ramond field in deflection of light. We obtain a static spherically symmetric wormhole solution due to the vacuum expectation value (vev) of a Kalb–Ramond field. The Kalb–Ramond (vev) is a background tensor field which produces a local Lorentz symmetry breaking (LSB) of spacetime. Considering a non-minimal coupling between the Kalb–Ramond (vev) and the Ricci tensor, we found an exact traversable wormhole solution sustained by matter sources with a negative isotropic pressure. The matter source satisfies the energy conditions at the throat for particular choices of the LSB parameter. Moreover, we employ the Gauss–Bonnet method to analyze the deflection angle of light in the weak limit approximation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Efficient generation of grids and traversal graphs in compositional spaces towards exploration and path planning

Abstract Diverse disciplines across science and engineering deal with problems related to compositions, which exist in non-Euclidean simplex spaces, rendering many standard tools inaccurate or inefficient. This work explores such spaces conceptually in the context of materials discovery, quantifies their computational feasibility, and implements several essential methods specific to simplex spaces through a new high-performance open-source library . Most significantly, we derive and implement an algorithm for constructing a novel n-dimensional simplex graph data structure, containing all discretized compositions and possible neighbor-to-neighbor transitions. Critically, no distance or neighborhood calculations are performed, instead leveraging pure combinatorics and order in procedurally generated simplex grids, keeping the algorithm $${\mathcal{O}}(N)$$ O ( N ) , with minimal memory, enabling rapid construction of graphs with billions of transitions in seconds. Additionally, we demonstrate how such graph representations can be combined to homogeneously express complex path-planning problems, while facilitating efficient deployment of existing high-performance gradient descent, graph traversal, and other optimization algorithms.

Krajewski, Adam M. (ORCID:0000000222660099)↗
DOE OSTI2023

Quantum Gravity in the Lab. I. Teleportation by Size and Traversable Wormholes

With the long-term goal of studying models of quantum gravity in the lab, we propose holographic teleportation protocols that can be readily executed in table-top experiments. These protocols exhibit similar behavior to that seen in the recent traversable-wormhole constructions of Gao et al. [J. High Energy Phys., 2017, 151 (2017)] and Maldacena et al. [Fortschr. Phys., 65, 1700034 (2017)]: information that is scrambled into one half of an entangled system will, following a weak coupling between the two halves, unscramble into the other half. We introduce the concept of teleportation by size to capture how the physics of operator-size growth naturally leads to information transmission. The transmission of a signal through a semiclassical holographic wormhole corresponds to a rather special property of the operator-size distribution that we call size winding. For more general systems (which may not have a clean emergent geometry), we argue that imperfect size winding is a generalization of the traversablewormhole phenomenon. In addition, a form of signaling continues to function at high temperature and at large times for generic chaotic systems, even though it does not correspond to a signal going through a geometrical wormhole but, rather, to an interference effect involving macroscopically different emergent geometries. Finally, we outline implementations that are feasible with current technology in two experimental platforms: Rydberg-atom arrays and trapped ions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Gravitational lensing effect in traversable wormholes

Highlights: • Strong gravitational lensing in the context of charged wormhole is studied. • The necessary and sufficient conditions for the existence of photon spheres at or outside the throat of the charged wormhole is derived. • Photon spheres are investigated in three cases for three different forms of redshift function. The present paper is intended for studying the effect of strong gravitational lensing in the context of charged wormhole. To study this effect, the conditions determining the existence of photon spheres at and outside the throat are obtained. The necessary and sufficient conditions for the existence of photon spheres at or outside the throat of the charged wormhole is derived. Furthermore, photon spheres are investigated in three cases for three different forms of redshift function. These three cases include the existence of effective photon spheres (i) at the throat, (ii) outside the throat and (iii) both at and outside the throat. Consequently, these provide the information about the formation of infinite number of concentric rings and may lead to the detection of wormhole geometries.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Empowering a qudit-based quantum processor by traversing the dual bosonic ladder

Abstract High-dimensional quantum information processing has emerged as a promising avenue to transcend hardware limitations and advance the frontiers of quantum technologies. Harnessing the untapped potential of the so-called qudits necessitates the development of quantum protocols beyond the established qubit methodologies. Here, we present a robust, hardware-efficient, and scalable approach for operating multidimensional solid-state systems using Raman-assisted two-photon interactions. We then utilize them to construct extensible multi-qubit operations, realize highly entangled multidimensional states including atomic squeezed states and Schrödinger cat states, and implement programmable entanglement distribution along a qudit array. Our work illuminates the quantum electrodynamics of strongly driven multi-qudit systems and provides the experimental foundation for the future development of high-dimensional quantum applications such as quantum sensing and fault-tolerant quantum computing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗