SEARCH · Search NASA

Results for “pseudorandom”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

12 records

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Efficient Unitary Designs from Random Sums and Permutations

A unitary k-design is an ensemble of unitaries that matches the first k moments of the Haar measure. In this work, we provide two efficient constructions of k-designs on n-qubits using new random matrix theory techniques. Our first construction is based on exponentiating sums of random i.i.d. Hermitian matrices and uses O(k2n2)-many gates. In the spirit of central limit theorems, we show that this random sum approximates the Gaussian Unitary Ensemble (GUE). We then show that the product of just two exponentiated GUE matrices is already approximately Haar random. Our second construction is based on products of exponentiated sums of random permutations and uses Õ(k poly (n)) many gates. The k dependence is optimal (up to polylogarithmic factors) and is inherited from the efficiency of existing k-wise independent permutations. Furthermore, replacing random permutations with quantum-secure pseudorandom permutations (PRPs), we also obtain a pseudorandom unitary (PRU) ensemble that is secure under nonadaptive queries. A central feature of both proofs is a new connection between the polynomial method in quantum query complexity and the large-dimension (N) expansion in random matrix theory. In particular, the first construction uses the polynomial method to control high moments of certain random matrix ensembles without requiring delicate Weingarten calculations. In doing so, we define and solve a moment problem on the unit circle, asking whether a finite number of equally weighted points can reproduce a given set of moments. In our second construction, the key step is to exhibit an orthonormal basis for irreducible representations of the partition algebra that has a low-degree large-N expansion. This allows us to show that the distinguishing probability is a low-degree rational polynomial of the dimension N.

algebra↗

DOE OSTI2025

Design of Experiments for Dynamic Test Runs in Solvent-Based CO 2 Capture Pilot Plants

Test runs in the pilot plants consume significant resources, and therefore, the learning from test runs should be maximized. Test runs conducted in the pilot plants are often steady state. It takes several hours for reaching steady-state in the pilot plants, and thus, the duration of the test runs needs to be long even for collecting few steady-state data points. On the other hand, a large number of measurements can be collected through dynamic test runs in a short span of time. This paper presents a systematic design of dynamic experiments (DoDEs) for identifiability of model parameters, which is achieved by persistently exciting the inputs signals. A pseudorandom binary sequence (PRBS) is designed as the input signal for DoDE due to its efficiency in obtaining sufficient spectral content. However, due to the long sequence size of the PRBS signal, a Schroeder-phase input signal, which is a multisine signal, is also designed. Tests for both types of signals are run in the Pilot Solvent Test Unit (PSTU) at the National Carbon Capture Center in Wilsonville, Alabama. The transient data are used to solve dynamic data reconciliation and parameter estimation problem. The estimated parameters are found to be not only superior to those estimated from using data collected from hundreds of steady-state test runs in a nonreactive (air–water) system, but the parameters could be estimated by using the dynamic data collected for about 24 h from the pilot plant for the MEA-H 2 O–CO 2 system.

CO2 capture↗

DOE OSTI2025

Traceable random numbers from a non-local quantum advantage

The unpredictability of random numbers is fundamental to both digital security and applications that fairly distribute resources. However, existing random number generators have limitations—the generation processes cannot be fully traced, audited and certified to be unpredictable. The algorithmic steps used in pseudorandom number generators are auditable, but they cannot guarantee that their outputs were a priori unpredictable given knowledge of the initial seed. Device-independent quantum random number generators can ensure that the source of randomness was unknown beforehand, but the steps used to extract the randomness are vulnerable to tampering. Here we demonstrate a fully traceable random number generation protocol based on device-independent techniques. Our protocol extracts randomness from unpredictable non-local quantum correlations, and uses distributed intertwined hash chains to cryptographically trace and verify the extraction process. This protocol forms the basis for a public traceable and certifiable quantum randomness beacon that we have launched. Over the first 40 days of operation, we completed the protocol 7,434 out of 7,454 attempts—a success rate of 99.7%. Each time the protocol succeeded, the beacon emitted a pulse of 512 bits of traceable randomness. The bits are certified to be uniform with error multiplied by actual success probability bounded by 2−64. Further, the generation of certifiable and traceable randomness represents a public service that operates with an entanglement-derived advantage over comparable classical approaches.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Debiasing Watermarks for Large Language Models via Maximal Coupling

