Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

True random number generation using the spin crossover in LaCoO 3

While digital computers rely on software-generated pseudo-random number generators, hardware-based true random number generators (TRNGs), which employ the natural physics of the underlying hardware, provide true stochasticity, and power and area efficiency. Research into TRNGs has extensively relied on the unpredictability in phase transitions, but such phase transitions are difficult to control given their often abrupt and narrow parameter ranges (e.g., occurring in a small temperature window). Here we demonstrate a TRNG based on self-oscillations in LaCoO 3 that is electrically biased within its spin crossover regime. The LaCoO 3 TRNG passes all standard tests of true stochasticity and uses only half the number of components compared to prior TRNGs. Assisted by phase field modeling, we show how spin crossovers are fundamentally better in producing true stochasticity compared to traditional phase transitions. As a validation, by probabilistically solving the NP-hard max-cut problem in a memristor crossbar array using our TRNG as a source of the required stochasticity, we demonstrate solution quality exceeding that using software-generated randomness.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Neuromorphic scaling advantages for energy-efficient random walk computations

Neuromorphic computing, which aims to replicate the computational structure and architecture of the brain in synthetic hardware, has typically focused on artificial intelligence applications. What is less explored is whether such brain-inspired hardware can provide value beyond cognitive tasks. Here we show that the high degree of parallelism and configurability of spiking neuromorphic architectures makes them well suited to implement random walks via discrete-time Markov chains. Overall, these random walks are useful in Monte Carlo methods, which represent a fundamental computational tool for solving a wide range of numerical computing tasks. Using IBM’s TrueNorth and Intel’s Loihi neuromorphic computing platforms, we show that our neuromorphic computing algorithm for generating random walk approximations of diffusion offers advantages in energy-efficient computation compared with conventional approaches. We also show that our neuromorphic computing algorithm can be extended to more sophisticated jump-diffusion processes that are useful in a range of applications, including financial economics, particle physics and machine learning.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Specific features of fluorescence transfer in multiply scattering randomly inhomogeneous layers under intense laser pumping

Based on the analysis of experimental data on the effect of the pulsed laser pump intensity on the spectral properties and the size of the fluorescent response zone in randomly inhomogeneous fluorescent layers, we found that the amplification of spontaneous and stimulated emission significantly affects the statistical properties of the propagation lengths of the fluorescent field partial components in the layers. The experiments are performed with layers of SiO{sub 2} and TiO{sub 2} nanoparticles saturated with rhodamine 6G, pumped by 532-nm laser radiation in the intensity range corresponding to the transient regime from excitation of spontaneous fluorescence to random lasing in the layer. The experimental data are compared with the results of statistical modelling of fluorescence transfer. It is shown that, even at a pump intensity below the random lasing threshold, the spontaneous emission amplification in a layer leads to a significant increase in the contributions to the fluorescence response from partial components with propagation lengths much larger than the layer thickness. This can be interpreted as a manifestation of the quasi-waveguide effect, in which the probability of propagation of diffuse fluorescence components along the layer over distances many times greater than its thickness and the size of the pumped region increases significantly with a decrease in the characteristic radiation amplification length in the layer. (paper)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Architectures and random properties of symplectic quantum circuits

Parametrized and random unitary (or orthogonal) n-qubit circuits play a central role in quantum information. As such, one could naturally assume that circuits implementing symplectic transformations would attract similar attention. However, this is not the case, as $\mathbb{SP}(d/2)$—the group of d × d unitary symplectic matrices—has thus far been overlooked. In this work, we aim at starting to fill this gap. We begin by presenting a universal set of generators $\mathcal{G}$ for the symplectic algebra $\mathfrak{sp}(d/2)$, consisting of one- and two-qubit Pauli operators acting on neighboring sites in a one-dimensional lattice. Here, we uncover two critical differences between such set, and equivalent ones for unitary and orthogonal circuits. Namely, we find that the operators in $\mathcal{G}$ cannot generate arbitrary local symplectic unitaries and that they are not translationally invariant. We then review the Schur–Weyl duality between the symplectic group and the Brauer algebra, and use tools from Weingarten calculus to prove that Pauli measurements at the output of Haar random symplectic circuits can converge to Gaussian processes. As a by-product, such analysis provides us with concentration bounds for Pauli measurements in circuits that form t-designs over $\mathbb{SP}(d/2)$. To finish, we present tensor-network tools to analyze shallow random symplectic circuits, and we use these to numerically show that computational-basis measurements anti-concentrate at logarithmic depth.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Enhancing quantum clocks and sensors with randomization and decoherence

