Search NASA⌕ Search

SEARCH · Search NASA

Results for “quantum distributed algorithms”

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 343 records · Page 19

Simulative design and process optimization of the two-stage stretch-blow molding process

The total production costs of PET bottles are significantly affected by the costs of raw material. Approximately 70 % of the total costs are spent for the raw material. Therefore, stretch-blow molding industry intends to reduce the total production costs by an optimized material efficiency. However, there is often a trade-off between an optimized material efficiency and required product properties. Due to a multitude of complex boundary conditions, the design process of new stretch-blow molded products is still a challenging task and is often based on empirical knowledge. Application of current CAE-tools supports the design process by reducing development time and costs. This paper describes an approach to determine optimized preform geometry and corresponding process parameters iteratively. The wall thickness distribution and the local stretch ratios of the blown bottle are calculated in a three-dimensional process simulation. Thereby, the wall thickness distribution is correlated with an objective function and preform geometry as well as process parameters are varied by an optimization algorithm. Taking into account the correlation between material usage, process history and resulting product properties, integrative coupled simulation steps, e.g. structural analyses or barrier simulations, are performed. The approach is applied on a 0.5 liter PET bottle of Krones AG, Neutraubling, Germany. The investigations point out that the design process can be supported by applying this simulative optimization approach. In an optimization study the total bottle weight is reduced from 18.5 g to 15.5 g. The validation of the computed results is in progress.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Accelerated simulation of stochastic particle removal processes in particle-resolved aerosol models

Stochastic particle-resolved methods have proven useful for simulating multi-dimensional systems such as composition-resolved aerosol size distributions. While particle-resolved methods have substantial benefits for highly detailed simulations, these techniques suffer from high computational cost, motivating efforts to improve their algorithmic efficiency. Here we formulate an algorithm for accelerating particle removal processes by aggregating particles of similar size into bins. We present the Binned Algorithm for particle removal processes and analyze its performance with application to the atmospherically relevant process of aerosol dry deposition. We show that the Binned Algorithm can dramatically improve the efficiency of particle removals, particularly for low removal rates, and that computational cost is reduced without introducing additional error. In simulations of aerosol particle removal by dry deposition in atmospherically relevant conditions, we demonstrate about 50-times increase in algorithm efficiency.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A First-Passage Kinetic Monte Carlo algorithm for complex diffusion-reaction systems

We develop an asynchronous event-driven First-Passage Kinetic Monte Carlo (FPKMC) algorithm for continuous time and space systems involving multiple diffusing and reacting species of spherical particles in two and three dimensions. The FPKMC algorithm presented here is based on the method introduced in Oppelstrup et al. and is implemented in a robust and flexible framework. Unlike standard KMC algorithms such as the n-fold algorithm, FPKMC is most efficient at low densities where it replaces the many small hops needed for reactants to find each other with large first-passage hops sampled from exact time-dependent Green's functions, without sacrificing accuracy. We describe in detail the key components of the algorithm, including the event-loop and the sampling of first-passage probability distributions, and demonstrate the accuracy of the new method. We apply the FPKMC algorithm to the challenging problem of simulation of long-term irradiation of metals, relevant to the performance and aging of nuclear materials in current and future nuclear power plants. The problem of radiation damage spans many decades of time-scales, from picosecond spikes caused by primary cascades, to years of slow damage annealing and microstructure evolution. Our implementation of the FPKMC algorithm has been able to simulate the irradiation of a metal sample for durations that are orders of magnitude longer than any previous simulations using the standard Object KMC or more recent asynchronous algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Photoluminescence-Imaging-Based Evaluation of Non-Uniform CdTe Degradation

A control algorithm is designed to smooth the variability of PV power output using distributed batteries. The tradeoff between smoothing and battery size is shown. It is also demonstrated that large numbers of highly distributed current, voltage, and irradiance sensors can be utilized to control the distributed storage in a more optimal manner. It is also demonstrated that centralized energy storage control for PV ramp rate smoothing requires very fast communication, typically less than a 15-second update rate. Finally, advanced inverter dynamic reactive current is shown to provide voltage variability smoothing, hence reducing the number of voltage regulator tap changes without energy storage.

14 SOLAR ENERGY↗

Universality of Poisson-driven plasma fluctuations in the Alcator C-Mod scrape-off layer