Watermarking language models is essential for distinguishing between human and machine-generated text and thus maintaining the integrity and trustworthiness of digital communication. Here, we present a novel green/red list watermarking approach that partitions the token set into “green” and “red” lists, subtly increasing the generation probability for green tokens. To correct token distribution bias, our method employs maximal coupling, using a uniform coin flip to decide whether to apply bias correction, with the result embedded as a pseudorandom watermark signal. Theoretical analysis confirms this approach’s unbiased nature and robust detection capabilities. Experimental results show that it outperforms prior techniques by preserving text quality while maintaining high detectability, and it demonstrates resilience to targeted modifications aimed at improving text quality. This research provides a promising watermarking solution for language models, balancing effective detection with minimal impact on text quality.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Hardness of Observing Strong-to-Weak Symmetry Breaking

Spontaneous symmetry breaking (SSB) is the cornerstone of our understanding of quantum phases of matter. Recent works have generalized this concept to the domain of mixed states in open quantum systems, where symmetries can be realized in two distinct ways dubbed strong and weak. Novel intrinsically mixed phases of quantum matter can then be defined by the spontaneous breaking of strong symmetry down to weak symmetry. However, proposed order parameters for strong-to-weak SSB (based on mixed-state fidelities or purities) seem to require exponentially many copies of the state, raising the question: Is it possible to efficiently detect strong-to-weak SSB, in general? In this work, we answer this question negatively in the paradigmatic cases of ℤ2 and U(1) symmetries. We construct ensembles of pseudorandom mixed states that do not break the strong symmetry yet are computationally indistinguishable from states that do. This rules out the existence of efficient state-agnostic protocols to detect strong-to-weak SSB.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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 OSTI2025

TRIM: AI Guided Random Number Generation for Resource-Constrained IoT Systems

Random numbers often serve as the backbone for many security solutions in diverse domains such as cryptography, side channel leakage prevention, and moving target defense. However, generating true random numbers requires a physical source of entropy (e.g. hardware, quantum, environmental phenomenon) making it difficult to realize at a large scale and at a low cost. On the flip side, pseudorandom number generators (easy to implement) following a specific distribution (e.g. Gaussian) can be easily compromised given a sufficient amount of traces. In this work, we have developed a machine learning-guided generative approach that can be used to create portable, resource-efficient, and cost-effective random number generators with high throughput and true randomness characteristics. We implement the proposed approach as a highly parameterized framework and perform extensive evaluation for different settings. The framework was able to learn from true random sources such as irrational numbers and environmental audio noise and imitate those sources towards generating new good quality random numbers on demand. We have generated more than 1 billion bits and observed robust performance in terms of true randomness metrics obtained from NIST SP 800-22 and FIPS 140-1 randomness test suites achieving a throughput of up to 142.85 Mbps. Compared to the state-of-the-art (SOTA) technique, the iso-cost setup of our framework can achieve more than 500 Mbps in a distributed setting. We have evaluated the efficacy of running the true randomness imitation AI models on target edge devices such as Raspberry Pi 4 (Model B), Nvidia Jetson Nano, Nvidia Jetson Orin Nano and Nvidia Jetson Xavier. We have also looked at the security of the TRIM framework itself against different adversarial threat models.

Cybersecurity↗

DOE OSTI2026

Secure Wireless Communication Using Distributed Coherent Transmission and Spatial Signal Decomposition

We present a new approach to secure wireless communications using coherent distributed transmission of signals that are spatially decomposed between a two-element distributed antenna array. High-accuracy distributed coordination of microwave wireless systems supports the ability to transmit different parts of a signal from separate transmitters such that they combine coherently at a designated destination. In this article, we explore this concept using a two-element coherent distributed phased array where each of the two transmitters sends a separate component of a communication signal, where each symbol is decomposed into a sum of two pseudorandom signal vectors, the coherent summation of which yields the intended symbol. By directing the transmission to an intended receiver using distributed beamforming, the summation of the two vector components is largely confined to a spatial region at the destination receiver. We implement the technique in a $50−λ$ array operating at 3 GHz. We evaluate the symbol error rate (SER) in 2-D space through simulation and measurement, showing that the approach yields a spatially confined secure region where the information is recoverable (i.e., the received signal has low SER), and outside of which the information is unrecoverable (high SER). The proposed system is also compared against a traditional beamforming system where each node sends the same data. We validate experimentally that our approach achieves a low SER of 0.0082 at broadside and an SER above 0.25 at all other locations compared to a traditional beamforming approach that achieves a SER of 0 at all locations measured.

