Search NASA⌕ Search

SEARCH · Search NASA

Results for “Randomization”

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 361 records · Page 20

2D stochastic-integral models for characterizing random grain noise in titanium alloys

We extend our previous work, in which we applied high-dimensional model representation (HDMR) and analysis of variance (ANOVA) concepts to the characterization of a metallic surface that has undergone a shot-peening treatment to reduce residual stresses, and has, therefore, become a random conductivity field. That example was treated as a onedimensional problem, because those were the only data available. In this study, we develop a more rigorous two-dimensional model for characterizing random, anisotropic grain noise in titanium alloys. Such a model is necessary if we are to accurately capture the 'clumping' of crystallites into long chains that appear during the processing of the metal into a finished product. The mathematical model starts with an application of the Karhunen-Loève (K-L) expansion for the random Euler angles, θ and φ, that characterize the orientation of each crystallite in the sample. The random orientation of each crystallite then defines the stochastic nature of the electrical conductivity tensor of the metal. We study two possible covariances, Gaussian and double-exponential, which are the kernel of the K-L integral equation, and find that the double-exponential appears to satisfy measurements more closely of the two. Results based on data from a Ti-7Al sample will be given, and further applications of HDMR and ANOVA will be discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Distribution of centrality measures on undirected random networks via the cavity method

The Katz centrality of a node in a complex network is a measure of the node’s importance as far as the flow of information across the network is concerned. For ensembles of locally tree-like undirected random graphs, this observable is a random variable. Its full probability distribution is of interest but difficult to handle analytically because of its “global” character and its definition in terms of a matrix inverse. Leveraging a fast Gaussian Belief Propagation-Cavity algorithm to solve linear systems on tree-like structures, we show that i) the Katz centrality of a single instance can be computed recursively in a very fast way, and ii) the probability P ( K ) that a random node in the ensemble of undirected random graphs has centrality K satisfies a set of recursive distributional equations, which can be analytically characterized and efficiently solved using a population dynamics algorithm. We test our solution on ensembles of Erdős-Rényi and Scale Free networks in the locally tree-like regime, with excellent agreement. The analytical distribution of centrality for the configuration model conditioned on the degree of each node can be employed as a benchmark to identify nodes of empirical networks with over- and underexpressed centrality relative to a null baseline. We also provide an approximate formula based on a rank- 1 projection that works well if the network is not too sparse, and we argue that an extension of our method could be efficiently extended to tackle analytical distributions of other centrality measures such as PageRank for directed networks in a transparent and user-friendly way.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Effective pair potential for random fcc CoCrFeMnNi alloys

The single-phase equiatomic CoCrFeMnNi alloy is a random solid solution of five elements on the face-centered cubic lattice, whose pure constituents crystallize in very different structures and exhibit diverse magnetic properties. Due to the randomness of the alloy, 80% of nearest neighbor bonds are between unlike elements and thus the details of bonding in pure structures are less important. The elastic moduli of this alloy give rise to small Cauchy pressure C 12 - C 44 , which suggests that the dominant part of bonding may be described by a simple pair potential. We test this hypothesis by developing a long-range Lennard-Jones potential in which the equilibrium crystal structures of pure constituents are taken as reference. The standard mixing rules for regular solutions are then adopted to obtain parameters for bonds between unlike elements in the quinary system. The transferability of this potential to quaternary CoCrFeNi, ternary CoCrNi, and binary FeNi alloys is investigated and the predictions compared with experiments and density functional theory calculations. By sampling over a large number of random configurations, we investigate the effect of compositional randomness on misfit volumes, energies of point defects and stacking faults, and the dislocation friction stresses experienced by moving edge and screw dislocations.

Materials Science↗

Spectral Properties and Coding Transitions of Haar-Random Quantum Codes