Large-amplitude, intermittent fluctuations are ubiquitous in the boundary region of magnetically confined plasmas and lead to detrimental plasma-wall interactions in next-generation, high duty cycle fusion power experiments. Using gas puff imaging data time series from the scrape-off layer in the Alcator C-Mod device, it is demonstrated in this work that the large-amplitude fluctuations can be described as a super-position of pulses with a fixed shape and a constant duration. By applying a new deconvolution algorithm on the data time series with a two-sided exponential pulse function, the arrival times and amplitudes of the pulses can be estimated, and the measurement time series can be reconstructed with high accuracy. The pulse amplitudes are shown to follow an exponential distribution. The waiting times between pulses are uncorrelated, their distribution has an exponential tail, and the number of arrivals is a linear function of time. This demonstrates that pulse arrivals follow a homogeneous Poisson process. Identical statistical properties apply to both ohmic and high confinement mode plasmas, clearly demonstrating the universality of the fluctuation statistics in the boundary region of Alcator C-Mod.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Discovering causal structure with reproducing-kernel Hilbert space ε -machines

We merge computational mechanics’ definition of causal states (predictively equivalent histories) with reproducing-kernel Hilbert space (RKHS) representation inference. The result is a widely applicable method that infers causal structure directly from observations of a system’s behaviors whether they are over discrete or continuous events or time. A structural representation—a finite- or infinite-state kernel ϵ-machine—is extracted by a reduced-dimension transform that gives an efficient representation of causal states and their topology. In this way, the system dynamics are represented by a stochastic (ordinary or partial) differential equation that acts on causal states. We introduce an algorithm to estimate the associated evolution operator. Paralleling the Fokker–Planck equation, it efficiently evolves causal-state distributions and makes predictions in the original data space via an RKHS functional mapping. We demonstrate these techniques, together with their predictive abilities, on discrete-time, discrete-value infinite Markov-order processes generated by finite-state hidden Markov models with (i) finite or (ii) uncountably infinite causal states and (iii) continuous-time, continuous-value processes generated by thermally driven chaotic flows. The method robustly estimates causal structure in the presence of varying external and measurement noise levels and for very high-dimensional data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Improving qubit readout with hidden Markov models

We demonstrate the application of pattern recognition algorithms via hidden Markov models (HMM) for qubit readout. This scheme provides a state-path trajectory approach capable of detecting qubit-state transitions and makes for a robust classification scheme with higher starting-state assignment fidelity than when compared to a multivariate Gaussian or a support vector machine scheme. Therefore, the method also eliminates the qubit-dependent readout time optimization requirement in current schemes. Using a HMM state discriminator we estimate fidelities reaching the ideal limit. Unsupervised learning gives access to transition matrix, priors, and IQ distributions, providing a toolbox for studying qubit-state dynamics during strong projective readout.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An image-based technique to assess the perceptual quality of clinical chest radiographs

Purpose: Current clinical image quality assessment techniques mainly analyze image quality for the imaging system in terms of factors such as the capture system modulation transfer function, noise power spectrum, detective quantum efficiency, and the exposure technique. While these elements form the basic underlying components of image quality, when assessing a clinical image, radiologists seldom refer to these factors, but rather examine several specific regions of the displayed patient images, further impacted by a particular image processing method applied, to see whether the image is suitable for diagnosis. In this paper, the authors developed a novel strategy to simulate radiologists' perceptual evaluation process on actual clinical chest images. Methods: Ten regional based perceptual attributes of chest radiographs were determined through an observer study. Those included lung grey level, lung detail, lung noise, rib-lung contrast, rib sharpness, mediastinum detail, mediastinum noise, mediastinum alignment, subdiaphragm-lung contrast, and subdiaphragm area. Each attribute was characterized in terms of a physical quantity measured from the image algorithmically using an automated process. A pilot observer study was performed on 333 digital chest radiographs, which included 179 PA images with 10:1 ratio grids (set 1) and 154 AP images without grids (set 2), to ascertain the correlation between image perceptual attributes and physical quantitative measurements. To determine the acceptable range of each perceptual attribute, a preliminary quality consistency range was defined based on the preferred 80% of images in set 1. Mean value difference ({mu}{sub 1}-{mu}{sub 2}) and variance ratio ({sigma}{sub 1}{sup 2}/{sigma}{sub 2}{sup 2}) were investigated to further quantify the differences between the selected two image sets. Results: The pilot observer study demonstrated that our regional based physical quantity metrics of chest radiographs correlated very well with their corresponding perceptual attributes. The distribution comparisons, mean value difference estimations, and variance ratio estimations of each physical quantity between sets of images from two different techniques matched our expectation that the image quality of set 1 should be better than that of set 2. Conclusions: The measured physical quantities provide a robust reflection of perceptual image quality in clinical images. The methodology can be readily applied for automated evaluation of perceptual image quality in clinical chest radiographs.

