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 667 records · Page 37

Quantum logic gates based on ballistic transport in graphene

The paper presents various configurations for the implementation of graphene-based Hadamard, C-phase, controlled-NOT, and Toffoli gates working at room temperature. These logic gates, essential for any quantum computing algorithm, involve ballistic graphene devices for qubit generation and processing and can be fabricated using existing nanolithographical techniques. All quantum gate configurations are based on the very large mean-free-paths of carriers in graphene at room temperature.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spin-adapted matrix product states and operators

Matrix product states (MPSs) and matrix product operators (MPOs) allow an alternative formulation of the density matrix renormalization group algorithm introduced by White. Here, we describe how non-abelian spin symmetry can be exploited in MPSs and MPOs by virtue of the Wigner–Eckart theorem at the example of the spin-adapted quantum chemical Hamiltonian operator.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Local unitary equivalence of quantum states and simultaneous orthogonal equivalence

The correspondence between local unitary equivalence of bipartite quantum states and simultaneous orthogonal equivalence is thoroughly investigated and strengthened. It is proved that local unitary equivalence can be studied through simultaneous similarity under projective orthogonal transformations, and four parametrization independent algorithms are proposed to judge when two density matrices on ℂ{sup d{sub 1}} ⊗ ℂ{sup d{sub 2}} are locally unitary equivalent in connection with trace identities, Kronecker pencils, Albert determinants and Smith normal forms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The formation of quantum images and their transformation and super-resolution reading

Images formed by light with suppressed photon fluctuations are interesting objects for studies with the aim of increasing their limiting information capacity and quality. This light in the sub-Poisson state can be prepared in a resonator filled with a medium with Kerr nonlinearity, in which self-phase modulation takes place. Spatially and temporally multimode light beams are studied and the production of spatial frequency spectra of suppressed photon fluctuations is described. The efficient operation regimes of the system are found. A particular schematic solution is described, which allows one to realize the potential possibilities laid in the formation of the squeezed states of light to a maximum degree during self-phase modulation in a resonator for the maximal suppression of amplitude quantum noises upon two-dimensional imaging. The efficiency of using light with suppressed quantum fluctuations for computer image processing is studied. An algorithm is described for interpreting measurements for increasing the resolution with respect to the geometrical resolution. A mathematical model that characterizes the measurement scheme is constructed and the problem of the image reconstruction is solved. The algorithm for the interpretation of images is verified. Conditions are found for the efficient application of sub-Poisson light for super-resolution imaging. It is found that the image should have a low contrast and be maximally transparent.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

GMTI radar minimum detectable velocity.

Minimum detectable velocity (MDV) is a fundamental consideration for the design, implementation, and exploitation of ground moving-target indication (GMTI) radar imaging modes. All single-phase-center air-to-ground radars are characterized by an MDV, or a minimum radial velocity below which motion of a discrete nonstationary target is indistinguishable from the relative motion between the platform and the ground. Targets with radial velocities less than MDV are typically overwhelmed by endoclutter ground returns, and are thus not generally detectable. Targets with radial velocities greater than MDV typically produce distinct returns falling outside of the endoclutter ground returns, and are thus generally discernible using straightforward detection algorithms. This document provides a straightforward derivation of MDV for an air-to-ground single-phase-center GMTI radar operating in an arbitrary geometry.

99 GENERAL AND MISCELLANEOUS↗

Triple-decker: Interfacing atomistic-mesoscopic-continuum flow regimes

Multiscale flow phenomena in microfluidic and biomedical applications require the use of heterogeneous modeling approaches. In this paper we present a hybrid method based on coupling the Molecular Dynamics (MD) method, the Dissipative Particle Dynamics (DPD) method, and the incompressible Navier-Stokes (NS) equations. MD, DPD, and NS are formulated in separate subdomains and are coupled via an overlapping region by communicating state information at the subdomain boundaries. Imposition of boundary conditions in the MD and DPD systems involves particle insertion and deletion, specular wall reflection and body force terms. The latter includes a boundary pressure force in order to minimize near-boundary density fluctuations, and an adaptive shear force which enforces the tangential velocity component of boundary conditions. The triple-decker algorithm is verified for prototype flows, including simple and multi-layer fluids (Couette, Poiseuille, and lid-driven cavity), using highly accurate reference solutions. A zero-thickness interface is also possible if it is aligned with the flow streamlines.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Single switch surface hopping for molecular dynamics with transitions

