Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Quantum AI”

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 19 records

A NASA Perspective on Quantum AI, Error Correction, and Beyond

Quantum computing is one of the most enticing computational paradigms with the potential to revolutionize diverse areas of future-generation computational systems. While quantum computing hardware has advanced rapidly, from tiny laboratory experiments to quantum chips that can outperform even the largest supercomputers on specialized computational tasks, these noisy-intermediate scale quantum (NISQ) processors are still too small and non-robust to be directly useful for any real-world applications. We discuss the prospects for quantum computing and AI, highlighting advances in algorithms, both near- and longer-term. Quantum error correction is critical to the realization of any such vision. The talk with touch on some recent exciting advanced in quantum error correction, particularly in dynamical codes. The talk will conclude with an example of how the combination of quantum computing and artificial intelligence can help probe fundamental aspect of quantum physics.

quantum optimization algorithms and sampling↗

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↗

Robustness and Eventual Slow Decay of Bound States of Interacting Microwave Photons in the Google Quantum AI Experiment

Integrable models are characterized by the existence of stable excitations that can propagate indefinitely without decaying. This includes multimagnon bound states in the celebrated 𝑋⁢𝑋⁢𝑍 spin-chain model and its integrable Floquet counterpart. A recent Google Quantum AI experiment [A. Morvan et al., Nature 612, 240 (2022)] realizing the Floquet model has demonstrated the persistence of such collective excitations even when the integrability is broken: this observation is at odds with the expectation of ergodic dynamics in generic nonintegrable systems. Here, we study the spectrum of the model realized in the experiment using exact diagonalization and physical arguments. We find that isolated bands corresponding to the descendants of the exact bound states of the integrable model are clearly observable in the spectrum for a large range of system sizes. However, our numerical analysis of the localization properties of the eigenstates suggests that the bound states become unstable in the thermodynamic limit. A perturbative estimate of the decay rate agrees with the prediction of an eventual instability for large system sizes.

Exact diagonalization↗

A Quantum-AI Framework for Extreme Weather Prediction

The frequency and intensity of extreme weather events in North America will likely increase with a changing climate. High resolution simulations are necessary to advance process-based understanding of weather events at local scales accompanying future changes in global atmospheric circulation.

54 ENVIRONMENTAL SCIENCES↗

In Silico Chemical Experiments in the Age of AI: From Quantum Chemistry to Machine Learning and Back

Computational chemistry is an indispensable tool for understanding molecules and predicting chemical properties. However, traditional computational methods face significant challenges due to the difficulty of solving the Schrödinger equations and the increasing computational cost with the size of the molecular system. In response, there has been a surge of interest in leveraging artificial intelligence (AI) and machine learning (ML) techniques to in silico experiments. Integrating AI and ML into computational chemistry increases the scalability and speed of the exploration of chemical space. However, challenges remain, particularly regarding the reproducibility and transferability of ML models. This review highlights the evolution of ML in learning from, complementing, or replacing traditional computational chemistry for energy and property predictions. Starting from models trained entirely on numerical data, a journey set forth toward the ideal model incorporating or learning the physical laws of quantum mechanics. This paper also reviews existing computational methods and ML models and their intertwining, outlines a roadmap for future research, and identifies areas for improvement and innovation. Ultimately, the goal is to develop AI architectures capable of predicting accurate and transferable solutions to the Schrödinger equation, thereby revolutionizing in silico experiments within chemistry and materials science.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Low-latency quantum control using AI algorithms on cryogenic microelectronics platforms

Superconducting quantum computers are a particular technology that involve the realization of qubits by means of LC circuits with a Josephson junction. As shown in Fig. 1, this latter addition has the effect of introducing a nonlinearity (anharmonicity) that makes the frequency spacing between each energy level non-uniform. This is a desired effect for separating the two lowest levels, used for computation, from the higher ones, that are theoretically infinite and which are not desired to be used.

97 MATHEMATICS AND COMPUTING↗

Adiabatic quantum support vector machines

Adiabatic quantum computers can solve difficult optimization problems (e.g., the quadratic unconstrained binary optimization problem), and they seem well suited to train machine learning models. In this paper, we describe an adiabatic quantum approach for training support vector machines. We show that the time complexity of our quantum approach is an order of magnitude better than the classical approach. Next, we compare the test accuracy of our quantum approach against a classical approach that uses the Scikit-learn library in Python across five benchmark datasets (Iris, Wisconsin Breast Cancer (WBC), Wine, Digits, and Lambeq). We show that our quantum approach obtains accuracies on par with the classical approach. Finally, we perform a scalability study in which we compute the total training times of the quantum approach and the classical approach with an increasing number of features and an increasing number of data points in the training dataset. In conclusion, our scalability results show that the quantum approach obtains a 3.5–4.5x speedup over the classical approach on datasets with many (millions of) features.

