Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Quantum algorithm sampling”

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.

160 records · Page 9
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Randomized Algorithms for Scientific Computing (RASC)

Randomized algorithms have propelled advances in artificial intelligence (AI) and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office of Science priority areas such as climate science, astrophysics, fusion, advanced materials, combustion, and quantum computing all require randomized algorithms for surmounting challenges of complexity, robustness, and scalability. Advances in data collection and numerical simulation have changed the dynamics of scientific research and motivate the need for randomized algorithms. For instance, advances in imaging technologies such as X-ray ptychography, electron microscopy, electron energy loss spectroscopy, or adaptive optics lattice light-sheet microscopy collect hyperspectral imaging and scattering data in terabytes, at breakneck speed enabled by state-of-the-art detectors. The data collection is exceptionally fast compared with its analysis. Likewise, advances in high-performance architectures have made exascale computing a reality and changed the economies of scientific computing in the process. Floating-point operations that create data are essentially free in comparison with data movement. Thus far, most approaches have focused on creating faster hardware. Ironically, this faster hardware has exacerbated the problem by making data still easier to create. Under such an onslaught, scientists often resort to heuristic deterministic sampling schemes (e.g., low-precision arithmetic, sampling every nth element) and sacrifice potentially valuable accuracy. Dramatically better results can be achieved via randomized algorithms, reducing the data size as much as or more than naive deterministic subsampling can achieve, while retaining the high accuracy of computing on the full data set. By randomized algorithms we mean those algorithms that employ some form of randomness in internal algorithmic decisions to accelerate time to solution, increase scalability, or improve reliability. Examples include matrix sketching for solving large-scale least-squares problems (see Figure 1) and stochastic gradient descent for training machine learning models. We are not recommending heuristic methods but rather randomized algorithms that have certificates of correctness and probabilistic guarantees of optimality and near-optimality. Such approaches can be useful beyond acceleration, for example, in understanding how to avoid measure zero worst-case scenarios that plague methods such as QR matrix factorization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Importance learning estimator for the site-averaged turnover frequency of a disordered solid catalyst

For disordered catalysts such as atomically dispersed “single-atom” metals on amorphous silica, the active sites inherit different properties from their quenched-disordered local environments. The observed kinetics are site-averages, typically dominated by a small fraction of highly active sites. Standard sampling methods require expensive ab initio calculations at an intractable number of sites to converge on the siteaveraged kinetics. We present a new method that efficiently estimates the site-averaged turnover frequency (TOF). The new estimator uses the same importance learning algorithm [Vandervelden et al., React. Chem. Eng. 5, 77 (2020)] that we previously used to compute the siteaveraged activation energy. We demonstrate the method by computing the site-averaged TOF for a simple disordered lattice model of an amorphous catalyst. The results show that with the importance learning algorithm, the site-averaged TOF and activation energy can now be obtained concurrently with orders of magnitude reduction in required ab initio calculations.

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

Jet fragmentation function and groomed substructure of bottom quark jets in proton-proton collisions at 5.02 TeV

A measurement of the substructure of bottom quark jets (b jets) in proton-proton (pp) collisions is presented. The measurement uses data collected in pp collisions at $\sqrt{s}=5.02$ TeV, with a low number of simultaneous interactions per bunch crossing, recorded by the CMS experiment in 2017, corresponding to an integrated luminosity of 301 pb −1 . An algorithm to identify and cluster the charged decay daughters of b hadrons is developed for this analysis, which facilitates the exposure of the gluon radiation pattern of b jets using iterative Cambridge-Aachen declustering. The soft-drop-groomed jet radius, R g , and momentum balance, z g , of b quark jets are presented. These observables can be used to test perturbative quantum chromodynamics predictions that account for mass effects. Because the b hadron is partially reconstructed from its charged decay daughters, only charged particles are used for the jet substructure studies. In addition, a jet fragmentation function, z b,ch , is measured, which is defined as the distribution of the ratio of the transverse momentum (p T ) of the partially reconstructed b hadron with respect to the charged-particle component of the jet p T . The substructure variable distributions are unfolded to the charged-particle level. The b jet substructure is compared to the substructure of jets in an inclusive jet sample that is dominated by light-quark and gluon jets in order to assess the role of the b quark mass. A strong suppression of emissions at small R g values is observed for b jets when compared to inclusive jets, consistent with the dead-cone effect. The measurement is also compared with theoretical predictions from Monte Carlo event generators. This is the first substructure measurement of b jets that clusters together the b hadron decay daughters independent of the b hadron species and decay channel.

