Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “polynomials”

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

Generalized Quantum Signal Processing

Quantum signal processing (QSP) and quantum singular value transformation (QSVT) currently stand as the most efficient techniques for implementing functions of block-encoded matrices, a central task that lies at the heart of most prominent quantum algorithms. However, current QSP approaches face several challenges, such as the restrictions imposed on the family of achievable polynomials and the difficulty of calculating the required phase angles for specific transformations. In this paper, we present a generalized quantum signal processing (GQSP) approach, employing general SU(2) rotations as our signal-processing operators, rather than relying solely on rotations in a single basis. Our approach lifts all practical restrictions on the family of achievable transformations, with the sole remaining condition being that | P | ≤ 1 , a restriction necessary due to the unitary nature of quantum computation. Furthermore, GQSP provides a straightforward recursive formula for determining the rotation angles needed to construct the polynomials in cases where P and Q are known. In cases where only P is known, we provide an efficient optimization algorithm capable of identifying in under a minute of GPU time, a corresponding Q for polynomials of degree on the order of 10 7 . We further illustrate GQSP simplifies QSP-based strategies for Hamiltonian simulation, offer an optimal solution to the ϵ -approximate fractional query problem that requires O ( ( 1 / δ ) + log ( 1 / ϵ ) ) queries to perform where O ( 1 / δ ) is a proved lower bound, and introduces novel approaches for implementing bosonic operators. Moreover, we propose a novel framework for the implementation of normal matrices, demonstrating its applicability through synthesis of diagonal matrices, as well as the development of a new algorithm for convolution through synthesis of circulant matrices using only O ( d log N + log 2 N ) 1 and 2-qubit gates for a filter of lengths d . Published by the American Physical Society 2024

Motlagh, Danial↗

Heat Transfer in Void Generating Foam Decomposition: Further Development

Continued development of the additive conductivity material model, used to simulate changes in heat transfer that occurs in void generating foam decomposition, has resulted in an improved model and new features. The previous version of the model was calibrated against the Aria Bulk Fluid Element (BFE) solution and proposed a third-order polynomial correction term best captured the increased heat transfer due to voids in the foam. An investigation of the Fuego Conjugate Heat Transfer (CHT) and Aria BFE solutions at several geometries revealed the CHT solution and BFE solution had differing behavior across length scales, especially at smaller scales. Five calibration studies, using the Fuego CHT as the calibration data, were carried out with polynomial functions of 4-th, 3-rd, 2-nd, 1-st and 0-th orders to determine the best correction function that generalized well across length scales. Each polynomial function was calibrated/trained on six different sized geometries and then tested on three uniquely sized geometries. This study revealed that the 1-st order additive conductivity model performed the best. A new feature of void formation scaling was implemented to more realistically capture the heat transfer as voids are created. A scaling term was added to the model to activate the conductivity correction as decomposition progresses.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Power of Quantum Witnesses

A central theme in the study of quantum information is to understand whether quantum resources are more powerful than their classical counterparts. One such resource is quantum witness and understanding the power of quantum witnesses is one of the fundamental questions of quantum complexity theory. The broad object of this project was to understand the power of quantum witnesses and related objects and their properties: In this direction, this project addressed three key broader category of questions: 1) Are quantum witnesses more powerful than the classical witnesses? 2) How easy it is to copy quantum witnesses and what are their complexity theoretic implications? 3) Can quantum witnesses shed light or help provide super-polynomial quantum speedups on problems for which super-polynomial quantum speedups are shown to be not possible in general? The research conducted under this grant has directly addressed the three core pillars of the original proposal: characterizing the computational power of quantum witnesses, understanding their uncloneability, implications for complexity theory and identifying structural regimes for super-polynomial speedups.

97 MATHEMATICS AND COMPUTING↗

Machine Learning-Based Process Control for Injection Molding of Recycled Polypropylene

