Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Quantum machine learning”

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 145 records · Page 8

Learning linear optical circuits with coherent states

We analyze the energy and training data requirements for supervised learning of an M-mode linear optical circuit by minimizing an empirical risk defined solely from the action of the circuit on coherent states. When the linear optical circuit acts non-trivially only on k < M unknown modes (i.e. a linear optical k-junta), we provide an energy-efficient, adaptive algorithm that identifies the junta set and learns the circuit. We compare two schemes for allocating a total energy, E, to the learning algorithm. In the first scheme, each of the T random training coherent states has energy E/T. In the second scheme, a single random MT-mode coherent state with energy E is partitioned into T training coherent states. The latter scheme exhibits a polynomial advantage in training data size sufficient for convergence of the empirical risk to the full risk due to concentration of measure on the $(2MT-1)$-sphere. Specifically, generalization bounds for both schemes are proven, which indicate that for ε-approximation of the full risk by the empirical risk with high probability, $O(E^{2/3}M^{2/3}/\epsilon^{2/3})$ training states are sufficient for the first scheme and $O(E^{1/3}M^{1/3}/\epsilon^{2/3})$ training states are sufficient for the second scheme.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

More buck-per-shot: Why learning trumps mitigation in noisy quantum sensing

Quantum sensing is one of the most promising applications for quantum technologies. However, reaching the ultimate sensitivities enabled by the laws of quantum mechanics can be a challenging task in realistic scenarios where noise is present. While several strategies have been proposed to deal with the detrimental effects of noise, these come at the cost of an extra shot budget. Given that shots are a precious resource for sensing – as infinite measurements could lead to infinite precision – care must be taken to truly guarantee that any shot not being used for sensing is actually leading to some metrological improvement. In this work, we study whether investing shots in error-mitigation, inference techniques, or combinations thereof, can improve the sensitivity of a noisy quantum sensor on a (shot) budget. We present a detailed bias–variance error analysis for various sensing protocols. Our results show that the costs of zero-noise extrapolation techniques outweigh their benefits. We also find that pre-characterizing a quantum sensor via inference techniques leads to the best performance, under the assumption that the sensor is sufficiently stable.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Time-Resolved Line Shapes of Single Quantum Emitters via Machine Learned Photon Correlations

Solid-state single-photon emitters (SPEs) are quantum light sources that combine atomlike optical properties with solid-state integration and fabrication capabilities. SPEs are hindered by spectral diffusion, where the emitter’s surrounding environment induces random energy fluctuations. Timescales of spectral diffusion span nanoseconds to minutes and require probing single emitters to remove ensemble averaging. Photon correlation Fourier spectroscopy (PCFS) can be used to measure time-resolved single emitter line shapes, but is hindered by poor signal-to-noise ratio in the measured correlation functions at early times due to low photon counts. Here, we develop a framework to simulate PCFS correlation functions directly from diffusing spectra that match well with experimental data for single colloidal quantum dots. We use these simulated datasets to train a deep ensemble autoencoder machine learning model that outputs accurate, noiseless, and probabilistic reconstructions of the noisy correlations. Using this model, we obtain reconstructed time-resolved single dot emission line shapes at timescales as low as 10 ns, which are otherwise completely obscured by noise. This enables PCFS to extract optical coherence times on the same timescales as Hong-Ou-Mandel two-photon interference, but with the advantage of providing spectral information in addition to estimates of photon indistinguishability. Further, our machine learning approach is broadly applicable to different photon correlation spectroscopy techniques and SPE systems, offering an enhanced tool for probing single emitter line shapes on previously inaccessible timescales.

74 ATOMIC AND MOLECULAR PHYSICS↗

Efficient Trainability of Linear Optical Modules in Quantum Optical Neural Networks

The existence of “barren plateau landscapes” for generic discrete-variable quantum neural networks, which obstructs efficient gradient-based optimization of cost functions defined by global measurements, would be surprising in the case of generic linear optical modules in quantum optical neural networks due to the tunability of the intensity of continuous variable states and the relevant unitary group having exponentially smaller dimension. We demonstrate that coherent light in m modes can be generically compiled efficiently if the total intensity scales sublinearly with m, and extend this result to cost functions based on homodyne, heterodyne, or photon detection measurement statistics, and to noisy cost functions in the presence of attenuation. Here, we further demonstrate efficient trainability of m mode linear optical quantum circuits for variational mean field energy estimation of positive quadratic Hamiltonians for input states that do not have energy exponentially vanishing with m.

47 OTHER INSTRUMENTATION↗

Non-Boolean quantum amplitude amplification and quantum mean estimation