boosted jets↗
DOE OSTI2020

Smart Scattering Scanning Near-Field Optical Microscopy

Scattering scanning near-field optical microscopy (s-SNOM) provides spectroscopic imaging from molecular to quantum materials with few nanometer deep subdiffraction limited spatial resolution. However, in its conventional implementation s-SNOM is slow to effectively acquire a series of spatio-spectral images, especially with large fields of view. This problem is further exacerbated for weak resonance contrast or when using light sources with limited spectral irradiance. Indeed, the generally limited signal-to-noise ratio prevents sampling a weak signal at the Nyquist sampling rate. Here, we demonstrate how acquisition time and sampling rate can be significantly reduced by using compressed sampling, matrix completion, and adaptive random sampling, while maintaining or even enhancing the physical or chemical image content. We use fully sampled real data sets of molecular, biological, and quantum materials as ground-truth physical data and show how deep under-sampling with a corresponding reduction of acquisition time by 1 order of magnitude or more retains the core s-SNOM image information. We demonstrate that a sampling rate of up to 6× smaller than the Nyquist criterion can be applied, which would provide a 30-fold reduction in the data required under typical experimental conditions. Furthermore, our smart s-SNOM approach is generally applicable and provides systematic full spatio-spectral s-SNOM imaging with a large field of view at high spectral resolution and reduced acquisition time.

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

Optimization of Geometric Perturbations on a Rod Moving Through a High Explosive Target

After completing a study to ensure the simulation results were converged, several high resolution 3D Smoothed Particle Hydrodynamic (SPH) simulations of copper rods impacting a high explosive (LX14) target were performed. This was then formulated into an optimization problem: I wanted to find the optimum shape and location of a perturbation on the rod that would maximize its erosion after it left the target. The shape of the perturbation was modeled as a 2D Gaussian bump and parameterized by its location along the rod axis (z 0 ) and amplitude (A). The final mass of the coherent part of the rod as it leaves the target was used as a metric to represent the erosion of the rod, and the optimization was formulated to maximize this metric with respect to the aforementioned design variables. Due to the expensive nature of the high-fidelity 3D SPH simulations, a surrogate model needed to be chosen so that many function calls to the optimizer would be feasible. Thus, a strategic full factorial sampling plan was chosen to build a dataset, which consisted of 24 high-fidelity simulations. Two surrogate models, a third order polynomial regression model and a Gaussian Process Model, were analyzed using a 14%/86% test/train holdout technique. The root mean square and R2 score of the test set was used to determine the best model, and the third order polynomial regression model was chosen as the surrogate model. Finally, the Nelder-Mead Simplex and Basin-hopping optimization algorithms were implemented, and it was found that the two algorithms gave slightly different optimum values. Nelder-Mead gave an optimum point of [z* 0 ;A*] = [9:9;0:4] and Basin-Hopping gave an optimum value of x* = [z* 0 ;A*] = [9:2;0:1].

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗
DOE OSTI2020

Finding wombling boundaries in LHC data with Voronoi and Delaunay tessellations