Computational Complexity↗

Observable measurement-induced transitions

One of the main postulates of quantum mechanics is that measurements destroy quantum coherence (wave function collapse). Recently it was discovered that in a many-body system dilute local measurements still preserve some coherence across the entire system. As the measurement density is increased, a phase transition occurs that is characterized by the disentanglement of different parts of the system. Unfortunately, this transition is impossible to observe experimentally for macroscopic systems because it requires an exponentially costly full tomography of the many-body wave function or a comparison with the simulation on an oracle classical computer. In this work we report the discovery of another measurement-induced phase transition that can be observed experimentally if quantum dynamics can be reversed. On one side of this phase transition the quantum information encoded in some part of the Hilbert space is fully recovered after the time inversion. On the other side, all quantum information is corrupted. This transition also manifests itself as the change in the behavior of the probability to observe the same measurement outcome in the process that consists of identical blocks repeated many times. In each block the unitary evolution is followed by the measurement. On one side of the transition the probability decreases exponentially with the number of repetitions, on the other it tends to a constant as the number of repetitions is increased. We confirm the existence of the proposed phase transition through numerical simulations of realistic quantum circuits and analytical calculations using an effective random-matrix theory model.

Measurement-induced phase transitions↗

Exploration of Quantum Machine Learning and AI Accelerators for Fusion Science

The dawn of the noisy intermediate-scale quantum (NISQ) era sparked rapid development in variational quantum algorithms. These algorithms, utilizing parameterized quantum circuit optimized by classical computers with feedback, are practical under the constraints of the current hardware and can potentially show quantum advantage. In recent years, these variational circuit are applied to neural networks, hoping to boost the triumphant success of deep learning. We simulate various of quantum-classical hybrid neural networks applied to scientific tasks, and seek to understand their capabilities and limitations. Specifically, we devise quantum convolutional layers and apply them to deep neural networks used for predicting plasma disruption in fusion reactors.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Quantum Computing for AI-based Design and Optimization of Electric Motors

Knowledge-based artificial intelligence and hierarchical fuzzy logic offer an interpretable framework for electricvehicle motor preliminary design, but their computational burden grows with linguistic granularity and coupled design-space size. This paper presents a reduced quantum reformulation of the hierarchical fuzzy inference of air-gap flux density, a representative level-one motor-design parameter. Starting from the published electric-vehicle motor-design framework, a three-term fuzzy prototype is constructed from the original inference structure. The reduced model is then reformulated as a modular quantum register-oracle system, in which each hierarchical subrelation is encoded as a block oracle and evaluated through superpositionbased candidate-label testing. The proposed modular quantum formulation reproduces the reduced classical prototype after block fusion. A resource analysis shows that the reduced modular system requires seven qubits per block and twenty-two qubits in a straightforward four-block implementation. Finally, a crossovercomplexity model is derived to identify the regime in which quantum candidate search may become favorable relative to hierarchical fuzzy inference. The results show that no quantum advantage should be claimed for the present one-output reduced benchmark, but that a plausible crossover emerges for larger joint candidate spaces and higher linguistic granularity. The work therefore establishes a technically consistent starting point for future quantum-assisted electric-vehicle motor-design optimization.

Kumar, Praveen [ORNL] (ORCID:0000000291877857)↗

Predicting Adaptively Chosen Observables in Quantum Systems

Recent advances have demonstrated that 𝒪⁡(log 𝑀) measurements suffice to predict 𝑀 properties of arbitrarily large quantum many-body systems. However, these remarkable findings assume that the properties to be predicted are chosen independently of the data. This assumption can be violated in practice, where scientists adaptively select properties after looking at previous predictions. This work investigates the adaptive setting for three classes of observables: local, Pauli, and bounded-Frobenius-norm observables. We prove that Ω⁡(√𝑀) samples of an arbitrarily large unknown quantum state are necessary to predict expectation values of 𝑀 adaptively chosen local and Pauli observables, where the system size scales exponentially and polynomially in 𝑀, respectively. We also present computationally efficient algorithms that achieve this information-theoretic lower bound. In contrast, for bounded-Frobenius-norm observables, we devise an algorithm requiring only 𝒪⁡(log 𝑀) samples, independent of system size. These results highlight the potential pitfalls of adaptivity in analyzing data from quantum experiments and provide algorithmic tools to safeguard against erroneous predictions in quantum experiments.

