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 73 records · Page 4

An adaptive importance sampling algorithm for Bayesian inversion with multimodal distributions

Parametric uncertainties are encountered in the simulations of many physical systems, and may be reduced by an inverse modeling procedure that calibrates the simulation results to observations on the real system being simulated. Following Bayes' rule, a general approach for inverse modeling problems is to sample from the posterior distribution of the uncertain model parameters given the observations. However, the large number of repetitive forward simulations required in the sampling process could pose a prohibitive computational burden. This difficulty is particularly challenging when the posterior is multimodal. We present in this paper an adaptive importance sampling algorithm to tackle these challenges. Two essential ingredients of the algorithm are: 1) a Gaussian mixture (GM) model adaptively constructed as the proposal distribution to approximate the possibly multimodal target posterior, and 2) a mixture of polynomial chaos (PC) expansions, built according to the GM proposal, as a surrogate model to alleviate the computational burden caused by computational-demanding forward model evaluations. In three illustrative examples, the proposed adaptive importance sampling algorithm demonstrates its capabilities of automatically finding a GM proposal with an appropriate number of modes for the specific problem under study, and obtaining a sample accurately and efficiently representing the posterior with limited number of forward simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sampling two-dimensional isometric tensor network states

Sampling a quantum system’s underlying probability distributions is an important computational task, e.g., for quantum advantage experiments and quantum Monte Carlo algorithms. Tensor networks are an invaluable tool for efficiently representing states of large quantum systems with limited entanglement. Algorithms for sampling one-dimensional (1D) tensor networks are well-established and utilized in several 1D tensor network methods. In this paper we introduce two novel sampling algorithms for two-dimensional (2D) isometric tensor network states (isoTNS) that generalize existing 1D tensor network sampling algorithms. Our first proposed algorithm performs independent sampling and yields a single configuration together with its associated probability. The second algorithm employs a greedy search strategy to identify high-probability configurations and their corresponding probabilities. Numerical results demonstrate the effectiveness of these algorithms across quantum states with varying entanglement and system size.

Dumitrescu, Eugene [ORNL] (ORCID:0000000158519567)↗

A pure-sampling quantum Monte Carlo algorithm

The objective of pure-sampling quantum Monte Carlo is to calculate physical properties that are independent of the importance sampling function being employed in the calculation, save for the mismatch of its nodal hypersurface with that of the exact wave function. To achieve this objective, we report a pure-sampling algorithm that combines features of forward walking methods of pure-sampling and reptation quantum Monte Carlo (RQMC). The new algorithm accurately samples properties from the mixed and pure distributions simultaneously in runs performed at a single set of time-steps, over which extrapolation to zero time-step is performed. In a detailed comparison, we found RQMC to be less efficient. It requires different sets of time-steps to accurately determine the energy and other properties, such as the dipole moment. We implement our algorithm by systematically increasing an algorithmic parameter until the properties converge to statistically equivalent values. As a proof in principle, we calculated the fixed-node energy, static α polarizability, and other one-electron expectation values for the ground-states of LiH and water molecules. These quantities are free from importance sampling bias, population control bias, time-step bias, extrapolation-model bias, and the finite-field approximation. We found excellent agreement with the accepted values for the energy and a variety of other properties for those systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

High order resolution of the Maxwell-Fokker-Planck-Landau model intended for ICF applications

A high order, deterministic direct numerical method is proposed for the non-relativistic 2D{sub x}x3D{sub v} Vlasov-Maxwell system, coupled with Fokker-Planck-Landau collision operators. The magnetic field is perpendicular to the 2D{sub x} plane surface of computation, whereas the electric fields occur in this plane. Such a system is devoted to modelling of electron transport and energy deposition in the general frame of Inertial Confinement Fusion applications. It is able to describe the kinetics of the plasma electrons in the nonlocal equilibrium regime, and permits to consider a large anisotropy degree of the distribution function. We develop specific methods and approaches for validation, that might be used in other fields where couplings between equations, multiscale physics, and high dimensionality are involved. Fast algorithms are employed, which makes this direct approach computationally affordable for simulations of hundreds of collisional times.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Measurement of the Three-jet Mass Cross Section in $p\bar{p}$ Collisions at $\sqrt{s}=1.96$ TeV