60 APPLIED LIFE SCIENCES↗

On a theory of stability for nonlinear stochastic chemical reaction networks

We present elements of a stability theory for small, stochastic, nonlinear chemical reaction networks. Steady state probability distributions are computed with zero-information (ZI) closure, a closure algorithm that solves chemical master equations of small arbitrary nonlinear reactions. Stochastic models can be linearized around the steady state with ZI-closure, and the eigenvalues of the Jacobian matrix can be readily computed. Eigenvalues govern the relaxation of fluctuation autocorrelation functions at steady state. Autocorrelation functions reveal the time scales of phenomena underlying the dynamics of nonlinear reaction networks. In accord with the fluctuation-dissipation theorem, these functions are found to be congruent to response functions to small perturbations. Significant differences are observed in the stability of nonlinear reacting systems between deterministic and stochastic modeling formalisms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Unbiased simulation of near-Clifford quantum circuits

Modeling and simulation are essential for predicting and verifying the behavior of fabricated quantum circuits, but existing simulation methods are either impractically costly or require an unrealistic simplification of error processes. In this paper, we present a method of simulating noisy Clifford circuits that is both accurate and practical in experimentally relevant regimes. In particular, the cost is weakly exponential in the size and the degree of non-Cliffordness of the circuit. Our approach is based on the construction of exact representations of quantum channels as quasiprobability distributions over stabilizer operations, which are then sampled, simulated, and weighted to yield unbiased statistical estimates of circuit outputs and other observables. As a demonstration of these techniques, we simulate a Steane [[7,1,3]]-encoded logical operation with non-Clifford errors and compute its fault tolerance error threshold. Finally, we expect that the method presented here will enable studies of much larger and more realistic quantum circuits than was previously possible.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adaptive thresholding and dynamic windowing method for automatic centroid detection of digital Shack-Hartmann wavefront sensor

A Shack-Hartmann wavefront sensor (SWHS) splits the incident wavefront into many subsections and transfers the distorted wavefront detection into the centroid measurement. The accuracy of the centroid measurement determines the accuracy of the SWHS. Many methods have been presented to improve the accuracy of the wavefront centroid measurement. However, most of these methods are discussed from the point of view of optics, based on the assumption that the spot intensity of the SHWS has a Gaussian distribution, which is not applicable to the digital SHWS. In this paper, we present a centroid measurement algorithm based on the adaptive thresholding and dynamic windowing method by utilizing image processing techniques for practical application of the digital SHWS in surface profile measurement. The method can detect the centroid of each focal spot precisely and robustly by eliminating the influence of various noises, such as diffraction of the digital SHWS, unevenness and instability of the light source, as well as deviation between the centroid of the focal spot and the center of the detection area. The experimental results demonstrate that the algorithm has better precision, repeatability, and stability compared with other commonly used centroid methods, such as the statistical averaging, thresholding, and windowing algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Measurement of the production of charm jets tagged with D 0 mesons in pp collisions at $\sqrt{\mathrm{s}}=7$ TeV

