Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “random”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Random 3D Interpenetrating Electrode Design for Energy Storage Applications

We introduce the concept of random interpenetrating electrode structures, inspired by spinodal decomposition, as a transformative approach for energy storage applications. While ordered architectures, such as double gyroids and Kelvin cell structures, have long been favored for their structural uniformity and surface area utilization, we demonstrate that random structures offer distinct advantages including shorter diffusion pathways, higher packing density, and enhanced reaction kinetics, particularly at low temperatures. Using a combination of computational and electrochemical analysis, we show that random architecture outperforms their ordered counterparts in scenarios where diffusion dominates. This work represents the first systematic exploration of random structures in energy storage, highlighting their potential to overcome limitations of traditional designs. However, challenges such as structural reproducibility and scalability remain, necessitating further investigation into fabrication techniques and material selection. By establishing a framework to optimize random electrode architectures, we provide critical insights into the interplay between geometry, diffusion, and reaction kinetics. This study not only introduces a new design principle for 3D electrodes but also opens pathways for next-generation energy storage systems that demand both high performance and adaptability to a range of operating conditions.

Materials science↗
DOE OSTI2023

Random Tensor Networks with Non-trivial Links

Abstract Random tensor networks are a powerful toy model for understanding the entanglement structure of holographic quantum gravity. However, unlike holographic quantum gravity, their entanglement spectra are flat. It has therefore been argued that a better model consists of random tensor networks with link states that are not maximally entangled, i.e., have non-trivial spectra. In this work, we initiate a systematic study of the entanglement properties of these networks. We employ tools from free probability, random matrix theory, and one-shot quantum information theory to study random tensor networks with bounded and unbounded variation in link spectra, and in cases where a subsystem has one or multiple minimal cuts. If the link states have bounded spectral variation, the limiting entanglement spectrum of a subsystem with two minimal cuts can be expressed as a free product of the entanglement spectra of each cut, along with a Marchenko–Pastur distribution. For a class of states with unbounded spectral variation, analogous to semiclassical states in quantum gravity, we relate the limiting entanglement spectrum of a subsystem with two minimal cuts to the distribution of the minimal entanglement across the two cuts. In doing so, we draw connections to previous work on split transfer protocols, entanglement negativity in random tensor networks, and Euclidean path integrals in quantum gravity.

Physics↗
DOE OSTI2025

Certified randomness using a trapped-ion quantum processor

Although quantum computers can perform a wide range of practically important tasks beyond the abilities of classical computers, realizing this potential remains a challenge. An example is to use an untrusted remote device to generate random bits that can be certified to contain a certain amount of entropy. Certified randomness has many applications but is impossible to achieve solely by classical computation. Here we demonstrate the generation of certifiably random bits using the 56-qubit Quantinuum H2-1 trapped-ion quantum computer accessed over the Internet. Our protocol leverages the classical hardness of recent random circuit sampling demonstrations: a client generates quantum ‘challenge’ circuits using a small randomness seed, sends them to an untrusted quantum server to execute and verifies the results of the server. We analyse the security of our protocol against a restricted class of realistic near-term adversaries. Using classical verification with measured combined sustained performance of 1.1 × 10 18 floating-point operations per second across multiple supercomputers, we certify 71,313 bits of entropy under this restricted adversary and additional assumptions. Our results demonstrate a step towards the practical applicability of present-day quantum computers.

computer science↗
DOE OSTI2024

Analysis of multipacting threshold sensitivity to the random distributions of the secondary electron yield parameters

The way multipacting develops, depends strongly on the secondary emission property of the surface material. The knowledge of secondary electron yield is crucial for accurate prediction of the multipacting threshold. Variations in secondary electron yield parameters from experimental measurements create uncertainty, stemming from handling and surface preparation, and these uncertainties significantly affect multipacting threshold predictions. Despite their significance, the previous studies on the multipacting phenomenon did not adequately address the effect of an assumed random distribution of the secondary emission parameters on the multipacting threshold. Therefore, this paper aims to provide a comprehensive statistical study on how the different random distributions of the secondary emission parameters and, as a result, the uncertainty in the secondary electron yield affect multipacting thresholds. We focus on three commonly used distributions, namely uniform, normal, and truncated normal distributions, to define the uncertainty of random inputs. We use the chaos polynomial expansion method to determine how much each of the random parameters contributes to the multipacting threshold uncertainty. Additionally, we calculate Sobol sensitivity indices to evaluate the impact of the individual parameters or groups of parameters on the model outputs and study how different random distributions of these parameters affected the Sobol index results.