A quantum error-correcting code with a nonzero error threshold undergoes a mixed-state phase transition when the error rate reaches that threshold. We explore this phase transition for Haar-random quantum codes, in which the logical information is encoded in a random subspace of the physical Hilbert space. We focus on the spectrum of the encoded system density matrix as a function of the rate of uncorrelated, single-qudit errors. For low error rates, this spectrum consists of well-separated bands, representing errors of different weights. As the error rate increases, the bands for high-weight errors merge. The evolution of these bands with increasing error rate is well described by a simple analytic ansatz. Using this ansatz, as well as an explicit calculation, we show that the threshold for Haar-random quantum codes saturates the hashing bound, and thus coincides with that for random stabilizer codes. For error rates that exceed the hashing bound, typical errors are uncorrectable, but postselected error correction remains possible until a much higher detection threshold. Postselection can in principle be implemented by projecting onto subspaces corresponding to low-weight errors, which remain correctable past the hashing bound.

decoherence↗

Faster Randomized Dynamical Decoupling

We present a randomized dynamical decoupling (DD) protocol that can substantially improve the performance of any given deterministic DD scheme for suppressing coherent noise by using no more than two additional pulses. Our construction is implemented by probabilistically applying sequences of pulses, which, when combined, effectively eliminate the error terms that scale linearly with the system-environment coupling strength. As a result, we show that a randomized protocol using a few pulses can outperform deterministic DD protocols that require considerably more pulses. Furthermore, we prove that the randomized protocol provides an improvement compared to deterministic DD sequences that aim to reduce the error in the system’s Hilbert space, such as Uhrig DD, which had been previously regarded to be optimal. To rigorously evaluate the performance, we introduce new analytical methods suitable for analyzing higher-order DD protocols that might be of independent interest. Here, we also present numerical simulations confirming the significant advantage of using randomized protocols compared to widely used deterministic protocols.

Quantum algorithms & computation↗

Local entanglement and confinement transitions in the random transverse-field Ising model on the pyrochlore lattice

We use numerical linked cluster expansions (NLC) and exact diagonalization to study confinement transitions out of the quantum spin liquid phase in the pyrochlore-lattice Ising antiferromagnet with random transverse fields. We calculate entanglement entropies associated with local regions defined by single tetrahedron to observe these transitions. The randomness-induced confinement transition is marked by a sharp reduction in the local entanglement and a concomitant increase in Ising correlations. In NLC, it is studied through the destruction of loop resonances due to random transverse-fields. As a result, the confining phase is characterized by a distribution of local entanglement entropies, which persists to large random fields.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Topological and symmetry-enriched random quantum critical points

In this work, we study how symmetry can enrich strong-randomness quantum critical points and phases, and lead to robust topological edge modes coexisting with critical bulk fluctuations. These are the disordered analogs of gapless topological phases. Using real-space and density matrix renormalization group approaches, we analyze the boundary and bulk critical behavior of such symmetry-enriched random quantum spin chains. We uncover a new class of symmetry-enriched infinite randomness fixed points: while local bulk properties are indistinguishable from conventional random singlet phases, nonlocal observables, and boundary critical behavior are controlled by a different renormalization group fixed point. We also illustrate how such new quantum critical points emerge naturally in Floquet systems.

74 ATOMIC AND MOLECULAR PHYSICS↗

Random insights into the complexity of two-dimensional tensor network calculations

Projected entangled pair states (PEPS) offer memory-efficient representations of some quantum many-body states that obey an entanglement area law and are the basis for classical simulations of ground states in two-dimensional (2d) condensed matter systems. However, rigorous results show that exactly computing observables from a 2d PEPS state is generically a computationally hard problem. Yet approximation schemes for computing properties of 2d PEPS are regularly used, and empirically seen to succeed, for a large subclass of (“not too entangled”) condensed matter ground states. Adopting the philosophy of random matrix theory, in this work, we analyze the complexity of approximately contracting a 2d random PEPS by exploiting an analytic mapping to an effective replicated statistical mechanics model that permits a controlled analysis at a large bond dimension. Through this statistical-mechanics lens, we argue that (i) although approximately sampling wave-function amplitudes of random PEPS faces a computational-complexity phase transition above a critical bond dimension, and (ii) one can generically efficiently estimate the norm and correlation functions for any finite bond dimension. Furthermore, these results are supported numerically for various bond-dimension regimes. It is an important open question whether the above results for random PEPS apply more generally also to PEPS representing physically relevant ground states.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Random walks on jammed networks: Spectral properties