This thesis describes the measurement of the inclusive three-jet cross section in proton-antiproton collisions at √s = 1.96 TeV measured at the D0 experiment at the Fermilab Tevatron Collider in the Fermi National Accelerator Laboratory, Batavia, Illinois, USA. The cross section as a function of three-jet invariant mass is provided in three regions of the third jet transverse momentum and three regions of jet rapidities. It utilizes a data sample collected in the so called Run IIa data taking period (2002-2006) corresponding to the integrated luminosity of about 0.7 fb -1 . The results are used to test the next-to-leading order predictions of Quantum chromodynamics computed using the latest parton distribution functions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Data-driven quantum approximate optimization algorithm for power systems

Abstract Quantum technology provides a ground-breaking methodology to tackle challenging computational issues in power systems. It is especially promising for Distributed Energy Resources (DERs) dominant systems that have been widely developed to promote energy sustainability. In those systems, knowing the maximum sections of power and data delivery is essential for monitoring, operation, and control. However, high computational effort is required. By leveraging quantum resources, Quantum Approximate Optimization Algorithm (QAOA) provides a means to search for these sections efficiently. However, QAOA performance relies heavily on critical parameters, especially for weighted graphs. Here we present a data-driven QAOA, which transfers quasi-optimal parameters between weighted graphs based on the normalized graph density. We verify the strategy with 39,774 expectation value calculations. Without parameter optimization, our data-driven QAOA is comparable with the Goemans-Williamson algorithm. This work advances QAOA and pilots its practical application to power systems in noisy intermediate-scale quantum devices.

Jing, Hang (ORCID:0000000256343489)↗

Efficient learning of t -doped stabilizer states with single-copy measurements

One of the primary objectives in the field of quantum state learning is to develop algorithms that are time-efficient for learning states generated from quantum circuits. Earlier investigations have demonstrated time-efficient algorithms for states generated from Clifford circuits with at most log ⁡ ( n ) non-Clifford gates. However, these algorithms necessitate multi-copy measurements, posing implementation challenges in the near term due to the requisite quantum memory. On the contrary, using solely single-qubit measurements in the computational basis is insufficient in learning even the output distribution of a Clifford circuit with one additional T gate under reasonable post-quantum cryptographic assumptions. In this work, we introduce an efficient quantum algorithm that employs only nonadaptive single-copy measurement to learn states produced by Clifford circuits with a maximum of O ( log ⁡ n ) non-Clifford gates, filling a gap between the previous positive and negative results.

Physics↗

A Monte Carlo algorithm for degenerate plasmas

A procedure for performing Monte Carlo calculations of plasmas with an arbitrary level of degeneracy is outlined. It has possible applications in inertial confinement fusion and astrophysics. Degenerate particles are initialised according to the Fermi–Dirac distribution function, and scattering is via a Pauli blocked binary collision approximation. The algorithm is tested against degenerate electron–ion equilibration, and the degenerate resistivity transport coefficient from unmagnetised first order transport theory. The code is applied to the cold fuel shell and alpha particle equilibration problem of inertial confinement fusion.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Improving the efficiency of configurational-bias Monte Carlo: A density-guided method for generating bending angle trials for linear and branched molecules

A new method has been developed to generate bending angle trials to improve the acceptance rate and the speed of configurational-bias Monte Carlo. Whereas traditionally the trial geometries are generated from a uniform distribution, in this method we attempt to use the exact probability density function so that each geometry generated is likely to be accepted. In actual practice, due to the complexity of this probability density function, a numerical representation of this distribution function would be required. This numerical table can be generated a priori from the distribution function. This method has been tested on a united-atom model of alkanes including propane, 2-methylpropane, and 2,2-dimethylpropane, that are good representatives of both linear and branched molecules. It has been shown from these test cases that reasonable approximations can be made especially for the highly branched molecules to reduce drastically the dimensionality and correspondingly the amount of the tabulated data that is needed to be stored. Despite these approximations, the dependencies between the various geometrical variables can be still well considered, as evident from a nearly perfect acceptance rate achieved. For all cases, the bending angles were shown to be sampled correctly by this method with an acceptance rate of at least 96% for 2,2-dimethylpropane to more than 99% for propane. Since only one trial is required to be generated for each bending angle (instead of thousands of trials required by the conventional algorithm), this method can dramatically reduce the simulation time. The profiling results of our Monte Carlo simulation code show that trial generation, which used to be the most time consuming process, is no longer the time dominating component of the simulation.

2-2-DIMETHYLPROPANE↗

Comparison of the kinetics of different Markov models for ligand binding under varying conditions

