Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quantum machine”

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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Q-Cluster: Quantum Error Mitigation Through Noise-Aware Unsupervised Learning

Quantum error mitigation (QEM) is critical in reducing the impact of noise in the pre-fault-tolerant era, and is expected to complement error correction in fault-tolerant quantum computing (FTQC). In this work, we propose a novel QEM approach, Q-Cluster, that uses unsupervised learning (clustering) to reshape the measured bit-string distribution. Our approach starts with a simplified bit-flip noise model. It first performs clustering on noisy measurement results, i.e., bit-strings, based on the Hamming distance. The centroid of each cluster is calculated using a qubit-wise majority vote. Next, the noisy distribution is adjusted with the clustering outcomes and the bitflip error rates using Bayesian inference. Our simulation results show that Q-Cluster can mitigate high noise rates (up to 40% per qubit) with the simple bit-flip noise model. However, real quantum computers do not fit such a simple noise model. To address the problem, we (a) apply Pauli twirling to tailor the complex noise channels to Pauli errors, and (b) employ a machine learning model, ExtraTrees regressor, to estimate an effective bit-flip error rate using a feature vector consisting of machine calibration data (gate & measurement error rates), circuit features (number of qubits, numbers of different types of gates, etc.) and the shape of the noisy distribution (entropy). Our experimental results show that our proposed Q-Cluster scheme improves the fidelity by a factor of 1.46x, on average, compared to the unmitigated output distribution, for a set of low-entropy benchmarks on five different IBM quantum machines. Our approach outperforms the state-of-art QEM approaches RZNE [28], M3 [24], Hammer [35], and QBEEP [33] by 1.26x,1.29x,1.47x, and 2.65 x, respectively.

42 ENGINEERING↗
DOE OSTI2022

Efficient quantum state tomography with mode-assisted training

Neural networks (NNs) representing quantum states are typically trained using Markov chain Monte Carlo based methods. However, unless specifically designed, such samplers only consist of local moves, making the slow-mixing problem prominent even for extremely simple quantum states. Here, we propose to use mode-assisted training that provides global information via the modes of the NN distribution. Further, applied to quantum state tomography using restricted Boltzmann machines, this method improves the quality of reconstructed quantum states by orders of magnitude. The method is applicable to other types of NNs and may efficiently tackle problems previously unmanageable.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Exploring strongly correlated quantum spin systems with quantum computers

At inception, quantum annealing leveraged quantum mechanics for classical optimization tasks. However, as machine coherence increases, the realization of quantum spin systems has emerged as an even more fruitful application of this computational model. Alternatives to the standard gate model deserve exploration, to achieve useful quantum advantage via analog quantum computing. The recent demonstration of so-called coherent quantum annealing with 1,000s of qubits, further expands the potential for this hardware to explore quantum system dynamics where the effects of quantum fluctuations can be carefully controlled and observed directly. Implementing existing celebrated spin models—or in fact new and dedicated ones—into quantum annealers will lead to observation and detection of quantum phenomena not yet observed, or not visualized directly, in experimental physics laboratories. Rather than computing or simulating quantum systems, these quantum computers allow one to simply build quantum systems, and experiment on them in an uniquely controlled way, with characterization down to the constitutive degree of freedom. This provides an unprecedented opportunity for understanding the physics of quantum spin systems. Keywords: Theoretical physics currently abounds of interesting theoretical spin models to explore frustration, strongly correlated spins, spin liquids, fractionalized excitations, and topological matter. However enticing, such models are generally only weak proxies for the properties of actual materials. In quantum annealers these models could be realized and experimented upon. Moreover, many more realistic models of such materials could be realized in quantum annealers. Employed in this way, quantum annealers provide an extraordinary versatile platform to explore quantum effects that are hard to find, detect, and characterize in natural materials.

36 MATERIALS SCIENCE↗
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 OSTI2023

Measurement-induced entanglement phase transitions in variational quantum circuits

