Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Quantum network”

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 1,693 records · Page 94

Methyl acetate and its singly deuterated isotopomers in the interstellar medium

Methyl acetate (CH{sub 3}COOCH{sub 3}) has been recently observed by the IRAM 30 m radio telescope in Orion, though the presence of its deuterated isotopomers is yet to be confirmed. We therefore study the properties of various forms of methyl acetate, namely, CH{sub 3}COOCH{sub 3}, CH{sub 2}DCOOCH{sub 3}, and CH{sub 3}COOCH{sub 2}D. Our simulation reveals that these species could be produced efficiently in both gas and ice phases. Production of methyl acetate could follow radical–radical reaction between acetyl (CH{sub 3}CO) and methoxy (CH{sub 3}O) radicals. To predict abundances of CH{sub 3}COOCH{sub 3} along with its two singly deuterated isotopomers and its two isomers (ethyl formate and hydroxyacetone), we prepare a gas–grain chemical network to study the chemical evolution of these molecules. Since gas-phase rate coefficients for methyl acetate and its related species are unknown, either we consider similar rate coefficients for similar types of reactions (by following existing databases) or we carry out quantum chemical calculations to estimate the unknown rate coefficients. For the surface reactions, we use adsorption energies of reactants from some earlier studies. Moreover, we perform quantum chemical calculations to obtain spectral properties of methyl acetate in infrared and sub-millimeter regions. We prepare two catalog files for the rotational transitions of CH{sub 2}DCOOCH{sub 3} and CH{sub 3}COOCH{sub 2}D in JPL format, which could be useful for their detection in regions of interstellar media where CH{sub 3}COOCH{sub 3} has already been observed.

79 ASTRONOMY AND ASTROPHYSICS↗

HTMT-class Latency Tolerant Parallel Architecture for Petaflops Scale Computation

Computational Aero Sciences and other numeric intensive computation disciplines demand computing throughputs substantially greater than the Teraflops scale systems only now becoming available. The related fields of fluids, structures, thermal, combustion, and dynamic controls are among the interdisciplinary areas that in combination with sufficient resolution and advanced adaptive techniques may force performance requirements towards Petaflops. This will be especially true for compute intensive models such as Navier-Stokes are or when such system models are only part of a larger design optimization computation involving many design points. Yet recent experience with conventional MPP configurations comprising commodity processing and memory components has shown that larger scale frequently results in higher programming difficulty and lower system efficiency. While important advances in system software and algorithms techniques have had some impact on efficiency and programmability for certain classes of problems, in general it is unlikely that software alone will resolve the challenges to higher scalability. As in the past, future generations of high-end computers may require a combination of hardware architecture and system software advances to enable efficient operation at a Petaflops level. The NASA led HTMT project has engaged the talents of a broad interdisciplinary team to develop a new strategy in high-end system architecture to deliver petaflops scale computing in the 2004/5 timeframe. The Hybrid-Technology, MultiThreaded parallel computer architecture incorporates several advanced technologies in combination with an innovative dynamic adaptive scheduling mechanism to provide unprecedented performance and efficiency within practical constraints of cost, complexity, and power consumption. The emerging superconductor Rapid Single Flux Quantum electronics can operate at 100 GHz (the record is 770 GHz) and one percent of the power required by convention semiconductor logic. Wave Division Multiplexing optical communications can approach a peak per fiber bandwidth of 1 Tbps and the new Data Vortex network topology employing this technology can connect tens of thousands of ports providing a bi-section bandwidth on the order of a Petabyte per second with latencies well below 100 nanoseconds, even under heavy loads. Processor-in-Memory (PIM) technology combines logic and memory on the same chip exposing the internal bandwidth of the memory row buffers at low latency. And holographic storage photorefractive storage technologies provide high-density memory with access a thousand times faster than conventional disk technologies. Together these technologies enable a new class of shared memory system architecture with a peak performance in the range of a Petaflops but size and power requirements comparable to today's largest Teraflops scale systems. To achieve high-sustained performance, HTMT combines an advanced multithreading processor architecture with a memory-driven coarse-grained latency management strategy called "percolation", yielding high efficiency while reducing the much of the parallel programming burden. This paper will present the basic system architecture characteristics made possible through this series of advanced technologies and then give a detailed description of the new percolation approach to runtime latency management.

