Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “noisy optimization”

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 73 records · Page 4

Improving stability margins in discrete-time LQG controllers

Some of the problems are discussed which are encountered in the design of discrete-time stochastic controllers for problems that may adequately be described by the Linear Quadratic Gaussian (LQG) assumptions; namely, the problems of obtaining acceptable relative stability, robustness, and disturbance rejection properties. A dynamic compensator is proposed to replace the optimal full state feedback regulator gains at steady state, provided that all states are measurable. The compensator increases the stability margins at the plant input, which may possibly be inadequate in practical applications. Though the optimal regulator has desirable properties the observer based controller as implemented with a Kalman filter, in a noisy environment, has inadequate stability margins. The proposed compensator is designed to match the return difference matrix at the plant input to that of the optimal regulator while maintaining the optimality of the state estimates as directed by the measurement noise characteristics.

Oranc, B. Tarik↗

State Dependent Optimization with Quantum Circuit Cutting

Quantum circuits can be reduced through optimization to better fit the constraints of quantum hardware. One such method, initial-state dependent optimization (ISDO), reduces gate count by leveraging knowledge of the input quantum states. Surprisingly, we found that ISDO is broadly applicable to the downstream circuits produced by circuit cutting. Circuit cutting also requires measuring upstream qubits and has some flexibility of selection observables to do reconstruction. Therefore, we propose a state-dependent optimization (SDO) framework that incorporates ISDO, our newly proposed measure-state dependent optimization (MSDO), and a biased observable selection strategy. Building on the strengths of the SDO framework and recognizing the scalability challenges of circuit cutting, we propose nonseparate circuit cutting-a more flexible approach that enables optimizing gates without fully separating them. We validate our methods on noisy simulations of QAOA, QFT, and BV circuits. Results show that our approach consistently mitigates noise and improves overall circuit performance, demonstrating its promise for enhancing quantum algorithm execution on near-term hardware.

Li, Xinpeng↗

Algorithm for Training a Recurrent Multilayer Perceptron

An improved algorithm has been devised for training a recurrent multilayer perceptron (RMLP) for optimal performance in predicting the behavior of a complex, dynamic, and noisy system multiple time steps into the future. [An RMLP is a computational neural network with self-feedback and cross-talk (both delayed by one time step) among neurons in hidden layers]. Like other neural-network-training algorithms, this algorithm adjusts network biases and synaptic-connection weights according to a gradient-descent rule. The distinguishing feature of this algorithm is a combination of global feedback (the use of predictions as well as the current output value in computing the gradient at each time step) and recursiveness. The recursive aspect of the algorithm lies in the inclusion of the gradient of predictions at each time step with respect to the predictions at the preceding time step; this recursion enables the RMLP to learn the dynamics. It has been conjectured that carrying the recursion to even earlier time steps would enable the RMLP to represent a noisier, more complex system.

Parlos, Alexander G.↗

Enabling a Voice Management System for Space Applications, Design and Software Development