Using random walk analyses we explore diffusive transport on networks obtained from contacts between isotropically compressed, monodisperse, frictionless sphere packings generated over a range of pressures in the vicinity of the jamming transition p → 0 . For conductive particles in an insulating medium, conduction is determined by the particle contact network with nodes representing particle centers and edges contacts between particles. The transition rate is not homogeneous, but is distributed inhomogeneously due to the randomness of packing and concomitant disorder of the contact network, e.g., the distribution of the coordination number. A narrow escape time scale is used to write a Markov process for random walks on the particle contact network. This stochastic process is analyzed in terms of spectral density of the random, sparse, Euclidean and real, symmetric, positive, semidefinite transition rate matrix. Findings reveal network structures derived from jammed particles have properties similar to ordered, euclidean lattices but also some unique properties that distinguish them from other structures that are in some sense more homogeneous. Specifically, the distribution of eigenvalues of the transition rate matrix follow a power law with spectral dimension 3. Yet, quantitative details of the statistics of the eigenvectors show subtle differences with homogeneous lattices and allow us to distinguish between topological and geometric sources of disorder in the network.

42 ENGINEERING↗

Random Close Packing as a Dynamical Phase Transition

Sphere packing is an ancient problem. The densest packing is known to be a face-centered cubic (FCC) crystal, with space-filling fraction Φ FCC = π / √ 18 ≈ 0.74 . The densest “random packing,” random close packing (RCP), is yet ill defined, although many experiments and simulations agree on a value Φ RCP ≈ 0.64 . We introduce a simple absorbing-state model, biased random organization (BRO), which exhibits a Manna class dynamical phase transition between absorbing and active states that has as its densest critical point Φ cmax ≈ 0.64 ≈ Φ RCP and, like other Manna class models, is hyperuniform at criticality. The configurations we obtain from BRO appear to be structurally identical to RCP configurations from other protocols. This leads us to conjecture that the highest-density absorbing state for an isotropic biased random organization model produces an ensemble of configurations that characterizes the state conventionally known as RCP.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Error mitigated metasurface-based randomized measurement schemes

Estimating properties of quantum states via randomized measurements has become a significant part of quantum information science. In this paper, we design an innovative approach leveraging metasurfaces to perform randomized measurements on photonic qubits, together with error mitigation techniques that suppress realistic metasurface measurement noise. Through fidelity and purity estimation, we confirm the capability of metasurfaces to implement randomized measurements and the unbiased nature of our error-mitigated estimator. Our findings show the potential of metasurface-based randomized measurement schemes in achieving robust and resource-efficient estimation of quantum state properties. Published by the American Physical Society 2024

Ren, Hang (ORCID:0000000255448692)↗

Localization in Fractonic Random Circuits

We study the spreading of initially local operators under unitary time evolution in a one-dimensional random quantum circuit model that is constrained to conserve a U ( 1 ) charge and also the dipole moment of this charge. These constraints are motivated by the quantum dynamics of fracton phases. We discover that the charge remains localized at its initial position, providing a crisp example of a nonergodic dynamical phase of random circuit dynamics. This localization can be understood as a consequence of the return properties of low-dimensional random walks, through a mechanism reminiscent of weak localization, but insensitive to dephasing. The charge dynamics is well described by a system of coupled hydrodynamic equations, which makes several nontrivial predictions that are all in good agreement with numerics in one dimension. Importantly, these equations also predict localization in two-dimensional fractonic random circuits. We further find that the immobile fractonic charge emits nonconserved operators, whose spreading is governed by exponents that are distinct from those observed in nonfractonic circuits. These nonstandard exponents are also explained by our coupled hydrodynamic equations. Where entanglement properties are concerned, we find that fractonic operators exhibit a short time linear growth of observable entanglement with saturation to an area law, as well as a subthermal volume law for operator entanglement. The entanglement spectrum is found to follow semi-Poisson statistics, similar to eigenstates of many-body localized systems. The nonergodic phenomenology is found to persist to initial conditions containing nonzero density of dipolar or fractonic charge, including states near the sector of maximal charge. Our work implies that low-dimensional fracton systems should preserve forever a memory of their initial conditions in local observables under noisy quantum dynamics, thereby constituting ideal memories. It also implies that one- and two-dimensional fracton systems should realize true many-body localization (MBL) under Hamiltonian dynamics, even in the absence of disorder, with the obstructions to MBL in translation-invariant systems and in spatial dimensions greater than one being evaded by the nature of the mechanism responsible for localization. We also suggest a possible route to new nonergodic phases in high dimensions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Superspin renormalization and slow relaxation in random spin systems