We address the problem of finding a wombling boundary in point data generated by a general Poisson point process, a specific example of which is an LHC event sample distributed in the phase space of a final state signature, with the wombling boundary created by some new physics. We discuss the use of Voronoi and Delaunay tessellations of the point data for estimating the local gradients and investigate methods for sharpening the boundaries by reducing the statistical noise. The outcome from traditional wombling algorithms is a set of boundary cell candidates with relatively large gradients, whose spatial properties must then be scrutinized in order to construct the boundary and evaluate its significance. Here we propose an alternative approach where we simultaneously form and evaluate the significance of all possible boundaries in terms of the total gradient flux. We illustrate our method with several toy examples of both straight and curved boundaries with varying amounts of signal present in the data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Deep Learning for In-Situ Layer Quality Monitoring during Laser-Based Directed Energy Deposition (LB-DED) Additive Manufacturing Process

Defects are a leading issue for the rejection of parts manufactured through the Directed Energy Deposition (DED) Additive Manufacturing (AM) process. In an attempt to illuminate and advance in situ quality monitoring and control of workpieces, we present an innovative data-driven method that synchronously collects sensing data and AM process parameters with a low sampling rate during the DED process. The proposed data-driven technique determines the important influences that individual printing parameters and sensing features have on prediction at the inter-layer qualification to perform feature selection. Three Machine Learning (ML) algorithms including Random Forest (RF), Support Vector Machine (SVM), and Convolutional Neural Network (CNN) are used. During post-production, a threshold is applied to detect low-density occurrences such as porosity sizes and quantities from CT scans that render individual layers acceptable or unacceptable. This information is fed to the ML models for training. Training/testing are completed offline on samples deemed “high-quality” and “low-quality”, utilizing only features recorded from the build process. CNN results show that the classification of acceptable/unacceptable layers can reach between 90% accuracy while training/testing on a “high-quality” sample and dip to 65% accuracy when trained/tested on “low-quality”/“high-quality” (respectively), indicating over-fitting but showing CNN as a promising inter-layer classifier.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Machine learning framework for quantum sampling of highly constrained, continuous optimization problems

In recent years, there is growing interest in using quantum computers for solving combinatorial optimization problems. In this work, we developed a generic, machine learning-based framework for mapping continuous-space inverse design problems into surrogate quadratic unconstrained binary optimization (QUBO) problems by employing a binary variational autoencoder and a factorization machine. The factorization machine is trained as a low-dimensional, binary surrogate model for the continuous design space and sampled using various QUBO samplers. Using the D-Wave Advantage hybrid sampler and simulated annealing, we demonstrate that by repeated resampling and retraining of the factorization machine, our framework finds designs that exhibit figures of merit exceeding those of its training set. We showcase the framework’s performance on two inverse design problems by optimizing (i) thermal emitter topologies for thermophotovoltaic applications and (ii) diffractive meta-gratings for highly efficient beam steering. This technique can be further scaled to leverage future developments in quantum optimization to solve advanced inverse design problems for science and engineering applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

End-to-end jet classification of boosted top quarks with the CMS open data

Here we describe a novel application of the end-to-end deep learning technique to the task of discriminating top quark-initiated jets from those originating from the hadronization of a light quark or a gluon. The end-to-end deep learning technique uses low-level detector representation of high-energy collision event as inputs to deep learning algorithms. In this study, we use low-level detector information from the simulated Compact Muon Solenoid (CMS) open data samples to construct the top jet classifiers. To optimize classifier performance we progressively add low-level information from the CMS tracking detector, including pixel detector reconstructed hits and impact parameters, and demonstrate the value of additional tracking information even when no new spatial structures are added. Relying only on calorimeter energy deposits and reconstructed pixel detector hits, the end-to-end classifier achieves an area under the receiver operator curve (AUC) score of 0.975 ± 0.002 for the task of classifying boosted top quark jets. After adding derived track quantities, the classifier AUC score increases to 0.9824 ± 0.0013, serving as the first performance benchmark for these CMS open data samples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Bayesian sparse learning with preconditioned stochastic gradient MCMC and its applications