Sterling, Thomas↗

Learning Model Structural Uncertainty with Gaussian Processes

The advent of commercially available quantum computers has marked the beginning of quantum computing as a reality. Both quantum gate and annealing computers have been released by major computer hardware companies. In this work, the D-Wave 2XTM quantum annealing computer housed at the NASA Advanced Systems computational facility is investigated to accelerate Machine Learning (ML) for image registration. NASA collects large amounts of images over the globe remotely using space-based monitoring. Images of a fixed areas of the land surface are taken over time. Due to the orbit of the sensors, the viewing angles deviate slightly, and it is necessary to align or register the images precisely to create image time series over the land surface. Unaligned images can lead to substantial analysis errors. These time-series are then used in modeling Earth Systems models such as hydrological, weather, and carbon monitoring models. In this work, we consider the Moderate Resolution Image Spectrometer (MODIS) data collected by the NASA's terra satellite. Artificial Neural Networks (ANNs) is a natural fit for ML modelling of images. Several successes have been reported using machine learning related to image processing. We investigate the use of ML to register MODIS images. ANNs are investigated in combination with a Restricted Boltzmann Machines (RBM) as an auto-encoder. We will present results showing the accuracy and efficiency of this approach.The D-Wave 2XTM quantum annealer samples the ground-state wave-function of a spin-Ising systems with quadratic interactions between qubits and a Chimera connectivity. The system sits in a ~15 mK thermal bath. One can think of the system as being placed in the ground state initially and subject to thermal excitations governed by Boltzmann statistics. If this is assumed true, one can use the statistics from the D-Wave 2XTM to train RBMs. Generating statistics for training Boltzmann machines is an NP-hard problem and constitutes the largest compute cost. We investigate the use of the D-Wave 2XTM to accelerate the training of the RBMs in our ANNs and report on the results.

Kouatchou, Jules↗

Nanophotonic technologies for innovative all- optical signal processor using photonic crystals and quantum dots

GaAs-based two-dimensional photonic crystal (2DPC) slab waveguides (WGs) and InAs quantum dots (QDs) were developed for key photonic device structures in the future. An ultrasmall and ultrafast symmetrical Mach-Zehnder (SMZ)-type all-optical switch (PC-SMZ) and an optical flip-flop device (PC-FF) have been developed based on these nanophotonic structures for an ultrafast digital photonic network. To realize these devices, two important techniques were developed. One is a new simulation method, i.e., topology optimization method of 2DPC WGs with wide/flat bandwidth, high transmittance and low reflectivity. Another is a new selective-area-growth method, i.e., metal-mask molecular beam epitaxy method of InAs QDs. This technique contributes to achieving high-density and highly uniform InAs QDs in a desired area such as an optical nonlinearity-induced phase shift arm in the PC-FF. Furthermore, as a unique site-controlled QD technique, a nano-jet probe method is also developed for positioning QDs at the centre of the optical nonlinearity-induced phase shift arm.

36 MATERIALS SCIENCE↗

The application of complex network time series analysis in turbulent heated jets

In the present study, we applied the methodology of the complex network-based time series analysis to experimental temperature time series from a vertical turbulent heated jet. More specifically, we approach the hydrodynamic problem of discriminating time series corresponding to various regions relative to the jet axis, i.e., time series corresponding to regions that are close to the jet axis from time series originating at regions with a different dynamical regime based on the constructed network properties. Applying the transformation phase space method (k nearest neighbors) and also the visibility algorithm, we transformed time series into networks and evaluated the topological properties of the networks such as degree distribution, average path length, diameter, modularity, and clustering coefficient. The results show that the complex network approach allows distinguishing, identifying, and exploring in detail various dynamical regions of the jet flow, and associate it to the corresponding physical behavior. In addition, in order to reject the hypothesis that the studied networks originate from a stochastic process, we generated random network and we compared their statistical properties with that originating from the experimental data. As far as the efficiency of the two methods for network construction is concerned, we conclude that both methodologies lead to network properties that present almost the same qualitative behavior and allow us to reveal the underlying system dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Transition from amplitude to oscillation death in a network of oscillators

