Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computer science, 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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Magnetic field mapping of inaccessible regions using physics-informed neural networks

A difficult problem concerns the determination of magnetic field components within an experimentally inaccessible region when direct field measurements are not feasible. In this paper, we propose a new method of accessing magnetic field components using non-disruptive magnetic field measurements on a surface enclosing the experimental region. Magnetic field components in the experimental region are predicted by solving a set of partial differential equations (Ampere’s law and Gauss’ law for magnetism) numerically with the aid of physics-informed neural networks (PINNs). Prediction errors due to noisy magnetic field measurements and small number of magnetic field measurements are regularized by the physics information term in the loss function. We benchmark our model by comparing it with an older method. The new method we present will be of broad interest to experiments requiring precise determination of magnetic field components, such as searches for the neutron electric dipole moment.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Solving tricky quantum optics problems with assistance from large language models

The capabilities of modern artificial intelligence (AI) as a “scientific collaborator” are explored by engaging it with three nuanced problems in quantum optics: state populations in optical pumping, resonant transitions between decaying states (the Burshtein effect), and degenerate mirrorless lasing. Through iterative dialogue, the authors observe that AI models–when prompted and corrected–can reason through complex scenarios, refine their answers, and provide expert-level guidance, closely resembling the interaction with an adept colleague. The findings highlight that AI can democratize access to sophisticated modeling and analysis, shifting the focus in scientific practice from technical mastery to the generation and testing of ideas, and reducing the time for completing research tasks from days to minutes.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2025

Breaking the mold: Overcoming the time constraints of molecular dynamics on general-purpose hardware

The evolution of molecular dynamics (MD) simulations has been intimately linked to that of computing hardware. For decades following the creation of MD, simulations have improved with computing power along the three principal dimensions of accuracy, atom count (spatial scale), and duration (temporal scale). Since the mid-2000s, computer platforms have, however, failed to provide strong scaling for MD, as scale-out central processing unit (CPU) and graphics processing unit (GPU) platforms that provide substantial increases to spatial scale do not lead to proportional increases in temporal scale. Important scientific problems therefore remained inaccessible to direct simulation, prompting the development of increasingly sophisticated algorithms that present significant complexity, accuracy, and efficiency challenges. While bespoke MD-only hardware solutions have provided a path to longer timescales for specific physical systems, their impact on the broader community has been mitigated by their limited adaptability to new methods and potentials. In this work, we show that a novel computing architecture, the Cerebras wafer scale engine, completely alters the scaling path by delivering unprecedentedly high simulation rates up to 1.144 M steps/s for 200 000 atoms whose interactions are described by an embedded atom method potential. This enables direct simulations of the evolution of materials using general-purpose programmable hardware over millisecond timescales, dramatically increasing the space of direct MD simulations that can be carried out. In this paper, we provide an overview of advances in MD over the last 60 years and present our recent result in the context of historical MD performance trends.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2019

Quantum eigenvalue estimation via time series analysis

We present an efficient method for estimating the eigenvalues of a Hamiltonian H from the expectation values of the evolution operator for various times. For a given quantum state ρ, our method outputs a list of eigenvalue estimates and approximate probabilities. Each probability depends on the support of ρ in those eigenstates of H associated with eigenvalues within an arbitrarily small range. The complexity of our method is polynomial in the inverse of a given precision parameter ε, which is the gap between eigenvalue estimates. Unlike the well-known quantum phase estimation algorithm that uses the quantum Fourier transform, our method does not require large ancillary systems, large sequences of controlled operations, or preserving coherence between experiments, and is therefore more attractive for near-term applications. The output of our method can be used to estimate spectral properties of H and other expectation values efficiently, within additive error proportional to ε.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Logical gates embedding in artificial spin ice