This paper generalizes the quantum amplitude amplification and amplitude estimation algorithms to work with non-Boolean oracles. The action of a non-Boolean oracle $U_\varphi $ on an eigenstate $\mathinner {|{x}\rangle }$ is to apply a state-dependent phase-shift $\varphi (x)$. Unlike Boolean oracles, the eigenvalues $\exp (i\varphi (x))$ of a non-Boolean oracle are not restricted to be $\pm 1$. Two new oracular algorithms based on such non-Boolean oracles are introduced. The first is the non-Boolean amplitude amplification algorithm, which preferentially amplifies the amplitudes of the eigenstates based on the value of $\varphi (x)$. Starting from a given initial superposition state $\mathinner {|{\psi _0}\rangle }$, the basis states with lower values of $\cos (\varphi )$ are amplified at the expense of the basis states with higher values of $\cos (\varphi )$. The second algorithm is the quantum mean estimation algorithm, which uses quantum phase estimation to estimate the expectation $\mathinner {\langle {\psi _0|U_\varphi |\psi _0}\rangle }$, i.e., the expected value of $\exp (i\varphi (x))$ for a random x sampled by making a measurement on $\mathinner {|{\psi _0}\rangle }$. It is shown that the quantum mean estimation algorithm offers a quadratic speedup over the corresponding classical algorithm. Both algorithms are demonstrated using simulations for a toy example. Potential applications of the algorithms are briefly discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

PASTA: A Parallel Sparse Tensor Algorithm Benchmark Suite

Tensor methods have gained increasingly attention from various applications, including machine learning, quantum chemistry, healthcare analytics, social network analysis, data mining, and signal processing, to name a few. Sparse tensors and their algorithms become critical to further improve the performance of these methods and enhance the interpretability of their output. This work presents a sparse tensor algorithm benchmark suite (PASTA) for single- and multi-core CPUs. To the best of our knowledge, this is the first benchmark suite for sparse tensor world. PASTA targets on: 1) helping application users to evaluate different computer systems using its representative computational workloads; 2) providing insights to better utilize existed computer architecture and systems and inspiration for the future design. This benchmark suite will be publicly released.

HPC, sparse tensor, benchmark↗

Developing a complete AI-accelerated workflow for superconductor discovery

The quest to identify new superconducting materials with enhanced properties is hindered by the prohibitive cost of computing electron-phonon spectral functions, severely limiting the materials space that can be explored. Here, we introduce a Bootstrapped Ensemble of Equivariant Graph Neural Networks (BEE-NET), a machine-learning model trained to predict the Eliashberg spectral function and superconducting critical temperature with a mean-absolute-error of 0.87 K relative to DFT-based Allen-Dynes calculations. Intriguingly, BEE-NET achieves a true-negative-rate of 99.4%, enabling highly efficient screening for the rare property of superconductivity. Integrated into a multi-stage, AI-accelerated discovery pipeline that incorporates elemental-substitution strategies and machine-learned interatomic potentials, our workflow reduced over 1.3 million candidate structures to 741 dynamically and thermodynamically stable compounds with DFT-confirmed T c > 5 K. We report the successful synthesis and experimental confirmation of superconductivity in two of these previously unreported compounds. This study establishes a data-driven framework that integrates machine learning, quantum calculations, and experiments to systematically accelerate superconductor discovery.

