SEARCH · Engineering Papers

Results for “noisy data”

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.

At least 379 records · Page 21

All sources NASA NTRS DOE OSTI

DOE OSTI2020

Bayesian differential programming for robust systems identification under uncertainty

This paper presents a machine learning framework for Bayesian systems identification from noisy, sparse and irregular observations of nonlinear dynamical systems. The proposed method takes advantage of recent developments in differentiable programming to propagate gradient information through ordinary differential equation solvers and perform Bayesian inference with respect to unknown model parameters using Hamiltonian Monte Carlo sampling. This allows an efficient inference of the posterior distributions over plausible models with quantified uncertainty, while the use of sparsity-promoting priors enables the discovery of interpretable and parsimonious representations for the underlying latent dynamics. A series of numerical studies is presented to demonstrate the effectiveness of the proposed methods, including nonlinear oscillators, predator–prey systems and examples from systems biology. Taken together, our findings put forth a flexible and robust workflow for data-driven model discovery under uncertainty. All codes and data accompanying this article are available at https://bit.ly/34FOJMj .

Science & Technology - Other Topics↗

DOE OSTI2021

Robust implementation of generative modeling with parametrized quantum circuits

Although the performance of hybrid quantum-classical algorithms is highly dependent on the selection of the classical optimizer and the circuit ansätze, a robust and thorough assessment on-hardware of such features has been missing to date. From the optimizer perspective, the primary challenge lies in the solver’s stochastic nature, and their significant variance over the random initialization. Therefore, a robust comparison requires one to perform several training curves for each solver before one can reach conclusions about their typical performance. Since each of the training curves requires the execution of thousands of quantum circuits in the quantum computer, such a robust study remained a steep challenge for most hybrid platforms available today. In this work, we leverage on Rigetti’s Quantum Cloud Services (QCS™) to overcome this implementation barrier, and we study the on-hardware performance of the data-driven quantum circuit learning (DDQCL) for three different state-of-the-art classical solvers, and on two-different circuit ansätze associated to different entangling connectivity graphs for the same task. Additionally, we assess the gains in performance from varying circuit depths. To evaluate the typical performance associated with each of these settings in this benchmark study, we use at least five independent runs of DDQCL towards the generation of quantum generative models capable of capturing the patterns of the canonical Bars and Stripes dataset. In this experimental benchmarking, the gradient-free optimization algorithms show an outstanding performance compared to the gradient-based solver. In particular, one of them had better performance when handling the unavoidable noisy objective function to be minimized under experimental conditions.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

A nudged hybrid analysis and modeling approach for realtime wake-vortex transport and decay prediction

Here, we put forth a long short-term memory (LSTM) nudging framework for the enhancement of reduced order models (ROMs) of fluid flows utilizing noisy measurements for air traffic improvements. Toward emerging applications of digital twins in aviation, the proposed approach allows for constructing a realtime predictive tool for wake-vortex transport and decay systems. We build on the fact that in realistic application, there are uncertainties in initial and boundary conditions, model parameters, as well as measurements. Moreover, conventional nonlinear ROMs based on Galerkin projection (GROMs) suffer from imperfection and solution instabilities, especially for advection-dominated flows with slow decay in the Kolmogorov n-width. In the presented LSTM nudging (LSTM-N) approach, we fuse forecasts from a combination of imperfect GROM and uncertain state estimates, with sparse Eulerian sensor measurements to provide more reliable predictions in a dynamical data assimilation framework. We illustrate our concept by solving the two-dimensional vorticity transport equation. We investigate the effects of measurements noise and state estimate uncertainty on the performance of the LSTM-N behavior. We also demonstrate that it can sufficiently handle different levels of temporal and spatial measurement sparsity, and offer a huge potential in developing next-generation digital twin technologies for aerospace applications.

42 ENGINEERING↗

DOE OSTI2020

DeepGrid: Robust Deep Reinforcement Learning-based Contingency Management

Increasing uncertainty raised by the integration of renewable energy resources requires an enormous number of simulations to be carried out for the security assessment of the power grid. However, it is challenging to assess the steady-state and dynamic security indices for different system contingency events by doing an exhaustive analysis in real-time due to the computational and communication constraints. One promising solution is using data-driven techniques along with the system models to train an intelligent contingency management framework to better handle the contingencies in real-time. Nevertheless, implementing a data-driven technique to obtain the best remedial actions necessitates to account for the effect of the measurement noise on the performance of the contingency management. To tackle these challenges, we leverage a robust deep reinforcement learning (DRL) algorithm called Double Deep Q-Network (DDQN) to design a recommender system capable of prescribing optimal control actions with the help of the real-time digital simulator (RTDS). The use of RTDS system in combination with the advanced DRL algorithm allows to explore a wide variety of system contingencies in order to derive better remedial actions. The performance of the proposed algorithm is evaluated in IEEE 9-bus system under different loading conditions, and different network configurations in presence of noisy measurements.