A trajectory surface hopping algorithm is proposed, which stems from a mathematically rigorous analysis of propagation through conical intersections of potential energy surfaces. Since nonadiabatic transitions are only performed when a classical trajectory attains one of its local minimal surface gaps, the algorithm is called single switch surface hopping. Numerical experiments for a two mode Jahn-Teller system are presented, which illustrate the asymptotic justification of the method as well as its good performance in the physically relevant parameter range.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fractional boundary layer flow and radiation heat transfer of MHD viscoelastic fluid over an unsteady stretching surface

This paper presents an investigation for magnetohydrodynamic (MHD) viscoelastic fluid boundary layer flow and radiation heat transfer over an unsteady stretching sheet in presence of heat source. Time dependent fractional derivative is first introduced in formulating the boundary layer equations. Numerical solutions are obtained by using the finite difference scheme and L1-algorithm approximation. Results indicate that the proposed model describes a basic delaying times framework for viscoelastic flow and radiation heat transfer. The effects of involved parameters on velocity and temperature fields are shown graphically and analyzed in detail.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Advances in QCD sum-rule calculations

We review the recent progress in the applications of QCD sum rules to hadron properties with the emphasis on the following selected problems: (i) development of new algorithms for the extraction of ground-state parameters from two-point correlators; (ii) form factors at large momentum transfers from three-point vacuum correlation functions: (iii) properties of exotic tetraquark hadrons from correlation functions of four-quark currents.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Automated searching for quantum subsystem codes

Quantum error correction allows for faulty quantum systems to behave in an effectively error-free manner. One important class of techniques for quantum error correction is the class of quantum subsystem codes, which are relevant both to active quantum error-correcting schemes as well as to the design of self-correcting quantum memories. Previous approaches for investigating these codes have focused on applying theoretical analysis to look for interesting codes and to investigate their properties. In this paper we present an alternative approach that uses computational analysis to accomplish the same goals. Specifically, we present an algorithm that computes the optimal quantum subsystem code that can be implemented given an arbitrary set of measurement operators that are tensor products of Pauli operators. We then demonstrate the utility of this algorithm by performing a systematic investigation of the quantum subsystem codes that exist in the setting where the interactions are limited to two-body interactions between neighbors on lattices derived from the convex uniform tilings of the plane.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hybrid massively parallel fast sweeping method for static Hamilton–Jacobi equations

The fast sweeping method is a popular algorithm for solving a variety of static Hamilton–Jacobi equations. Fast sweeping algorithms for parallel computing have been developed, but are severely limited. In this work, we present a multilevel, hybrid parallel algorithm that combines the desirable traits of two distinct parallel methods. The fine and coarse grained components of the algorithm take advantage of heterogeneous computer architecture common in high performance computing facilities. We present the algorithm and demonstrate its effectiveness on a set of example problems including optimal control, dynamic games, and seismic wave propagation. We give results for convergence, parallel scaling, and show state-of-the-art speedup values for the fast sweeping method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Communication: Four-component density matrix renormalization group

We present the first implementation of the relativistic quantum chemical two- and four-component density matrix renormalization group algorithm that includes a variational description of scalar-relativistic effects and spin–orbit coupling. Numerical results based on the four-component Dirac–Coulomb Hamiltonian are presented for the standard reference molecule for correlated relativistic benchmarks: thallium hydride.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Characterizing system dynamics with a weighted and directed network constructed from time series data

In this work, we propose a novel method to transform a time series into a weighted and directed network. For a given time series, we first generate a set of segments via a sliding window, and then use a doubly symbolic scheme to characterize every windowed segment by combining absolute amplitude information with an ordinal pattern characterization. Based on this construction, a network can be directly constructed from the given time series: segments corresponding to different symbol-pairs are mapped to network nodes and the temporal succession between nodes is represented by directed links. With this conversion, dynamics underlying the time series has been encoded into the network structure. We illustrate the potential of our networks with a well-studied dynamical model as a benchmark example. Results show that network measures for characterizing global properties can detect the dynamical transitions in the underlying system. Moreover, we employ a random walk algorithm to sample loops in our networks, and find that time series with different dynamics exhibits distinct cycle structure. That is, the relative prevalence of loops with different lengths can be used to identify the underlying dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient quantum circuit implementation of quantum walks

