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,657 records · Page 92

Microring resonator-based optical router for photonic networks-on-chip

We report the design and analysis of a non-blocking microring resonator-based optical switched router, which can be used as a switch node to construct a large photonic routing network on chips. The proposed optical router has sixteen microrings, fourteen crossings and four 90° waveguide bends, which could be tuned through the thermo-optic (TO) or electro-optic (EO) effect. Compared with a previously described 5 × 5 optical switching router, our router comprises fewer microring resonators (MRRs), crossings and bends, which results in a more compact design, a higher switching speed, a lower loss and a lower optical power consumption. In addition, all the rings operate at the same wavelength making it scalable to a network of any size. (transmission and processing of optical information)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

State protection under collective damping and diffusion

In this paper we provide a recipe for state protection in a network of oscillators under collective damping and diffusion. Our strategy is to manipulate the network topology, i.e., the way the oscillators are coupled together, the strength of their couplings, and their natural frequencies, in order to create a relaxation-diffusion-free channel. This protected channel defines a decoherence-free subspace (DFS) for nonzero-temperature reservoirs. Our development also furnishes an alternative approach to build up DFSs that offers two advantages over the conventional method: it enables the derivation of all the network-protected states at once, and also reveals, through the network normal modes, the mechanism behind the emergence of these protected domains.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Inferring low-dimensional microstructure representations using convolutional neural networks

We apply here recent advances in machine learning and computer vision to a central problem in materials informatics: the statistical representation of microstructural images. We use activations in a pretrained convolutional neural network to provide a high-dimensional characterization of a set of synthetic microstructural images. Next, we use manifold learning to obtain a low-dimensional embedding of this statistical characterization. We show that the low-dimensional embedding extracts the parameters used to generate the images. Finally, according to a variety of metrics, the convolutional neural network method yields dramatically better embeddings than the analogous method derived from two-point correlations alone.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Imaging quantum melting in a disordered 2D Wigner solid

Two-dimensional strongly interacting electrons crystalize into a solid phase known as the Wigner crystal at low densities and form a Fermi liquid at high densities. At intermediate densities, the two-dimensional solid evolves into a strongly correlated liquid phase around a critical density. We observed this quantum melting of a disordered Wigner solid in bilayer molybdenum diselenide (MoSe2) using a noninvasive scanning tunneling microscopy imaging technique. At low densities, the Wigner solid forms nanocrystalline domains pinned by local disorder. It exhibits a quantum densification behavior with increased densities in the solid phase. Above a threshold density, the Wigner solid melts locally and enters a mixed phase in which solid and liquid regions coexist. The liquid regions expand and form a percolation network at even higher densities.

Xiang, Ziyu↗

Data Summarization and Inference at Scale

This is the final report for the DOE ASCR grant SC-0022260, Data Summarization and Inference at Scale, PI: Alex Pothen, Purdue University. The goal of the project was to solve data-intensive and compute-intensive problems in the physical sciences, engineering, information science, data science, etc. by designing and implementing new algorithms that could work with a subset of the data. The four subgoals were: (a) The solution of problems where the data is too large to be stored in the memory of a computer. In this streaming model of computation, the data arrives as a stream of elements to the computer, each element is processed as it arrives, and a decision is made to discard the data or to store it; only a small subset of the data proportional to the size of the output solution is stored, and when all the data has been streamed, a solution to the problem is computed from the stored subset. (b) The use of machine learning methods to compute solutions to data-intensive problems. The use of GPUs is critical to obtain high performance on machine learning tasks, but their memory sizes are smaller relative to that of CPUs. For large-scale problems, the data is sampled many times, and small samples are used with repetition, for robustness, to compute solutions to inference tasks. This sampling reduces the memory required to solve the problem, but attention is needed to avoid slow convergence to the solutions, and reduced accuracy of inference. We propose submodular optimization, Large Language Models, and physics-informed neural networks to enable GPU computations here. (c) Modeling and visualization of high-dimensional data using interpretable features. Clinical proteomic data sets from immunology for the detection of cancer and other diseases are temporal and high-dimensional, and algorithms for visualizing these data sets using clinically interpretable features are lacking. We propose methods that compute distances based on the optimal transportation problem and graph edit distances to address this problem. We also propose the use of optimal transport-based distances, spatial statistics, and network structure to classify image data sets, We apply these algorithms to electron micrographs of the peripheral nervous system in the digestive tract. (d) The design of data-intensive algorithms on emerging architectures, specifically, noisy, intermediate-scale quantum (NISQ) devices. Quantum computers offer the possibility of exploring large solution spaces due to the principle of superposition, but current quantum computers are limited by few qubits, short coherence times due to noise, poor interconections among the qubits, etc. We propose the use of the divide and conquer paradigm to solve large-scale problems, wherein collections of small subproblems are solved on the quantum devices, and the solutions to the subproblems are integrated into a solution for the original problem on a classical computer.