Sustainable missions, beyond low Earth orbit, will require autonomous capabilities in order to achieve NASA’s Artemis program objectives. Correspondingly, the crew must have a means to efficiently interact with these autonomous systems; this can be facilitated via voice and speech communications. Voice-based controls enable the user to access autonomous systems hands-free/eyes-free, allowing the user to better focus on critical tasks. The goal of this project was to explore the knowledge and technology needed to successfully design effective voice interfaces for autonomous systems. The main objective was to understand how a crew member, through voice interaction, could most efficiently and intuitively communicate with a notional autonomous vehicle system manager. This project leveraged prior research conducted by the University of Michigan’s Bioastronautics and Life Support System (BLiSS) team as part of a NASA Moon to Mars eXploration Systems and Habitation (M2M X-Hab) 2020 Academic Innovation Challenge. The X-Hab 2020 work from the BliSS Team resulted in an intuitive graphical user interface/user experience that was built on an Internet of Things (IOT) platform. The Voice User Interface (VUI) design for the M2M X-Hab 2021 project leveraged this technology and incorporated a voice-based assistant and NASA’s Platform for Autonomous Systems (NPAS) software. This required technologies to convert voice to text, conduct semantic interpretations, and convert responses from the autonomous system to text and to speech; additionally, the background noise environment of spacecraft was assessed, and a relatable personality for the autonomous system to facilitate human-like conversations was created. This work’s success was largely due to the diverse team that included expertise in Space Systems Engineering, Human Computer Interaction, Aerospace Engineering, Computer Science, Biomedical Engineering, and Applied Physics. The differing perspectives fostered elaborate discussions, resulting in the conception of three main interactions: (1) User-System, (2) NPAS-System, and (3) Environment-System. The system developed, i.e. the VUI, had to be unique, efficient, and intuitive; thus, the team crafted a personality for the system to enable human-like conversation. User surveys sent to students and young professionals were used to help determine these personality traits by capturing perspectives and expectations of the “Artemis Generation Astronauts”. To further simulate human-like conversations, the system had to be able to quickly interpret user speech and be able to integrate with NASA’s NPAS system for quick and reliable information transfer. Results of this research include (1) a working prototype user interface, that is compatible with NASA’s NPAS system; (2) software that demonstrates the ability to interpret user requests and respond appropriately; (3) the capability to implement fully expanded conversations between user and system using intuitive communication in four request categories; and (4) software and hardware recommendations that optimize the system’s ability to operate, i.e. be heard, in a noisy environment. The technologies chosen for this project’s demonstrations included the following: Raspberry Pi, RASA, Mozilla Deep Speech, Coqui, RTX Voice and Adobe XD. This work has laid the foundation for the development of VUI’s used for autonomy, and is intended to provide guidance for future VUI development.

Tara Vega↗

Minimum Climb to Cruise Noise Trajectories Modeled for the High Speed Civil Transport

The proposed U.S. High Speed Civil Transport (HSCT) will revolutionize commercial air travel by providing economical supersonic passenger service to destinations worldwide. Unlike the high-bypass turbofan engines that propel today's subsonic airliners, HSCT engines will have much higher jet exhaust speeds. Jet noise, caused by the turbulent mixing of high-speed exhaust with the surrounding air, poses a significant challenge for HSCT engine designers. To resolve this challenge, engineers have designed advanced mixer rejector nozzles that reduce HSCT jet noise to airport noise certification levels by entraining and mixing large quantities of ambient air with the engines' jet streams. Although this works well during the first several minutes of flight, far away from the airport, as the HSCT gains speed and climbs, poor ejector inlet recovery and ejector ram drag contribute to poor thrust, making it advantageous to turn off the ejector. Doing so prematurely, however, can cause unacceptable noise levels to propagate to the ground, even when the aircraft is many miles from the airport. This situation lends itself ideally to optimization, where the aircraft trajectory, throttle setting, and ejector setting can be varied (subject to practical aircraft constraints) to minimize the noise propagated to the ground. A method was developed at the NASA Lewis Research Center that employs a variation of the classic energy state approximation: a trajectory analysis technique historically used to minimize climb time or fuel burned in many aircraft problems. To minimize the noise on the ground at any given throttle setting, high aircraft altitudes are desirable; but the HSCT may either climb quickly to high altitudes using a high, noisy throttle setting or climb more slowly at a lower, quieter throttle setting. An optimizer has been programmed into NASA's existing aircraft and noise analysis codes to balance these options by dynamically choosing the best altitude-velocity path and throttle setting history. The noise level standard, or metric, used in the optimizer should be one that accurately reflects the subjective annoyance levels of ground-based observers under the flight path. A variety of noise metrics are available, many of which are practical for airport-vicinity noise certification. Unlike airport noise, however, the HSCT's climb noise will be characterized by relatively low noise levels, long durations, and low-frequency spectra. The noise metrics used in these calculations are based on the recommendations of researchers at the NASA Langley Research Center, who have correlated the flyover noise annoyance levels of actual laboratory subjects with a variety of measurements. Analysis of data from this optimizer has shown that significant reductions in noise may be obtained with trajectory optimization. And since throttling operations are performed in the subsonic portion of the climb path (where thrust is plentiful), only small penalties in HSCT range or fuel performance occur.

Berton, Jeffrey J.↗

Optimality of Gradient-MUSIC for Spectral Estimation