physics↗
DOE OSTI2021

Structured sequences emerge from random pool when replicated by templated ligation

The central question in the origin of life is to understand how structure can emerge from randomness. The Eigen theory of replication states, for sequences that are copied one base at a time, that the replication fidelity has to surpass an error threshold to avoid that replicated specific sequences become random because of the incorporated replication errors [M. Eigen, Naturwissenschaften 58 (10), 465–523 (1971)]. Here, we showed that linking short oligomers from a random sequence pool in a templated ligation reaction reduced the sequence space of product strands. We started from 12-mer oligonucleotides with two bases in all possible combinations and triggered enzymatic ligation under temperature cycles. Surprisingly, we found the robust creation of long, highly structured sequences with low entropy. At the ligation site, complementary and alternating sequence patterns developed. However, between the ligation sites, we found either an A-rich or a T-rich sequence within a single oligonucleotide. Our modeling suggests that avoidance of hairpins was the likely cause for these two complementary sequence pools. What emerged was a network of complementary sequences that acted both as templates and substrates of the reaction. This self-selecting ligation reaction could be restarted by only a few majority sequences. The findings showed that replication by random templated ligation from a random sequence input will lead to a highly structured, long, and nonrandom sequence pool. This is a favorable starting point for a subsequent Darwinian evolution searching for higher catalytic functions in an RNA world scenario.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2025