The realization and study of arrays of interacting magnetic nanoislands, such as artificial spin ices, have reached mature levels of control that allow design and demonstration of exotic, collective behaviors not seen in natural materials. Advances in the direct manipulation of their local, binary moments also suggest a use as nanopatterned, interacting memory media, for computation within a magnetic memory. Recent experimental work has demonstrated the possibility of building logic gates from clusters of interacting magnetic domains, and yet the possibility of large scale integration of such gates can prove problematic even at the theoretical level. Here we introduce theoretically complete sets of logical gates, in principle realizable in an experiment, and we study the feasibility of their integration into tree-like circuits. By evaluating the fidelity control parameter between their collective behavior and their expected logic functionality we determine conditions for integration. Also, we test our numerical results against the presence of disorder in the couplings, showing that the design gate structure is robust to small coupling perturbations, and thus possibly to small imperfections in the fabrication of the islands.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Supercomputers, Clouds and Grids powered by BigPanDA for Brain studies

The PanDA WMS - Production and Distributed Analysis Workload Management System - has been developed and used by the ATLAS experiment at the LHC (Large Hadron Collider) for all data processing and analysis challenges. BigPanDA is an extension of the PanDA WMS to run ATLAS and non-ATLAS applications on Leadership Class Facilities and supercomputers, as well as traditional grid and cloud resources. The success of the BigPanDA project has drawn attention from other compute intensive sciences such as biology. In 2017, a pilot project was started between BigPanDA and the Blue Brain Project (BBP) of the Ecole Polytechnique Federal de Lausanne (EPFL) located in Lausanne, Switzerland. This proof of concept project is aimed at demonstrating the efficient application of the BigPanDA system to support the complex scientific workflow of the BBP, which relies on using a mix of desktop, cluster and supercomputers to reconstruct and simulate accurate models of brain tissue.

Computer Science↗
DOE OSTI2019

Entanglement spectroscopy with a depth-two quantum circuit

Noisy intermediate-scale quantum (NISQ) computers have gate errors and decoherence, limiting the depth of circuits that can be implemented on them. Here, a strategy for NISQ algorithms is to reduce the circuit depth at the expense of increasing the qubit count.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

LTAU-FF: Loss Trajectory Analysis for Uncertainty in atomistic Force Fields

Model ensembles are effective tools for estimating prediction uncertainty in deep learning atomistic force fields. However, their widespread adoption is hindered by high computational costs and overconfident error estimates. In this work, we address these challenges by leveraging distributions of per-sample errors obtained during training and employing a distance-based similarity search in the model latent space. Our method, which we call LTAU (Loss Trajectory Analysis for Uncertainty), efficiently estimates the full probability distribution function of errors for any test point using the logged training errors, achieving speeds that are 2–3 orders of magnitudes faster than typical ensemble methods and allowing it to be used for tasks where training or evaluating multiple models would be infeasible. We apply LTAU towards estimating parametric uncertainty in atomistic force fields (LTAU-FF), demonstrating that it produces well-calibrated confidence intervals and predicts errors that correlate strongly with the true errors for data near the training domain. Furthermore, we show that the errors predicted by LTAU-FF can be used in practical applications for detecting out-of-domain data, tuning model performance, and predicting failure during simulations. We believe that LTAU will be a valuable tool for uncertainty quantification in atomistic force fields and is a promising method that should be further explored in other domains of machine learning.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Classical optimization with imaginary-time block encoding on quantum computers: The MaxCut problem

Optimization problems in finance, physics, and computer science are typically very hard to tackle in classical computing; quantum computing could help speed up computations and provide efficient methods for tackling large problems. Typically, to treat a problem with a quantum computer, the optimal solution is cast as the ground state of a diagonal Hamiltonian. Here, we develop a method, called imaginary-time evolution block encoding (ITE-BE), based on a recent imaginary-time algorithm, which requires no variational parameter optimization, as all parameters can be derived analytically from the target Hamiltonian. We also demonstrate that our method can be successfully combined with other quantum algorithms such as the quantum approximate optimization algorithm (QAOA). For illustration, here we study the MaxCut problem. We find that the QAOA ansatz increases the postselection success of ITE-BE, and shallow QAOA circuits, when boosted with ITE-BE, achieve better performance than deeper QAOA circuits. For the special case of the transverse initial state, we adapt our block-encoding scheme to allow for a deterministic application of the first layer of the circuit.