Machine learning↗

AQuaRef: machine learning accelerated quantum refinement of protein structures

Cryo-EM and X-ray crystallography provide crucial experimental data for obtaining atomic-detail models of biomacromolecules. Refining these models relies on library-based stereochemical data, which, in addition to being limited to known chemical entities, do not include meaningful noncovalent interactions. Quantum mechanical (QM) calculations could alleviate these issues but are too expensive for large molecules. Here we present a novel AI-enabled Quantum Refinement (AQuaRef) based on AIMNet2 machine learned interatomic potential (MLIP) mimicking QM at substantially lower computational costs. By refining 41 cryo-EM and 30 X-ray structures, we show that this approach yields atomic models with superior geometric quality compared to standard techniques, while maintaining an equal or better fit to experimental data. Notably, AQuaRef aids in determining proton positions, as illustrated in the challenging case of short hydrogen bonds in the parkinsonism-associated human protein DJ-1 and its bacterial homolog YajL.

Zubatyuk, Roman [Carnegie Mellon University, Pitts↗

Resilience of the surface code to error bursts

Quantum error correction works effectively only if the error rate of gate operations is sufficiently low. However, some rare physical mechanisms can cause a temporary increase in the error rate that affects many qubits; examples include ionizing radiation in superconducting hardware and large deviations in the global control of atomic systems. We refer to such rare transient spikes in the gate error rate as error bursts. In this work, we investigate the resilience of the rotated surface code to generic error bursts. We assume that, after appropriate mitigation strategies, the spike in the error rate lasts for only a single syndrome-extraction cycle; we also assume that the enhanced error rate is uniform across the code block. Under these assumptions, and for a circuit-level depolarizing noise model, we perform Monte Carlo simulations to determine the regime in burst error rate and background error rate for which the memory time becomes arbitrarily long as the code block size grows. Our results indicate that suitable hardware mitigation methods combined with standard decoding methods may suffice to protect against transient error bursts in the rotated surface code.

Quantum error correction↗

Krylov winding and emergent coherence in operator growth dynamics

The operator wavefunction provides a fine-grained description of quantum chaos and of the irreversible growth of simple operators into increasingly complex ones. Remarkably, at finite temperature this wavefunction can acquire a phase that increases linearly with the operator’s size, a phenomenon called . Although size winding occurs naturally in a holographic setting, the emergence of a coherent phase in a scrambled operator remains mysterious from the standpoint of a thermalizing quantum many-body system. Here, in this article, we elucidate this phenomenon by introducing the related concept of , whereby the operator wavefunction acquires a phase which winds linearly with the Krylov index. We show that Krylov winding is a generic feature of quantum chaotic systems and is a direct consequence of the universal operator growth bound hypothesis. It gives rise to size winding under two additional conditions: (i) a low-rank mapping between the Krylov and size bases, which ensures phase alignment among operators of the same size, and (ii) the saturation of the "chaos-operator growth" bound 𝜆 𝐿 ≤ 2⁢𝛼 (with 𝜆 𝐿 the Lyapunov exponent and 𝛼 the growth rate), which ensures a linear phase dependence on size. For systems which do not saturate this bound, with ℎ = 𝜆 𝐿 /2⁢𝛼 < 1, the winding with Pauli size ℓ becomes superliner, behaving as ℓ 1/ℎ . We illustrate these results with two classes of microscopic models: the Sachdev-Ye-Kitaev (SYK) model and its variants, and a disordered 𝑘-local spin model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Telecom-to-visible quantum frequency converter on a silicon nitride chip

Quantum frequency conversion serves a key role in the realization of hybrid quantum networks by interfacing between wavelength-incompatible platforms. Here we present what is believed to be the first quantum frequency converter connecting visible and telecom domains on a silicon nitride (SiN) chip, using Bragg-scattering four-wave mixing to upconvert heralded single photons from 1260 to 698 nm, which covers a 192 THz span. We examine the noise sources in SiN and devise approaches to suppress noise photons at the source and target frequencies to enable measurements at the single-photon level. We demonstrate an on-chip conversion efficiency of 5% in photon flux and describe design modifications that can be implemented to significantly improve it. Our results pave the way for the implementation of complementary metal-oxide-semiconductor (CMOS)-compatible devices in quantum networks.

59 BASIC BIOLOGICAL SCIENCES↗