Ghasemkhani, Amir↗

DOE OSTI2024

Controlling radioisotope proportions when randomly sampling from Dirichlet distributions in PyRIID

As machine learning models for radioisotope quantification become more powerful, likewise the need for high-quality synthetic training data grows as well. For problem spaces that involve estimating the relative isotopic proportions of various sources in gamma spectra it is necessary to generate training data that accurately represents the variance of proportions encountered. In this report, we aim to provide guidance on how to target a desired variance of proportions which are randomly when using the PyRIID Seed Mixer, which samples from a Dirichlet distribution. We provide a method for properly parameterizing the Dirichlet distribution in order to maintain a constant variance across an arbitrary number of dimensions, where each dimension represents a distinct source template being mixed. We demonstrate that our method successfully parameterizes the Dirichlet distribution to target a specific variance of proportions, provided that several conditions are met. This allows us to follow a principled technique for controlling how random mixture proportions are generated which are then used downstream in the synthesis process to produce the final, noisy gamma spectra.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2024

Probabilistic measures for biological adaptation and resilience

This paper introduces an approach to quantifying ecological resilience in biological systems, particularly focusing on noisy systems responding to episodic disturbances with sudden adaptations. Incorporating concepts from nonequilibrium statistical mechanics, we propose a measure termed “ecological resilience through adaptation,” specifically tailored to noisy, forced systems that undergo physiological adaptation in the face of stressful environmental changes. Randomness plays a key role, accounting for model uncertainty and the inherent variability in the dynamical response among components of biological systems. Our measure of resilience is rooted in the probabilistic description of states within these systems and is defined in terms of the dynamics of the ensemble average of a model-specific observable quantifying success or well-being. Our approach utilizes stochastic linear response theory to compute how the expected success of a system, originally in statistical equilibrium, dynamically changes in response to a environmental perturbation and a subsequent adaptation. Importantly, the resulting mathematical derivations allow for the estimation of resilience in terms of ensemble averages of simulated or experimental data. Finally, through a simple but clear conceptual example, we illustrate how our resilience measure can be interpreted and compared to other existing frameworks in the literature. The methodology is general but inspired by applications in plant systems, with the potential for broader application to complex biological processes.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2019

Challenges and perspectives for large-scale temperature reconstructions of the past two millennia

Knowledge of the temperature variability during the last one to two millennia is important for providing a perspective to present-day climate excursions, for assessing the sensitivity of the climate to different forcings, and for providing a test bed for climate models. Since systematic instrumental temperature records only extend back to the nineteenth century, such knowledge mainly relies on climate-sensitive proxy data. Here we critically assess some of the many challenges related to large-scale multiproxy temperature reconstructions. We begin with a review of available large-scale temperature reconstructions, focusing on the differences in low-frequency variability and the response to natural forcings such as major volcanic eruptions and changes in total solar irradiance. Then, we discuss different proxy selection strategies, review previously used reconstruction methods, and discuss their ability to reconstruct the amplitude of the low-frequency variability. To shed additional light on the challenges of large-scale reconstructions, we investigate the spatial and temporal correlation structures in the observed temperature field and discuss the implications of these correlation structures regarding the required number and positions of proxies. We demonstrate how the unavoidable uncertainty related to noisy proxies will show up as bias and variance in the reconstruction and that the partition between these forms of errors depends on the reconstruction method. Pseudo-proxy experiments are conducted to further discuss the influence of noise and the requirements regarding the geographical location and number of proxies necessary for reliably reconstructing the low-frequency variability. Finally, we conclude with recommendations for future large-scale temperature reconstructions.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2021

Evaluation of KDP Estimation Algorithm Performance in Rain Using a Known-Truth Framework