Quantum walks, being the quantum analog of classical random walks, are expected to provide a fruitful source of quantum algorithms. A few such algorithms have already been developed, including the 'glued trees' algorithm, which provides an exponential speedup over classical methods, relative to a particular quantum oracle. Here, we discuss the possibility of a quantum walk algorithm yielding such an exponential speedup over possible classical algorithms, without the use of an oracle. We provide examples of some highly symmetric graphs on which efficient quantum circuits implementing quantum walks can be constructed and discuss potential applications to quantum search for marked vertices along these graphs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal time schedule for adiabatic evolution

We show that, provided dephasing is taken into account, there is a unique timetable which maximizes the fidelity with a target state in adiabatic evolutions. The optimum has constant tunneling rate along the path. Application to quantum search algorithms recovers the Grover result for appropriate scaling of the dephasing with the size of the database. Moreover, the Grover bound imposes constraints on the dephasing rates of systems coupled to a universal Markovian bath.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An algorithm to unveil the inner structure of objects concealed by beam divergence in radiographic image acquisition systems

Two main parameters rule the performance of an Image Acquisition System, namely, spatial resolution and contrast. For radiographic systems using cone beam arrangements, the farther the source, the better the resolution, but the contrast would diminish due to the lower statistics. A closer source would yield a higher contrast but it would no longer reproduce the attenuation map of the object, as the incoming beam flux would be reduced by unequal large divergences and attenuation factors. This work proposes a procedure to correct these effects when the object is comprised of a hull - or encased in it - possessing a shape capable to be described in analytical geometry terms. Such a description allows the construction of a matrix containing the attenuation factors undergone by the beam from the source until its final destination at each coordinate on the 2D detector. Each matrix element incorporates the attenuation suffered by the beam after its travel through the hull wall, as well as its reduction due to the square of distance to the source and the angle it hits the detector surface. When the pixel intensities of the original image are corrected by these factors, the image contrast, reduced by the overall attenuation in the exposure phase, are recovered, allowing one to see details otherwise concealed due to the low contrast. In order to verify the soundness of this approach, synthetic images of objects of different shapes, such as plates and tubes, incorporating defects and statistical fluctuation, have been generated, recorded for further comparison and afterwards processed to improve their contrast. The developed algorithm which, generates processes and plots the images has been written in Fortran 90 language. As the resulting final images exhibit the expected improvements, it therefore seemed worthwhile to carry out further tests with actual experimental radiographies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The effects of intrinsic noise on the behaviour of bistable cell regulatory systems under quasi-steady state conditions

We analyse the effect of intrinsic fluctuations on the properties of bistable stochastic systems with time scale separation operating under quasi-steady state conditions. We first formulate a stochastic generalisation of the quasi-steady state approximation based on the semi-classical approximation of the partial differential equation for the generating function associated with the chemical master equation. Such approximation proceeds by optimising an action functional whose associated set of Euler-Lagrange (Hamilton) equations provides the most likely fluctuation path. We show that, under appropriate conditions granting time scale separation, the Hamiltonian can be re-scaled so that the set of Hamilton equations splits up into slow and fast variables, whereby the quasi-steady state approximation can be applied. We analyse two particular examples of systems whose mean-field limit has been shown to exhibit bi-stability: an enzyme-catalysed system of two mutually inhibitory proteins and a gene regulatory circuit with self-activation. Our theory establishes that the number of molecules of the conserved species is order parameters whose variation regulates bistable behaviour in the associated systems beyond the predictions of the mean-field theory. This prediction is fully confirmed by direct numerical simulations using the stochastic simulation algorithm. This result allows us to propose strategies whereby, by varying the number of molecules of the three conserved chemical species, cell properties associated to bistable behaviour (phenotype, cell-cycle status, etc.) can be controlled.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Modified Newton-Raphson GRAPE methods for optimal control of spin systems

Quadratic convergence throughout the active space is achieved for the gradient ascent pulse engineering (GRAPE) family of quantum optimal control algorithms. We demonstrate in this communication that the Hessian of the GRAPE fidelity functional is unusually cheap, having the same asymptotic complexity scaling as the functional itself. This leads to the possibility of using very efficient numerical optimization techniques. In particular, the Newton-Raphson method with a rational function optimization (RFO) regularized Hessian is shown in this work to require fewer system trajectory evaluations than any other algorithm in the GRAPE family. This communication describes algebraic and numerical implementation aspects (matrix exponential recycling, Hessian regularization, etc.) for the RFO Newton-Raphson version of GRAPE and reports benchmarks for common spin state control problems in magnetic resonance spectroscopy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