Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational topology”

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

Optical vortex manipulation for topological quantum computation

Topological quantum computation based on Majorana bound states may enable new paths to fault-tolerant quantum computing. Several recent experiments have suggested that the vortex cores of topological superconductors, such as iron-based superconductors, may host Majorana bound states at zero energy. However, quantum computation with these zero-energy vortex bound states requires precise and fast manipulation of individual vortices, which is difficult to do in a scalable manner. To address this issue, in this study we propose a control scheme based on local heating via, for example, scanning optical microscopy to braid vortex-bound Majorana zero modes in a two-dimensional topological superconductor. First, we derive the conditions required for transporting a single vortex between two defects in the superconducting material by trapping it with a hot spot generated by local optical heating. Equipped with critical conditions for the vortex motion, we then establish the ideal material properties for vortex braiding and describe how transition errors resulting from finite speed and/or temperature can be minimized. Our work paves the way toward optical or microscopic control of zero-energy vortex bound states in two-dimensional topological superconductors.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Hypernetwork Science: From Multidimensional Networks to Computational Topology

As data structures and mathematical objects used for complex systems modeling, hypergraphs sit nicely poised between on the one hand the world of network models, and on the other that of higher-order mathematical abstractions from algebra, lattice theory, and topology. They are able to represent complex systems interactions more faithfully than graphs and networks, while also being some of the simplest classes of systems representing topological structures as collections of multidimensional objects connected in a particular pattern. In this paper we discuss the role of (undirected) hypergraphs in the science of complex networks, and provide a mathematical overview of the core concepts needed for hypernetwork modeling, including duality and the relationship to bicolored graphs, quantitative adjacency and incidence, the nature of walks in hypergraphs, and available topological relationships and properties. We close with a brief discussion of two example applications: biomedical databases for disease analysis, and domain-name system (DNS) analysis of cyber data.

Joslyn, Cliff A.↗
DOE OSTI2023

Robust measurement of wave function topology on NISQ quantum computers

Topological quantum phases of quantum materials are defined through their topological invariants. These topological invariants are quantities that characterize the global geometrical properties of the quantum wave functions and thus are immune to local noise. Here, we present a strategy to measure topological invariants on quantum computers. We show that our strategy can be easily integrated with the variational quantum eigensolver (VQE) so that the topological properties of generic quantum many-body states can be characterized on current quantum hardware. We demonstrate the robust nature of the method by measuring topological invariants for both non-interacting and interacting models, and map out interacting quantum phase diagrams on quantum simulators and IBM quantum hardware.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1984

A topology for computer networks with good survivability characteristics and low transmission delays between node computers

Various network topologies are developed which have not appeared in the literature before which result in minimum diameter graphs for computer networks having connectivity four. The topologies presented have good survivability characteristics and result in more topologies being available for computer network designers which achieve the minimum diameter resulting in small transmission delays.

Kelly, G. L.↗
NASA NTRS1996

Refinement Of Hexahedral Cells In Euler Flow Computations

Topologically Independent Grid, Euler Refinement (TIGER) computer program solves Euler equations of three-dimensional, unsteady flow of inviscid, compressible fluid by numerical integration on unstructured hexahedral coordinate grid refined where necessary to resolve shocks and other details. Hexahedral cells subdivided, each into eight smaller cells, as needed to refine computational grid in regions of high flow gradients. Grid Interactive Refinement and Flow-Field Examination (GIRAFFE) computer program written in conjunction with TIGER program to display computed flow-field data and to assist researcher in verifying specified boundary conditions and refining grid.

Melton, John E.↗
DOE OSTI2026

Scalable Computation of Topological Abstractions for Scalar Data

Topological data analysis has become an important tool for large scale scalar data analysis and visualization, efficiently extracting the inherent structure and features of interest of the data. However, with growing dataset sizes and complexity, it is increasingly becoming infeasible to compute topological abstractions of interest in serial and on single machines. This paper presents the state of the art in the scalable computation of topological abstractions on scalar data, in shared memory parallel on single machines, and in distributed memory parallel on multiple machines. We highlight results for set‐based, graph‐based and complex‐based abstractions and organize the state of the art based on this taxonomy. The paper identifies parallelization and distribution techniques common in topological algorithms and highlights further areas of interest with underdeveloped efforts.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Universal topological quantum computation with strongly correlated Majorana edge modes

