Search NASA⌕ Search

SEARCH · Search NASA

Results for “randomizer”

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 181 records · Page 10

Understanding vortex dynamics in CaK(Fe,Ni) 4 As 4 and Ba(Fe,Co) 2 As 2 single crystals under the influence of random point disorder

We report on the influence of doping on vortex dynamics in 3 MeV proton-irradiated single crystals of CaK(Fe 1–x Ni x ) 4 As 4 (1144, x = 0.015, 0.025, and 0.03) and Ba(Fe 1–x Co x ) 2 As 2 (x = 0.04, 0.062, 0.066 and 0.074). Non-irradiated crystals of the 1144 system display superconducting critical temperatures ranging from 31 K for x = 0.015–20.5 K, as doping increases to 0.03. On the other hand, pristine crystals of the 122 system show T c values between 14.6 and 23.6 K, with the maximum T c occurring at intermediate doping levels. The fluence was set at 3 × 10 16 p cm –2 , resulting in a decrease in the T c by around 1.5 K for all samples and significantly affecting the vortex dynamics by reducing the flux creep relaxation compared to previously reported values for unirradiated crystals. Parameters such as vortex pinning energy U 0 and the glassy exponent μ dependencies on doping and magnetic field strength are identified. For the 1144 system, U 0 reaches values approaching 500 K for small fields in samples with T c = 29.3 K (x = 0.015), systematically decreasing to around 200 K as T c falls below 20 K. Furthermore, U 0 decreases as the field increases to 3 T for the same sample, varying from approximately 250 K to 100 K as T c decreases. These changes are typically accompanied by modifications in μ, gradually increasing from values around 1 towards 1.5, corresponding to small bundle relaxation in the collective creep theory. Despite differences in the substitutional disorder and magnetic phase diagram with respect to the 1144 system, the results for 122 single crystals follow a similar tendency in which U 0 usually reduces and μ increase rise as the applied magnetic field is increased. Due to moderate U 0 in these systems (few hundreds of kelvins), the resulting decay of persistent current at liquid helium temperatures is primarily determined by a balance between U 0 and bundle size contribution. Furthermore, these findings provide valuable insights for potential applications of these systems, particularly in the context of intrinsic superconducting parameters and the resulting pinning landscape.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Benchmarking the performance of a high-Q cavity qudit using random unitaries

High-coherence cavity resonators are excellent resources for encoding quantum information in higher-dimensional Hilbert spaces, moving beyond traditional qubit-based platforms. A natural strategy is to use the Fock basis to encode information in qudits. One can perform quantum operations on the cavity mode qudit by coupling the system to a non-linear ancillary transmon qubit. However, the performance of the cavity-transmon device is limited by the noisy transmons. It is, therefore, important to develop practical benchmarking tools for these qudit systems in an algorithm-agnostic manner. We gauge the performance of these qudit platforms using sampling tests such as the heavy output generation test as well as the linear cross-entropy benchmark, by way of simulations of such a system subject to realistic dominant noise channels. We use selective number-dependent arbitrary phase and unconditional displacement gates as our universal gateset. Our results show that contemporary transmons comfortably enable controlling a few tens of Fock levels of a cavity mode. This framework allows benchmarking even higher dimensional qudits as those become accessible with improved transmons.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Classical combinatorial optimization scaling for random Ising models on 2D heavy-hex graphs

Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the quantum approximate optimization algorithm. In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation time scaling quantification. Specifically the time-to-solution (TTS) metric using the classical heuristic simulated annealing is measured for finding optimal variable assignments (ground states), as well as the time required for the optimization software Gurobi to find an optimal variable assignment. Because of the sparsity of these Ising models, the classical algorithms are able to find optimal solutions efficiently even for large instances (i.e. 100 000 spin variables). The Ising models both with and without geometrically local cubic terms exhibit average-case linear-time or weakly quadratic scaling when solved exactly using Gurobi, and the Ising models with no cubic terms show evidence of exponential-time TTS scaling when sampled using simulated annealing. These findings point to the necessity of developing and testing more complex, namely more densely connected, optimization problems in order for quantum computing to ever have a practical advantage over classical computing. Our results are another illustration that different classical algorithms can indeed have exponentially different running times, thus making the identification of the best practical classical technique important in any quantum computing vs. classical computing comparison.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

RWRtoolkit: multi-omic network analysis using random walks on multiplex networks in any species

Abstract We introduce RWRtoolkit, a multiplex generation, exploration, and statistical package built for R and command-line users. RWRtoolkit enables the efficient exploration of large and highly complex biological networks generated from custom experimental data and/or from publicly available datasets, and is species agnostic. A range of functions can be used to find topological distances between biological entities, determine relationships within sets of interest, search for topological context around sets of interest, and statistically evaluate the strength of relationships within and between sets. The command-line interface is designed for parallelization on high-performance cluster systems, which enables high-throughput analysis such as permutation testing. Several tools in the package have also been made available for use in reproducible workflows via the KBase web application.

Kainer, David (ORCID:0000000172714676)↗

Random Forest Prediction of Crystal Structure from Electron Diffraction Patterns

Transmission electron microscopy (TEM) diffraction patterns are regularly used to determine the structure of crystalline materials. Electron diffraction is the most common method to solve for unknown or partially known crystal structures, as it provides direct and interpretable feedback on the orientation of crystal grains under the beam [1]. However, it remains a challenge to determine the crystal structure of a new material or even a new phase of an existing material. Analysis of such materials commonly requires manual exploration and comparison with simulated diffraction patterns. This is often a time consuming process with no obvious start point when many similar structures are possible, and this method cannot be used to determine crystal structure or orientation from structures not included in the diffraction libraries. Therefore, we have developed a machine learning model to determine the crystal structure of a material from its electron diffraction pattern.

36 MATERIALS SCIENCE↗

Random Walks With Tweedie: A Unified View of Score-Based Diffusion Models [In the Spotlight]

We present a concise derivation for several influential score-based diffusion models that relies on only a few textbook results. Diffusion models have recently emerged as powerful tools for generating realistic, synthetic signals—particularly natural images—and often play a role in state-of-the-art algorithms for inverse problems in image processing. While these algorithms are often surprisingly simple, the theory behind them is not, and multiple complex theoretical justifications exist in the literature. Here, in this study, we provide a simple and largely self-contained theoretical justification for score-based diffusion models that is targeted towards the signal processing community. This approach leads to generic algorithmic templates for training and generating samples with diffusion models. We show that several influential diffusion models correspond to particular choices within these templates and demonstrate that alternative, more straightforward algorithmic choices can provide comparable results. This approach has the added benefit of enabling conditional sampling without any likelihood approximation.

97 MATHEMATICS AND COMPUTING↗

Simulating Single Qubit Random

Single qubit RB is used to measure the error of gates via average gate fidelity. A single qubit RB program was made to calculate this. To filter out potential hardware issues, RB was executed through creating a simulator. Upon simulating both noisy and noise-less gates, we determined that there is a mix of both hardware and program issues.

Anguiano, Efren↗

Randomized algorithms for accelerating linear algebraic computations

The project supported the development of new methodologies for performing matrix computations that form key building blocks in modern scientific computing, such as low rank approximation of matrices, and efficient representations of global operators that arise in simulations of physical phenomena.

97 MATHEMATICS AND COMPUTING↗