Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mathematics and Computing, Physics”

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 127 records · Page 7

Green’s Function Perspective on the Nonlinear Density Response of Quantum Many-Body Systems

We derive equations of motion for higher order density response functions using the theory of thermodynamic Green’s functions. We also derive expressions for the higher order generalized dielectric functions and polarization functions. Moreover, we relate higher order response functions and higher order collision integrals within the Martin–Schwinger hierarchy. We expect our results to be highly relevant to the study of a variety of quantum many-body systems such as matter under extreme temperatures, densities, and pressures.

Density Functional Theory↗

Identifying and tracking bubbles and drops in simulations: A toolbox for obtaining sizes, lineages, and breakup and coalescence statistics

Knowledge of bubble and drop size distributions in two-phase flows is important for characterizing a wide range of phenomena, including combustor ignition, sonar communication, and cloud formation. The physical mechanisms driving the background flow also drive the time evolution of these distributions. Accurate and robust identification and tracking algorithms for the dispersed phase are necessary to reliably measure this evolution and thereby quantify the underlying mechanisms in interface-resolving flow simulations. The identification of individual bubbles and drops traditionally relies on an algorithm used to identify connected regions. This traditional algorithm can be sensitive to the presence of spurious structures. A cost-effective refinement is proposed to maximize volume accuracy while minimizing the identification of spurious bubbles and drops. An accurate identification scheme is crucial for distinguishing bubble and drop pairs with large size ratios. The identified bubbles and drops need to be tracked in time to obtain breakup and coalescence statistics that characterize the evolution of the size distribution, including breakup and coalescence frequencies, and the probability distributions of parent and child bubble and drop sizes. An algorithm based on mass conservation is proposed to construct bubble and drop lineages using simulation snapshots that are not necessarily from consecutive time steps. These lineages are then used to detect breakup and coalescence events, and obtain the desired statistics. Accurate identification of large-size-ratio bubble and drop pairs enables accurate detection of breakup and coalescence events over a large size range. Accurate detection of successive breakup and coalescence events requires that the snapshot interval be an order of magnitude smaller than the characteristic breakup and coalescence times to capture these successive events while minimizing the identification of repeated confounding events. Together, these algorithms serve as a toolbox for detailed analysis of two-phase simulations, and enable insights into the mechanisms behind bubble and drop formation and evolution in flows of practical importance.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Global energy spectrum of the general oceanic circulation

Abstract Advent of satellite altimetry brought into focus the pervasiveness of mesoscale eddies $${{{{{{{\bf{{{{{{{{\mathcal{O}}}}}}}}}}}}}}}}({100})$$ O ( 100 ) km in size, which are the ocean’s analogue of weather systems and are often regarded as the spectral peak of kinetic energy (KE). Yet, understanding of the ocean’s spatial scales has been derived mostly from Fourier analysis in small "representative” regions that cannot capture the vast dynamic range at planetary scales. Here, we use a coarse-graining method to analyze scales much larger than what had been possible before. Spectra spanning over three decades of length-scales reveal the Antarctic Circumpolar Current as the spectral peak of the global extra-tropical circulation, at ≈ 10 4 km, and a previously unobserved power-law scaling over scales larger than 10 3 km. A smaller spectral peak exists at ≈ 300 km associated with mesoscales, which, due to their wider spread in wavenumber space, account for more than 50% of resolved surface KE globally. Seasonal cycles of length-scales exhibit a characteristic lag-time of ≈ 40 days per octave of length-scales such that in both hemispheres, KE at 10 2 km peaks in spring while KE at 10 3 km peaks in late summer. These results provide a new window for understanding the multiscale oceanic circulation within Earth’s climate system, including the largest planetary scales.

54 ENVIRONMENTAL SCIENCES↗

Error statistics and scalability of quantum error mitigation formulas