Abstract Majorana-based quantum gates are not complete for performing universal topological quantum computation while Fibonacci-based gates are difficult to be realized electronically and hardly coincide with the conventional quantum circuit models. In reference Hu and Kane (2018 Phys. Rev. Lett. 120 066801), it has been shown that a strongly correlated Majorana edge mode in a chiral topological superconductor can be decomposed into a Fibonacci anyon τ and a thermal operator anyon ɛ in the tricritical Ising model. The deconfinement of τ and ɛ via the interaction between the fermion modes yields the anyon collisions and gives the braiding of either τ or ɛ . With these braidings, the complete members of a set of universal gates, the Pauli gates, the Hadamard gate and extra phase gates for one-qubit as well as controlled-NOT (CNOT) gate for two-qubits, are topologically assembled. Encoding quantum information and reading out the computation results can be carried out through electric signals. With the sparse-dense mixed encodings, we set up the quantum circuit where the CNOT gate turns out to be a probabilistic gate and design the corresponding devices with thin films of the chiral topological superconductor. As an example of the universal topological quantum computing, we show the application to Shor’s integer factorization algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Integrating micromagnets and hybrid nanowires for topological quantum computing

Majorana zero modes are expected to arise in semiconductor-superconductor hybrid systems, with potential topological quantum computing applications. One limitation of this approach is the need for a relatively high external magnetic field that should also change direction at the nanoscale. This proposal considers devices that incorporate micromagnets to address this challenge. We perform numerical simulations of stray magnetic fields from different micromagnet configurations, which are then used to solve for Majorana wavefunctions. Several devices are proposed, starting with the basic four-magnet design to align magnetic field with the nanowire and scaling up to nanowire T-junctions. The feasibility of the approach is assessed by performing magnetic imaging of prototype patterns.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Topological quantum computation on a chiral Kondo chain

We describe the chiral Kondo chain model based on the symplectic Kondo effect and demonstrate that it has a quantum critical ground state populated by non-Abelian anyons. We show that the fusion channel of two arbitrary anyons can be detected by locally coupling the two anyons to an extra single channel of chiral current and measuring the corresponding conductance at a finite frequency. Based on such measurements, we propose that the chiral Kondo chain model with symplectic symmetry can be used for the implementation of measurement-only topological quantum computations, and it possesses several distinct features favorable for such applications. Furthermore, the sources and effects of errors in the proposed system are analyzed and possible material realizations are discussed.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
NASA NTRS1984

Dynamics of flexible bodies in tree topology - A computer oriented approach

An approach suited for automatic generation of the equations of motion for large mechanical systems (i.e., large space structures, mechanisms, robots, etc.) is presented. The system topology is restricted to a tree configuration. The tree is defined as an arbitrary set of rigid and flexible bodies connected by hinges characterizing relative translations and rotations of two adjoining bodies. The equations of motion are derived via Kane's method. The resulting equation set is of minimum dimension. Dynamical equations are imbedded in a computer program called TREETOPS. Extensive control simulation capability is built in the TREETOPS program. The simulation is driven by an interactive set-up program resulting in an easy to use analysis tool.

Singh, R. P.↗
DOE OSTI2025

Exploring Nontrivial Topological Superconductivity in 2M-WS2 for Topological Quantum Computation

This project has two main research goals: (1) growing the high-quality two-dimensional (2D) 2M-pahse WS 2 (2M-WS 2 ) single crystals and identifying clear signatures of the unconventional superconductivity in the 2M-WS 2 ; and (2) establishing the layer-dependence of the Majorana zero mode in the 2M-WS 2 down to the monoatomic layer limit. These goals were planned to be achieved by growing high-quality and large-scale 2M-WS 2 single crystals and transferring their thin layers onto different substrates for the proposed measurements. The layer-dependent unconventional superconductivity in 2M-WS 2 were systematically studied by different techniques, including transport measurements (charge, thermal and spin), scanning tunneling microscopy and spectroscopy (STM/S), angle-resolved photoemission spectroscopy (ARPES), and theoretical calculations. The research team is comprised of researchers from University of Wyoming (UW) and three DOE National Laboratories (DOE NLs), including Argonne National Laboratory (ANL), Lawrence Berkeley National Laboratory (LBNL) and Sandia National Laboratories (SNL), with complete and complementary expertise: PI Tian: Handling 2D materials, nanofabrication, nanodevices, and quantum transport; Co-Is: Ackerman and Leonard: van der Waals material crystal growth and handling; Chien: Nanoimaging with STM/S; and Tang: Magnetic measurements and charge and thermal transport; National lab collaborators (NLs): Guisinger (ANL): STM/S and nanoimaging; Mo and Rotenberg (LBNL): ARPES and nano ARPES (nARPES); Lu (SNL): Quantum information science, quantum transport, and nanofabrication; and Baczewski (SNL): Theoretical modeling and calculations.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Decorated TQFTs and their Hilbert spaces