Gibson, Jason B. [Quantum Formatics, Cambridge, MA↗

Application-level benchmarking of quantum computers using nonlocal game strategies

In a nonlocal game, two noncommunicating players cooperate to convince a referee that they possess a strategy that does not violate the rules of the game. Quantum strategies allow players to optimally win some games by performing joint measurements on a shared entangled state, but computing these strategies can be challenging. We present a variational quantum algorithm to compute quantum strategies for nonlocal games by encoding the rules of a nonlocal game into a Hamiltonian. We show how this algorithm can generate a short-depth optimal quantum strategy for a graph coloring game with a quantum advantage. This quantum strategy is then evaluated on fourteen different quantum hardware platforms to demonstrate its utility as a benchmark. Finally, we discuss potential sources of errors that can explain the observed decreased performance of the executed task and derive an expression for the number of samples required to accurately estimate the win rate in the presence of noise.

nonlocal games↗

Quantum pattern recognition algorithms for charged particle tracking

High-energy physics is facing a daunting computing challenge with the large datasets expected from the upcoming High-Luminosity Large Hadron Collider in the next decade and even more so at future colliders. A key challenge in the reconstruction of events of simulated data and collision data is the pattern recognition algorithms used to determine the trajectories of charged particles. The field of quantum computing shows promise for transformative capabilities and is going through a cycle of rapid development and hence might provide a solution to this challenge. This article reviews current studies of quantum computers for charged particle pattern recognition in high-energy physics.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Role for IEEE in Quantum Computing

Will quantum computation become an important milestone in human progress? Here, passionate advocates and equally passionate skeptics abound. IEEE already provides useful, neutral forums for state-of-the-art science and engineering knowledge as well as practical benchmarks for quantum computation evaluation. But could the organization do more?

97 MATHEMATICS AND COMPUTING↗

Visualization of Noisy and Less Noisy Computational Basis States in Quantum Computing

Quantum computing technology holds substantial promise as a reliable computational paradigm. However, current noisy intermediate scale quantum (NISQ) systems, are significantly impacted by noise originating from hardware inconsistencies. This noise causes errors and lowers output fidelity. So we must find which basis states cause errors. However, there are two main challenges in analyzing noise corresponding to basis states. First, the noise distribution data is high dimensional in nature, thereby making its analysis challenging. Second, although functional box plots have been used in the state of the art research to understand such a high dimensional data, they suffer from clutter and occlusion issues because of overplotting. In this study, we introduce an innovative visualization pipeline to address the aforementioned challenges to provide a clear depiction of noisy and less-noisy basis states. Specifically, our proposed visualization pipeline comprises three stages namely, low dimensional embedding, clustering, and violin plot visualization, to reduce visual clutter and effectively analyze high-dimensional noise distribution data. Our analysis uses quantum machine learning (QML) circuits as case study for drawing a distinction between noisy and less noisy basis states.

Senapati, Priyabrata [Kent State University]↗

Quantum computing in power systems

Electric power systems provide the backbone of modern industrial societies. Enabling scalable grid analytics is the keystone to successfully operating large transmission and distribution systems. However, today's power systems are suffering from ever-increasing computational burdens in sustaining the expanding communities and deep integration of renewable energy resources, as well as managing huge volumes of data accordingly. These unprecedented challenges call for transformative analytics to support the resilient operations of power systems. Recently, the explosive growth of quantum computing techniques has ignited new hopes of revolutionizing power system computations. Quantum computing harnesses quantum mechanisms to solve traditionally intractable computational problems, which may lead to ultra-scalable and efficient power grid analytics. This paper reviews the newly emerging application of quantum computing techniques in power systems. We present a comprehensive overview of existing quantum-engineered power analytics from different operation perspectives, including static analysis, transient analysis, stochastic analysis, optimization, stability, and control. We thoroughly discuss the related quantum algorithms, their benefits and limitations, hardware implementations, and recommended practices. We also review the quantum networking techniques to ensure secure communication of power systems in the quantum era. Finally, we discuss challenges and future research directions. This paper will hopefully stimulate increasing attention to the development of quantum-engineered smart grids.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Hybrid Quantum-Classical Neural Network for Calculating Ground State Energies of Molecules

We present a hybrid quantum-classical neural network that can be trained to perform electronic structure calculation and generate potential energy curves of simple molecules. The method is based on the combination of parameterized quantum circuits and measurements. With unsupervised training, the neural network can generate electronic potential energy curves based on training at certain bond lengths. To demonstrate the power of the proposed new method, we present the results of using the quantum-classical hybrid neural network to calculate ground state potential energy curves of simple molecules such as H 2 , LiH, and BeH 2 . The results are very accurate and the approach could potentially be used to generate complex molecular potential energy surfaces.

74 ATOMIC AND MOLECULAR PHYSICS↗

Quantum Software Engineering (Dagstuhl Seminar 24512)

The Dagstuhl Seminar 24512 on "Quantum Software Engineering" was held from December 15 to 20, 2024. It brought together 26 participants from industry and academia from 13 different countries, including senior and junior researchers as well as practitioners in the field of Quantum Software Engineering. The aim of the seminar was to advance software engineering methods and tools for the engineering of hybrid quantum systems by promoting personal interaction and open discussion among researchers who are already working in this emerging area of knowledge. The first day of the seminar was devoted to the topic "When software engineering meets quantum mechanics", while the second day focused on "Quantum software engineering and its challenges." During both days, 16 invited presentations were given. The rest of the seminar was organized into three working groups to address the topics "Quantum Software Design, Modelling and Architecturing", "Adaptive Hybrid Quantum Systems", and "Quantum Software Quality Assurance". The seminar was a very fruitful experience for all participants both in terms of scientific outcomes and in terms of the personal relationships that were generated to jointly address future experiences.

97 MATHEMATICS AND COMPUTING↗

Machine learning framework for quantum sampling of highly constrained, continuous optimization problems

In recent years, there is growing interest in using quantum computers for solving combinatorial optimization problems. In this work, we developed a generic, machine learning-based framework for mapping continuous-space inverse design problems into surrogate quadratic unconstrained binary optimization (QUBO) problems by employing a binary variational autoencoder and a factorization machine. The factorization machine is trained as a low-dimensional, binary surrogate model for the continuous design space and sampled using various QUBO samplers. Using the D-Wave Advantage hybrid sampler and simulated annealing, we demonstrate that by repeated resampling and retraining of the factorization machine, our framework finds designs that exhibit figures of merit exceeding those of its training set. We showcase the framework’s performance on two inverse design problems by optimizing (i) thermal emitter topologies for thermophotovoltaic applications and (ii) diffractive meta-gratings for highly efficient beam steering. This technique can be further scaled to leverage future developments in quantum optimization to solve advanced inverse design problems for science and engineering applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hybrid Quantum Mechanical, Molecular Mechanical, and Machine Learning Potential for Computing Aqueous-Phase Adsorption Free Energies on Metal Surfaces

Performing reliable computer simulations of elementary processes occurring at metal–water interfaces is pivotal for novel catalyst design in sustainable energy applications. Computational catalyst design hinges on the ability to reliably and efficiently compute the potential energy surface (PES) of the system. Here, due to the large system sizes needed for studying processes at liquid water–metal interfaces, these systems can currently not be described using density functional theory (DFT). In this work, we used a hybrid quantum mechanical, molecular mechanical, and machine learning potential for studying the adsorption behavior of phenol, atomic hydrogen, 2-butanol, and 2-butanone on the (0001) facet of Ru under reducing conditions when Ru is not oxidized. Specifically, we describe the adsorbate and the surrounding metal atoms at the DFT level of theory. Here, we also considered the electrostatic field effect of the water molecules on adsorbate–metal interactions. Next, for the water–water and water–adsorbate interactions, we used established classical force fields. Finally, for the water–Ru surface interaction, for which no reliable force fields have been published, we used Behler–Parrinello high-dimensional neural network potentials (HDNNPs). Employing this setup, we used our explicit solvation for metal surface (eSMS) approach to compute the aqueous-phase effect on the low-coverage adsorption of selected molecules and atoms on the (0001) facet of Ru. In agreement with previous experimental and computational studies of oxygenated molecules over transition metal facets, we found that liquid water destabilizes the tested adsorbates on Ru(0001). Interestingly, our findings indicate that adsorbates on Ru are less affected by the presence of an aqueous phase than on other transition metals (e.g., Pt), highlighting the necessity of experimental investigations of Ru-based catalytic systems in liquid water.

Adsorption↗

Prediction and compression of lattice QCD data using machine learning algorithms on quantum annealer

We present regression and compression algorithms for lattice QCD data utilizing the efficient binary optimization ability of quantum annealers. In the regression algorithm, we encode the correlation between the input and output variables into a sparse coding machine learning algorithm. The trained correlation pattern is used to predict lattice QCD observables of unseen lattice configurations from other observables measured on the lattice. In the compression algorithm, we define a mapping from lattice QCD data of floating-point numbers to the binary coefficients that closely reconstruct the input data from a set of basis vectors. Since the reconstruction is not exact, the mapping defines a lossy compression, but, a reasonably small number of binary coefficients are able to reconstruct the input vector of lattice QCD data with the reconstruction error much smaller than the statistical fluctuation. In both applications, we use D-Wave quantum annealers to solve the NP-hard binary optimization problems of the machine learning algorithms.

79 ASTRONOMY AND ASTROPHYSICS↗

Detecting Quantum Critical Points of Correlated Systems by Quantum Convolutional Neural Network Using Data from Variational Quantum Eigensolver

Machine learning has been applied to a wide variety of models, from classical statistical mechanics to quantum strongly correlated systems, for classifying phase transitions. The recently proposed quantum convolutional neural network (QCNN) provides a new framework for using quantum circuits instead of classical neural networks as the backbone of classification methods. We present the results from training the QCNN by the wavefunctions of the variational quantum eigensolver for the one-dimensional transverse field Ising model (TFIM). We demonstrate that the QCNN identifies wavefunctions corresponding to the paramagnetic and ferromagnetic phases of the TFIM with reasonable accuracy. The QCNN can be trained to predict the corresponding ‘phase’ of wavefunctions around the putative quantum critical point even though it is trained by wavefunctions far away. The paper provides a basis for exploiting the QCNN to identify the quantum critical point.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