Randomized Adiabatic Quantum Linear Solver Algorithm with Optimal Complexity Scaling and Detailed Running Costs

Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı et al. [Phys. Rev. Lett. 122, 060504 (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number 𝜅 of the linear system and the target error 𝜖. Here we go beyond these results in several ways. Firstly, using filtering [Lin and Tong, Quantum 4, 361 (2020)] and Poissonization techniques [Cunningham and Roland, ArXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling 𝑂⁡(𝜅⁢log (1/𝜖))—an exponential improvement in 𝜖, and a shaving of a log 𝜅 scaling factor in 𝜅. Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation—which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is 837⁢𝜅 at 𝜖 = 10 −10 for Hermitian matrices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Comparison of quantum advantage experiments using random circuit sampling

Random circuit sampling, the task of sampling bit strings from a random unitary operator, has been implemented to demonstrate quantum advantage on the Sycamore quantum processor with 53 qubits and on the Zuchongzhi quantum processor with 56 and 61 qubits. Recently, it was claimed that classical computers using tensor network simulation could catch on to current noisy quantum processors for random circuit sampling. While the linear cross-entropy benchmark fidelity was used to certify all these claims, it may not capture statistical properties of outputs in detail. Here, we compare the bit strings sampled from classical computers using tensor network simulation by Pan et al. [F. Pan, K. Chen, and P. Zhang, Phys. Rev. Lett. 129, 090502 (2022)] and by Kalachev et al. [G. Kalachev, P. Panteleev, P. Zhou, and M.-H. Yung, arXiv:2112.15083] with the bit strings from the Sycamore quantum processor. It is shown that all of Kalachev et al.'s samples passed the NIST random number tests. The heat maps of bit strings show that Pan et al.'s and Kalachev et al.'s samples are quite different from the Sycamore or Zuchongzhi samples. The analysis with the Marchenko-Pastur distribution and the Wasssertein distances demonstrates that Kalachev et al.'s samples are statistically closer to the Sycamore samples than Pan et al.'s while the three datasets have similar values for the linear cross-entropy fidelity. In conclusion, our finding implies that further study is needed to certify or beat the claims of quantum advantage using random circuit sampling.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Entanglement phase transitions in random stabilizer tensor networks

Here we explore a class of random tensor network models with “stabilizer” local tensors which we name random stabilizer tensor networks (RSTNs). For RSTNs defined on a two-dimensional square lattice, we perform extensive numerical studies of entanglement phase transitions between volume-law and area-law entangled phases of the one-dimensional boundary states. These transitions occur when either (a) the bond dimension D of the constituent tensors is varied or (b) the tensor network is subject to random breaking of bulk bonds, implemented by forced measurements. In the absence of broken bonds, we find that the RSTN supports a volume-law entangled boundary state with bond dimension D ≥ 3 where D is a prime number, and an area-law entangled boundary state for D = 2. Upon breaking bonds at random in the bulk with probability p, there exists a critical measurement rate p c for each D ≥ 3 above which the boundary state becomes area-law entangled. To explore the conformal invariance at these entanglement transitions for different prime D, we consider tensor networks on a finite rectangular geometry with a variety of boundary conditions, and extract universal operator scaling dimensions via extensive numerical calculations of the entanglement entropy, mutual information, and mutual negativity at their respective critical points. Our results at large D approach known universal data of percolation conformal field theory, while showing clear discrepancies at smaller D, suggesting a distinct entanglement transition universality class for each prime D. We further study universal entanglement properties in the volume-law phase and demonstrate quantitative agreement with the recently proposed description in terms of a directed polymer in a random environment.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Optical information transfer through random unknown diffusers using electronic encoding and diffractive decoding

Free-space optical information transfer through diffusive media is critical in many applications, such as biomedical devices and optical communication, but remains challenging due to random, unknown perturbations in the optical path. We demonstrate an optical diffractive decoder with electronic encoding to accurately transfer the optical information of interest, corresponding to, e.g., any arbitrary input object or message, through unknown random phase diffusers along the optical path. This hybrid electronic-optical model, trained using supervised learning, comprises a convolutional neural network-based electronic encoder and successive passive diffractive layers that are jointly optimized. After their joint training using deep learning, our hybrid model can transfer optical information through unknown phase diffusers, demonstrating generalization to new random diffusers never seen before. The resulting electronic-encoder and optical-decoder model was experimentally validated using a 3D-printed diffractive network that axially spans <70λ, where λ = 0.75 mm is the illumination wavelength in the terahertz spectrum, carrying the desired optical information through random unknown diffusers. The presented framework can be physically scaled to operate at different parts of the electromagnetic spectrum, without retraining its components, and would offer low-power and compact solutions for optical information transfer in free space through unknown random diffusive media.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Quantum Random Number Generator (QRNG)

The Los Alamos Quantum Random Number Generator (QRNG) is a hardware-based, high-performance Random Number Generator capable of generating 200 Mbit/s or more of true random numbers. Like flipping a coin, it is very much random and essential for information security like encrypting data on the internet, checking email, or purchasing something from an online vendor. The device harvests entropy from fluctuations in an optical source that arise from quantum mechanical properties of light. Qrypt, Inc., a company launched in 2017, began making strategic investments and developing partnerships to advance cutting-edge quantum hardware solutions. One of those key investments was licensing QRNG from Los Alamos and subsequently collaborating with advanced quantum materials and technology researcher Dr. Raymond Newell to create high-quality random keys at scale.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Randomized measurement protocols for lattice gauge theories

Randomized measurement protocols, including classical shadows, entanglement tomography, and randomized benchmarking are powerful techniques to estimate observables, perform state tomography, or extract the entanglement properties of quantum states. While unraveling the intricate structure of quantum states is generally difficult and resource-intensive, quantum systems in nature are often tightly constrained by symmetries. Furthermore, this can be leveraged by the symmetry-conscious randomized measurement schemes we propose, yielding clear advantages over symmetry-blind randomization such as reducing measurement costs, enabling symmetry-based error mitigation in experiments, allowing differentiated measurement of (lattice) gauge theory entanglement structure, and, potentially, the verification of topologically ordered states in existing and near-term experiments. Crucially, unlike symmetry-blind randomized measurement protocols, these latter tasks can be performed without relearning symmetries via full reconstruction of the density matrix.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Devices and methods for increasing the speed and efficiency at which a computer is capable of modeling a plurality of random walkers using a density method

A method for increasing a speed or energy efficiency at which a computer is capable of modeling a plurality of random walkers. The method includes defining a virtual space in which a plurality of virtual random walkers will move among different locations in the virtual space, wherein the virtual space comprises a plurality of vertices and wherein the different locations are ones of the plurality of vertices. A corresponding set of neurons in a spiking neural network is assigned to a corresponding vertex such that there is a correspondence between sets of neurons and the plurality of vertices, wherein a spiking neural network comprising a plurality of sets of spiking neurons is established. A virtual random walk of the plurality of virtual random walkers is executed using the spiking neural network, wherein executing includes tracking how many virtual random walkers are at each vertex at a given time increment.

Aimone, James Bradley↗
DOE OSTI2022

Improving the performance of PM6 donor polymer by random ternary copolymerization of BDD and DTBT segments

Developing high-performance wide bandgap polymer donors to match the rapidly growing non-fullerene small molecule acceptors (NF-SMAs) is of great importance to further improve the photovoltaic performances of organic solar cells (OSCs). PM6 and D18 are two leading wide bandgap donor polymers, but their performances are highly sensitive to the molecular weights, which have distinct impact on the morphology and thereby the charge generation and recombination processes. Here, in this work, we reported the random ternary copolymerization of PM6 and D18 segments to develop random terpolymers with finely tuned photoelectronic properties and optimized blend morphology for high-performance OSCs. The resulting random terpolymers (PMD-5, PMD-10, PMD-15 and PMD-20) exhibited finely tuned absorptions, energy levels and blend morphology. The optimal morphology of PMD-15:L8-BO contributed to the fast exciton diffusion and dissociation, efficient charge extraction with suppressed recombination. Thus, the power conversion efficiency was improved from 17.22% of the control PM6 devices and 17.47% of the control D18 devices to 18.12% of PMD-15 based devices, which is the top performance of random terpolymers. Moreover, the PMD-15 exhibited much higher batch-to-batch reproducibility at a broad molecular weight range than that of PM6 and D18, showing promising for practical applications.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Interconnected Nanoporous Polysulfone by the Self-Assembly of Randomly Linked Copolymer Networks and Linear Multiblocks

Porous materials have attracted considerable attention due to their versatile applications, especially in water purification. Interconnected nanoporous structures are distinguished by their high degree of porosity and resistance to clogging, as well as their insensitivity to nanostructural orientation. Previous works on randomly linked copolymer systems have shown that they can effectively produce disordered cocontinuous nanostructures, which upon removal of one component yield interconnected nanoporous materials. However, the cocontinuous nanomaterials previously developed using polystyrene (PS) and poly(d,l-lactic acid) (PLA) strands, and the resulting interconnected nanoporous PS monoliths, were far too brittle to enable practical use as membranes. Here, we study the self-assembly of randomly linked copolymer networks prepared using blocks of the engineering polymer polysulfone (PSU). A wide cocontinuous regime (spanning 40 wt %) was found for randomly end-linked copolymer networks (RECNs) constructed from PSU and PLA strands, via a combination of mechanical testing, gravimetry, small-angle X-ray scattering, and scanning electron microscopy. The PSU/PLA cocontinuous nanomaterial with symmetric composition showed 2.4 times higher Young’s modulus and ~100 times greater toughness than the corresponding PS/PLA sample. The interconnected nanoporous PSU fabricated after etching of PLA even exhibited 1.6 times greater toughness than PS/PLA prior to PLA removal. To facilitate the production of thin films of cocontinuous nanomaterials, we applied solution-processable randomly linked linear PSU/PLA multiblock polymers onto ultrafiltration membranes. Here, the interconnected nanoporous PSU thin film generated by etching PLA was found to effectively reject 50 nm diameter particles without significantly compromising permeability. This discovery presents a valuable addition to the existing techniques used to fabricate PSU membranes. In contrast to traditional methods, which are sensitive to processing conditions, produce a wide range of pore sizes, and offer limited adjustability of pore size, the current technique is anticipated to enable interconnected PSU membranes with more uniform and tailorable porosity.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Modular-Invariant Random Matrix Theory and AdS 3 Wormholes

We develop a nonperturbative definition of RMT 2 : a generalization of random matrix theory that is compatible with the symmetries of two-dimensional conformal field theory. Given any random matrix ensemble, its 𝑛-point spectral correlations admit a prescribed modular-invariant lift to RMT 2 , which moreover reduce to the original random matrix correlators in a near-extremal limit. Central to the prescription is a presentation of random matrix theory in Mellin space, which lifts to two dimensions via the SL⁡(2,ℤ) spectral decomposition employed in previous work. As a demonstration we perform the explicit RMT 2 lift of two-point correlations of the GUE Airy model. We propose that in AdS 3 pure gravity, semiclassical amplitudes for off-shell 𝑛-boundary torus wormholes with topology Σ 0,𝑛 × 𝑆 1 are given by the RMT 2 lift of JT gravity wormhole amplitudes. For the three-boundary case, we identify a gravity calculation which matches the RMT 2 result.

conformal field theory↗
DOE OSTI2024

Stochastic Trust-Region Algorithm in Random Subspaces with Convergence and Expected Complexity Analyses

Here, this work proposes a framework for large-scale stochastic derivative-free optimization (DFO) by introducing STARS, a trust-region method based on iterative minimization in random subspaces. This framework is both an algorithmic and theoretical extension of a random subspace derivative-free optimization (RSDFO) framework, and an algorithm for stochastic optimization with random models (STORM). Moreover, like RSDFO, STARS achieves scalability by minimizing interpolation models that approximate the objective in low-dimensional affine subspaces, thus significantly reducing per-iteration costs in terms of function evaluations and yielding strong performance on largescale stochastic DFO problems. The user-determined dimension of these subspaces, when the latter are defined, for example, by the columns of so-called Johnson-Lindenstrauss transforms, turns out to be independent of the dimension of the problem. For convergence purposes, inspired by the analyses of RSDFO and STORM, both a particular quality of the subspace and the accuracies of random function estimates and models are required to hold with sufficiently high, but fixed, probabilities. Using martingale theory under the latter assumptions, an almost sure global convergence of STARS to a first-order stationary point is shown, and the expected number of iterations required to reach a desired first-order accuracy is proved to be similar to that of STORM and other stochastic DFO algorithms, up to constants.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Machine Learning Inference of Random Medium Properties

Earth materials are heterogeneous across a range of spatial scales, but the resolvability of small structures is limited by sparse data coverage, noise, bandlimitedness, and other difficulties. In practice, heterogeneities below a certain size cannot be recovered from seismic data except through statistical medium descriptions, which even then can be difficult to uniquely determine. To improve the characterization of such heterogeneities, we develop a novel supervised machine learning (ML) model that provides insight about the recoverability of statistical medium properties from elastic waveform data and succeeds despite cycle-skipping and other challenges well known from elastic waveform inversion. We demonstrate the approach using random media generated by superimposing self-affine random variations on homogeneous and layered background structures. After training on sparsely-recorded, high-frequency waveforms from hundreds of different random medium realizations, we show the ability of our ML model to recover correlation lengths and other statistical properties of interest to near-surface and crustal seismology, among other fields. For frequency passbands and spatial offsets encountered in seismology, Gaussian correlation lengths and the amplitude of the random variations relative to the background model are recovered even in challenging scenarios involving unknown medium parameters, complex crustal structures, and low signal-to-noise ratio. In comparison, von Kármán correlation lengths, which are related to larger-wavelength variations of the medium than Gaussian correlation lengths, are not as well recovered. These results provide one of the first and most systematic investigations of the recoverability of statistical properties of heterogeneities below the resolution limit of deterministic seismic tomography, and suggest practical ML strategies for high-frequency waveform seismology.

58 GEOSCIENCES↗
DOE OSTI2023

Development of a High Min-Entropy Quantum Random Number Generator Based on Amplified Spontaneous Emission

We present the theory, architecture, and performance characteristics of a quantum random number generator (QRNG) which operates in a PCI express form factor-compatible plug-and-play design. The QRNG relies on a thermal light source (in this case, amplified spontaneous emission), which exhibits photon bunching according to the Bose–Einstein (BE) statistics. We demonstrate that 98.7% of the unprocessed random bit stream min-entropy is traceable to the BE (quantum) signal. The classical component is then removed using a non-reuse shift-XOR protocol, and the final random numbers are generated at a 200 Mbps rate and shown to pass the statistical randomness test suites FIPS 140-2, Alphabit, SmallCrush, DIEHARD, and Rabbit of the TestU01 library.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