The increased interest in artificial intelligence in manufacturing has driven the adoption of machine learning to optimize processes and improve efficiency. A key challenge in injection molding is the variability of recycled materials, which affects part quality and processing stability. This study presents a novel closed-loop process control approach for injection molding, leveraging machine learning to adaptively predict processing inputs and quality outcomes. The methodology was tested on five blends of recycled polypropylene (rPP), using artificial neural networks (ANNs), linear regression, and polynomial regression to model the relationships between material properties and process parameters. The dataset was split 80/20 into training and testing sets. The ANN model was implemented using TensorFlow and Keras, with six hidden layers of 32 neurons per layer, ReLU activation, and an Adam optimizer. Empirical tuning and early stopping were used to optimize performance and prevent overfitting. Predictions were evaluated based on mean absolute error (MAE), mean squared error (MSE), and percentage error. The results showed that yield stress, ultimate elongation, and part weight were accurately predicted within a 5% error for linear and polynomial regression models and within a 10% error for the ANN. However, modulus predictions were less reliable, with errors of ~11% for ANN and linear regression and ~40% for polynomial regression, reflecting the inherent variability of this property in rPP blends. Predictions of processing inputs had errors ranging from 3% to 25%, depending on the model and response variable. No single modeling approach was consistently superior across all responses, highlighting the complexity of the relationship between material properties, process parameters, and quality metrics. Overall, the work demonstrates that closed-loop process control, powered by machine learning, can effectively predict key quality parameters in injection molding of recycled materials. The proposed approach can improve process stability and material utilization, facilitating increased adoption of sustainable materials.

Krantz, Joshua↗

Kernel Manifolds: Nonlinear‐Augmentation Dimensionality Reduction Using Reproducing Kernel Hilbert Spaces

This paper generalizes recent advances on quadratic manifold (QM) dimensionality reduction by developing kernel methods-based nonlinear-augmentation dimensionality reduction. QMs, and more generally feature map-based nonlinear corrections, augment linear dimensionality reduction with a nonlinear correction term in the reconstruction map to overcome approximation accuracy limitations of purely linear approaches. While feature map-based approaches typically learn a least squares optimal polynomial correction term, we generalize this approach by learning an optimal nonlinear correction from a user-defined reproducing kernel Hilbert space. Our approach allows one to impose arbitrary nonlinear structure on the correction term, including polynomial structure, and includes feature map and radial basis function-based corrections as special cases. Furthermore, our method has relatively low training cost and has monotonically decreasing error as the latent space dimension increases. In conclusion, we compare our approach to proper orthogonal decomposition and several recent QM approaches on data from several example problems.

kernel methods↗

Trigonometric continuous-variable gates and hybrid quantum simulations of the sine-Gordon model

Hybrid qubit-qumode quantum computing platforms provide a natural setting for simulating interacting bosonic quantum field theories. However, existing continuous-variable gate constructions rely predominantly on polynomial functions of canonical quadratures. In this work, we introduce a complementary universality paradigm based on trigonometric continuous-variable gates, which enable a Fourier-like representation of bosonic operators and are particularly well suited for periodic and non-perturbative interactions. We present an ancilla-based framework for implementing trigonometric gates with arguments given by arbitrary Hermitian functions of qumode quadratures. The protocol yields unitary gates deterministically, and non-unitary gates through probabilistic post-selection. As a concrete application, we develop a hybrid qubit-qumode quantum simulation of the lattice sine-Gordon model. Using these gates, we prepare ground states via quantum imaginary-time evolution, simulate real-time dynamics, compute time-dependent vertex two-point correlation functions, and extract quantum kink profiles under topological boundary conditions. Our results demonstrate that trigonometric continuous-variable gates provide a physically natural framework for simulating interacting field theories on near-term hybrid quantum hardware, while establishing a parallel route to universality beyond polynomial gate constructions. We expect that the trigonometric gates introduced here to find broader applications, including quantum simulations of condensed matter systems, quantum chemistry, and biological models.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

On the Trotter Error in Many-body Quantum Dynamics with Coulomb Potentials

Efficient simulation of many-body quantum systems is central to advances in physics, chemistry, and quantum computing, with a key question being whether the simulation cost scales polynomially with the system size. Here, in this work, we analyze many-body quantum systems with Coulomb interactions, which are fundamental to electronic and molecular systems. We prove that Trotterization for such unbounded Hamiltonians achieves a 1/4-order convergence rate, with explicit polynomial dependence on the number of particles. The result holds for all initial wavefunctions in the domain of the Hamiltonian, and the 1/4-order convergence rate is optimal, as previous work has numerically demonstrated that it can be saturated by a specific initial ground state. The main challenges arise from the many-body structure and the singular nature of the Coulomb potential. Our proof strategy differs from prior state-of-the-art Trotter analyses, addressing both difficulties in a unified framework. Our analysis treats the Coulomb potential as an unbounded operator without modification or regularization, and does not rely on spatial discretization, making it compatible with both first- and second-quantized circuit constructions.

Fang, Di [Duke Univ., Durham, NC (United States)]↗