Engineering - Electronic and electrical engineerin↗

DOE OSTI2025

CAMIS: A Cylindrical Active Mask Imaging System

Detecting and locating radiological and nuclear materials at distances of 10 m or more in urban and cluttered environments continues to pose challenges in nuclear security and proliferation detection. Previous approaches have focused on large-area radiation imaging using planar configurations of detectors and passive masks. However, these approaches suffer from limitations such as limited field-of-view (FOV) and reduced detection efficiency due to absorption in the mask. To address these limitations, we have developed the cylindrical active mask imaging system (CAMIS). This system comprises 128 NaI(Tl) (10 cm)3 detectors. These detectors are arranged in a cylindrical configuration, enabling gamma-ray imaging with a full 360° azimuthal FOV. The active mask elements within the system are arranged in a pseudorandom configuration, providing unique encoding for all incident directions within the FOV. CAMIS offers an effective detection area of approximately 1 m2 across the entire 360° FOV in the horizontal plane, achieving a mean angular resolution of 10.9° in the azimuthal direction and 12.9° in the polar direction measured by taking the full-width at half-maximum (FWHM) of a cross-section at the maximum reconstructed intensity.

Lamb, C↗

DOE OSTI2024

Data Based Shock Test Specification

It is vital that avionic packages used for testing and certifying the reliability and safety of U.S. nuclear weapons with platform aircraft survive exposure to shock environments during transportation and delivery. The objective of this research was to characterize the response to these transportation shock environments delivering accurate shock test specifications in order to set laboratory programming material and device certification rigor. Responses to shock events were analyzed in the frequency domain via the Shock Response Spectrum (SRS). Shocks were then grouped based on respective behavior of maximum response accelerations which were pseudorandomly resampled and compared to test data to form test specifications based on the MinerPalmgren hypothesis. In addition to discovering significant over testing in current shock specifications, a new systematic, data-driven approach to designing shock specifications was formulated.

42 ENGINEERING↗

DOE OSTI2026

Tough Errors are no Match (TEAM): Optimizing the Quantum Compiler for Noise Resilience

This report summarizes our contributions to the Department of Energy’s Tough Errors are no Match (TEAM) project (DE-SC0020377) under Thrust 2: Quantum Programming and Compilation. The central outcomes of this work included a novel efficient quantum compiling algorithm which works without requiring the quantum computer to exactly invert its operations, answering a longstanding open problem in quantum compiling. Additional results include the implementation of zero-noise extrapolation error mitigation in collaboration with the Unitary Fund, as well as novel quantum algorithms for entanglement detection and pseudorandomness.

Bouland, Adam [Stanford Univ., CA (United States)]↗

DOE OSTI2025

Insights on the Influence of the Central-Cut Width of the Box Assembly with Removable Component on Its Dynamical Responses

This investigation focuses on the dynamical effects caused by varying the central-cut width within the Box Assembly with Removable Component (BARC) system. The central-cut widths included in this study are a 0.5″ cut, a 0.25″ cut, a thin 0.1″ cut, and a structure that did not have a cut at all. Finite element analysis was conducted to determine the mode shapes and natural frequencies of each of the BARC structures. Structural dynamics experiments were run to examine the effects of the central-cut width on the dynamical responses and nonlinear characteristics of the BARC system. Free vibration testing with an impact hammer was carried out to excite the system and extract the dominant frequencies and directions of the significant responses. A pseudorandom vibration test that allows for the qualitative determination of any nonlinear behavior within the system was performed. This type of behavior can include nonlinear softening, nonlinear hardening, and the most common, nonlinear damping due to the presence of several bolted-joint connections and the possible activation of geometric and inertia nonlinearities. To quantitatively investigate the impacts of the central-cut width on the dynamics of the system, swept sinusoidal testing was conducted. It is determined that almost all systems with central cuts demonstrate the presence of nonlinear softening, but at times, nonlinear hardening trends are seen, particularly in the 0.1″ cut and no-cut systems when testing harmonically. Each of the central-cut systems displays nonlinear damping, with the amount of damping generally increasing as the central cut decreases in size. The effect of the central cut of the BARC system on the mode-switching ability of the system is negligible; however, mode switching takes place when comparing the central-cut configurations to the no-cut one. These results show the significance of accurately measuring the central-cut width and how geometric uncertainty may change the dynamical responses and nonlinear properties of the system.

Padilla, Christopher (ORCID:000900033446732X)↗