Accurate estimation of specific differential phase ( K DP ) is necessary for rain rate estimation, attenuation correction, and hydrometeor classification algorithms. There are numerous published methods to process polarimetric radar observations of propagation differential phase shift (Φ DP ) and estimate K DP , but the corresponding K DP estimate uncertainty is unquantified. This study provides guidance on how commonly used K DP estimation algorithms perform in various environments. Here, we create numerous synthetic (“true”) K DP profiles, integrate over them to obtain “smoothed” Φ DP , and then add noise typical of S-band operational weather radar measurements. Each algorithm is applied to our noisy Φ DP profiles and compared to the true K DP profile such that the errors and uncertainty are quantified. The synthetic K DP profiles are Gaussian in shape, which allows systematic variations in their magnitude and width to determine how each algorithm performs in smooth, slowly changing K DP profiles, as well as steep profiles. Results demonstrate that algorithm performance is dependent on the Φ DP field received. These results are further supported by an error analysis of each algorithm for two more complicated synthetic K DP profiles. Some K DP algorithms allow users to change various tuning parameters; a subset of these tuning parameters is tested to provide guidance on how changing these parameters impacts algorithm performance. We then provide evidence that our known-truth framework provides insight into algorithm performance in observed data through two case studies.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2022

An Efficient Bayesian Approach to Learning Droplet Collision Kernels: Proof of Concept Using “Cloudy,” a New n -Moment Bulk Microphysics Scheme

The small-scale microphysical processes governing the formation of precipitation particles cannot be resolved explicitly by cloud resolving and climate models. Instead, they are represented by microphysics schemes that are based on a combination of theoretical knowledge, statistical assumptions, and fitting to data (“tuning”). Historically, tuning was done in an ad hoc fashion, leading to parameter choices that are not explainable or repeatable. Recent work has treated it as an inverse problem that can be solved by Bayesian inference. The posterior distribution of the parameters given the data—the solution of Bayesian inference—is found through computationally expensive sampling methods, which require over $\mathcal{O}$(10 5 ) evaluations of the forward model; this is prohibitive for many models. We present a proof of concept of Bayesian learning applied to a new bulk microphysics scheme named “Cloudy,” using the recently developed Calibrate-Emulate-Sample (CES) algorithm. Cloudy models collision-coalescence and collisional breakup of cloud droplets with an adjustable number of prognostic moments and with easily modifiable assumptions for the cloud droplet mass distribution and the collision kernel. The CES algorithm uses machine learning tools to accelerate Bayesian inference by reducing the number of forward evaluations needed to $\mathcal{O}$(10 2 ). It also exhibits a smoothing effect when forward evaluations are polluted by noise. In a suite of perfect-model experiments, we show that CES enables computationally efficient Bayesian inference of parameters in Cloudy from noisy observations of moments of the droplet mass distribution. In an additional imperfect-model experiment, a collision kernel parameter is successfully learned from output generated by a Lagrangian particle-based microphysics model.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2024

Quantum optimization algorithms: Energetic implications

Since the dawn of quantum computing (QC), theoretical developments like Shor's algorithm proved the conceptual superiority of QC over traditional computing. However, such quantum supremacy claims are difficult to achieve in practice because of the technical challenges of realizing noiseless qubits. In the near future, QC applications will need to rely on noisy quantum devices that offload part of their work to classical devices. One way to achieve this is by using parameterized quantum circuits in optimization or even in machine learning tasks. The energy requirements of quantum algorithms have not yet been studied extensively. Here in this article, we explore several optimization algorithms using both theoretical insights and numerical experiments to understand their impact on energy consumption. Specifically, we highlight why and how algorithms like quantum natural gradient descent, simultaneous perturbation stochastic approximations or circuit learning methods, are at least 2x to 4x more energy efficient than their classical counterparts; why feedback-based quantum optimization is energy-inefficient; and how techniques like Rosalin can improve the energy efficiency of other algorithms by a factor of ≥2 0 x. Finally, we use the NchooseK high-level programming model to run optimization problems on both gate-based quantum computers and quantum annealers. Empirical data indicate that these optimization problems run faster, have better success rates, and consume less energy on quantum annealers than on their gate-based counterparts.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Bridging paradigms: Designing for HPC-Quantum convergence