97 MATHEMATICS AND COMPUTING↗

Symmetry reduction of tensor networks in many-body theory: I. Automated symbolic evaluation of SU(2) algebra

Abstract The ongoing progress in (nuclear) many-body theory is accompanied by an ever-rising increase in complexity of the underlying formalisms used to solve the stationary Schrödinger equation. The associated working equations at play in state-of-the-art ab initio nuclear many-body methods can be analytically reduced with respect to angular-momentum, i.e. SU (2), quantum numbers whenever they are effectively employed in a symmetry-restricted context. The corresponding procedure constitutes a tedious and error-prone but yet an integral part of the implementation of those many-body frameworks. Indeed, this symmetry reduction is a key step to advance modern simulations to higher accuracy since the use of symmetry-adapted tensors can decrease the computational complexity by orders of magnitude. While attempts have been made in the past to automate the (anti-) commutation rules linked to Fermionic and Bosonic algebras at play in the derivation of the working equations, there is no systematic account to achieve the same goal for their symmetry reduction. In this work, the first version of an automated tool performing graph-theory-based angular-momentum reduction is presented. Taking the symmetry-unrestricted expressions of a generic tensor network as an input, the code provides their angular-momentum-reduced form in an error-safe way in a matter of seconds. Several state-of-the-art many-body methods serve as examples to demonstrate the generality of the approach and to highlight the potential impact on the many-body community.

Tichai, A.↗

Vibrational energies for HFCO using a neural network sum of exponentials potential energy surface

A six-dimensional potential energy surface (PES) for formyl fluoride (HFCO) is fit in a sum-of-products form using neural network exponential fitting functions. The ab initio data upon which the fit is based were computed at the explicitly correlated coupled cluster with single, double, and perturbative triple excitations [CCSD(T)-F12]/cc-pVTZ-F12 level of theory. The PES fit is accurate (RMSE = 10 cm{sup −1}) up to 10 000 cm{sup −1} above the zero point energy and covers most of the experimentally measured IR data. The PES is validated by computing vibrational energies for both HFCO and deuterated formyl fluoride (DFCO) using block improved relaxation with the multi-configuration time dependent Hartree approach. The frequencies of the fundamental modes, and all other vibrational states up to 5000 cm{sup −1} above the zero-point energy, are more accurate than those obtained from the previous MP2-based PES. The vibrational frequencies obtained on the PES are compared to anharmonic frequencies at the MP2/aug-cc-pVTZ and CCSD(T)/aug-cc-pVTZ levels of theory obtained using second-order vibrational perturbation theory. The new PES will be useful for quantum dynamics simulations for both HFCO and DFCO, e.g., studies of intramolecular vibrational redistribution leading to unimolecular dissociation and its laser control.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Computational synthesis of a new generation of 2D-based perovskite quantum materials

Perovskite-based optoelectronic devices have emerged as a promising energy source due to their potential for scalable production. This study introduces “perovskene,” a novel class of 2D materials derived from the ABC3-like perovskites, synthesized via a data-driven, high-throughput computational strategy. We harness machine learning and multitarget deep neural networks to systematically investigate the structure–property relations, paving the way for targeted material design and optimization in fields such as renewable energy, electronics, and catalysis. The characterization of over 1500 synthesized structures shows that more than 500 structures are stable, revealing properties such as ultra-low work function and large magnetic moment, underscoring the potential for advanced technological applications.