Variational quantum algorithms (VQAs), which classically optimize a parametrized quantum circuit to solve a computational task, promise to advance our understanding of quantum many-body systems and improve machine learning algorithms using near-term quantum computers. Prominent challenges associated with this family of quantum-classical hybrid algorithms are the control of quantum entanglement and quantum gradients linked to their classical optimization. Known as the barren plateau phenomenon, these quantum gradients may rapidly vanish in the presence of volume-law entanglement growth, which poses a serious obstacle to the practical utility of VQAs. Inspired by recent studies of measurement-induced entanglement transition in random circuits, we investigate the entanglement transition in variational quantum circuits endowed with intermediate projective measurements. Considering the Hamiltonian Variational Ansatz (HVA) for the XXZ model and the Hardware Efficient Ansatz (HEA), we observe a measurement-induced entanglement transition from volume-law to area-law with increasing measurement rate. Moreover, we provide evidence that the transition belongs to the same universality class of random unitary circuits. Importantly, the transition coincides with a “landscape transition” from severe to mild/no barren plateaus in the classical optimization. Our work may provide an avenue for improving the trainability of quantum circuits by incorporating intermediate measurement protocols in currently available quantum hardware.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Development of a machine-learning-based ionic-force correction model for quantum molecular dynamic simulations of warm dense matter

In this work Δ learning is used to map orbital-free density functional theory (OF-DFT) ionic forces to the corresponding Kohn-Sham (KS) DFT ionic forces. The development of the approximate force difference in terms of the ion positions is constructed and serves as a stand in for the ground truth force difference. Descriptor vectors for ion configurations are constructed using all distance between ions in conjunction with an indexing based on a nearest neighbor ranking. It is demonstrated that such a scheme of descriptors can uniquely describe an ionic configuration up to a rotation and reflection when no ambiguity in the nearest neighbor ranking exists. How to handle the case when an ambiguity exists in the nearest neighbor ranking is discussed. As a proof of principle, the model is trained and tested on warm dense hydrogen at temperatures between 1 and 15 eV. Once tested, the model was used to perform molecular dynamic simulations of warm dense hydrogen. Furthermore, the resulting energies and pressures are within 1% and 2% of their respective target KS values.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Machine learning of high dimensional data on a noisy quantum processor

Abstract Quantum kernel methods show promise for accelerating data analysis by efficiently learning relationships between input data points that have been encoded into an exponentially large Hilbert space. While this technique has been used successfully in small-scale experiments on synthetic datasets, the practical challenges of scaling to large circuits on noisy hardware have not been thoroughly addressed. Here, we present our findings from experimentally implementing a quantum kernel classifier on real high-dimensional data taken from the domain of cosmology using Google’s universal quantum processor, Sycamore. We construct a circuit ansatz that preserves kernel magnitudes that typically otherwise vanish due to an exponentially growing Hilbert space, and implement error mitigation specific to the task of computing quantum kernels on near-term hardware. Our experiment utilizes 17 qubits to classify uncompressed 67 dimensional data resulting in classification accuracy on a test set that is comparable to noiseless simulation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Machine-Guided Design of Oxidation-Resistant Superconductors for Quantum Information Applications

Decoherence in superconducting qubits has long been attributed to two-level systems arising from the surfaces and interfaces present in real devices. A recent significant step in reducing decoherence was the replacement of superconducting niobium by superconducting tantalum, resulting in a tripling of transmon qubit lifetimes (T1). The identity, thickness, and quality of the native surface oxide, is thought to play a major role, as tantalum only has one oxide whereas niobium has several. Here we report the development of a thermodynamic metric to rank materials based on their potential to form a well-defined, thin, surface oxide. We first computed this metric for known binary and ternary metal alloys using data available from the Materials Project and experimentally validated the strengths and limits of this metric through the preparation and controlled oxidation of eight known metal alloys. Then we trained a convolutional neural network to predict the value of this metric from atomic composition and atomic properties. This allowed us to compute the metric for materials that are not present in the Materials Project, including a large selection of known superconductors, and, when combined with Tc, allowed us to identify new candidate superconductors for quantum information science and engineering (QISE) applications. We tested the oxidation resistance of a pair of these predictions experimentally. Our results are expected to lay the foundation for the tailored and rapid selection of improved superconductors for QISE.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Phase transitions and dimensional cross-over in layered confined solids