We recently derived a Markov model for macromolecular ligand binding dynamics from few physical assumptions and showed that its stationary distribution is the grand canonical ensemble [J. W. R. Martini, M. Habeck, and M. Schlather, J. Math. Chem. 52, 665 (2014)]. The transition probabilities of the proposed Markov process define a particular Glauber dynamics and have some similarity to the Metropolis-Hastings algorithm. Here, we illustrate that this model is the stochastic analog of (pseudo) rate equations and the corresponding system of differential equations. Moreover, it can be viewed as a limiting case of general stochastic simulations of chemical kinetics. Thus, the model links stochastic and deterministic approaches as well as kinetics and equilibrium described by the grand canonical ensemble. We demonstrate that the family of transition matrices of our model, parameterized by temperature and ligand activity, generates ligand binding kinetics that respond to changes in these parameters in a qualitatively similar way as experimentally observed kinetics. In contrast, neither the Metropolis-Hastings algorithm nor the Glauber heat bath reflects changes in the external conditions correctly. Both converge rapidly to the stationary distribution, which is advantageous when the major interest is in the equilibrium state, but fail to describe the kinetics of ligand binding realistically. To simulate cellular processes that involve the reversible stochastic binding of multiple factors, our pseudo rate equation model should therefore be preferred to the Metropolis-Hastings algorithm and the Glauber heat bath, if the stationary distribution is not of only interest.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Complex-valued acquisition of the diffraction imaging by incoherent quasimonochromatic light without a support constraint

A scheme for complex-valued acquisition of the diffraction imaging with quasimonochromatic incoherent light is theoretically proposed. The main idea is to project the real and the imaginary parts of a Fraunhofer diffraction field on intensity distributions, respectively, with the use of a {pi}/2 phase-changing plate. The whole procedure is iterative algorithm free and needs no a priori knowledge of an arbitrary object. A numerical experiment and a quantitative confirmation are also given. To our knowledge, it was the first physical proposal for the complex-valued acquisition of a diffraction imaging by two-dimensional coherent patterns with thermal illumination.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Traceable random numbers from a non-local quantum advantage

The unpredictability of random numbers is fundamental to both digital security and applications that fairly distribute resources. However, existing random number generators have limitations—the generation processes cannot be fully traced, audited and certified to be unpredictable. The algorithmic steps used in pseudorandom number generators are auditable, but they cannot guarantee that their outputs were a priori unpredictable given knowledge of the initial seed. Device-independent quantum random number generators can ensure that the source of randomness was unknown beforehand, but the steps used to extract the randomness are vulnerable to tampering. Here we demonstrate a fully traceable random number generation protocol based on device-independent techniques. Our protocol extracts randomness from unpredictable non-local quantum correlations, and uses distributed intertwined hash chains to cryptographically trace and verify the extraction process. This protocol forms the basis for a public traceable and certifiable quantum randomness beacon that we have launched. Over the first 40 days of operation, we completed the protocol 7,434 out of 7,454 attempts—a success rate of 99.7%. Each time the protocol succeeded, the beacon emitted a pulse of 512 bits of traceable randomness. The bits are certified to be uniform with error multiplied by actual success probability bounded by 2−64. Further, the generation of certifiable and traceable randomness represents a public service that operates with an entanglement-derived advantage over comparable classical approaches.

97 MATHEMATICS AND COMPUTING↗

Computation of disordered system from the first principles of classical mechanics and ℕℙ hard problem

We study the classical 1D Heisenberg spin glasses in the framework of nearest-neighboring model. Based on the Hamilton equations we obtained the system of recurrence equations which allows to perform node-by-node calculations of a spin-chain. It is shown that calculations from the first principles of classical mechanics lead to ℕℙ hard problem, that however in the limit of the statistical equilibrium can be calculated by ℙ algorithm. For the partition function of the ensemble a new representation is offered in the form of one-dimensional integral of spin-chains’ energy distribution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Architecture for Quantum-in-the Loop Real-Time Simulations for Designing Resilient Smart Grids