We report a transition from a homogeneous steady state (HSS) to inhomogeneous steady states (IHSSs) in a network of globally coupled identical oscillators. We perturb a synchronized population of oscillators in the network with a few local negative or repulsive mean field links. The whole population splits into two clusters for a certain number of repulsive mean field links and a range of coupling strength. For further increase of the strength of interaction, these clusters collapse into a HSS followed by a transition to IHSSs where all the oscillators populate either of the two stable steady states. We analytically determine the origin of HSS and its transition to IHSS in relation to the number of repulsive mean-field links and the strength of interaction using a reductionism approach to the model network. We verify the results with numerical examples of the paradigmatic Landau-Stuart limit cycle system and the chaotic Rössler oscillator as dynamical nodes. During the transition from HSS to IHSSs, the network follows the Turing type symmetry breaking pitchfork or transcritical bifurcation depending upon the system dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Time lagged ordinal partition networks for capturing dynamics of continuous dynamical systems

We investigate a generalised version of the recently proposed ordinal partition time series to network transformation algorithm. First, we introduce a fixed time lag for the elements of each partition that is selected using techniques from traditional time delay embedding. The resulting partitions define regions in the embedding phase space that are mapped to nodes in the network space. Edges are allocated between nodes based on temporal succession thus creating a Markov chain representation of the time series. We then apply this new transformation algorithm to time series generated by the Rössler system and find that periodic dynamics translate to ring structures whereas chaotic time series translate to band or tube-like structures—thereby indicating that our algorithm generates networks whose structure is sensitive to system dynamics. Furthermore, we demonstrate that simple network measures including the mean out degree and variance of out degrees can track changes in the dynamical behaviour in a manner comparable to the largest Lyapunov exponent. We also apply the same analysis to experimental time series generated by a diode resonator circuit and show that the network size, mean shortest path length, and network diameter are highly sensitive to the interior crisis captured in this particular data set.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Impact of hyperbolicity on chimera states in ensembles of nonlocally coupled chaotic oscillators

In this work we analyse nonlocally coupled networks of identical chaotic oscillators. We study both time-discrete and time-continuous systems (Henon map, Lozi map, Lorenz system). We hypothesize that chimera states, in which spatial domains of coherent (synchronous) and incoherent (desynchronized) dynamics coexist, can be obtained only in networks of chaotic non-hyperbolic systems and cannot be found in networks of hyperbolic systems. This hypothesis is supported by numerical simulations for hyperbolic and non-hyperbolic cases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Towards intelligent diagnostic system employing integration of mathematical and engineering model

The development of medical diagnostic system has been one of the main research fields during years. The goal of the medical diagnostic system is to place a nosological system that could ease the diagnostic evaluation normally performed by scientists and doctors. Efficient diagnostic evaluation is essentials and requires broad knowledge in order to improve conventional diagnostic system. Several approaches on developing the medical diagnostic system have been designed and tested since the earliest 60s. Attempts on improving their performance have been made which utilizes the fields of artificial intelligence, statistical analyses, mathematical model and engineering theories. With the availability of the microcomputer and software development as well as the promising aforementioned fields, medical diagnostic prototypes could be developed. In general, the medical diagnostic system consists of several stages, namely the 1) data acquisition, 2) feature extraction, 3) feature selection, and 4) classifications stages. Data acquisition stage plays an important role in converting the inputs measured from the real world physical conditions to the digital numeric values that can be manipulated by the computer system. One of the common medical inputs could be medical microscopic images, radiographic images, magnetic resonance image (MRI) as well as medical signals such as electrocardiogram (ECG) and electroencephalogram (EEG). Normally, the scientist or doctors have to deal with myriad of data and redundant to be processed. In order to reduce the complexity of the diagnosis process, only the significant features of the raw data such as peak value of the ECG signal or size of lesion in the mammogram images will be extracted and considered in the subsequent stages. Mathematical models and statistical analyses will be performed to select the most significant features to be classified. The statistical analyses such as principal component analysis and discriminant analysis as well as mathematical model of clustering technique have been widely used in developing the medical diagnostic systems. The selected features will be classified using mathematical models that embedded engineering theory such as artificial intelligence, support vector machine, neural network and fuzzy-neuro system. These classifiers will provide the diagnostic results without human intervention. Among many publishable researches, several prototypes have been developed namely NeuralPap, Neural Mammo, and Cervix Kit. The former system (NeuralPap) is an automatic intelligent diagnostic system for classifying and distinguishing between the normal and cervical cancerous cells. Meanwhile, the Cervix Kit is a portable Field-programmable gate array (FPGA)-based cervical diagnostic kit that could automatically diagnose the cancerous cell based on the images obtained during sampling test. Besides the cervical diagnostic system, the Neural Mammo system is developed to specifically aid the diagnosis of breast cancer using a fine needle aspiration image.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DeePKS + ABACUS as a Bridge between Expensive Quantum Mechanical Models and Machine Learning Potentials