The nature of solid phases and cross-over of order–disorder phase transitions from two-dimensional (2D) layers to three-dimensional (3D) bulk in confined atomic systems remain largely unexplained. To this end, we consider noble gases and aluminum confined between graphene sheets at different pressures and temperatures. Using crystal structure search methods and molecular dynamics based on machine-learned potentials with quantum-mechanical accuracy, we identify structures of multilayer confined solids that deviate from simple close packing. Upon heating, we find that confined 2D monolayers melt according to the two-step continuous Kosterlitz–Thouless–Halperin–Nelson–Young theory. However, multilayer solids transition continuously into an intermediate layered-hexatic phase before melting discontinuously into an isotropic liquid. This intermediate phase persists at least up to 12 layers studied here. This change can be qualitatively understood based on the cross-over from 2D topological defects toward 3D ones during melting as the number of layers increases.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Unified architecture for quantum lookup tables

Quantum access to arbitrary classical data encoded in unitary black-box oracles underlies interesting data-intensive quantum algorithms, such as machine learning or electronic structure simulation. The feasibility of these applications depends crucially on gate-efficient implementations of these oracles, which are commonly some reversible versions of the Boolean circuit for a classical lookup table. Here, we present a general parametrized architecture for quantum circuits implementing a lookup table that encompasses all prior work in realizing a continuum of optimal trade-offs between qubits, non-Clifford gates, and error resilience, up to logarithmic factors. Our architecture assumes only local 2D connectivity, yet recovers results, with the appropriate parameters, polylogarithmic error scaling. We also identify regimes, such as simultaneous sublinear scaling, in all parameters. These results enable tailoring implementations of the commonly used lookup table primitive to any given quantum device with constrained resources.

quantum circuits↗
DOE OSTI2021

Adiabatic quantum linear regression

Abstract A major challenge in machine learning is the computational expense of training these models. Model training can be viewed as a form of optimization used to fit a machine learning model to a set of data, which can take up significant amount of time on classical computers. Adiabatic quantum computers have been shown to excel at solving optimization problems, and therefore, we believe, present a promising alternative to improve machine learning training times. In this paper, we present an adiabatic quantum computing approach for training a linear regression model. In order to do this, we formulate the regression problem as a quadratic unconstrained binary optimization (QUBO) problem. We analyze our quantum approach theoretically, test it on the D-Wave adiabatic quantum computer and compare its performance to a classical approach that uses the Scikit-learn library in Python. Our analysis shows that the quantum approach attains up to $${2.8 \times }$$ 2.8 × speedup over the classical approach on larger datasets, and performs at par with the classical approach on the regression error metric. The quantum approach used the D-Wave 2000Q adiabatic quantum computer, whereas the classical approach used a desktop workstation with an 8-core Intel i9 processor. As such, the results obtained in this work must be interpreted within the context of the specific hardware and software implementations of these machines.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Grain boundary segregation in BCC vanadium-based alloys: Quantum-accurate computed segregation spectra and targeted experimental validations

Grain boundaries are critically important to the material performance of fusion reactor materials such as vanadium, particularly mechanical properties and irradiation resistance. A key challenge to the design and control of grain boundaries in vanadium alloys is the lack of quantitative data on grain boundary segregation. In this study, we combine computational and experimental methods to address this gap. Furthermore, using a machine learning-accelerated quantum mechanics/molecular mechanics approach, we calculated the segregation spectra for 28 transition metal elements in polycrystalline vanadium, and validated these predictions experimentally for a subset of solutes that sample a range of segregation behavior, specifically zirconium, titanium, and tungsten, using analytical transmission electron microscopy. Furthermore, the agreement between experiment and theory highlights the predictive capability of our approach. Critically, this work provides a comprehensive database of quantum-accurate solute segregation enthalpies in vanadium, enabling the development of advanced alloys for fusion reactors applications.

Fusion materials↗