Here, this paper presents a comprehensive software stack architecture for integrating quantum computing (QC) capabilities with High-Performance Computing (HPC) environments. While quantum computers show promise as specialized accelerators for scientific computing, their effective integration with classical HPC systems presents significant technical challenges. We propose a hardware-agnostic software framework that supports both current noisy intermediate-scale quantum devices and future fault-tolerant quantum computers, while maintaining compatibility with existing HPC workflows. The architecture includes a quantum gateway interface, standardized APIs for resource management, and robust scheduling mechanisms to handle both simultaneous and interleaved quantum–classical workloads. Key innovations include: (1) a unified resource management system that efficiently coordinates quantum and classical resources, (2) a flexible quantum programming interface that abstracts hardware-specific details, (3) A Quantum Platform Manager API that simplifies the integration of various quantum hardware systems, and (4) a comprehensive tool chain for quantum circuit optimization and execution. We demonstrate our architecture through implementation of quantum–classical algorithms, including the variational quantum linear solver, showcasing the framework’s ability to handle complex hybrid workflows while maximizing resource utilization. This work provides a foundational blueprint for integrating QC capabilities into existing HPC infrastructures, addressing critical challenges in resource management, job scheduling, and efficient data movement between classical and quantum resources.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Age, vascular disease, and Alzheimer’s disease pathologies in amyloid negative elderly adults

Background: We recently reported that CSF phosphorylated tau (p-Tau 181 ) relative to Aβ 40 (CSF p-Tau/Aβ 40 ratio) was less noisy and increased associations with Alzheimer’s disease (AD) biomarkers compared to CSF p-Tau 181 alone. While elevations of CSF p-Tau/Aβ 40 can occur in amyloid-β (Aβ) negative (Aβ-) individuals, the factors associated with these elevations and their role in neurodegeneration and cognitive decline are unknown. We aim to explore factors associated with elevated tau in CSF, and how these elevated tau are related to neurodegeneration and cognitive decline in the absence of Aβ positivity. Methods: We examined relationships between CSF p-Tau/Aβ 40 , and CSF Aβ 42 /Aβ 40 , Aβ PET, and white matter hyperintensities (WMH) as well as vascular risk factors in 149 cognitively unimpaired and 52 impaired individuals who were presumably not on the Alzheimer’s disease (AD) pathway due to negative Aβ status on both CSF and PET. Subgroups had 18 F-fluorodeoxyglucose (FDG) PET and adjusted hippocampal volume (aHCV), and longitudinal measures of CSF, aHCV, FDG PET, and cognition data, so we examined CSF p-Tau/Aβ 40 associations with these measures as well. Results: Elevated CSF p-Tau/Aβ 40 was associated with older age, male sex, greater WMH, and hypertension as well as a pattern of hippocampal atrophy and temporoparietal hypometabolism characteristic of AD. Lower CSF Aβ 42 /Aβ 40 , higher WMH, and hypertension but not age, sex, Aβ PET, APOE-ε4 status, body mass index, smoking, and hyperlipidemia at baseline predicted CSF p-Tau/Aβ 40 increases over approximately 5 years of follow-up. The relationship between CSF p-Tau/Aβ 40 and subsequent cognitive decline was partially or fully explained by neurodegenerative measurements. Conclusions: These data provide surprising clues as to the etiology and significance of tau pathology in the absence of Aβ. It seems likely that, in addition to age, both cerebrovascular disease and subthreshold levels of Aβ are related to this tau accumulation. Crucially, this phenotype of CSF tau elevation in amyloid-negative individuals share features with AD such as a pattern of metabolic decline and regional brain atrophy.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2026

Regional surrogates for predictive control of digital twins

Digital twins of complex systems must involve a model that is fast, generalizable, and usable for real-time control. For example, high-fidelity nonlinear multiphysics simulations can capture laser-material interactions, but are too slow for optimization or model predictive control (MPC). Reduced-order models, used to accelerate such computation, frequently fail to generalize to unseen inputs or control states. We show theoretically that this failure is intrinsic, i.e., that a learned model is non-unique outside the sampled subspace when its low-rank structure arises from limited excitation and clustered eigenvalues, rather than from a user-imposed truncation alone. Motivated by this result, we propose a control-ready regional surrogate-construction framework for both autonomous and nonautonomous dynamics; it employs Koopman lifting to represent nonlinearities, while preserving spatial locality. We illustrate our approach by constructing a control-ready surrogate for the digital twin of a thermal component of additive-manufacturing process. Our surrogate, localized in space through a von Neumann stencil, is learned from noisy high-fidelity simulations that emulate thermal-camera images collected during the manufacturing. It is linear in thermo-physically augmented states so that MPC reduces to a convex quadratic program. The surrogate requires no online correction, generalizes to unseen scan paths and power profiles of the laser, and is more than three orders of magnitude faster than a finite-difference solver. Furthermore, when the MPC sequence computed on the digital twin is applied to this solver, closed-loop temperature regulation is recovered, showing that the surrogate preserves control-relevant input-output behavior.