We introduce the Gradient-MUSIC algorithm for estimating the unknown frequencies and amplitudes of a nonharmonic signal from noisy time samples. While the classical MUSIC algorithm performs a computationally expensive search over a fine grid, Gradient-MUSIC is significantly more efficient and eliminates the need for discretization over a fine grid by using optimization techniques. It coarsely scans the 1D landscape to find initialization simultaneously for all frequencies followed by parallelizable local refinement via gradient descent. We also analyze its performance when the noise level is sufficiently small and the signal frequencies are separated by at least 8π/m, where π/m is the standard resolution of this problem. Even though the 1D landscape is nonconvex, we prove a global convergence result for Gradient-MUSIC: coarse scanning provably finds suitable initialization and gradient descent converges at a linear rate. In addition to convergence results, we also upper bound the error between the true signal frequencies and amplitudes with those found by Gradient-MUSIC. For example, if the noise has $\ell^\infty$ norm at most ϵ, then the frequencies and amplitudes are recovered up to error at most Cϵ/m and Cϵ respectively, which are minimax optimal in m and ϵ. Our theory can also handle stochastic noise with performance guarantees under nonstationary independent Gaussian noise. Our main approach is a comprehensive geometric analysis of the landscape, a perspective that has not been explored before.

97 MATHEMATICS AND COMPUTING↗

Combined optimization of image-gathering optics and image-processing algorithm for edge detection

This paper investigates the relationships between the image-gathering and image-processing systems for minimum mean-squared error estimation of scene characteristics. A stochastic optimization problem is formulated in which the objective is to determine a spatial characteristic of the scene rather than a feature of the already blurred, sampled, and noisy image data. The Wiener filter for the sampled image case is obtained as a special case, where the desired characteristics is scene restoration. Optimal edge detection is investigated. It is shown that the optimal edge detector compensates for the blurring introduced by the image-gathering optics, and, notably, that it is not circularly symmetric. The lack of circular symmetry is largely due to the geometric effects of the sampling lattice used in image acquisition.

Halyo, N.↗

Constant Overhead Entanglement Distillation via Scrambling

High-fidelity quantum entanglement enables key quantum networking capabilities such as secure communication and distributed quantum computing, but long-distance entanglement distribution is limited by noise and loss. Entanglement distillation protocols address this problem by extracting high-fidelity Bell pairs from multiple noisy ones. The primary objective is minimizing the resource overhead: the number of noisy input pairs needed to distill each high-fidelity output pair. While protocols achieving optimal overhead are known in theory, they often require complex decoding operations that make practical implementation challenging. We circumvent this challenge by introducing protocols that use quantum scrambling—the spreading of quantum information under chaotic dynamics—through random Clifford operations. Based on this scrambling mechanism, our protocol maintains asymptotically constant overhead, independent of the desired output error rate $\bar{𝜖}$ , and can be implemented with shallow quantum circuits of depth 𝑂⁡(poly log log⁡ $\bar{𝜖}$ −1 ) and memory 𝑂⁡(poly log⁡ $\bar{𝜖}$ −1 ). Our protocol remains effective even with noisy quantum gates. By incorporating error correction, our protocol achieves state-of-the-art performance: starting with pairs of 10% initial infidelity, we require only seven noisy inputs per output pair to distill a single Bell pair with infidelity $\bar{𝜖}$ =10 −12 , substantially outperforming existing schemes. We demonstrate the utility of our protocols for quantum repeater networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Targeted Adaptive Design

Modern advanced manufacturing and advanced materials design often require searches of relatively high-dimensional process control parameter spaces for settings that result in optimal structure, property, and performance parameters. The mapping from the former to the latter must be determined from noisy experiments or from expensive simulations. Here, we abstract this problem to a mathematical framework in which an unknown function from a control space to a design space must be ascertained by means of expensive noisy measurements, which locate control settings generating desired design features within specified tolerances, with quantified uncertainty. We describe targeted adaptive design (TAD), a new algorithm that performs this sampling task efficiently. TAD creates a Gaussian process surrogate model of the unknown mapping at each iterative stage, proposing a new batch of control settings to sample experimentally and optimizing the updated expected log-predictive probability density of the target design. TAD either stops upon locating a solution with uncertainties that fit inside the tolerance box or uses a measure of expected future information to determine that the search space has been exhausted with no solution. TAD thus embodies the exploration-exploitation tension in a manner that recalls, but is essentially different from, Bayesian optimization and optimal experimental design.