2D materials↗

Recent progress toward catalyst properties, performance, and prediction with data-driven methods

Herein, data-driven approaches are currently renovating the field of heterogenous catalysis and open a door to advance catalyst design. Their success depends heavily on the synergy among machine learning (ML), experimental data, and quantum mechanical (QM) calculations. In this brief survey of recent progress, we examine catalysis informatics in the context of (1) ML-aided catalyst characterizations, (2) knowledge extractions from experimental data, (3) predictions of catalytic properties and constructions of reaction networks, and (4) ML-enabled large-scale QM simulations. An outlook on the current challenges of this rapidly evolving field is also provided.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Artificial neural network correction for density-functional tight-binding molecular dynamics simulations

In this paper, the authors developed a Behler–Parrinello-type neural network (NN) to improve the density-functional tight-binding (DFTB) energy and force prediction. The Δ-machine learning approach was adopted and the NN was designed to predict the energy differences between the density functional theory (DFT) quantum chemical potential and DFTB for a given molecular structure. Most notably, the DFTB-NN method is capable of improving the energetics of intramolecular hydrogen bonds and torsional potentials without modifying the framework of DFTB itself. This improvement enables considerably larger simulations of complex chemical systems that currently could not easily been accomplished using DFT or higher level ab initio quantum chemistry methods alone.

36 MATERIALS SCIENCE↗

Permutation invariant potential energy surfaces for polyatomic reactions using atomistic neural networks

The applicability and accuracy of the Behler-Parrinello atomistic neural network method for fitting reactive potential energy surfaces is critically examined in three systems, H + H{sub 2} → H{sub 2} + H, H + H{sub 2}O → H{sub 2} + OH, and H + CH{sub 4} → H{sub 2} + CH{sub 3}. A pragmatic Monte Carlo method is proposed to make efficient choice of the atom-centered mapping functions. The accuracy of the potential energy surfaces is not only tested by fitting errors but also validated by direct comparison in dynamically important regions and by quantum scattering calculations. Our results suggest this method is both accurate and efficient in representing multidimensional potential energy surfaces even when dissociation continua are involved.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Numerical investigation of closed-loop control for Hall accelerators

Low frequency discharge current oscillations in Hall accelerators are conventionally damped with external inductor-capacitor (LC) or resistor-inductor-capacitor (RLC) networks. The role of such network in the stabilization of the plasma discharge is investigated with a numerical model and the potential advantages of proportional-integral-derivative (PID) closed-loop control over RLC networks are subsequently assessed using either discharge voltage or magnetic field modulation. Simulations confirm the reduction of current oscillations in the presence of a RLC network, but suggest that PID control could ensure nearly oscillation-free operation with little sensitivity toward the PID settings.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Evaluating conducting network based transparent electrodes from geometrical considerations

Conducting nanowire networks have been developed as viable alternative to existing indium tin oxide based transparent electrode (TE). The nature of electrical conduction and process optimization for electrodes have gained much from the theoretical models based on percolation transport using Monte Carlo approach and applying Kirchhoff's law on individual junctions and loops. While most of the literature work pertaining to theoretical analysis is focussed on networks obtained from conducting rods (mostly considering only junction resistance), hardly any attention has been paid to those made using template based methods, wherein the structure of network is neither similar to network obtained from conducting rods nor similar to well periodic geometry. Here, we have attempted an analytical treatment based on geometrical arguments and applied image analysis on practical networks to gain deeper insight into conducting networked structure particularly in relation to sheet resistance and transmittance. Many literature examples reporting networks with straight or curvilinear wires with distributions in wire width and length have been analysed by treating the networks as two dimensional graphs and evaluating the sheet resistance based on wire density and wire width. The sheet resistance values from our analysis compare well with the experimental values. Our analysis on various examples has revealed that low sheet resistance is achieved with high wire density and compactness with straight rather than curvilinear wires and with narrower wire width distribution. Similarly, higher transmittance for given sheet resistance is possible with narrower wire width but of higher thickness, minimal curvilinearity, and maximum connectivity. For the purpose of evaluating active fraction of the network, the algorithm was made to distinguish and quantify current carrying backbone regions as against regions containing only dangling or isolated wires. The treatment can be helpful in predicting the properties of a network simply from image analysis and will be helpful in improvisation and comparison of various TEs and better understanding of electrical percolation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

