Search NASASearch

Engineering topics

Abrams, D.

Publications and source records attributed to Abrams, D..

Inclusive studies of two- and three-nucleon short-range correlations in 3 H and 3 He

Inclusive electron scattering at carefully chosen kinematics can isolate scattering from the high-momentum nucleons in short-range correlations (SRCs). SRCs are produced by the hard, short-distance interactions of nucleons in the nucleus, and because the two-nucleon (2N) SRCs arise from the same N-N interaction in all nuclei, the cross section in the SRC-dominated regime is identical up to an overall scaling factor. This scaling behavior has been used to identify SRC dominance and to measure the contribution of SRCs in a wide range of nuclei. We examine this scaling behavior over a range of momentum transfers using new data on 2 H, 3 H, and 3 He, and find an expanded scaling region compared to heavy nuclei. Motivated by this improved scaling, we examine the 3 H and 3 He data in kinematics where three-nucleon SRCs may play an important role. The data for the largest struck nucleon momenta are consistent with isolation of scattering from three-nucleon SRCs, and suggest that the very highest momentum nucleons in 3 He have a nearly isospin-independent momentum configuration.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS

Fast Quantum Algorithms for Numerical Integrals and Stochastic Processes

We discuss quantum algorithms that calculate numerical integrals and descriptive statistics of stochastic processes. With either of two distinct approaches, one obtains an exponential speed increase in comparison to the fastest known classical deterministic algotithms and a quadratic speed increase incomparison to classical Monte Carlo methods.

quantum algorithms numerical integrals

Quantum Algorithms

This thesis describes several new quantum algorithms. These include a polynomial time algorithm that uses a quantum fast Fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, and that can be applied in cases for which all know classical algorithms require exponential time.

Quantum Algorithms polynomial time algorithm Hamil