We discuss topological quantum field theories that compute topological invariants which depend on additional structures (or decorations) on three-manifolds. The q-series invariant $\hat{Z}$(q) proposed by Gukov, Pei, Putrov, and Vafa is an example of such an invariant. We describe how to obtain these decorated invariants by cutting and gluing and make a proposal for Hilbert spaces that are assigned to two-dimensional surfaces in the $\hat{Z}$-TQFT.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Crystalline materials for quantum computing: Semiconductor heterostructures and topological insulators exemplars

Abstract High-purity crystalline solid-state materials play an essential role in various technologies for quantum information processing, from qubits based on spins to topological states. New and improved crystalline materials emerge each year and continue to drive new results in experimental quantum science. This article summarizes the opportunities for a selected class of crystalline materials for qubit technologies based on spins and topological states and the challenges associated with their fabrication. We start by describing semiconductor heterostructures for spin qubits in gate-defined quantum dots and benchmark GaAs, Si, and Ge, the three platforms that demonstrated two-qubit logic. We then examine novel topologically nontrivial materials and structures that might be incorporated into superconducting devices to create topological qubits. We review topological insulator thin films and move onto topological crystalline materials, such as PbSnTe, and its integration with Josephson junctions. We discuss advances in novel and specialized fabrication and characterization techniques to enable these. We conclude by identifying the most promising directions where advances in these material systems will enable progress in qubit technology.

Scappucci, G. (ORCID:0000000325120079)↗
DOE OSTI2021

Quantitative and interpretable order parameters for phase transitions from persistent homology

Here, we apply modern methods in computational topology to the task of discovering and characterizing phase transitions. As illustrations, we apply our method to four two-dimensional lattice spin models: the Ising, square ice, XY, and fully frustrated XY models. In particular, we use persistent homology, which computes the births and deaths of individual topological features as a coarse-graining scale or sublevel threshold is increased, to summarize multiscale and high-point correlations in a spin configuration. We employ vector representations of this information called persistence images to formulate and perform the statistical task of distinguishing phases. For the models we consider, a simple logistic regression on these images is sufficient to identify the phase transition. Interpretable order parameters are then read from the weights of the regression. This method suffices to identify magnetization, frustration, and vortex-antivortex structure as relevant features for phase transitions in our models. We also define “persistence” critical exponents and study how they are related to those critical exponents usually considered.

36 MATERIALS SCIENCE↗
DOE OSTI2024

FORESTR: Finding, Organizing, Representing, Explaining, Summarizing, and Thinning Random forests

Random forests have become popular models used for data driven predictions. As a result, random forests are currently used or being considered for high-consequence mission applications in national security, such as the prediction of yield from optical signals and malware detection. While random forests may provide accurate predictions, the complexity of the algorithm causes a lack of interpretability. Random forests are an ensemble of regression or decision trees. Individual regression and decision trees are interpretable, but ensembles are inherently difficult to interpret due to the compilation of many models. We aim to increase the interpretability of random forests by finding patterns in the ensemble of trees that can be used to “thin” (or remove) trees. As a starting point, in this report, we develop a new distance metric for quantifying the similarity between trees based on their topologies (i.e., shapes). We base the metric on a novel distance metric for graphs that is a proper mathematical distance, is invariant to transformations, has registration between graphs, and computes topological evolutions between graphs. We use the tree distance metric to compute tree statistics such as a “mean tree” and to identify clusters of trees. We apply the developed methodology to a toy dataset and a mission relevant product inspection dataset to demonstrate how the metric can provide insight into random forests. Furthermore, we discuss the limitations of the approach and ideas for future research into how the metric could be used as a thinning tool to develop less complex models.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1998

Electromagnetics and Fluid Dynamics

Previous efforts focused on developing tools for design of low observables were sustained. The final product was the maturation of a high-order accurate finite-volume based code to solve Maxwell's equations. One of the primary achievements was the development and implementation of efficient filtering techniques which enhance the robustness of high-order and optimized schemes without significant adverse impact on accuracy. This has eliminated the stability barrier which restrains the common use of high-order schemes for conservative wave propagation phenomena on curvilinear meshes. A study was performed of crossing shock interactions under conditions of increasing interaction strength and asymmetry. In the first category, the observed computed topological bifurcations were correlated with the formation of various lines of coalescence and divergence evident in experimental and computed surf-ace oil maps. ne flow structure arising from asymmetric interactions was investigated with particular emphasis on: 1) vorticity dynamics, 2) shock-structure and 3) sidewall vortex loading. Several efforts of the prior year were successfully published in archival journals. The high-order algorithms developed for CEM have been implemented into the FDL3DI CFD code are presently undergoing extensive testing. Preliminary results are highly encouraging.

Gaitonde, Datta↗