Recently, the development of machine learning (ML) potentials has made it possible to perform large-scale and long-time molecular simulations with the accuracy of quantum mechanical (QM) models. However, for different levels of QM methods, such as density functional theory (DFT) at the meta-GGA level and/or with exact exchange, quantum Monte Carlo, etc., generating a sufficient amount of data for training an ML potential has remained computationally challenging due to their high cost. In this work, we demonstrate that this issue can be largely alleviated with Deep Kohn–Sham (DeePKS), an ML-based DFT model. DeePKS employs a computationally efficient neural network-based functional model to construct a correction term added upon a cheap DFT model. Upon training, DeePKS offers closely matched energies and forces compared with high-level QM method, but the number of training data required is orders of magnitude less than that required for training a reliable ML potential. As such, DeePKS can serve as a bridge between expensive QM models and ML potentials: one can generate a decent amount of high-accuracy QM data to train a DeePKS model and then use the DeePKS model to label a much larger amount of configurations to train an ML potential. Further, this scheme for periodic systems is implemented in a DFT package ABACUS, which is open source and ready for use in various applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

IRNet: A General Purpose Deep Risidual Regression Framework for Materials Discovery

Materials discovery is crucial for making scientific advances in many domains. Collections of data from experiments and first-principle computations have spurred interest in applying machine learning methods to create predictive models capable of mapping from composition and crystal structures to materials properties. Generally, these are regression problems with the input being a 1D vector composed of numerical attributes representing the material composition and/or crystal structure. While neural networks consisting of fully connected layers have been applied to such problems, their performance often suffers from the vanishing gradient problem when network depth is increased. Hence, predictive modeling for such tasks has been mainly limited to traditional machine learning techniques such as Random Forest. In this paper, we study and propose design principles for building deep regression networks composed of fully connected layers with numerical vectors as input. We introduce a novel deep regression network with individual residual learning, IRNet, that places shortcut connections after each layer so that each layer learns the residual mapping between its output and input. We use the problem of learning properties of inorganic materials from numerical attributes derived from material composition and/or crystal structure to compare IRNet’s performance against that of other machine learning techniques. Using multiple datasets from the Open Quantum Materials Database (OQMD) and Materials Project for training and evaluation, we show that IRNet provides significantly better prediction performance than the state-of-the-art machine learning approaches currently used by domain scientists. We also show that IRNet’s use of individual residual learning leads to better convergence during the training phase than when shortcut connections are between multi-layer stacks while maintaining the same number of parameters.

deep learning↗

Dimerization and spin decoupling in a two-leg Heisenberg ladder with frustrated trimer rungs

We study the antiferromagnetic spin-half Heisenberg ladder in the presence of an additional frustrating rung spin which is motivated and relevant also for the description of real two-dimensional materials such as the two-dimensional trimer magnet Ba 4 Ir 3 O 10 . We study the zero-temperature phase diagram, where we combine numerical and analytical methods into an overall consistent description. All numerical simulations are also accompanied by studies of the dynamical spin structure factor obtained via the density matrix renormalization group. Overall, we find in the regime of strong rung coupling a gapped dimerized phase related to competing symmetry sectors in Hilbert space that ultimately results in frustration-driven spin-Peierls transition. In the weak rung-coupling regime, the system is uniform, yet shows a gapped spinon continuum together with a sharp coherent low-energy branch which renders the system critical overall. In either case, the additional rung spin quickly get sidelined and nearly decouple in the regime when their bare coupling to the ladder is weakened

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Real-Time Operator Evolution in Two and Three Dimensions via Sparse Pauli Dynamics