CHEMREASONER: Heuristic Search over a Large Language Model’s Knowledge Space using Quantum-Chemical Feedback

The discovery of new catalysts is essential for the design of new and more efficient chemical processes in order to transition to a sustainable future. We introduce an AI-guided computational screening framework unifying linguistic reasoning with quantum-chemistry based feedback from 3D atomistic representations. Our approach formulates catalyst discovery as an uncertain environment where an agent actively searches for highly effective catalysts via the iterative combination of large language model (LLM)-derived hypotheses and atomistic graph neural network (GNN)-derived feedback. Identified catalysts in intermediate search steps undergo structural evaluation based on spatial orientation, reaction pathways, and stability. Scoring functions based on adsorption energies and barriers steer the exploration in the LLM's knowledge space toward energetically favorable, high-efficiency catalysts. We introduce planning methods that automatically guide the exploration without human input, providing competitive performance against expert-enumerated chemical descriptor-based implementations. By integrating language-guided reasoning with computational chemistry feedback, our work pioneers AI-accelerated, trustworthy catalyst discovery.

artificial intelligence↗

Gaussian processes with built-in dimensionality reduction: Applications to high-dimensional uncertainty propagation

Uncertainty quantification (UQ) tasks, such as model calibration, uncertainty propagation, and optimization under uncertainty, typically require several thousand evaluations of the underlying computer codes. To cope with the cost of simulations, one replaces the real response surface with a cheap surrogate based, e.g., on polynomial chaos expansions, neural networks, support vector machines, or Gaussian processes (GP). However, the number of simulations required to learn a generic multivariate response grows exponentially as the input dimension increases. This curse of dimensionality can only be addressed, if the response exhibits some special structure that can be discovered and exploited. A wide range of physical responses exhibit a special structure known as an active subspace (AS). An AS is a linear manifold of the stochastic space characterized by maximal response variation. The idea is that one should first identify this low dimensional manifold, project the high-dimensional input onto it, and then link the projection to the output. If the dimensionality of the AS is low enough, then learning the link function is a much easier problem than the original problem of learning a high-dimensional function. The classic approach to discovering the AS requires gradient information, a fact that severely limits its applicability. Furthermore, and partly because of its reliance to gradients, it is not able to handle noisy observations. The latter is an essential trait if one wants to be able to propagate uncertainty through stochastic simulators, e.g., through molecular dynamics codes. In this work, we develop a probabilistic version of AS which is gradient-free and robust to observational noise. Our approach relies on a novel Gaussian process regression with built-in dimensionality reduction. In particular, the AS is represented as an orthogonal projection matrix that serves as yet another covariance function hyper-parameter to be estimated from the data. To train the model, we design a two-step maximum likelihood optimization procedure that ensures the orthogonality of the projection matrix by exploiting recent results on the Stiefel manifold, i.e., the manifold of matrices with orthogonal columns. The additional benefit of our probabilistic formulation, is that it allows us to select the dimensionality of the AS via the Bayesian information criterion. We validate our approach by showing that it can discover the right AS in synthetic examples without gradient information using both noiseless and noisy observations. We demonstrate that our method is able to discover the same AS as the classical approach in a challenging one-hundred-dimensional problem involving an elliptic stochastic partial differential equation with random conductivity. Finally, we use our approach to study the effect of geometric and material uncertainties in the propagation of solitary waves in a one dimensional granular system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