With the power grid growing more complex every day with the inclusion of new sensors and regulatory approvals that enable end-users and small local developers to participate in the grid, it is becoming challenging for conventional smart grid simulation, emulation, and testing technologies to keep up. In this work, we propose that quantum-encoded real-time simulations can be helpful under the new paradigm and operational circumstances to solve optimization problems for power grids. By leveraging the principles of quantum mechanics, the proposed quantum-in-loop (QIL) framework will enable better and faster optimization solutions based on real-world, real-time data streams, facilitating the real-time planning and operations of electrical grids that rely on millions of distributed sensors and controllers. Furthermore, QIL will allow researchers and engineers to assist utilities in designing, developing, and de-risking algorithms to optimize power grid operation and resilience by considering inputs from millions of grid-connected devices. QIL framework is being developed to have a self-limiting triage mechanism, which will help engineers and practitioners identify fundamental physical limits on quantum processors, revealing what quantum algorithms can and cannot do in utility-specific use cases and must continue to count on classical high-performance computing infrastructure.

digital real-time simulation↗

Unmixing hyperspectral images using Markov random fields

This paper proposes a new spectral unmixing strategy based on the normal compositional model that exploits the spatial correlations between the image pixels. The pure materials (referred to as endmembers) contained in the image are assumed to be available (they can be obtained by using an appropriate endmember extraction algorithm), while the corresponding fractions (referred to as abundances) are estimated by the proposed algorithm. Due to physical constraints, the abundances have to satisfy positivity and sum-to-one constraints. The image is divided into homogeneous distinct regions having the same statistical properties for the abundance coefficients. The spatial dependencies within each class are modeled thanks to Potts-Markov random fields. Within a Bayesian framework, prior distributions for the abundances and the associated hyperparameters are introduced. A reparametrization of the abundance coefficients is proposed to handle the physical constraints (positivity and sum-to-one) inherent to hyperspectral imagery. The parameters (abundances), hyperparameters (abundance mean and variance for each class) and the classification map indicating the classes of all pixels in the image are inferred from the resulting joint posterior distribution. To overcome the complexity of the joint posterior distribution, Markov chain Monte Carlo methods are used to generate samples asymptotically distributed according to the joint posterior of interest. Simulations conducted on synthetic and real data are presented to illustrate the performance of the proposed algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Extension of moment projection method to the fragmentation process

The method of moments is a simple but efficient method of solving the population balance equation which describes particle dynamics. Recently, the moment projection method (MPM) was proposed and validated for particle inception, coagulation, growth and, more importantly, shrinkage; here the method is extended to include the fragmentation process. The performance of MPM is tested for 13 different test cases for different fragmentation kernels, fragment distribution functions and initial conditions. Comparisons are made with the quadrature method of moments (QMOM), hybrid method of moments (HMOM) and a high-precision stochastic solution calculated using the established direct simulation algorithm (DSA) and advantages of MPM are drawn.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Application of the MCMC Method for the Calibration of DSMC Parameters

A Markov Chain Monte Carlo (MCMC) algorithm was employed to obtain a calibrated distribution for the hard sphere diameter, the VHS reference diameter, and the temperature viscosity exponent of argon, for use in the Direct Simulation Monte Carlo (DSMC) method. Shock-tube experiments from Alsmeyer [1] were used to provide the necessary calibration data for use in the MCMC method. The DSMC method used in this work employs the algorithm of Bird [2], with modifications to allow for the efficient simulation of a 1D shock. When calibrating for the hard sphere diameter (the temperature viscosity exponent is set to 0.5 for the hard sphere method), the results of the MCMC method agree with a simple brute-force method, and a single value for the hard-sphere diameter is obtained. For the VHS method, however, when simultaneously calibrating the VHS reference diameter and the temperature viscosity exponent, we find that normalized density data alone does not provide sufficient information to obtain a single solution for both parameters. Instead we find a band in parameter space where acceptable solutions are obtained.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Generalized Metropolis acceptance criterion for hybrid non-equilibrium molecular dynamics—Monte Carlo simulations

A family of hybrid simulation methods that combines the advantages of Monte Carlo (MC) with the strengths of classical molecular dynamics (MD) consists in carrying out short non-equilibrium MD (neMD) trajectories to generate new configurations that are subsequently accepted or rejected via an MC process. In the simplest case where a deterministic dynamic propagator is used to generate the neMD trajectories, the familiar Metropolis acceptance criterion based on the change in the total energy ΔE, min[1, exp( − βΔE)], guarantees that the hybrid algorithm will yield the equilibrium Boltzmann distribution. However, the functional form of the acceptance probability is more complex when the non-equilibrium switching process is generated via a non-deterministic stochastic dissipative propagator coupled to a heat bath. Here, we clarify the conditions under which the Metropolis criterion remains valid to rigorously yield a proper equilibrium Boltzmann distribution within hybrid neMD-MC algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