Search NASA⌕ Search

SEARCH · Search NASA

Results for “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 1,477 records · Page 82

THE HARPS-TERRA PROJECT. I. DESCRIPTION OF THE ALGORITHMS, PERFORMANCE, AND NEW MEASUREMENTS ON A FEW REMARKABLE STARS OBSERVED BY HARPS

Doppler spectroscopy has uncovered or confirmed all the known planets orbiting nearby stars. Two main techniques are used to obtain precision Doppler measurements at optical wavelengths. The first approach is the gas cell method, which consists of least-squares matching of the spectrum of iodine imprinted on the spectrum of the star. The second method relies on the construction of a stabilized spectrograph externally calibrated in wavelength. The most precise stabilized spectrometer in operation is the High Accuracy Radial velocity Planet Searcher (HARPS), operated by the European Southern Observatory in La Silla Observatory, Chile. The Doppler measurements obtained with HARPS are typically obtained using the cross-correlation function (CCF) technique. This technique consists of multiplying the stellar spectrum by a weighted binary mask and finding the minimum of the product as a function of the Doppler shift. It is known that CCF is suboptimal in exploiting the Doppler information in the stellar spectrum. Here we describe an algorithm to obtain precision radial velocity measurements using least-squares matching of each observed spectrum to a high signal-to-noise ratio template derived from the same observations. This algorithm is implemented in our software HARPS-TERRA (Template-Enhanced Radial velocity Re-analysis Application). New radial velocity measurements on a representative sample of stars observed by HARPS are used to illustrate the benefits of the proposed method. We show that, compared with CCF, template matching provides a significant improvement in accuracy, especially when applied to M dwarfs.

79 ASTRONOMY AND ASTROPHYSICS↗

Quadrature algorithms to the luminosity distance with a time-dependent dark energy model

In our previous work [1], we have proposed two methods for computing the luminosity distance d{sub L}{sup Λ} in ΛCDM model. In this paper, two effective quadrature algorithms, known as Romberg Integration and composite Gaussian Quadrature, are presented to calculate the luminosity distance d{sub L}{sup CPL} in the Chevallier-Polarski-Linder parametrization(CPL) model. By comparing both the efficiency and accuracy of the two algorithms, we find that the second is more promising. Moreover, we develop another strategy adapted for approximating d{sub L}{sup Λ} in flat ΛCDM universe. To some extent, our methods can make contributions to the recent numerical stimulation for the investigation of dark energy cosmology.

79 ASTRONOMY AND ASTROPHYSICS↗

A new perspective on dark energy modeling via genetic algorithms

We use Genetic Algorithms to extract information from several cosmological probes, such as the type Ia supernovae (SnIa), the Baryon Acoustic Oscillations (BAO) and the growth rate of matter perturbations. This is done by implementing a model independent and bias-free reconstruction of the various scales and distances that characterize the data, like the luminosity d{sub L}(z) and the angular diameter distance d{sub A}(z) in the SnIa and BAO data, respectively, or the dependence with redshift of the matter density Ω{sub m}(a) in the growth rate data, fσ{sub 8}(z). These quantities can then be used to reconstruct the expansion history of the Universe, and the resulting Dark Energy (DE) equation of state w(z) in the context of FRW models, or the mass radial function Ω{sub M}(r) in LTB models. In this way, the reconstruction is completely independent of our prior bias. Furthermore, we use this method to test the Etherington relation, ie the well-known relation between the luminosity and the angular diameter distance, η≡d{sub L}(z)/(1+z){sup 2}d{sub A}(z), which is equal to 1 in metric theories of gravity. We find that the present data seem to suggest a 3-σ deviation from one at redshifts z ∼ 0.5. Finally, we present a novel way, within the Genetic Algorithm paradigm, to analytically estimate the errors on the reconstructed quantities by calculating a Path Integral over all possible functions that may contribute to the likelihood. We show that this can be done regardless of the data being correlated or uncorrelated with each other and we also explicitly demonstrate that our approach is in good agreement with other error estimation techniques like the Fisher Matrix approach and the Bootstrap Monte Carlo.

79 ASTRONOMY AND ASTROPHYSICS↗

Entanglement of periodic states, the quantum Fourier transform, and Shor's factoring algorithm

The preprocessing stage of Shor's algorithm generates a class of quantum states referred to as periodic states, on which the quantum Fourier transform is applied. Such states also play an important role in other quantum algorithms that rely on the quantum Fourier transform. Since entanglement is believed to be a necessary resource for quantum computational speedup, we analyze the entanglement of periodic states and the way it is affected by the quantum Fourier transform. To this end, we derive a formula that evaluates the Groverian entanglement measure for periodic states. Using this formula, we explain the surprising result that the Groverian entanglement of the periodic states built up during the preprocessing stage is only slightly affected by the quantum Fourier transform.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum counting algorithm and its application in mesoscopic physics