The production of charm jets in proton-proton collisions at a center-of-mass energy of $\sqrt{\mathrm{s}}=7$ TeV was measured with the ALICE detector at the CERN Large Hadron Collider. The measurement is based on a data sample corresponding to a total integrated luminosity of 6.23 nb -1 , collected using a minimum-bias trigger. Charm jets are identified by the presence of a D 0 meson among their constituents. The D 0 mesons are reconstructed from their hadronic decay D 0 → $K^-π^+$. The D 0 -meson tagged jets are reconstructed using tracks of charged particles (track-based jets) with the anti-$k$ T algorithm in the jet transverse momentum range 5 < p T , j e t c h 30 GeV/ c and pseudorapidity |$η$ jet | < 0.5. The fraction of charged jets containing a D 0 -meson increases with p T , j e t c h from 0.042 ± 0.004 (stat) ± 0.006 (syst) to 0.080 ± 0.009 (stat) ± 0.008 (syst). The distribution of D 0 -meson tagged jets as a function of the jet momentum fraction carried by the D 0 meson in the direction of the jet axis ( z &#x2225;<!-- ∥ --> c h ) is reported for two ranges of jet transverse momenta, 5 < p T , j e t c h < 15 GeV/ c and 15 < p T , j e t c h < 30 GeV/ c in the intervals 0.2 < z &#x2016; c h < 1.0 and 0.4 < z &#x2016; c h < 1.0 respectively. The data are compared with results from Monte Carlo event generators (PYTHIA 6, PYTHIA 8 and Herwig 7) and with a Next-to-Leading-Order perturbative Quantum Chromodynamics calculation, obtained with the POWHEG method and interfaced with PYTHIA 6 for the generation of the parton shower, fragmentation, hadronisation and underlying event.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Parallel Implementation of Nonadditive Gaussian Process Potentials for Monte Carlo Simulations

A strategy is presented to implement Gaussian process potentials in molecular simulations through parallel programming. Attention is focused on the three-body nonadditive energy, though all algorithms extend straightforwardly to the additive energy. The method to distribute pairs and triplets between processes is general to all potentials. Results are presented for a simulation box of argon, including full box and atom displacement calculations, which are relevant to Monte Carlo simulation. Data on speed-up are presented for up to 120 processes across four nodes. A 4-fold speed-up is observed over five processes, extending to 20-fold over 40 processes and 30-fold over 120 processes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Numerical Evidence for Many-Body Localization in Two and Three Dimensions

Disorder and interactions can lead to the breakdown of statistical mechanics in certain quantum systems, a phenomenon known as many-body localization (MBL). Much of the phenomenology of MBL emerges from the existence of localized-bits, or l-bits, a set of conserved quantities that are spatially localized and binary (i.e., possess only ±1 eigenvalues). While MBL and l-bits are known to exist in one-dimensional systems, their existence in dimensions greater than one is a key open question. To tackle this question, we develop an algorithm that can find approximate binary l-bits in arbitrary dimensions by adaptively generating a basis of operators in which to represent the l-bit. We use the algorithm to study four models: the one-, two-, and three-dimensional disordered Heisenberg models and the two-dimensional disordered hard-core Bose-Hubbard model. For all four of the models studied, our algorithm finds high-quality l-bits at large disorder strength and rapid qualitative changes in the distributions of l-bits in particular ranges of disorder strengths, suggesting the existence of MBL transitions. Furthermore, these transitions in the one-dimensional Heisenberg model and two-dimensional Bose-Hubbard model coincide well with past estimates of the critical disorder strengths in these models which further validates the evidence of MBL-like behavior in the other two and three-dimensional models we examine. In addition to finding MBL-like behavior in higher dimensions, our algorithm can be used to probe MBL in various geometries and dimensionality.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Physics-driven learning of Wasserstein GAN for density reconstruction in dynamic tomography

Object density reconstruction from projections containing scattered radiation and noise is of critical importance in many applications. Existing scatter correction and density reconstruction methods may not provide the high accuracy needed in many applications and can break down in the presence of unmodeled or anomalous scatter and other experimental artifacts. Incorporating machine-learning models could prove beneficial for accurate density reconstruction, particularly in dynamic imaging, where the time evolution of the density fields could be captured by partial differential equations or by learning from hydrodynamics simulations. In this work, we demonstrate the ability of learned deep neural networks to perform artifact removal in noisy density reconstructions, where the noise is imperfectly characterized. Here, we use a Wasserstein generative adversarial network (WGAN), where the generator serves as a denoiser that removes artifacts in densities obtained from traditional reconstruction algorithms. We train the networks from large density time-series datasets, with noise simulated according to parametric random distributions that may mimic noise in experiments. The WGAN is trained with noisy density frames as generator inputs, to match the generator outputs to the distribution of clean densities (time series) from simulations. A supervised loss is also included in the training, which leads to an improved density restoration performance. In addition, we employ physics-based constraints such as mass conservation during the network training and application to further enable highly accurate density reconstructions. Our preliminary numerical results show that the models trained in our frameworks can remove significant portions of unknown noise in density time-series data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable Circuit Cutting and Scheduling in a Resource-constrained and Distributed Quantum System

Despite quantum computing's rapid development, current systems remain limited in practical applications due to their limited qubit count and quality. Various technologies, such as superconducting, trapped ions, and neutral atom quantum computing technologies are progressing towards a fault tolerant era, however they all face a diverse set of challenges in scalability and control. Recent efforts have focused on multi-node quantum systems that connect multiple smaller quantum devices to execute larger circuits. Future demonstrations hope to use quantum channels to couple systems, however current demonstrations can leverage classical communication with circuit cutting techniques. This involves cutting large circuits into smaller subcircuits and reconstructing them post-execution. However, existing cutting methods are hindered by lengthy search times as the number of qubits and gates increases. Additionally, they often fail to effectively utilize the resources of various worker configurations in a multi-node system. To address these challenges, we introduce FitCut, a novel approach that transforms quantum circuits into weighted graphs and utilizes a community-based, bottom-up approach to cut circuits according to resource constraints, e.g., qubit counts, on each worker. FitCut also includes a scheduling algorithm that optimizes resource utilization across workers. Implemented with Qiskit and evaluated extensively, FitCut significantly outperforms the Qiskit Circuit Knitting Toolbox, reducing time costs by factors ranging from 3 to 2000 and improving resource utilization rates by up to 3.88 times on the worker side, achieving a system-wide improvement of 2.86 times.

Kan, Shuwen [Fordham University]↗

Distribution of centrality measures on undirected random networks via the cavity method

The Katz centrality of a node in a complex network is a measure of the node’s importance as far as the flow of information across the network is concerned. For ensembles of locally tree-like undirected random graphs, this observable is a random variable. Its full probability distribution is of interest but difficult to handle analytically because of its “global” character and its definition in terms of a matrix inverse. Leveraging a fast Gaussian Belief Propagation-Cavity algorithm to solve linear systems on tree-like structures, we show that i) the Katz centrality of a single instance can be computed recursively in a very fast way, and ii) the probability P ( K ) that a random node in the ensemble of undirected random graphs has centrality K satisfies a set of recursive distributional equations, which can be analytically characterized and efficiently solved using a population dynamics algorithm. We test our solution on ensembles of Erdős-Rényi and Scale Free networks in the locally tree-like regime, with excellent agreement. The analytical distribution of centrality for the configuration model conditioned on the degree of each node can be employed as a benchmark to identify nodes of empirical networks with over- and underexpressed centrality relative to a null baseline. We also provide an approximate formula based on a rank- 1 projection that works well if the network is not too sparse, and we argue that an extension of our method could be efficiently extended to tackle analytical distributions of other centrality measures such as PageRank for directed networks in a transparent and user-friendly way.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dynamic load balance scheme for the DSMC algorithm