Data-driven model↗

DOE OSTI2026

Optimization performance, fidelity, and cost: SIAM VQE

This dataset contains files storing results from classically-simulated quantum subroutines within a dynamical mean-field theory workflow, and jupyter notebooks processing the data in these files to generate plots. The files store: (1) Results from variational quantum eigensolver (VQE) simulations searching for optimal parameters allowing parametrized quantum circuits to prepare approximations to ground states of different Anderson impurity models (AIMs) (2) Results from simulations of a quantum Lanczos algorithm (QLA) estimating the Lanczos coefficients defining the continued-fraction representation of an (AIM) Green’s function Description: Any file named vqe_gs_results* stores approximations to the ground state and energy of a given AIM estimated using three different methods: (1) Numerical diagonalization (2) Ideal VQE simulation (3) VQE simulation with sampling noise For each VQE simulations metadata about the optimization (optimization results plus number of quantum circuits that would have been executed on real hardware) is also stored. Any file named qla_dos_results* estimations for the Lanczos coefficients defining the Green’s function of an AIM. The stored estimations are achieved using different methods: (1) Numerical Lanczos algorithm from initial states obtained from numerical diagonalization (2) Simulated quantum Lanczos algorithm from initial states prepared from parametrized quantum circuits yielded by corresponding ideal and noisy VQE subroutines. The dataset is used and described in M. Karabin et al., "Quantum solver for single-impurity Anderson models with particle-hole symmetry", Phys. Rev. Research 8, 033066 (2026). DOI: https://doi.org/10.1103/7ys3-tl4l

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2023

Spread Spectrum Time Domain Reflectometry (SSTDR) and Frequency Domain Reflectometry (FDR) for Detection of Cable Anomalies Using Machine Learning

Cables are initially qualified for nuclear power plant use for 40 years. As plants extend their operating license to 60 and 80 years, continued use of these cables must shift to a performance-based approach since it is cost prohibitive to completely replace cables that are likely still capable of performing their design function. A variety of cable tests are available and are commonly applied during outages when the cables can be taken out of service. Frequency domain reflectometry (FDR) is one of these test methods that is being more broadly accepted and used because it not only detects anomalies along the cable with a low-voltage signal that does not stress the cable insulation, but the technique also locates the anomalies. This supports follow-up local inspection and local repair or partial replacement of a damaged cable segment. Currently, FDR testing is only applied to cables that are taken out of service since the test instrument would be damaged by operational voltages. A related technology that has found some acceptance in the aircraft and rail industry is spread spectrum time domain reflectometry (SSTDR). This technology has been implemented with a custom commercial instrument by LiveWire Innovation Inc. that is designed to operate on live cables up to 1000 volts. One of the main conclusions of a previous effort was that cable reflectometry plots can be difficult for humans to analyze due to baseline noise, low or noisy anomaly response peaks, or large responses from cable ends. Detection of cable anomalies for many of these frequencies and test conditions was challenging for manual analysis. This presented an ideal opportunity for ML analysis to distinguish undamaged cable indications from anomalous cable indications. This research discusses application of machine learning (ML) to reflectometry cable test methods. The goal was to assess feasibility to distinguish undamaged cable reflectometry responses from damaged or anomalous cable reflectometry responses. The assessment considered the 3 instruments, multiple frequency bandwidths from each instrument, multiple cable anomalies and test conditions, and both supervised and unsupervised ML approaches. Although approaches and analysis methods were not identical or directly comparable, both outputs were encouraging. The unsupervised prediction weighted accuracy was assessed by instrument and by frequency. It performed better at high frequencies with the highest prediction accuracy of 0.84 for the higher frequency FDR, 0.79 for the 48-MHz LiveWire SSTDR, and 0.77 for 300-MHz PNNL SSTDR. The initial weighted accuracy average across all frequencies for using supervised ML was 0.56 to 0.68. The supervised analysis was repeated with noisier training data removed resulting in weighted accuracies of 0.69 to 0.87. These weighted accuracies are not directly comparable due to differences in the supervised and unsupervised analysis details but do indicate an encouraging trend. Even with limited and unbalanced data, strong prediction accuracies seem encouraging for further work including more data under a wider range of conditions.

42 ENGINEERING↗

DOE OSTI2022

Classical Simulation of Boson Sampling Based on Graph Structure