We study real-time operator evolution using sparse Pauli dynamics, a recently developed method for simulating expectation values of quantum circuits. On the examples of energy and charge diffusion in one-dimensional (1D) spin chains and sudden quench dynamics in the 2D transverse-field Ising model, it is shown that this approach can compete with state-of-the-art tensor network methods. We further demonstrate the flexibility of the approach by studying quench dynamics in the 3D transverse-field Ising model that is highly challenging for tensor network methods. For the simulation of expectation value dynamics starting in a computational basis state, we introduce an extension of sparse Pauli dynamics that truncates the growing sum of Pauli operators by discarding terms with a large number of X and Y matrices. This is validated by our 2D and 3D simulations. Finally, we argue that sparse Pauli dynamics is not only capable of converging challenging observables to high accuracy, but can also serve as a reliable approximate approach even when given only limited computational resources. Published by the American Physical Society 2025

Begušić, Tomislav (ORCID:0000000279424134)↗

Using Machine Learning for Quantum Annealing Accuracy Prediction

Quantum annealers, such as the device built by D-Wave Systems, Inc., offer a way to compute solutions of NP-hard problems that can be expressed in Ising or quadratic unconstrained binary optimization (QUBO) form. Although such solutions are typically of very high quality, problem instances are usually not solved to optimality due to imperfections of the current generations quantum annealers. In this contribution, we aim to understand some of the factors contributing to the hardness of a problem instance, and to use machine learning models to predict the accuracy of the D-Wave 2000Q annealer for solving specific problems. We focus on the maximum clique problem, a classic NP-hard problem with important applications in network analysis, bioinformatics, and computational chemistry. By training a machine learning classification model on basic problem characteristics such as the number of edges in the graph, or annealing parameters, such as the D-Wave’s chain strength, we are able to rank certain features in the order of their contribution to the solution hardness, and present a simple decision tree which allows to predict whether a problem will be solvable to optimality with the D-Wave 2000Q. We extend these results by training a machine learning regression model that predicts the clique size found by D-Wave.

97 MATHEMATICS AND COMPUTING↗

Reconstructing parton distribution functions from Ioffe time data: from Bayesian methods to neural networks

The computation of the parton distribution functions (PDF) or distribution amplitudes (DA) of hadrons from first principles lattice QCD constitutes a central open problem in high energy nuclear physics. In this study, we present and evaluate the efficiency of several numerical methods, well established in the study of inverse problems, to reconstruct the full x-dependence of PDFs. Our starting point are the so called Ioffe time PDFs, which are accessible from Euclidean time simulations in conjunction with a matching procedure. Using realistic mock data tests, we find that the ill-posed incomplete Fourier transform underlying the reconstruction requires careful regularization, for which both the Bayesian approach as well as neural networks are efficient and flexible choices.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Operator splitting method for simulation of dynamic flows in natural gas pipeline networks

Here, we develop an operator splitting method to simulate flows of isothermal compressible natural gas over transmission pipelines. The method solves a system of nonlinear hyperbolic partial differential equations (PDEs) of hydrodynamic type for mass flow and pressure on a metric graph, where turbulent losses of momentum are modeled by phenomenological Darcy-Weisbach friction. Mass flow balance is maintained through the boundary conditions at the network nodes, where natural gas is injected or withdrawn from the system. Gas flow through the network is controlled by compressors boosting pressure at the inlet of the adjoint pipe. Our operator splitting numerical scheme is unconditionally stable and it is second order accurate in space and time. The scheme is explicit, and it is formulated to work with general networks with loops. We test the scheme over range of regimes and network configurations, also comparing its performance with performance of two other state of the art implicit schemes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