Deep neural networks have been successfully employed in an extensive variety of research areas, including solving partial differential equations. Despite its significant success, there are some challenges in effectively training DNN, such as avoiding overfitting in over-parameterized DNNs and accelerating the optimization in DNNs with pathological curvature. Here, we propose a Bayesian type sparse deep learning algorithm. The algorithm utilizes a set of spike-and-slab priors for the parameters in the deep neural network. The hierarchical Bayesian mixture will be trained using an adaptive empirical method. That is, one will alternatively sample from the posterior using preconditioned stochastic gradient Langevin Dynamics (PSGLD), and optimize the latent variables via stochastic approximation. The sparsity of the network is achieved while optimizing the hyperparameters with adaptive searching and penalizing. A popular SG-MCMC approach is Stochastic gradient Langevin dynamics (SGLD). However, considering the complex geometry in the model parameter space in nonconvex learning, updating parameters using a universal step size in each component as in SGLD may cause slow mixing. To address this issue, we apply a computationally manageable preconditioner in the updating rule, which provides a step-size parameter to adapt to local geometric properties. Moreover, by smoothly optimizing the hyperparameter in the preconditioning matrix, our proposed algorithm ensures a decreasing bias, which is introduced by ignoring the correction term in the preconditioned SGLD. According to the existing theoretical framework, we show that the proposed algorithm can asymptotically converge to the correct distribution with a controllable bias under mild conditions. Numerical tests are performed on both synthetic regression problems and learning solutions of elliptic PDE, which demonstrate the accuracy and efficiency of the present work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Cost of emulating a small quantum annealing problem in the circuit model

Demonstrations of quantum advantage for certain sampling problems have generated considerable excitement for quantum computing and have further spurred the development of circuit-model quantum computers, which represent quantum programs as a sequence of quantum gates acting on a finite number of qubits. Amongst this excitement, analog quantum computation has become less prominent, with the expectation that circuit-model quantum computers will eventually be sufficient for emulating analog quantum computation and thus rendering analog quantum computation obsolete. In this work we explore the basic requirements for emulating a specific analog quantum computation in the circuit model: the preparation of a biased superposition of degenerate ground states of an Ising Hamiltonian using an adiabatic evolution. We show that the overhead of emulation is substantial even for this simple problem. This supports using analog quantum computation for solving time-dependent Hamiltonian dynamics in the short term and midterm, assuming analog errors can be made low enough and coherence times long enough to solve problems of practical interest.

Quantum algorithms & computation↗
DOE OSTI2021

Monte Carlo MP2-F12 for Noncovalent Interactions: The C 60 Dimer

A scalable stochastic algorithm is presented that can evaluate explicitly correlated (F12) second-order many-body perturbation (MP2) energies of weak, noncovalent, intermolecular interactions. It first transforms the formulas of the MP2 and F12 energy differences into a short sum of high-dimensional integrals of Green’s functions in real space and imaginary time. Furthermore, these integrals are then evaluated by the Monte Carlo method augmented by parallel execution, redundant-walker convergence acceleration, direct-sampling autocorrelation elimination, and control-variate error reduction. By sharing electron-pair walkers across the supermolecule and its subsystems spanned by the joint basis set, the statistical uncertainty is reduced by one to 2 orders of magnitude in the MP2 binding energy corrected for the basis-set incompleteness and superposition errors. The method predicts the MP2-F12/aug-cc-pVDZ binding energy of 19.1 ± 4.0 kcal mol –1 for the C 60 dimer at the center distance of 9.748 Å.

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

Bayesian inference for plasmonic nanometrology

Here, we introduce a Bayesian method for the characterization of plasmonic nanoparticles, which is applicable to both near- and far-field problems. Designed to combine data generated from any photon-plasmon interaction experiment with physically motivated theoretical models, our approach leverages state-of-the-art Markov chain Monte Carlo sampling techniques and returns parameter estimates on nanometric scales. Simulated spectral data sets, describing resonant scattering of photons from ellipsoidal and toroidal nanoparticles, are explored as concrete examples of our approach, with the resulting Bayesian estimates showing excellent agreement with the ground truth, even under conditions of high statistical noise. By incorporating Bayes factors into the method as well, we reveal how model selection can determine which one of competing geometric shapes better explains the observed data. Our comprehensive nanometrology procedure can be tailored to a variety of light-particle interaction models, and its reliance on Bayesian inference furnishes automatic uncertainty quantification. In addition to applicability to a host of plasmonic configurations such as nanoparticle dimers, trimers, and array studies, it is proposed that the presented analysis can be extended to the quantum regime, where nonclassical photon statistics may provide additional insight for inference of scatterer properties.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Orbits and Masses of Binaries from Speckle Interferometry at SOAR