We develop an excited-state real-space renormalization group (RSRG-X) formalism to describe the dynamics of conserved densities in randomly interacting spin-12 systems. Our formalism is suitable for systems with U(1) and Z2 symmetries, and we apply it to chains of randomly positioned spins with dipolar XX+YY interactions, as arise in Rydberg quantum simulators and other platforms. The formalism generates a sequence of effective Hamiltonians that provide approximate descriptions for dynamics on successively smaller energy scales. These effective Hamiltonians involve “superspins”: two-level collective degrees of freedom constructed from (anti)aligned microscopic spins. Conserved densities can then be understood as relaxing via coherent collective spin flips. For the well-studied simpler case of randomly interacting nearest-neighbor XX+YY chains, the superspins reduce to single spins. Our formalism also leads to a numerical method capable of simulating the dynamics up to an otherwise inaccessible combination of large system size and late time. Focusing on disorder-averaged infinite-temperature autocorrelation functions, in particular the spin survival probability Sp¯(t), we demonstrate quantitative agreement between our algorithm and exact diagonalization (ED) at low but nonzero frequencies. Such agreement holds for chains with nearest-neighbor, next-nearest-neighbor, and long-range dipolar interactions. Our results indicate decay of Sp¯(t) slower than any power law and feature no significant deviation from the ∼1/ln2(t) asymptote expected from the infinite-randomness fixed-point of the nearest-neighbor model. We also apply the RSRG-X formalism to two-dimensional long-range systems of moderate size and find slow late-time decay of Sp¯(t).

Zhao, Yi J↗

Spatial Prediction Filtering for Medical Ultrasound in Aberration and Random Noise

While medical ultrasound imaging has become one of the most widely used imaging modalities in clinics, it often suffers from suboptimal image quality especially in technically difficult patients with a large amount of fat content that induces severe phase aberration effects and decreases the signal-to-noise (SNR) ratio. Several researchers have proposed various techniques, which can be broadly categorized as either a phase aberration correction (PAC) technique or a coherence-based imaging technique, to address the challenges in imaging technically difficult patients. Although both families of techniques have shown some success in improving the image quality in the presence of a mild level of phase aberration and/or random noise, they often fail to achieve meaningful improvements in the image quality and in some cases, and even create severe image artifacts. In this work, we employ an adaptive filtering technique called frequency-space (F-X) prediction filtering, which we recently introduced in ultrasound imaging, to overcome the weaknesses of existing techniques and achieve image quality improvements more effectively under varying levels of phase aberration and random noise. Using simulated and experimental phantom data with varying levels of phase aberration and random noise, we evaluate and compare the performance of FXPF with the most representative technique for each category: NNCC-based PAC and the generalized coherence factor (GCF). Our simulation, experimental phantom, and in vivo results demonstrate that FXPF is highly robust in varying levels of phase aberration and noise, and always outperforms both NNCC-based PAC and GCF in terms of the contrast-to-noise ratio (CNR) and the contrast when both random noise and phase aberration are present.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

SU-D-201-06: Random Walk Algorithm Seed Localization Parameters in Lung Positron Emission Tomography (PET) Images