This letter shows how incoherent dynamics can lead to metrological advantages in quantum sensing. The results rely on the fact that incoherent dynamics lead to an additive contribution to the quantum Fisher information about time. Such an additive contribution can reduce the error of optimal estimation protocols, as implied by the quantum Cramér–Rao bound. I characterize regimes in which the estimation of a time interval or a frequency is enhanced by decoherence, thereby identifying cases in which incoherent dynamics serve as a metrological resource. The decoherence processes that yield enhanced precision of quantum sensors can be engineered by randomized Hamiltonian dynamics. I illustrate the results with protocols that display improved sensing of time intervals or global fields by qubit and photonic sensors. Enhanced precision of time intervals is achieved with Hamiltonians that include randomized global parameters. Enhanced precision in field estimation is obtained by randomized sensing times.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Random circuit block-encoded matrix and a proposal of quantum LINPACK benchmark

The LINPACK benchmark reports the performance of a computer for solving a system of linear equations with dense random matrices. Although this task was not designed with a real application directly in mind, the LINPACK benchmark has been used to define the list of TOP500 supercomputers since the debut of the list in 1993. We propose that a similar benchmark, called the quantum LINPACK benchmark, could be used to measure the whole machine performance of quantum computers. The success of the quantum LINPACK benchmark should be viewed as the minimal requirement for a quantum computer to perform a useful task of solving linear algebra problems, such as linear systems of equations. We propose an input model called the Random Circuit Block-Encoded Matrix (RACBEM), which is a proper generalization of a dense random matrix in the quantum setting. The RACBEM model is efficient to be implemented on a quantum computer and can be designed to optimally adapt to any given quantum architecture, with relying on a black-box quantum compiler. Besides solving linear systems, the RACBEM model can be used to perform a variety of linear algebra tasks relevant to many physical applications, such as computing spectral measures, time series generated by a Hamiltonian simulation, and thermal averages of the energy. We implement these linear algebra operations on IBM Q quantum devices as well as quantum virtual machines, and demonstrate their performance in solving scientific computing problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Efficiency and Forward Voltage of Blue and Green Lateral LEDs with V-shaped Defects and Random Alloy Fluctuation in Quantum Wells

For nitride-based blue and green light-emitting diodes (LEDs), the forward voltage V for is larger than expected, especially for green LEDs. This is mainly due to the large barriers to vertical carrier transport caused by the total polarization discontinuity at multiple quantum well and quantum barrier interfaces. The natural random alloy fluctuation in quantum wells has proven to be an important factor reducing V for . However, this does not suffice in the case of green LEDs because of their larger polarization-induced barrier. V-shaped defects (V-defects) have been proposed as another key factor in reducing V for to allow lateral injection into multiple quantum wells, thus bypassing the multiple energy barriers incurred by vertical transport. In this paper, to model carrier transport in the whole LED, we consider both random-alloy and V-defect effects. A fully two-dimensional drift-diffusion charge-control solver is used to model both effects. The results indicate that the turn-on voltages for blue and green LEDs are both affected by random alloy fluctuations and the V-defect density. For green LEDs, V for decreases more due to V-defects, where the smaller polarization barrier at the V-defect sidewall is the major path for lateral carrier injection. Then, we discuss how the V-defect density and size affects the results.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Beyond universal behavior in the one-dimensional chain with random nearest-neighbor hopping

