Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized algorithm”

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 451 records · Page 25

Scalable quantum search using trapped ions

We propose a scalable implementation of Grover's quantum search algorithm in a trapped-ion quantum information processor. The system is initialized in an entangled Dicke state by using adiabatic techniques. The inversion-about-average and oracle operators take the form of single off-resonant laser pulses. This is made possible by utilizing the physical symmetries of the trapped-ion linear crystal. The physical realization of the algorithm represents a dramatic simplification: each logical iteration (oracle and inversion about average) requires only two physical interaction steps, in contrast to the large number of concatenated gates required by previous approaches. This not only facilitates the implementation but also increases the overall fidelity of the algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Experimental evidence of quantum randomness incomputability

In contrast with software-generated randomness (called pseudo-randomness), quantum randomness can be proven incomputable; that is, it is not exactly reproducible by any algorithm. We provide experimental evidence of incomputability--an asymptotic property--of quantum randomness by performing finite tests of randomness inspired by algorithmic information theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cabana

Physics simulations that use particles in their algorithms are ubiquitous on modern high performance computers. Cabana is a C++ library for developing particle-based simulations on heterogeneous high performance computing platforms. Cabana provides general data structures and algorithms for common particle operations in a way that is both performant and portable on HPC systems. This includes particle data structure allocatable and configurable on GPU and CPU architectures, and threaded and distributed algorithms for sorting particles, halo exchanges, neighbor list generation, and other basic particle operations.

Slattery, StuartR↗

Nonlinear automatic landing control of unmanned aerial vehicles on moving platforms via a 3D laser radar

This paper presents a motion tracking and control system for automatically landing Unmanned Aerial Vehicles (UAVs) on an oscillating platform using Laser Radar (LADAR) observations. The system itself is assumed to be mounted on a ship deck. A full nonlinear mathematical model is first introduced for the UAV. The ship motion is characterized by a Fourier transform based method which includes a realistic characterization of the sea waves. LADAR observation models are introduced and an algorithm to process those observations for yielding the relative state between the vessel and the UAV is presented, from which the UAV's state relative to an inertial frame can be obtained and used for feedback purposes. A sliding mode control algorithm is derived for tracking a landing trajectory defined by a set of desired waypoints. An extended Kalman filter (EKF) is proposed to account for process and observation noises in the design of a state estimator. The effectiveness of the control algorithm is illustrated through a simulation example.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Search on a hypercubic lattice using a quantum random walk. II. d=2

We investigate the spatial search problem on the two-dimensional square lattice, using the Dirac evolution operator discretized according to the staggered lattice fermion formalism. d=2 is the critical dimension for the spatial search problem, where infrared divergence of the evolution operator leads to logarithmic factors in the scaling behavior. As a result, the construction used in our accompanying article [A. Patel and M. A. Rahaman, Phys. Rev. A 82, 032330 (2010)] provides an O({radical}(N)lnN) algorithm, which is not optimal. The scaling behavior can be improved to O({radical}(NlnN)) by cleverly controlling the massless Dirac evolution operator by an ancilla qubit, as proposed by Tulsi [Phys. Rev. A 78, 012310 (2008)]. We reinterpret the ancilla control as introduction of an effective mass at the marked vertex, and optimize the proportionality constants of the scaling behavior of the algorithm by numerically tuning the parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cooperative pulses for pseudo-pure state preparation

Using an extended version of the optimal-control-based gradient ascent pulse engineering algorithm, cooperative (COOP) pulses are designed for multi-scan experiments to prepare pseudo-pure states in quantum computation. COOP pulses can cancel undesired signal contributions, complementing and generalizing phase cycles. They also provide more flexibility and, in particular, eliminate the need to select specific individual target states and achieve the fidelity of theoretical limit by flexibly choosing appropriate number of scans and duration of pulses. The COOP approach is experimentally demonstrated for three-qubit and four-qubit systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Association of scattering matrices in quantum networks

Algorithms based on operations that associate scattering matrices in series or in parallel (analogous to impedance association in a classical circuit) are developed here. We exemplify their application by calculating the total scattering matrix of several types of quantum networks, such as star graphs and a chain of chaotic quantum dots, obtaining results with good agreement with the literature. Through a computational-time analysis we compare the efficiency of two algorithms for the simulation of a chain of chaotic quantum dots based on series association operations of (i) two-by-two centers and (ii) three-by-three ones. Empirical results point out that the algorithm (ii) is more efficient than (i) for small number of open scattering channels. A direct counting of floating point operations justifies quantitatively the superiority of the algorithm (i) for large number of open scattering channels.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Double sweep preconditioner for optimized Schwarz methods applied to the Helmholtz problem

This paper presents a preconditioner for non-overlapping Schwarz methods applied to the Helmholtz problem. Starting from a simple analytic example, we show how such a preconditioner can be designed by approximating the inverse of the iteration operator for a layered partitioning of the domain. The preconditioner works by propagating information globally by concurrently sweeping in both directions over the subdomains, and can be interpreted as a coarse grid for the domain decomposition method. The resulting algorithm is shown to converge very fast, independently of the number of subdomains and frequency. The preconditioner has the advantage that, like the original Schwarz algorithm, it can be implemented as a matrix-free routine, with no additional preprocessing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A novel SPH method for sedimentation in a turbulent fluid