Purpose: The objective of this study was to find the best seed localization parameters in random walk algorithm application to lung tumor delineation in Positron Emission Tomography (PET) images. Methods: PET images suffer from statistical noise and therefore tumor delineation in these images is a challenging task. Random walk algorithm, a graph based image segmentation technique, has reliable image noise robustness. Also its fast computation and fast editing characteristics make it powerful for clinical purposes. We implemented the random walk algorithm using MATLAB codes. The validation and verification of the algorithm have been done by 4D-NCAT phantom with spherical lung lesions in different diameters from 20 to 90 mm (with incremental steps of 10 mm) and different tumor to background ratios of 4:1 and 8:1. STIR (Software for Tomographic Image Reconstruction) has been applied to reconstruct the phantom PET images with different pixel sizes of 2×2×2 and 4×4×4 mm{sup 3}. For seed localization, we selected pixels with different maximum Standardized Uptake Value (SUVmax) percentages, at least (70%, 80%, 90% and 100%) SUVmax for foreground seeds and up to (20% to 55%, 5% increment) SUVmax for background seeds. Also, for investigation of algorithm performance on clinical data, 19 patients with lung tumor were studied. The resulted contours from algorithm have been compared with nuclear medicine expert manual contouring as ground truth. Results: Phantom and clinical lesion segmentation have shown that the best segmentation results obtained by selecting the pixels with at least 70% SUVmax as foreground seeds and pixels up to 30% SUVmax as background seeds respectively. The mean Dice Similarity Coefficient of 94% ± 5% (83% ± 6%) and mean Hausdorff Distance of 1 (2) pixels have been obtained for phantom (clinical) study. Conclusion: The accurate results of random walk algorithm in PET image segmentation assure its application for radiation treatment planning and diagnosis.

60 APPLIED LIFE SCIENCES↗

Random Sampling Process Leads to Overestimation of β-Diversity of Microbial Communities

The site-to-site variability in species composition, known as β-diversity, is crucial to understanding spatiotemporal patterns of species diversity and the mechanisms controlling community composition and structure. However, quantifying β-diversity in microbial ecology using sequencing-based technologies is a great challenge because of a high number of sequencing errors, bias, and poor reproducibility and quantification. Herein, based on general sampling theory, a mathematical framework is first developed for simulating the effects of random sampling processes on quantifying β-diversity when the community size is known or unknown. Also, using an analogous ball example under Poisson sampling with limited sampling efforts, the developed mathematical framework can exactly predict the low reproducibility among technically replicate samples from the same community of a certain species abundance distribution, which provides explicit evidences of random sampling processes as the main factor causing high percentages of technical variations. In addition, the predicted values under Poisson random sampling were highly consistent with the observed low percentages of operational taxonomic unit (OTU) overlap (<30% and <20% for two and three tags, respectively, based on both Jaccard and Bray-Curtis dissimilarity indexes), further supporting the hypothesis that the poor reproducibility among technical replicates is due to the artifacts associated with random sampling processes. Finally, a mathematical framework was developed for predicting sampling efforts to achieve a desired overlap among replicate samples. Our modeling simulations predict that several orders of magnitude more sequencing efforts are needed to achieve desired high technical reproducibility. These results suggest that great caution needs to be taken in quantifying and interpreting β-diversity for microbial community analysis using next-generation sequencing technologies.

59 BASIC BIOLOGICAL SCIENCES↗

A Quantum Random Number Generator Based on the 100-Mbit/s Poisson Photocount Statistics

A quantum random number generator is experimentally realized. The initial randomness source is a sequence of photocounts from quasi-single-photon radiation detected with a SiPM (Silicon Photo Multiplier) silicon avalanche detector array. The use of a SiPM provides a reliable control of the quantum nature of the Poisson photocount statistics. A special algorithm with nonexponential complexity allows one to extract from the Poisson process all the randomness contained in it, namely, a random uniform sequence of 0 and 1.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Local polynomial chaos expansion for linear differential equations with high dimensional random inputs

In this paper we present a localized polynomial chaos expansion for partial differential equations (PDE) with random inputs. In particular, we focus on time independent linear stochastic problems with high dimensional random inputs, where the traditional polynomial chaos methods, and most of the existing methods, incur prohibitively high simulation cost. Furthermore, the local polynomial chaos method employs a domain decomposition technique to approximate the stochastic solution locally. In each subdomain, a subdomain problem is solved independently and, more importantly, in a much lower dimensional random space. In a postprocesing stage, accurate samples of the original stochastic problems are obtained from the samples of the local solutions by enforcing the correct stochastic structure of the random inputs and the coupling conditions at the interfaces of the subdomains. Overall, the method is able to solve stochastic PDEs in very large dimensions by solving a collection of low dimensional local problems and can be highly efficient. In our paper we present the general mathematical framework of the methodology and use numerical examples to demonstrate the properties of the method.

97 MATHEMATICS AND COMPUTING↗