Here, we study the one-dimensional nearest-neighbor tight-binding model of electrons with independently distributed random hopping and no on-site potential (i.e., off-diagonal disorder with particle-hole symmetry, leading to sublattice symmetry, for each realization). For nonsingular distributions of the hopping, it is known that the model exhibits a universal, singular behavior of the density of states $ρ(E) ~ 1/|E\: \text{ln}^3 |E||$ and of the localization length $ξ(E) ~ |\text{ln}|E||$, near the band center $\textit{E}$ = 0 . (This singular behavior is also applicable to random $\textit{XY}$ and Heisenberg spin chains; it was first obtained by Dyson for a specific random harmonic oscillator chain.) Simultaneously, the state at$\textit{E}$ = 0 shows a universal, subexponential decay at large distances $\sim \text{exp}[–\sqrt{r/r_0}]$. In this study, we consider singular, but normalizable, distributions of hopping, whose behavior at small $\textit{t}$ is of the form $\sim 1/[t \text{ln}^{λ+1}(1/t)]$, characterized by a single, continuously tunable parameter λ > 0. We find, using a combination of analytic and numerical methods, that while the universal result applies for λ > 2, it no longer holds in the interval 0 < λ < 2. In particular, we find that the form of the density of states singularity is enhanced (relative to the Dyson result) in a continuous manner depending on the nonuniversal parameter λ; simultaneously, the localization length shows a less divergent form at low energies and ceases to diverge below λ = 1. For λ < 2, the fall-off of the $\textit{E}$ = 0 state at large distances also deviates from the universal result and is of the form $\sim\text{exp}[–(r/r_0)^{1/λ}]$ , which decays faster than an exponential for λ < 1.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Mean-field entanglement transitions in random tree tensor networks

Entanglement phase transitions in quantum chaotic systems subject to projective measurements and in random tensor networks have emerged as a new class of critical points separating phases with different entanglement scaling. We propose a mean-field theory of such transitions by studying the entanglement properties of random tree tensor networks. As a function of bond dimension, we find a phase transition separating area-law from logarithmic scaling of the entanglement entropy. Using a mapping onto a replica statistical mechanics model defined on a Cayley tree and the cavity method, we analyze the scaling properties of such transitions. Our approach provides a tractable, mean-field-like example of an entanglement transition. Furthermore, we verify our predictions numerically by computing directly the entanglement of random tree tensor network states.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Entanglement features of random neural network quantum states

Restricted Boltzmann machines (RBMs) are a class of neural networks that have been successfully employed as a variational ansatz for quantum many-body wave functions. Here, we develop an analytic method to study quantum many-body spin states encoded by random RBMs with independent and identically distributed complex Gaussian weights. By mapping the computation of ensemble-averaged quantities to statistical mechanics models, we are able to investigate the parameter space of the RBM ensemble in the thermodynamic limit. We discover qualitatively distinct wave functions by varying RBM parameters, which correspond to distinct phases in the equivalent statistical mechanics model. Notably, there is a regime in which the typical RBM states have near-maximal entanglement entropy in the thermodynamic limit, similar to that of Haar-random states. However, these states generically exhibit nonergodic behavior in the Ising basis, and do not form quantum state designs, making them distinguishable from Haar-random states.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Characterizing random-singlet state in two-dimensional frustrated quantum magnets and implications for the double perovskite Sr 2 CuTe 1 – x W x O 6