The direct simulation Monte Carlo (DSMC) algorithm, devised by Bird, has been used over a wide range of various rarified flow problems in the past 40 years. While the DSMC is suitable for the parallel implementation on powerful multi-processor architecture, it also introduces a large load imbalance across the processor array, even for small examples. The load imposed on a processor by a DSMC calculation is determined to a large extent by the total of simulator particles upon it. Since most flows are impulsively started with initial distribution of particles which is surely quite different from the steady state, the total of simulator particles will change dramatically. The load balance based upon an initial distribution of particles will break down as the steady state of flow is reached. The load imbalance and huge computational cost of DSMC has limited its application to rarefied or simple transitional flows. In this paper, by taking advantage of METIS, a software for partitioning unstructured graphs, and taking the total of simulator particles in each cell as a weight information, the repartitioning based upon the principle that each processor handles approximately the equal total of simulator particles has been achieved. The computation must pause several times to renew the total of simulator particles in each processor and repartition the whole domain again. Thus the load balance across the processors array holds in the duration of computation. The parallel efficiency can be improved effectively. The benchmark solution of a cylinder submerged in hypersonic flow has been simulated numerically. Besides, hypersonic flow past around a complex wing-body configuration has also been simulated. The results have displayed that, for both of cases, the computational time can be reduced by about 50%.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