Quantum computing promises advantages over classical computing in many problems. Nevertheless, noise in quantum devices prevents most quantum algorithms from achieving the quantum advantage. Quantum error mitigation provides a variety of protocols to handle such noise using minimal qubit resources. While some of those protocols have been implemented in experiments for a few qubits, it remains unclear whether error mitigation will be effective in quantum circuits with tens to hundreds of qubits. In this paper, we apply statistics principles to quantum error mitigation and analyse the scaling behaviour of its intrinsic error. We find that the error increases linearly O(ϵN) with the gate number N before mitigation and sublinearly O(ϵ'N γ ) after mitigation, where γ ≈ 0.5, ϵ is the error rate of a quantum gate, and ϵ' is a protocol-dependent factor. The $\sqrt{N}$ scaling is a consequence of the law of large numbers, and it indicates that error mitigation can suppress the error by a larger factor in larger circuits. We propose the importance Clifford sampling as a key technique for error mitigation in large circuits to obtain this result.

97 MATHEMATICS AND COMPUTING↗

Theoretical guarantees for permutation-equivariant quantum neural networks

Despite the great promise of quantum machine learning models, there are several challenges one must overcome before unlocking their full potential. For instance, models based on quantum neural networks (QNNs) can suffer from excessive local minima and barren plateaus in their training landscapes. Recently, the nascent field of geometric quantum machine learning (GQML) has emerged as a potential solution to some of those issues. The key insight of GQML is that one should design architectures, such as equivariant QNNs, encoding the symmetries of the problem at hand. Here, we focus on problems with permutation symmetry (i.e., symmetry group $S_n$), and show how to build $S_n$-equivariant QNNs We provide an analytical study of their performance, proving that they do not suffer from barren plateaus, quickly reach overparametrization, and generalize well from small amounts of data. To verify our results, we perform numerical simulations for a graph state classification task. Our work provides theoretical guarantees for equivariant QNNs, thus indicating the power and potential of GQML.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dynamic resource allocation drives growth under nitrogen starvation in eukaryotes

Cells can sense changes in their extracellular environment and subsequently adapt their biomass composition. Nutrient abundance defines the capability of the cell to produce biomass components. Under nutrient-limited conditions, resource allocation dramatically shifts to carbon-rich molecules. Here, we used dynamic biomass composition data to predict changes in growth and reaction flux distributions using the available genome-scale metabolic models of five eukaryotic organisms (three heterotrophs and two phototrophs). We identified temporal profiles of metabolic fluxes that indicate long-term trends in pathway and organelle function in response to nitrogen depletion. Surprisingly, our calculations of model sensitivity and biosynthetic cost showed that free energy of biomass metabolites is the main driver of biosynthetic cost and not molecular weight, thus explaining the high costs of arginine and histidine. We demonstrated how metabolic models can accurately predict the complexity of interwoven mechanisms in response to stress over the course of growth.

59 BASIC BIOLOGICAL SCIENCES↗

Quantum machine learning with differential privacy

Abstract Quantum machine learning (QML) can complement the growing trend of using learned models for a myriad of classification tasks, from image recognition to natural speech processing. There exists the potential for a quantum advantage due to the intractability of quantum operations on a classical computer. Many datasets used in machine learning are crowd sourced or contain some private information, but to the best of our knowledge, no current QML models are equipped with privacy-preserving features. This raises concerns as it is paramount that models do not expose sensitive information. Thus, privacy-preserving algorithms need to be implemented with QML. One solution is to make the machine learning algorithm differentially private, meaning the effect of a single data point on the training dataset is minimized. Differentially private machine learning models have been investigated, but differential privacy has not been thoroughly studied in the context of QML. In this study, we develop a hybrid quantum-classical model that is trained to preserve privacy using differentially private optimization algorithm. This marks the first proof-of-principle demonstration of privacy-preserving QML. The experiments demonstrate that differentially private QML can protect user-sensitive information without signficiantly diminishing model accuracy. Although the quantum model is simulated and tested on a classical computer, it demonstrates potential to be efficiently implemented on near-term quantum devices [noisy intermediate-scale quantum (NISQ)]. The approach’s success is illustrated via the classification of spatially classed two-dimensional datasets and a binary MNIST classification. This implementation of privacy-preserving QML will ensure confidentiality and accurate learning on NISQ technology.

97 MATHEMATICS AND COMPUTING↗

An optoelectronic heterostructure for neuromorphic computing: CdS/V 3 O 5

Nonvolatile resistive switching is one of the key phenomena for emerging applications in optoelectronics and neuromorphic computing. In most of the cases, an electric field is applied to a two terminal dielectric material device and leads to the formation of a low resistance filament due to ion migration. However, the stochastic nature of the ion migration can be an impediment for the device robustness and controllability, with uncontrolled variations of high and low resistance states or threshold voltages. Here, we report an optically induced resistive switching based on a CdS/V 3 O 5 heterostructure which can overcome this issue. V 3 O 5 is known to have a second order insulator to metal transition around T c ≈ 415 K, with an electrically induced threshold switching at room temperature. Upon illumination, the direct transfer of the photoinduced carriers from the CdS into V 3 O 5 produces a nonvolatile resistive switching at room temperature. The initial high resistance can be recovered by reaching the high temperature metallic phase, i.e., temperatures above T c . Interestingly, this resistive switching becomes volatile around the T c . In conclusion, by locally manipulating the volatile and nonvolatile resistive switching using electric field and light, this system is a promising platform for hardware based neuromorphic computing implementations.

97 MATHEMATICS AND COMPUTING↗

CMaize: Simplifying inter-package modularity from the build up

There is a growing desire for inter-package modularity within the chemistry software community to reuse encapsulated code units across a variety of software packages. Most comprehensive efforts at achieving inter-package modularity will quickly run afoul of a very practical problem, being able to cohesively build the modules. Writing and maintaining build systems has long been an issue for many scientific software packages that rely on compiled languages such as C/C++. The push for inter-package modularity compounds this issue by additionally requiring binary artifacts from disparate developers to interoperate at a binary level. Thankfully, the de facto build tool for C/C++, CMake, is more than capable of supporting the myriad of edge cases that complicate writing robust build systems. Unfortunately, writing and maintaining a robust CMake build system can be a laborious endeavor because CMake provides few abstractions to aid the developer. Further, the need to significantly simplify the process of writing robust CMake-based build systems, especially in inter-package builds, motivated us to write CMaize. In addition to describing the architecture and design of CMaize, the article also demonstrates how CMaize is used in production-level software.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

SHarmonic: A fast and accurate implementation of spherical harmonics for electronic-structure calculations

The authors present SHarmonic, a new implementation of the spherical harmonics targeted for electronic-structure calculations. Their approach is to use explicit formulas for the harmonics written in terms of normalized Cartesian coordinates. This approach results in a code that is as precise as other implementations while being at least one order of magnitude more computationally efficient. The library can run on graphics processing units as well, achieving an additional order of magnitude in execution speed. This new implementation is simple to use and is provided under an open-source license; it can be readily used by other codes to avoid the error-prone and cumbersome implementation of the spherical harmonics.

Mathematics and Computing↗

Lieb-Robinson Bounds with Exponential-in-Volume Tails

Lieb-Robinson bounds demonstrate the emergence of locality in many-body quantum systems. Intuitively, Lieb-Robinson bounds state that, with local or exponentially decaying interactions, the correlation that can be built up between two sites separated by distance 𝑟 after a time 𝑡 decays as exp (𝑣⁢𝑡 −𝑟), where 𝑣 is the emergent Lieb-Robinson velocity. In many problems, it is important to also capture how much of an operator grows to act on 𝑟 𝑑 sites in 𝑑 spatial dimensions. Perturbation theory and cluster expansion methods suggest that, at short times, these volume-filling operators are suppressed as exp (−𝑟 𝑑 ). We confirm this intuition, showing that, for 𝑟 >𝑣⁢𝑡, the volume-filling operator is suppressed by exp (−(𝑟−𝑣⁢𝑡) 𝑑 /(𝑣⁢𝑡) 𝑑−1 ). This closes a conceptual and practical gap between the cluster expansion and the Lieb-Robinson bound. We then present two very different applications of this new bound. Firstly, we obtain improved bounds on the classical computational resources necessary to simulate many-body dynamics with error tolerance 𝜀 for any finite time 𝑡: as 𝜀 becomes sufficiently small, only 𝜀 −O⁡(𝑡 𝑑−1 ) resources are needed. A protocol that likely saturates this bound is given. Secondly, we prove that disorder operators have volume-law suppression near the “solvable (Ising) point” in quantum phases with spontaneous symmetry breaking, which implies a new diagnostic for distinguishing many-body phases of quantum matter.

computational complexity↗

Transport barriers to self-propelled particles in fluid flows

Here, we present theory and experiments demonstrating the existence of invariant manifolds that impede the motion of microswimmers in two-dimensional fluid flows. One-way barriers are apparent in a hyperbolic fluid flow that block the swimming of both smooth-swimming and run-and-tumble Bacillus subtilis bacteria. We identify key phase-space structures, called swimming invariant manifolds (SwIMs), that serve as separatrices between different regions of long-time swimmer behavior. When projected into xy space, the edges of the SwIMs act as one-way barriers, consistent with the experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Demonstration of Algorithmic Quantum Speedup

Despite the development of increasingly capable quantum computers, an experimental demonstration of a provable algorithmic quantum speedup employing today’s non-fault-tolerant devices has remained elusive. Here, in this study, we unequivocally demonstrate such a speedup within the oracular model, quantified in terms of the scaling with the problem size of the time-to-solution metric. We implement the single-shot Bernstein-Vazirani algorithm, which solves the problem of identifying a hidden bitstring that changes after every oracle query, using two different 27-qubit IBM Quantum superconducting processors. The speedup is observed on only one of the two processors when the quantum computation is protected by dynamical decoupling but not without it. The quantum speedup reported here does not rely on any additional assumptions or complexity-theoretic conjectures and solves a bona fide computational problem in the setting of a game with an oracle and a verifier.

97 MATHEMATICS AND COMPUTING↗