Motivated by the experimental observation of a nonmagnetic phase in compounds with frustration and disorder, we study the ground state of a spin-1/2 square-lattice Heisenberg model with randomly distributed nearest-neighbor J 1 and next-nearest-neighbor J 2 couplings. By using the density matrix renormalization group (DMRG) calculation on a cylinder system with a circumference of up to ten lattice sites, we identify a disordered phase between the Néel and stripe magnetic phase with growing J 2 /J 1 in the presence of strong bond randomness. The vanished spin-freezing parameter indicates the absence of spin-glass order. The large-scale DMRG results unveil the size-scaling behaviors of the spin-freezing parameter, the power-law decay of the average spin correlation, and the exponential decay of the typical spin correlation, which all agree with the corresponding behavior in the one-dimensional random-singlet (RS) state and characterize the RS nature of this disordered phase. The DMRG simulation also provides insights and opportunities for characterizing a class of nonmagnetic states in two-dimensional frustrated magnets with disorder. Here, we also compare with existing experiments and suggest more measurements for understanding the spin-liquid-like behaviors in the double perovskite Sr 2 CuTe 1–x W x O 6 .

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Universal Spreading of Conditional Mutual Information in Noisy Random Circuits

For this work, we study the evolution of conditional mutual information (CMI) in generic open quantum systems, focusing on one-dimensional random circuits with interspersed local noise. Unlike in noiseless circuits, where CMI spreads linearly while being bounded by the light cone, we find that noisy random circuits with an error rate 𝑝 exhibit superlinear propagation of CMI, which diverges far beyond the light cone at a critical circuit depth 𝑡 𝑐 ∝ 𝑝 −1 . We demonstrate that the underlying mechanism for such rapid spreading is the combined effect of local noise and a scrambling unitary, which selectively removes short-range correlations while preserving long-range correlations. To analytically capture the dynamics of CMI in noisy random circuits, we introduce a coarse-graining method, and we validate our theoretical results through numerical simulations. Furthermore, we identify a universal scaling law governing the spreading of CMI.

decoherence↗
DOE OSTI2024

Understanding random-walk dynamical phase coexistence through waiting times

We study the appearance of first-order dynamical phase transitions (DPTs) as “intermittent” coexisting phases in the fluctuations of random walks on graphs. We show that the diverging timescale leading to critical behavior is the waiting time to jump from one phase to another. This timescale is crucial for observing the system's relaxation to stationarity and demonstrate ergodicity of the system at criticality. We illustrate these results through three analytical examples which provide insights into random walks exploring random graphs. Published by the American Physical Society 2024

Stuhrmann, David C. (ORCID:0009000726916649)↗
DOE OSTI2024

Random coordinate descent: A simple alternative for optimizing parameterized quantum circuits

Variational quantum algorithms rely on the optimization of parameterized quantum circuits in noisy settings. The commonly used back-propagation procedure in classical machine learning is not directly applicable in this setting due to the collapse of quantum states after measurements. Thus, gradient estimations constitute a significant overhead in a gradient-based optimization of such quantum circuits. This paper introduces a random coordinate descent algorithm as a practical and easy-to-implement alternative to the full gradient descent algorithm. This algorithm only requires one partial derivative at each iteration. Motivated by the behavior of measurement noise in the practical optimization of parameterized quantum circuits, this paper presents an optimization problem setting that is amenable to analysis. Under this setting, the random coordinate descent algorithm exhibits the same level of stochastic stability as the full gradient approach, making it as resilient to noise. The complexity of the random coordinate descent method is generally no worse than that of the gradient descent and can be much better for various quantum optimization problems with anisotropic Lipschitz constants. Theoretical analysis and extensive numerical experiments validate our findings. Published by the American Physical Society 2024

Ding, Zhiyan (ORCID:000000018863403X)↗
DOE OSTI2024

Effect of Nonunital Noise on Random-Circuit Sampling

In this work, drawing inspiration from the type of noise present in real hardware, we study the output distribution of random quantum circuits under practical nonunital noise sources with constant noise rates. We show that even in the presence of unital sources such as the depolarizing channel, the distribution, under the combined noise channel, never resembles a maximally entropic distribution at any depth. To show this, we prove that the output distribution of such circuits never anticoncentrates—meaning that it is never too “flat”—regardless of the depth of the circuit. This is in stark contrast to the behavior of noiseless random quantum circuits or those with only unital noise, both of which anticoncentrate at sufficiently large depths. As a consequence, our results shows that the complexity of random-circuit sampling under realistic noise is still an open question, since anticoncentration is a critical property exploited by both state-of-the-art classical hardness and easiness results. Published by the American Physical Society 2024