Boson sampling is a fundamentally and practically important task that can be used to demonstrate quantum supremacy using noisy intermediate-scale quantum devices. In this Letter, we present classical sampling algorithms for single-photon and Gaussian input states that take advantage of a graph structure of a linear-optical circuit. The algorithms’ complexity grows as so-called treewidth, which is closely related to the connectivity of a given linear-optical circuit. Using the algorithms, we study approximated simulations for local Haar-random linear-optical circuits. For equally spaced initial sources, we show that, when the circuit depth is less than the quadratic in the lattice spacing, the efficient simulation is possible with an exponentially small error. Notably, right after this depth, photons start to interfere each other and the algorithms’ complexity becomes subexponential in the number of sources, implying that there is a sharp transition of its complexity. Finally, when a circuit is sufficiently deep enough for photons to typically propagate to all modes, the complexity becomes exponential as generic sampling algorithms. We numerically implement a likelihood test with a recent Gaussian boson sampling experiment and show that the treewidth-based algorithm with a limited treewidth renders a larger likelihood than the experimental data.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2021

Adaptive pruning-based optimization of parameterized quantum circuits

Abstract Variational hybrid quantum–classical algorithms are powerful tools to maximize the use of noisy intermediate-scale quantum devices. While past studies have developed powerful and expressive ansatze, their near-term applications have been limited by the difficulty of optimizing in the vast parameter space. In this work, we propose a heuristic optimization strategy for such ansatze used in variational quantum algorithms, which we call ‘parameter-efficient circuit training (PECT)’. Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms, in which each iteration of the algorithm activates and optimizes a subset of the total parameter set. To update the parameter subset between iterations, we adapt the Dynamic Sparse Reparameterization scheme which was originally proposed for training deep convolutional neural networks. We demonstrate PECT for the Variational Quantum Eigensolver, in which we benchmark unitary coupled-cluster ansatze including UCCSD and k -UpCCGSD, as well as the Low-Depth Circuit Ansatz (LDCA), to estimate ground state energies of molecular systems. We additionally use a layerwise variant of PECT to optimize a hardware-efficient circuit for the Sycamore processor to estimate the ground state energy densities of the one-dimensional Fermi-Hubbard model. From our numerical data, we find that PECT can enable optimizations of certain ansatze that were previously difficult to converge and more generally can improve the performance of variational algorithms by reducing the optimization runtime and/or the depth of circuits that encode the solution candidate(s).

Physics↗

DOE OSTI2025

Quantum AI Based Enhanced Detection of Dementia

Quantum computing has the potential to significantly improve the early detection of Alzheimer's Disease and Related Dementias (ADRD). Quantum-enhanced machine learning can be used to perform an early screening of Alzheimer's disease using brain imaging data based on dataset of MRI scans from both healthy individuals and those diagnosed with Alzheimer's. This study aims to demonstrate the potential of quantum transfer learning to enhance the performance of the classical deep learning model for dementia detection. Using the MRI sagittal images available in the OASIS-2 (64 demented and 72 non-demented subjects between 60 and 96 years), we show how quantum techniques can transform a suboptimal classical model into a more effective solution for dementia detection, highlighting their potential impact on advancing healthcare technology. We begin with a simple classical deep learning model with a significantly smaller number of parameters, which gives suboptimal performance on the problem. Then, we apply different configurations of quantum transfer learning based on the pre-trained weak classifier (Figure 1). We fix the weak classifier's initial convolutional layers at their fixed pre-trained parameters and replace the last set of dense layers with a dressed quantum circuit (DQN), which we train to enhance performance. We performed 4-fold cross-validation for both the classical and the hybrid quantum models and trained them using Pennylane's `default.qubit' simulator and IonQ's Aria-1 simulator (noisy simulation). We showed that with significantly fewer parameters, the quantum transfer learning-based hybrid models showed significant performance enhancement over the base weak classical deep learning model for dementia detection. To classify between a demented and non-demented subject, the accuracy of quantum-based AI methods improved by 6 to 14% compared to classical methods. The sensitivity of the models improved by 4 to 17%. This shows that there are fewer chances of misclassifying demented patients. Figure 2 compares the performance of the hybrid quantum models and their base classical model, and Table 1 summarizes the results. We illustrated that with assistance from quantum machine learning, it is possible to enhance detection for dementia based on brain images. This shows the potential for practical utility of quantum computing in ADRD research.

Bhowmik, Sounak [University of Tennessee, Knoxvill↗