We discuss a quantum counting algorithm which transforms a physical particle-number state (and superpositions thereof) into a binary number. The algorithm involves two quantum Fourier transformations. One transformation is in physical space, where a stream of n<N=2{sup K} (charged) particles is coupled to K qubits, rotating their states by prescribed angles. The second transformation is within the Hilbert space of qubits and serves to read out the particle number in a binary form. Applications include a divisibility check characterizing the size of a finite train of particles in a quantum wire and a scheme allowing one to entangle multiparticle wave functions in a Mach-Zehnder interferometer, generating Bell, Greenberger-Horne-Zeilinger, or Dicke states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Exactness of the original Grover search algorithm

It is well-known that when searching one out of four, the original Grover's search algorithm is exact; that is, it succeeds with certainty. It is natural to ask the inverse question: If we are not searching one out of four, is Grover's algorithm definitely not exact? In this article we give a complete answer to this question through some rationality results of trigonometric functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Measurement-based quantum phase estimation algorithm for finding eigenvalues of non-unitary matrices

We propose a quantum algorithm for finding eigenvalues of non-unitary matrices. We show how to construct, through interactions in a quantum system and projective measurements, a non-Hermitian or non-unitary matrix and obtain its eigenvalues and eigenvectors. This proposal combines ideas of frequent measurement, measured quantum Fourier transform, and quantum state tomography. It provides a generalization of the conventional phase estimation algorithm, which is limited to Hermitian or unitary matrices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Experimental demonstration of coupled multi-peak Bragg coherent diffraction imaging with genetic algorithms

Bragg coherent diffraction imaging has the potential to provide significant insight into the structure-properties relationship for crystalline materials by imaging, with nanoscale resolution, three-dimensional strain fields within individual grains and nanoparticles. The capability of present-day synchrotrons to locate and measure a multiplicity of Bragg reflections from a single grain makes it possible to recover the full strain tensor with nanometer resolution. Recent methods for coupling reconstructions from several peaks to determine the strain tensor have been developed and applied to synthetic data, but have not been applied to experimental data. Here, using a coupled genetic reconstruction algorithm, we reconstruct an experimental data set and demonstrate improvements in the ability to resolve vector-valued displacement fields internal to the particle as compared to what is achieved with a noncoupled approach. The coupled approach developed in this work was also validated on simulated data sets. In both simulated and experimental data, reconstructions from our coupled Bragg peak algorithm show improvements over the noncoupled independent reconstruction method of 5% in terms of accuracy and 53% in terms of consistency.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Quantum tensor network algorithms for evaluation of spectral functions on quantum computers

We investigate quantum algorithms derived from tensor networks to simulate the static and dynamic properties of quantum many-body systems. Using a sequentially prepared quantum circuit representation of a matrix product state (MPS) that we call a quantum tensor network (QTN), we demonstrate algorithms to prepare ground and excited states on a quantum computer and apply them to molecular nanomagnets (MNMs) as a paradigmatic example. In this setting, we develop two approaches for extracting the spectral correlation functions measured in neutron-scattering experiments: (a) a generalization of the SWAP test for computing wave function overlaps and, (b) a generalization of the notion of matrix product operators to the QTN setting which generates a linear combination of unitaries. The latter method is discussed in detail for translationally invariant spin-half systems, where it is shown to reduce the qubit resource requirements compared with the SWAP method and may be generalized to other systems. We demonstrate the versatility of our approaches by simulating spin-1/2 and spin-3/2 MNMs, with the latter being an experimentally relevant model of a Cr$^{3+}_{8}$ ring. Here, our approach has qubit requirements that are independent of the number of constituents of the many-body system and scale only logarithmically with the bond dimension of the MPS representation, making them appealing for implementation on near-term quantum hardware with mid-circuit measurement and reset.

Neutron scattering↗

High-performance algorithm to calculate spin- and parity-dependent nuclear level densities

A new algorithm for calculating the spin- and parity-dependent shell-model nuclear level densities using the moments method in the proton-neutron formalism is presented. A new, parallelized code based on this algorithm was developed and tested using up to 4000 cores for a set of nuclei from the sd-, pf-, and pf+g{sub 9/2}-model spaces. By comparing the nuclear level densities at low excitation energy for a given nucleus calculated in two model spaces, such as pf and pf+g{sub 9/2}, one can estimate the ground-state energy in the larger model space, which is not accessible to direct shell-model calculations due to the unmanageable dimension. Examples for the ground-state energies of for {sup 64}Ge and {sup 68}Se in the pf+g{sub 9/2} model space are presented.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Fully relativistic lattice Boltzmann algorithm

Starting from the Maxwell-Juettner equilibrium distribution, we develop a relativistic lattice Boltzmann (LB) algorithm capable of handling ultrarelativistic systems with flat, but expanding, spacetimes. The algorithm is validated through simulations of a quark-gluon plasma, yielding excellent agreement with hydrodynamic simulations. The present scheme opens the possibility of transferring the recognized computational advantages of lattice kinetic theory to the context of both weakly and ultrarelativistic systems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Collective neutrino oscillations on a quantum computer with hybrid quantum-classical algorithm