We present results from Speckle inteferometric observations of 15 visual binaries and one double-line spectroscopic binary, carried out with the HRCam Speckle camera of the SOAR 4.1 m telescope. These systems were observed as a part of an on-going survey to characterize the binary population in the solar vicinity, out to a distance of 250 pc. We obtained orbital elements and mass sums for our sample of visual binaries. The orbits were computed using a Markov Chain Monte Carlo algorithm that delivers maximum likelihood estimates of the parameters, as well as posterior probability density functions that allow us to evaluate their uncertainty. Their periods cover a range from 5 yr to more than 500 yr; and their spectral types go from early A to mid M, implying total system masses from slightly more than 4M{sub ⊙} down to 0.2M {sub ⊙}. They are located at distances between approximately 12 and 200 pc, mostly at low Galactic latitude. For the double-line spectroscopic binary YSC8, we present the first combined astrometric/radial-velocity orbit resulting from a self-consistent fit, leading to individual component masses of 0.897 ± 0.027 M {sub ⊙} and 0.857 ± 0.026 M {sub ⊙}; and an orbital parallax of 26.61 ± 0.29 mas, which compares very well with the Gaia DR2 trigonometric parallax (26.55 ± 0.27 mas). In combination with published photometry and trigonometric parallaxes, we place our objects on an H-R diagram and discuss their evolutionary status. We also present a thorough analysis of the precision and consistency of the photometry available for them.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2022

Sample-Efficient Adaptive Calibration of Quantum Networks Using Bayesian Optimization

All physical systems employed for quantum information tasks must act as unbiased carriers of encoded quantum states. Ensuring such indistinguishability of information carriers is a major challenge in many quantum information applications, including advanced quantum communication protocols. For photons, the workhorses of quantum communication networks, it is difficult to obtain and maintain their indistinguishability because of environment-induced transformations and loss imparted by communication channels, especially in noisy scenarios. Conventional strategies to mitigate these transformations often require hardware or software overhead that is restrictive (e.g., adding noise), infeasible (e.g., on a satellite), or time-consuming for deployed networks. In this work we propose and develop resource-efficient Bayesian optimization techniques to rapidly and adaptively calibrate the indistinguishability of individual photons for quantum networks using only information derived from their measurement. To experimentally validate our approach, we demonstrate the optimization of Hong-Ou-Mandel interference between two photons-a central task in quantum networking- finding rapid, efficient, and reliable convergence towards maximal photon indistinguishability in the presence of high loss and shot noise. We expect our resource-optimized and experimentally friendly methodology will allow fast and reliable calibration of indistinguishable quanta, a necessary task in distributed quantum computing, communications, and sensing, as well as for fundamental investigations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Error-mitigated nonorthogonal quantum eigensolver via shadow tomography

We present a shadow-tomography-enhanced nonorthogonal quantum eigensolver (NOQE) for more efficient and accurate electronic structure calculations on near-term quantum devices. By integrating shadow tomography into the NOQE, the measurement cost scales linearly rather than quadratically with the number of reference states, while also reducing the required qubits and circuit depth by half. This approach enables extraction of all matrix elements via randomized measurements and classical postprocessing. We analyze its sample complexity and show that, for small systems, it remains constant in the high-precision regime, while for larger systems, it scales linearly with the system size. We further apply shadow-based error mitigation to suppress noise-induced bias without increasing quantum resources. Demonstrations on the hydrogen molecule in the strongly correlated regime achieve chemical accuracy under realistic noise, showing that our method is both resource-efficient and noise-resilient for practical quantum chemistry simulations in the near term.

quantum algorithms & computation↗