A novel method for simulating sedimentation is described and applied to the sedimentation of dust in a turbulent fluid. We assume the dust grains are sufficiently numerous that they may be treated as a fluid and modelled by SPH particles. A different set of SPH particles describes the fluid. The equations of motion are therefore similar to those of Monaghan and Kocharyan [14] with the exception that the sedimentation of dust onto a solid surface is treated as if the surface mimics a sink for the dust fluid. The continuity equation for the dust then contains a sink term that can be modelled in the SPH formulation by allowing the mass of each SPH dust particle to decrease when it is sufficiently close to the boundary. We apply this method both to sedimentation in a nearly static fluid, and to sedimentation in a turbulent fluid. In the latter case we produce the turbulence by both a mechanical stirrer and by a stochastic algorithm. Our results agree very closely with the experiments of Martin and Nokes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the solution of elliptic partial differential equations on regions with corners

In this paper we investigate the solution of boundary value problems on polygonal domains for elliptic partial differential equations. We observe that when the problems are formulated as the boundary integral equations of classical potential theory, the solutions are representable by series of elementary functions. In addition to being analytically perspicuous, the resulting expressions lend themselves to the construction of accurate and efficient numerical algorithms. The results are illustrated by a number of numerical examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Note: Large rotation measurement using half shaded square patterns

As the manufacturing technology ranging from micrometer to nanometer scale requires more planar motion devices, the demand for sensor measuring the planar motion is increasing. However, the previous sensors measuring the planar motion had a drawback in the measurement of rotation, especially regarding yaw angle. In this article, we present a novel method to measure large yaw angle with the planar position sensor based on the half shaded square patterns. The measuring range of the yaw angle is restricted to 45 deg. in this article, but it can be expanded to as much as 360 deg. with an improvement of the algorithm.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Cautionary remarks on the moduli space metric for multidyon simulations

We perform a detailed numerical investigation of the approximate moduli space metric proposed by Diakonov and Petrov [Phys. Rev. D 76, 056001 (2007)] for a confining model of dyons. Our findings strongly indicate that this metric is positive definite (and, therefore, a valid moduli space metric) throughout a considerable part of configuration space only for a small number of dyons at sufficiently low density. This poses strong limitations on results obtained by an unrestricted integration over collective coordinates in this model. It also indicates that strong correlations between collective coordinates will be essential for the physical content of a dyon model, which could be exhibited by a suitable simulation algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Topological Quantum Hashing with the Icosahedral Group

We study an efficient algorithm to hash any single-qubit gate into a braid of Fibonacci anyons represented by a product of icosahedral group elements. By representing the group elements by braid segments of different lengths, we introduce a series of pseudogroups. Joining these braid segments in a renormalization group fashion, we obtain a Gaussian unitary ensemble of random-matrix representations of braids. With braids of length O(log{sup 2}(1/{epsilon})), we can approximate all SU(2) matrices to an average error {epsilon} with a cost of O(log(1/{epsilon})) in time. The algorithm is applicable to generic quantum compiling.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Design of smart 3D-digital X-ray microtomographic scanners for non-destructive testing of materials and components of electronic devices with a multilayered structure

The article studies the operating procedures of an X-ray microtomographic scanner and the module of reconstruction and analysis 3D-image of a test sample in particular. An algorithm for 3D-image reconstruction based on image shadow projections and mathematical methods of the processing are described. Chapter 1 describes the basic principles of X-ray tomography and general procedures of the device developed. Chapters 2 and 3 are devoted to the problem of resources saving by the system during the X-ray tomography procedure, which is achieved by preprocessing of the initial shadow projections. Preprocessing includes background noise removing from the images, which reduces the amount of shadow projections in general and increases the efficiency of the group shadow projections compression. Chapter 4 covers general procedures of defect search, which is based on vector analysis principles. In conclusion, the main applications of X-ray tomography are presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Robust, common path, phase shifting interferometer and optical profilometer

We describe an improved implementation of our previously reported common-path, phase shifting, and shearing interferometer. Using a time-multiplexed phase shifting scheme, we demonstrate higher sampling resolution, better light sensitivity, and use of arbitrary phase shifting algorithms. We describe microscopic imaging of the surface profile of a copper-plated silicon wafer and demonstrate that the system is vibration insensitive with {approx}{lambda}/100repeatability. In a more general discussion of our method, we describe the different functional elements and suggest alternative designs and improvements. Possible uses include full-field coherent imaging and high dynamic range wavefront sensing, which we briefly discuss.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A regularized approach for solving magnetic differential equations and a revised iterative equilibrium algorithm

A method for approximately solving magnetic differential equations is described. The approach is to include a small diffusion term to the equation, which regularizes the linear operator to be inverted. The extra term allows a ''source-correction'' term to be defined, which is generally required in order to satisfy the solvability conditions. The approach is described in the context of computing the pressure and parallel currents in the iterative approach for computing magnetohydrodynamic equilibria.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Reconstruction of the wind velocity profile by the intensity fluctuations of a scattered wave in a receiving telescope

The problem of the wind velocity profile reconstruction from random intensity fluctuations of a laser beam diffusely scattered by a screen and received by a telescope is considered. Expressions for a spatiotemporal correlation function and spectrum of weak intensity fluctuations of the reflected beam are presented. An algorithm is proposed for the reconstruction of the profile and direction of the wind velocity from the intensity fluctuation spectra of reflected radiation received by the telescope. The efficiency of the algorithm is confirmed by the results of numerical experiments. (lidars)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Addendum to 'Single-photon logic gates using minimum resources'

The authors call attention to a previous work [Lin and He, Phys. Rev. A 80, 042310 (2009)] on the realization of multiqubit logic gates with controlled-path and merging gates. We supplement the work by showing how to efficiently implement quantum algorithms in this approach and by providing guide rules for the task.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