Zhong, Dawei [University of Southern California, L↗
DOE OSTI2021

Quantum Solver of Contracted Eigenvalue Equations for Scalable Molecular Simulations on Quantum Computing Devices

The accurate computation of ground and excited states of many-fermion quantum systems is one of the most consequential, contemporary challenges in the physical and computational sciences whose solution stands to benefit significantly from the advent of quantum computing devices. Existing methodologies using phase estimation or variational algorithms have potential drawbacks such as deep circuits requiring substantial error correction or non-trivial high-dimensional classical optimization. In this work, we introduce a quantum solver of contracted eigenvalue equations, the quantum analogue of classical methods for the energies and reduced density matrices of ground and excited states. The solver does not require deep circuits or difficult classical optimization and achieves an exponential speed-up over its classical counterpart. We demonstrate the algorithm though computations on both a quantum simulator and two IBM quantum processing units.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Eavesdropping on the Decohering Environment: Quantum Darwinism, Amplification, and the Origin of Objective Classical Reality

“How much information about a system S can one extract from a fragment F of the environment E that decohered it?” is the central question of Quantum Darwinism. To date, most answers relied on the quantum mutual information of SF, or on the Holevo bound on the channel capacity of F to communicate the classical information encoded in S. Furthermore, these are reasonable upper bounds on what is really needed but much harder to calculate—the accessible information in the fragment F about S. We consider a model based on imperfect c-not gates where all the above can be computed, and discuss its implications for the emergence of objective classical reality. We find that all relevant quantities, such as the quantum mutual information as well as various bounds on the accessible information exhibit similar behavior. In the regime relevant for the emergence of objective classical reality this includes scaling independent of the quality of the imperfect c-not gates or the size of E, and even nearly independent of the initial state of S.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Reformulation of the No-Free-Lunch Theorem for Entangled Datasets

The No-Free-Lunch (NFL) theorem is a celebrated result in learning theory that limits one’s ability to learn a function with a training data set. With the recent rise of quantum machine learning, it is natural to ask whether there is a quantum analog of the NFL theorem, which would restrict a quantum computer’s ability to learn a unitary process with quantum training data. However, in the quantum setting, the training data can possess entanglement, a strong correlation with no classical analog. In this work, we show that entangled data sets lead to an apparent violation of the (classical) NFL theorem. This motivates a reformulation that accounts for the degree of entanglement in the training set. As our main result, we prove a quantum NFL theorem whereby the fundamental limit on the learnability of a unitary is reduced by entanglement. We employ Rigetti's quantum computer to test both the classical and quantum NFL theorems. In conclusion, our work establishes that entanglement is a commodity in quantum machine learning.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Teaching Quantum Computing to High School Students

Quantum computing is a growing field at the intersection of physics and computer science. The goal of this article is to highlight a successfully trialled quantum computing course for high school students between the ages of 15 and 18 years old. This course was designed to bridge the gap between popular science articles and advanced undergraduate textbooks. Conceptual ideas in the text are reinforced with active learning techniques, such as interactive problem sets and simulation-based labs at various levels. The course is freely available for use and download under the Creative Commons “Attribution-NonCommercial-ShareAlike 4.0 International” license.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Energy spectrum of two-particle scattering in a periodic box

We aim to compute the discrete energy spectrum for two-body scattering in a three-dimensional box under periodic boundary conditions. The spectrum in the center of mass is obtained by solving the Schödinger equation in a test potential using the Fourier basis. The focus is on how to project the spectrum into the various irreducible representations of the symmetry groups of the box. Four examples are given to show how the infinite-volume spectrum (including both bound and scattering states) is resolved in cubic or elongated boxes, and in systems with integer or half-integer total spin. Such a demonstration is a crucial step in relating the discrete spectrum in the box to the infinite-volume scattering phaseshifts via the Lüscher method.

Computer Science↗