Physics↗
DOE OSTI2024

Designs from Local Random Quantum Circuits with SU ( d ) Symmetry

The generation of k -designs (pseudorandom distributions that emulate the Haar measure up to k moments) with local quantum circuit ensembles is a problem of fundamental importance in quantum information and physics. Despite the extensive understanding of this problem for ordinary random circuits, the crucial situations in which symmetries or conservation laws are in play are known to pose fundamental challenges and remain little understood. Here, we construct explicit local unitary ensembles that can achieve high-order unitary k -designs under transversal continuous symmetry, in the particularly important SU ( d ) case. Specifically, we define the convolutional quantum alternating (CQA) group generated by 4-local SU ( d ) -symmetric Hamiltonians as well as associated 4-local SU ( d ) -symmetric random unitary circuit ensembles and prove that they form and converge to SU ( d ) -symmetric k -designs, respectively, for all k < n ( n − 3 ) / 2 , with n being the number of qudits. A key technique that we employ to obtain the results is the Okounkov-Vershik approach to S n representation theory. To study the convergence time of the CQA ensemble, we develop a numerical method using the Young orthogonal form and the S n branching rule. We provide strong evidence for a subconstant spectral gap and certain convergence time scales of various important circuit architectures, which contrast with the symmetry-free case. We also provide comprehensive explanations of the difficulties and limitations in rigorously analyzing the convergence time using methods that have been effective for cases without symmetries, including Knabe’s local gap threshold and Nachtergaele’s martingale methods. This suggests that a novel approach is likely necessary for understanding the convergence time of SU ( d ) -symmetric local random circuits. Published by the American Physical Society 2024

Li, Zimu (ORCID:0000000314736492)↗
DOE OSTI2021

Fabrication of Quasi-Random Photonic Crystals for Ultrathin Solar Cells

Quasi-random structures for light management present an intermediate ordering between a completely random rough surface and a perfect ordered photonic crystal. They are attractive for broadband applications due to their power spectral density. This makes them excellent candidates for photovoltaic applications. Here we present preliminary fabrication results creating quasi-random structures using a self-assembly approach based on polymer blends and wet etching. We are able to create patterns with average lattice constant of five to two microns. This structure is proposed to be used as a rear patterning layer for ultrathin GaAs cells for better sustainability and radiation- hard devices.

41 EE - Solar Energy Technologies Office (EE-4S)↗
DOE OSTI2021

River sinuosity describes a continuum between randomness and ordered growth

River channels are among the most common landscape features on Earth. An essential characteristic of channels is sinuosity: their tendency to take a circuitous path, which is quantified as along-stream length divided by straight-line length. River sinuosity is interpreted as a characteristic that either forms randomly at channel inception or develops over time as meander bends migrate. Studies tend to assume the latter and thus have used river sinuosity as a proxy for both modern and ancient environmental factors including climate, tectonics, vegetation, and geologic structure. But no quantitative criterion for planform expression has distinguished between random, initial sinuosity and that developed by ordered growth through channel migration. This ambiguity calls into question the utility of river sinuosity for understanding Earth’s history. We propose a quantitative framework to reconcile these competing explanations for river sinuosity. Using a coupled analysis of modeled and natural channels, we show that while a majority of observed sinuosity is consistent with randomness and limited channel migration, rivers with sinuosity ≥1.5 likely formed their geometry through sustained, ordered growth due to channel migration. This criterion frames a null hypothesis for river sinuosity that can be applied to evaluate the significance of environmental interpretations in landscapes shaped by rivers. The quantitative link between sinuosity and channel migration further informs strategies for preservation and restoration of riparian habitat and guides predictions of fluvial deposits in the rock record and in remotely sensed environments from the seafloor to planetary surfaces.

58 GEOSCIENCES↗