A Bayesian Framework for Spectral Reprojection

Abstract Fourier partial sum approximations yield exponential accuracy for smooth and periodic functions, but produce the infamous Gibbs phenomenon for non-periodic ones. Spectral reprojection resolves the Gibbs phenomenon by projecting the Fourier partial sum onto a Gibbs complementary basis, often prescribed as the Gegenbauer polynomials. Noise in the Fourier data and the Runge phenomenon both degrade the quality of the Gegenbauer reconstruction solution, however. Motivated by its theoretical convergence properties, this paper proposes a new Bayesian framework for spectral reprojection, which allows a greater understanding of the impact of noise on the reprojection method from a statistical point of view. We are also able to improve the robustness with respect to the Gegenbauer polynomials parameters. Finally, the framework provides a mechanism to quantify the uncertainty of the solution estimate.

Li, Tongtong (ORCID:0000000276644764)↗

Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms

The quantum approximate optimization algorithm (QAOA) has the potential to approximately solve complex combinatorial optimization problems in polynomial time. However, current noisy quantum devices cannot solve large problems due to hardware constraints. In this work, we develop an algorithm that decomposes the QAOA input problem graph into a smaller problem and solves MaxCut using QAOA on the reduced graph. The algorithm requires a subroutine that can be classical or quantum—in this work, we implement the algorithm twice on each graph. One implementation uses the classical solver Gurobi in the subroutine and the other uses QAOA. We solve these reduced problems with QAOA. On average, the reduced problems require only approximately 1/10 of the number of vertices than the original MaxCut instances. Furthermore, the average approximation ratio of the original MaxCut problems is 0.75, while the approximation ratios of the decomposed graphs are on average of 0.96 for both Gurobi and QAOA. With this decomposition, we are able to measure optimal solutions for ten 100-vertex graphs by running single-layer QAOA circuits on the Quantinuum trapped-ion quantum computer H1-1, sampling each circuit only 500 times. This approach is best suited for sparse, particularly k-regular graphs, as k-regular graphs on n vertices can be decomposed into a graph with at most $\frac{nk}{k+1}$ vertices in polynomial time. Further reductions can be obtained with a potential trade-off in computational time. In conclusion, while this paper applies the decomposition method to the MaxCut problem, it can be applied to more general classes of combinatorial optimization problems.

97 MATHEMATICS AND COMPUTING↗

Fantômas unconfined: global QCD fits with Bézier parameterizations

Fantômas is a C++ toolkit for exploring the parametrization dependence of parton distribution functions (PDFs) and other correlator functions in quantum chromodynamics (QCD). Fantômas facilitates the generation of adaptable polynomial parametrizations for PDFs, called metamorphs, to find best-fit PDF solutions and quantify the epistemic uncertainty associated with the parametrizations during their fitting. The method employs Bézier curves as universal approximators for a variety of PDF shapes. Integrated into the xFitter framework for the global QCD analysis, Fantômas provides a foundation for general models of PDFs, while reducing the computational time compared to the approaches utilizing traditional polynomial parametrizations as well as providing an interpretable alternative to neural-network-based models. This paper outlines the structure and practical usage of the Fantômas toolkit, including its inputs, outputs, and implementation within xFitter. It also provides a practical example of using Fantômas for uncertainty quantification as well as the combination of PDF fits into a single ensemble.

Bézier curves↗

Comparative Evaluation of Control-Oriented Heavy Duty Vehicle Air Drag Coefficient Models

Heavy-duty vehicles (HDVs) are a significant source of fuel consumption and greenhouse gas emissions, prompting solutions such as HDV platooning to mitigate these negative impacts through air drag reduction. The intervehicle distance in an HDV platoon needs to be carefully selected, such that the platoon-level energy efficiency and safety considerations can be well balanced. Underlying this problem lies in accurately modeling the relationship between HDV air drag coefficient and intervehicle distance. Through comprehensive evaluation and comparison, we analyze five control-oriented HDV air drag coefficient models, including the polynomial model, rational polynomial model, rational model, semi-quadratic model, and ridge model. Leveraging Scipy Curve-Fit toolbox and our previously compiled air drag coefficient datasets, we optimally identify the parameters inside each model. The calibrated models are then thoroughly evaluated via five complementary metrics. The comparison results reveal that the semi-quadratic model has the highest overall performance, while the widely adopted rational model only exhibits suboptimal performance.

Best, Micah↗