97 MATHEMATICS AND COMPUTING↗

Intermediate-temperature topological Uhlmann phase on IBM quantum computers

A spin-1 system can exhibit an intermediate-temperature topological regime with a quantized Uhlmann phase sandwiched by topologically trivial low- and high-temperature regimes. We present a quantum circuit consisting of system and ancilla qubits plus a probe qubit which prepares an initial state corresponding to the purified state of a spin-1 system at finite temperature, evolves the system according to the Uhlmann process, and measures the Uhlmann phase via expectation values of the probe qubit. Although classical simulations suggest the quantized Uhlmann phase is observable on International Business Machines (IBM’s) noisy intermediate-scale quantum (NISQ) computers, an implementation of the circuit without any optimization exceeds the gate count for the error budget and results in unresolved signals. Through a series of optimization with Qiskit and BQSKit, the gate count can be substantially reduced, making the jumps of the Uhlmann phase more visible. A recent hardware upgrade of IBM quantum computers further improves the signals and leads to a clearer demonstration of interesting finite-temperature topological phenomena on NISQ hardware.

Mastandrea, Christopher [Univ. of California, Merc↗

Spatio-Temporal Video Segmentation with Shape Growth or Shrinkage Constraint

We propose a new method for joint segmentation of monotonously growing or shrinking shapes in a time sequence of noisy images. The task of segmenting the image time series is expressed as an optimization problem using the spatio-temporal graph of pixels, in which we are able to impose the constraint of shape growth or of shrinkage by introducing monodirectional infinite links connecting pixels at the same spatial locations in successive image frames. The globally optimal solution is computed with a graph cut. The performance of the proposed method is validated on three applications: segmentation of melting sea ice floes and of growing burned areas from time series of 2D satellite images, and segmentation of a growing brain tumor from sequences of 3D medical scans. In the latter application, we impose an additional intersequences inclusion constraint by adding directed infinite links between pixels of dependent image structures.

Segmentation↗

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

This project builds toward a comprehensive error-mitigating toolkit that makes quantum programming more robust and adaptive to the noisy, resource-limited nature of today’s quantum hardware. To that end, it integrates established error-mitigation methods — such as zero-noise extrapolation and dynamical decoupling — directly into compiler infrastructures. These techniques will be packaged as modules that can automatically adjust and combine based on performance analysis, enabling compilers to explore large design spaces and produce optimized, low-noise quantum programs with minimal manual intervention. In parallel, this project also explores new approaches to analog quantum programming or quantum simulation, and has developed the programming language SimuQ which treats quantum Hamiltonian evolution as the central object.

97 MATHEMATICS AND COMPUTING↗

Hamiltonian switching control of noisy bipartite qubit systems

Abstract We develop a Hamiltonian switching ansatz for bipartite control that is inspired by the quantum approximate optimization algorithm, to mitigate environmental noise on qubits. We demonstrate the control for a central spin coupled to bath spins via isotropic Heisenberg interactions, and then make physical applications to the protection of quantum gates performed on superconducting transmon qubits coupling to environmental two-level-systems (TLSs) through dipole-dipole interactions, as well as on such qubits coupled to both TLSs and a Lindblad bath. The control field is classical and acts only on the system qubits. We use reinforcement learning with policy gradient to optimize the Hamiltonian switching control protocols, using a fidelity objective for specific target quantum gates. We use this approach to demonstrate effective suppression of both coherent and dissipative noise, with numerical studies achieving target gate implementations with fidelities over 0.9999 (four nines) in the majority of our test cases and showing improvement beyond this to values of 0.999 999 999 (nine nines) upon a subsequent optimization by GRadient Ascent Pulse Engineering (GRAPE). We analyze how the control depth, total evolution time, number of environmental TLS, and choice of optimization method affect the fidelity achieved by the optimal protocols and reveal some critical behaviors of bipartite control of quantum gates.

Physics↗

Surrogate-driven design optimization with uncertainty constraints in Monte Carlo simulations

In multi-objective design tasks, the computational cost increases rapidly when high-fidelity simulations are used to evaluate objective functions. Surrogate models help mitigate this cost by approximating the simulation output, simplifying the design process. However, under high uncertainty, surrogate models trained on noisy data can produce inaccurate predictions, as their performance depends heavily on the quality of training data. This study investigates the impact of data uncertainty on two multi-objective design problems modelled using Monte Carlo transport simulations: a neutron moderator and an ion-to-neutron converter. For each, a grid search was performed using five different tally uncertainty levels to generate training data for neural network surrogate models. These models were then optimized using NSGA-III. The recovered Pareto-fronts were analyzed across uncertainty levels: in the moderator problem, normalized hypervolume dropped from 0.886 at 1.0% uncertainty to 0.748 at 10% uncertainty, while in the converter problem it remained near 0.50 for all cases. Average simulation times were also compared to evaluate the trade-off between accuracy and computational cost. Results show that the influence of simulation uncertainty is strongly problem-dependent. In the neutron moderator case, higher uncertainties led to exaggerated objective sensitivities and distorted Pareto-fronts, reducing normalized hypervolume. In contrast, the ion-to-neutron converter task was less affected—low-fidelity simulations produced results similar to those from high-fidelity data. These findings suggest that a fixed-fidelity approach is not optimal. Surrogate models can recover the Pareto-front under noisy conditions, and multi-fidelity studies help identify suitable uncertainty levels for each problem to balance efficiency and accuracy.

07 ISOTOPE AND RADIATION SOURCES↗

Efficient learning of accurate surrogates for simulations of complex systems

Machine learning methods are increasingly deployed to construct surrogate models for complex physical systems at a reduced computational cost. However, the predictive capability of these surrogates degrades in the presence of noisy, sparse or dynamic data. Here, we introduce an online learning method empowered by optimizer-driven sampling that has two advantages over current approaches: it ensures that all local extrema (including endpoints) of the model response surface are included in the training data, and it employs a continuous validation and update process in which surrogates undergo retraining when their performance falls below a validity threshold. We find, using benchmark functions, that optimizer-directed sampling generally outperforms traditional sampling methods in terms of accuracy around local extrema even when the scoring metric is biased towards assessing overall accuracy. Finally, the application to dense nuclear matter demonstrates that highly accurate surrogates for a nuclear equation-of-state model can be reliably autogenerated from expensive calculations using few model evaluations.

79 ASTRONOMY AND ASTROPHYSICS↗

Performance and Achievable Rates of the Gottesman-Kitaev-Preskill Code for Pure-Loss and Amplification Channels

Quantum error-correction codes protect information from realistic noisy channels and lie at the heart of quantum computation and communication tasks. Understanding the optimal performance and other information-theoretic properties, such as the achievable rates, of a given code is crucial, as these factors determine the fundamental limits imposed by the encoding in conjunction with the noise channel. Here, we use the transpose channel to analytically obtain the near-optimal performance of any Gottesman-Kitaev-Preskill (GKP) code under pure loss and pure amplification. We present rigorous connections between GKP code’s near-optimal performance and its dual lattice geometry and average input energy. With no energy constraint, we show that when |𝜏/(1−𝜏)| is an integer, specific families of GKP codes simultaneously achieve the loss and amplification capacity. 𝜏 is the transmissivity (gain) for loss (amplification). Our results establish GKP code as the first structured bosonic code family that achieves the capacity of loss and amplification.

Zheng, Guo [Univ. of Chicago, IL (United States)] ↗

Correlated purification for restoring 𝑁-representability in quantum simulation

Experimentally measured reduced density matrices (RDMs) often violate constraints that ensure they represent N-electron states—known as N-representability conditions—because of statistical and hardware noise. In this work, we present a correlated purification framework based on semidefinite programming to restore the accuracy of a noisy, unphysical two-electron RDM (2-RDM). The method performs a bi-objective optimization that minimizes both the many-electron energy and the nuclear norm of the correction to the measured 2-RDM. The nuclear norm, often employed in matrix completion, promotes low-rank corrections, while the energy term acts as a regularization term that can improve the purity of the ground state. While the method is particularly effective for ground states, it can also be applied to excited and nonstationary states by decreasing the weight of the energy relative to the error norm. In an application to fermionic shadow tomography of large hydrogen chains, correlated purification yields substantial reductions in both energy and 2-RDM error, achieving chemical accuracy across dissociation curves. This framework provides a robust strategy for tomography in many-body quantum simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