We simulate the time evolution of collective neutrino oscillations in two-flavor settings on a quantum computer. We explore the generalization of Trotter-Suzuki approximation to time-dependent Hamiltonian dynamics. The trotterization steps are further optimized using the Cartan decomposition of two-qubit unitary gates U ϵ SU(4) in the minimum number of controlled-NOT (CNOT) gates making the algorithm more resilient to the hardware noise. As a result, a more efficient hybrid quantum-classical algorithm is also explored to solve the problem on noisy intermediate-scale quantum devices.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Evolution of domain wall networks: The Press-Ryden-Spergel algorithm

The Press-Ryden-Spergel (PRS) algorithm is a modification to the field theory equations of motion, parametrized by two parameters ({alpha} and {beta}), implemented in numerical simulations of cosmological domain wall networks, in order to ensure a fixed comoving resolution. In this paper we explicitly demonstrate that the PRS algorithm provides the correct domain wall dynamics in (N+1)-dimensional Friedmann-Robertson-Walker universes if {alpha}+{beta}/2=N, fully validating its use in numerical studies of cosmic domain evolution. We further show that this result is valid for generic thin featureless domain walls, independently of the Lagrangian of the model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Jet function with a jet algorithm in soft-collinear effective theory

The jet function for the factorized cross section e{sup +}e{sup -} into dijets is given as a function of the jet invariant mass s and with a generic jet algorithm at O({alpha}{sub s}). We demonstrate the results using the Sterman-Weinberg algorithm and show that the jet function is independent of the energy fraction {beta} of the soft radiation. The anomalous dimension has the same form with and without the cone half-angle {delta}. The dependence of the finite part of the jet function on the cone angle is given.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Recombination algorithms and jet substructure: Pruning as a tool for heavy particle searches

We discuss jet substructure in recombination algorithms for QCD jets and single jets from heavy particle decays. We demonstrate that the jet algorithm can introduce significant systematic effects into the substructure. By characterizing these systematic effects and the substructure from QCD, splash-in, and heavy particle decays, we identify a technique, pruning, to better identify heavy particle decays into single jets and distinguish them from QCD jets. Pruning removes protojets typical of soft, wide-angle radiation, improves the mass resolution of jets reconstructing heavy particle decays, and decreases the QCD background to these decays. We show that pruning provides significant improvements over unpruned jets in identifying top quarks and W bosons and separating them from a QCD background, and may be useful in a search for heavy particles.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Rest frame subjet algorithm with SISCone jet for fully hadronic decaying Higgs search

The rest frame subjet algorithm is introduced to define the subjets for the SISCone jet; with this algorithm, an infrared and collinear safe jet shape observable N-subjettiness {tau}{sub N}{sup j} is defined to discriminate the fat jet, from a highly boosted color singlet particle decaying to N partons, from the QCD jet. Using rest frame subjets and {tau}{sub 2}{sup j} on dijets from highly boosted H/W/Z bosons through pp{yields}HW,HZ with m{sub H}=120 GeV, we found that the statistical significance of the signal, from the fully hadronic channels, is about 2{sigma} for 14 TeV collisions with L{approx}30 fb{sup -1}.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Adaptive Multigrid Algorithm for the Lattice Wilson-Dirac Operator

We present an adaptive multigrid solver for application to the non-Hermitian Wilson-Dirac system of QCD. The key components leading to the success of our proposed algorithm are the use of an adaptive projection onto coarse grids that preserves the near null space of the system matrix together with a simplified form of the correction based on the so-called {gamma}{sub 5}-Hermitian symmetry of the Dirac operator. We demonstrate that the algorithm nearly eliminates critical slowing down in the chiral limit and that it has weak dependence on the lattice volume.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Rodeo Algorithm for Quantum Computing

We present a stochastic quantum computing algorithm that can prepare any eigenvector of a quantum Hamiltonian within a selected energy interval $\ [E-\epsilon, E+\epsilon]$. In order to reduce the spectral weight of all other eigenvectors by a suppression factor δ, the required computational effort scales as $\ O[|\log \delta|/(p \epsilon)]$, where p s the squared overlap of the initial state with the target eigenvector. The method, which we call the rodeo algorithm, uses auxiliary qubits to control the time evolution of the Hamiltonian minus some tunable parameter E . In this manner, we converge to the target eigenvector with exponential accuracy in the number of measurements. In addition to preparing eigenvectors, the method can also compute the full spectrum of the Hamiltonian. We illustrate the performance with several examples. For energy eigenvalue determination with error $\epsilon$, the computational scaling is $\ O[(\log \epsilon)^2/(p \epsilon)]$. For eigenstate preparation, the computational scaling is $\ O(\log \Delta/p)$, where $\Delta$ is the magnitude of the orthogonal component of the residual vector. The speed for eigenstate preparation is exponentially faster than that for phase estimation or adiabatic evolution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