A methodology for decay heat characterization in molten salt reactors

Accurate decay heat prediction in molten salt reactors (MSRs) faces dual challenges: complex operational uncertainties and the need for interpretable models compatible with engineering workflows. This work presents a hybrid machine learning and segmented polynomial methodology that addresses both requirements through three key innovations. First, a modular data architecture encodes MSR-specific operational parameters (power density: 1-100 W cm -3 , humidity: 0-0.1 wt %, air ingress: 0-0.1 mol %) with uncertainty-aware temporal discretization spanning 15 orders of magnitude. Second, region-optimized machine learning models achieve 92.3 % root mean square error (RMSE) reduction over conventional polynomials while maintaining physical interpretability through automated piecewise equation generation. Third, dual front-end interfaces accelerate safety analyses — a Jupyter environment enables researchers to explore 10,000+ parameter combinations via interactive widgets, while a Streamlit web application reduces design iteration cycles through production-grade visualization tools. Operational deployment demonstrates prediction times of only a couple hundred milliseconds for 10 4 years decay profiles, enabling real-time optimization of spent fuel container designs.

42 - ENGINEERING↗

Long-term thermal stability and calibration of Type-II fiber Bragg grating array inscribed in radiation-hardened fibers

This paper investigates the long-term thermal stability of Type-II fiber Bragg grating (FBG) arrays, inscribed by femtosecond laser in radiation-hardened fiber, for potential applications as multiplexed sensors in high-temperature energy systems. The thermal stability of FBG sensors was assessed through 16 thermal cycles from room temperature (RT) to 750 ℃ about two months, involving 100 FBG sensors. The results show that the absolute temperature drift of FBG sensors can be reduced to less than 0.4 pm/day after 54 h thermal annealing process at a constant temperature of 800 ℃. As temperature sensors, the FBGs demonstrated stable performance, achieving a standard deviation (STD) of 1.8 pm (corresponding to a temperature resolution of 0.118 ℃) post-annealing. Repeated thermal cycles revealed a random drift of 2.3 pm in the FBG wavelength at RT. Polynomial fitting was explored as a calibration method to convert FBG wavelength shifts into absolute temperature measurements. By optimizing calibration temperature points (RT, 200 ℃, 400 ℃, and 750 ℃), the study shows that cubic polynomial calibration using four points yields an average R2 of 0.9997 and an RMSE of 3.58 ℃ across the entire temperature range (RT to 750 ℃). This approach represents an 11.53-fold improvement over empirical slope calibration and a 1.34-fold improvement over four-point piecewise fitting. The findings indicate that Type-II FBGs inscribed in radiation-hardened fibers can function as accurate temperature sensors, with performance on par with or exceeding that of thermocouples. With their multiplexing capability, robust signal transmission over long lead cables, and immunity to electromagnetic interference, FBG sensors offer a promising alternative to traditional electronic sensors for energy system monitoring.

Dominguez-Ontiveros, Elvis [ORNL] (ORCID:000000018↗

A Perspective on Quantum Computing Applications in Quantum Chemistry Using 25-100 Logical Qubits

The intersection of quantum computing and quantum chemistry represents a promising frontier for achieving quantum utility in domains of both scientific and societal relevance. Owing to the exponential growth of classical resource requirements for simulating quantum systems, quantum chemistry has long been recognized as a natural candidate for quantum computation. This perspective focuses on identifying scientifically meaningful use cases where early fault-tolerant quantum computers, which are considered to be equipped with approximately 25-100 logical qubits, could deliver tangible impact. While recent advances in classical computing have pushed the boundaries of tractable simulations to unprecedented scales, this logical-qubit regime represents the first window where quantum devices can pursue qualitatively distinct strategies, such as polynomial-scaling phase estimation, direct simulation of quantum dynamics, and active-space embedding, that remain challenging for classical solvers, such as multireference charge-transfer and conical-intersection states central to photochemistry and materials design. We highlight near-term opportunities in algorithm and software design, discuss representative chemical problems suited for quantum acceleration, and propose strategic roadmaps and collaborative pathways for advancing practical quantum utility in quantum chemistry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Jordan–Wigner Transformation for the Description of Strong Correlation in Fermionic Systems

Seniority is a useful way of organizing Hilbert space for strongly correlated systems. The exact zero-seniority wave function, doubly occupied configuration interaction (DOCI), provides accurate results (given the right orbitals) for many strongly correlated electronic systems but has a combinatorial computational cost. In many cases, pair coupled cluster doubles provide a polynomial-cost approximation that closely reproduces the energies of DOCI, but it breaks down in some cases and, as shown herein, it does not provide particularly good density matrices. In this article, we demonstrate that by using the Jordan–Wigner transformation to turn the seniority zero problem back into a Fermionic one, we can provide mean-field variational results of DOCI quality for the Hubbard model and a few small molecular dissociation examples, with polynomial cost, both for the energies and for density matrices, all while being protected from collapse. This success is rooted in the proof we provide, showing that the Hartree–Fock wave function on the Jordan–Wigner-transformed Hamiltonian transforms back to variational coupled cluster doubles in the seniority zero representation, but restricted to have determinant rather than permanent amplitude coefficients, without compromising its overall accuracy.

74 ATOMIC AND MOLECULAR PHYSICS↗

Efficient multimode Wigner tomography

Abstract Advancements in quantum system lifetimes and control have enabled the creation of increasingly complex quantum states, such as those on multiple bosonic cavity modes. When characterizing these states, traditional tomography scales exponentially with the number of modes in both computational and experimental measurement requirement, which becomes prohibitive as the system size increases. Here, we implement a state reconstruction method whose sampling requirement instead scales polynomially with system size, and thus mode number, for states that can be represented within such a polynomial subspace. We demonstrate this improved scaling with Wigner tomography of multimode entangled W states of up to 4 modes on a 3D circuit quantum electrodynamics (cQED) system. This approach performs similarly in efficiency to existing matrix inversion methods for 2 modes, and demonstrates a noticeable improvement for 3 and 4 modes, with even greater theoretical gains at higher mode numbers.

Science & Technology - Other Topics↗

Quantum Zeno Monte Carlo for computing observables

The recent development of logical quantum processors marks a pivotal transition from the noisy intermediate-scale quantum (NISQ) era to the fault-tolerant quantum computing (FTQC) era. These devices have the potential to address classically challenging problems with polynomial computational time using quantum properties. However, they remain susceptible to noise, necessitating noise resilient algorithms. We introduce Quantum Zeno Monte Carlo (QZMC), a classical-quantum hybrid algorithm that demonstrates resilience to device noise and Trotter errors while showing polynomial computational cost for a gapped system. QZMC computes static and dynamic properties without requiring initial state overlap or variational parameters, offering reduced quantum circuit depth.

Han, Mancheon [Korea Institute for Advanced Study ↗

Elucidating the local structure of Li 1+ x Al x Ti 2– x (PO 4 ) 3 and Li 3 Al x Ti 2– x (PO 4 ) 3 ( x = 0, 0.3) via total scattering

Li 1+x Al x Ti 2–x (PO 4 ) 3 (LATP) and Li 3 Al x Ti 2–x (PO 4 ) 3 (x = 0, 0.3) are promising candidates in all-solid-state batteries due to their high room temperature conductivity of 10 –3 S cm –1 and air- and moisture-stability. They also exhibit unusual thermal expansion properties, with Li 1+x Al x Ti 2–x (PO 4 ) 3 showing near-zero thermal expansion along the a axis while Li 3 Al x Ti 2–x (PO 4 ) 3 exhibits polynomial positive thermal expansion along the a axis and polynomial negative thermal expansion along the c axis. A crucial component to understanding these properties is understanding the local structure. Total scattering is a powerful analytical technique as it provides information on the long-range, average structure as well as the local structure. Here, we report the first X-ray and neutron total scattering experiments performed on Li 1+x Al x Ti 2–x (PO 4 ) 3 and Li 3 Al x Ti 2–x (PO 4 ) 3 (x = 0, 0.3). We show that the PO 4 and TiO 6 polyhedra experience very little expansion of the P/Ti–O bonds up to 800 °C, nor is there much expansion when the Li content increases significantly. The minor thermal expansion of the nearest-neighbor bonds of the polyhedra is revealed to be the reason behind the unusual thermal expansion properties, causing the near-zero thermal expansion along a in Li 1+x Al x Ti 2–x (PO 4 ) 3 and moving as whole units in Li 3 Al x Ti 2–x (PO 4 ) 3 . The structural robustness of the framework is also the reason for the increased conductivity as Li content increases, as the framework remains undistorted as Li content increases, permitting Li-ion mobility as the number of charge carriers increases. Finally, this suggests that phosphate-based framework materials beyond LATP would also be a good material space to explore for new Li-ion (and other ion-) conducting materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