Search NASASearch

SEARCH · Search NASA

Results for “Quantum Advantage”

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 Path Towards Quantum Advantage in Training Deep Generative Models with Quantum Annealing

A class of quantum-classical hybrid machine-learning algorithms can be obtained by integrating classical deep generative models with quantum probability distributions as 'priors' over their latent variables. We introduce a hybrid implementation of variational autoencoders (QVAE) and also present a technique to hybridize flow-based invertible generative models. We demonstrate the use of D-Wave quantum annealers as physical simulators of quantum Boltzmann machines (QBM) to perform quantum-assisted training of QVAE. Latent-space QBM develop slowly mixing modes, opening a path to obtain quantum advantage in generative modeling with available quantum devices.

Vinci, Walter

Modernizing Mechatronics Course With Quantum Engineering

Mechatronics is the synergistic application of mechanics, electronics, control engineering, and computer science in the development of electromechanical products and systems, through integrated design. This paper proposes to extend the mechatronics course beyond traditional engineering topics, and to modernize the mechatronics instructions with complementary quantum engineering topics. With the recent rapid advances in quantum technologies such as quantum communications, sensing, computers, and algorithms, it is imperative to train the next generation of engineers and prepare them for their future careers in the ever-changing industry in such areas. Furthermore, due to such progress and advances in the fields associated with quantum mechanics, the integration of quantum technologies with classical mechanical systems will be inevitable both in terms of educational and technological standpoints in future. To address the educational needs of the future engineers in such areas of significant importance, quantum entanglement and quantum cryptography experiments, as two fundamental topics in quantum mechanics, are brought into the mechatronics course in an initiative that is reported in this paper. The integrated quantum and mechatronics topics also provides opportunities for open discussions on exploring the interface of quantum technologies and classical engineering systems, which can potentially push the engineering boundaries beyond classical possibilities by accessing the quantum advantages. An innovative online remote demonstration of such quantum experiments are developed and presented to the students. This course has been offered to undergraduate students once with successful results. The students were able to remotely access the experiments, perform the experiments and collect data. The successful result of such quantum experiments is also reflected in a course survey, presented in this paper, even though the quantum mechanics topics offered in this course are unfamiliar to engineering students and hence more challenging. The paper reports, and aims to promote, the integration of selected quantum technology topics with the mechatronics course for training engineering students in this rapidly growing area.

Ghazinejad, Maziar

High dimensional similarity search with quantum assisted variational autoencoder

Recent progress in quantum algorithms and hardware is indicator of the potential importance of quantum computing in the next future. However, finding suitable application areas remains an active area of research. Quantum machine learning [1] is touted as a potential approach to demonstrate quantum advantage within both the gate-model [2,3] and the adiabatic [4,5] schemes. For instance, the Quantum-assisted Variational Autoencoder (QVAE) [6] has been proposed as a quantum enhancement to the discrete VAE [7]. We extend on previous work and study the real-world applicability of a QVAE, specifically, for similarity search in large-scale high dimensional datasets. While similarity search algorithms are available for low dimensional datasets, scaling to billion-scale datasets with thousands of dimensions is non-trivial. We show how the latent-space representation of a QVAE can be used to construct a space-efficient search index. We back up our claims by experimental results which show a correlation between the Hamming distance in the embedded space and the Euclidean distance in the original space on the Moderate Resolution Imaging Spectroradiometer (MODIS) dataset. Further, we show real-world speedups compared to linear search and demonstrate memory efficient scaling to large-scale datasets.

Nicholas D Gao

High-Dimensional Similarity Search with Quantum-Assisted Variational Autoencoder

Recent progress in quantum algorithms and hardware indicates the potential importance of quantum computing in the near future. However, finding suitable application areas remains an active area of research. Quantum machine learning is touted as a potential approach to demonstrate quantum advantage within both the gate-model and the adiabatic schemes. For instance, the QVAE has been proposed as a quantum enhancement to the discrete VAE. We extend on previous work and study the real-world applicability of a QVAE by presenting a proof-of-concept for similarity search in large-scale high-dimensional datasets. While exact and fast similarity search algorithms are available for low dimensional datasets, scaling to high-dimensional data is non-trivial. We show how to construct a space-efficient search index based on the latent space representation of a QVAE. Our experiments show a correlation between the Hamming distance in the embedded space and the Euclidean distance in the original space on the MODIS dataset. Further, we find real-world speedups compared to linear search and demonstrate memory-efficient scaling to half a billion data points.

Data mining, similarity search, quantum machine le

Incorporating ADAPT-VQE with a Sparse Wavefunction Circuit Simulator to Find Compact Quantum Circuits for Chemical Applications

We implemented the ADAPT-VQE algorithm into our recent classical sparse wavefunction circuit simulator to demonstrate that classical resources can (1) efficiently find a physically motivated compact wavefunction ansatz for further refinement on near-term quantum hardware and (2) benchmark expected results of VQE-based algorithms once the quantum hardware is available to study large-scale applications. In particular, we study the role of the ADAPT-VQE operator pool, molecular basis set selection, and variations such as TETRIS-ADAPT-VQE on the performance of our classical circuit simulator. This work demonstrates the promise of using classical resources to generate highly accurate wavefunctions that can be prepared on quantum hardware to initiate other quantum algorithms such as phase estimation. Our approach harnesses the power of high-performance computing resources with the more limited available quantum computers to map a path toward quantum advantage for electronic structure calculations in chemistry and materials science.

Quantum Computing

Symmetry and Error Mitigation in Quantum Alternating Operator Ansatz

Quantum Alternating Operator Ansatz (QAOA) provides a platform for probing quantum advantage in optimization problems on NISQ hardware. By exploring symmetries in the system and the structure of unitaries in the algorithm, we proposed using problem-specific mixing operators to limit the quantum evolution within a subspace where the target state lives. As an example, in case of equality constraint, we studied the use of XY operators that preserve total Pauli Z. This QAOA variant, in the noiseless case, significantly outperforms the vanilla version of QAOA where the constraints are encoded as penalty in the cost Hamiltonian and the search is in the whole Hilbert space. In presence of noise, although the advantage still holds, error mitigation is needed for QAOA. I will overview our work on the design of QAOA in presence of symmetry, the implementation and compilation of XY-QAOA, its performance and error mitigation techniques in presence of noise.

Zhihui Wang

Surrogate Optimization for Quantum Circuits

Variational quantum Eigensolvers are touted as a near-term algorithm capable of impacting many applications. However, the potential has yet to be realized with few claims of quantum advantage and high resource estimates mainly due to the need for optimization in the presence of noise. Finding algorithms and methods to improve the convergence is essential to accelerate the capabilities of near-term hardware for VQE or more broad applications of hybrid methods in which optimization is required. To this goal we look to use modern approaches recently developed in circuit simulations and stochastic classical optimization that can be combined in a surrogate optimization approach to classical circuits. Using an approximate state vector simulator, we efficiently calculate an approximate Hessian, fed as an input for a detailed quantum circuit simulator. We demonstrate the capabilities of such an approach with and without sampling noise. We also show that this method outperforms Powell in the presence of quantum circuit shot noise by a factor of 2-4

quantum computing

Simultaneous Stoquasticity

Stoquastic Hamiltonians play a role in the computational complexity of the local Hamiltonian problem as well as the study of classical simulability. In particular, stoquastic Hamiltonians can be straightforwardly simulated using Monte Carlo techniques. We address the question of whether two or more Hamiltonians may be made simultaneously stoquastic via a unitary transformation. This question has important implications for the complexity of simulating quantum annealing where quantum advantage is related to the stoquasticity of the Hamiltonians involved in the anneal. We find that for almost all problems no such unitary exists and show that the problem of determining the existence of such a unitary is equivalent to identifying if there is a solution to a system of polynomial (in)equalities in the matrix elements of the initial and transformed Hamiltonians. Solving such a system of equations is NP-hard. We highlight a geometric understanding of this problem in terms of a collection of generalized Bloch vectors.

Monte Carlo

Simultaneous Stoquasticity

Stoquastic Hamiltonians play a role in the computational complexity of the local Hamiltonian problem as well as the study of classical simulability. In particular, stoquastic Hamiltonians can be straightforwardly simulated using Monte Carlo techniques. We address the question of whether two or more Hamiltonians may be made simultaneously stoquastic via a unitary transformation. This question has important implications for the complexity of simulating quantum annealing where quantum advantage is related to the stoquasticity of the Hamiltonians involved in the anneal. We find that for almost all problems no such unitary exists and show that the problem of determining the existence of such a unitary is equivalent to identifying if there is a solution to a system of polynomial (in)equalities in the matrix elements of the initial and transformed Hamiltonians. Solving such a system of equations is NP-hard. We highlight a geometric understanding of this problem in terms of a collection of generalized Bloch vectors.

Jacob Bringewatt

Cross-Government Development of Space-Based Quantum Sensors for Earth and Space Science

Quantum sensing technologies promise advantages over their traditional counterparts in terms of sensitivity and accuracy, including higher signal-to-noise ratios, better measurement resolution and sensitivity, and accuracies that can be tied to fundamental constants. As a result of the potentially promising advantages of quantum sensing technologies, the multi-agency Space Science and Technology Partnership Forum (S&T Forum), consisting of NASA, NRO, and USSF, conducted a 2023 study to identify the current state of space-based quantum sensing technology development that will enable cutting-edge Earth and space science. The findings contained within this work provide insight into quantum sensing and quantum enabling technology work across the S&T Forum to inform technology development and identify potential government, industry, and academic coordination and collaboration opportunities in quantum sensing within the Earth and space science community. The results herein focus on the collation of quantum sensing technologies, facilities, and developers captured from the participants of the study to provide a broad overview of quantum sensor development for the Earth and space science community; specifically highlighting how five particular areas of quantum sensing technology (listed in alphabetical order) are of near-term interest to all three S&T Forum agencies: atomic clocks, atom interferometers, quantum magnetometers, Rydberg sensors, and single photon detectors. The findings in this work point to the intent of the S&T Forum agencies to lean into the development of quantum sensing technology in which the three agencies have mutual near-term interest, including cross-cutting enabling component technologies. The information presented provides points of entry in terms of people, facilities, and quantum sensing technology work within the government as well as increased transparency into the five quantum sensing technology areas of mutual interest of the S&T Forum agencies to remove barriers and encourage participation and partnership with the Earth and space science community.

Quantum

Hidden Statistics Approach to Quantum Simulations

Recent advances in quantum information theory have inspired an explosion of interest in new quantum algorithms for solving hard computational (quantum and non-quantum) problems. The basic principle of quantum computation is that the quantum properties can be used to represent structure data, and that quantum mechanisms can be devised and built to perform operations with this data. Three basic non-classical properties of quantum mechanics superposition, entanglement, and direct-product decomposability were main reasons for optimism about capabilities of quantum computers that promised simultaneous processing of large massifs of highly correlated data. Unfortunately, these advantages of quantum mechanics came with a high price. One major problem is keeping the components of the computer in a coherent state, as the slightest interaction with the external world would cause the system to decohere. That is why the hardware implementation of a quantum computer is still unsolved. The basic idea of this work is to create a new kind of dynamical system that would preserve the main three properties of quantum physics superposition, entanglement, and direct-product decomposability while allowing one to measure its state variables using classical methods. In other words, such a system would reinforce the advantages and minimize limitations of both quantum and classical aspects. Based upon a concept of hidden statistics, a new kind of dynamical system for simulation of Schroedinger equation is proposed. The system represents a modified Madelung version of Schroedinger equation. It preserves superposition, entanglement, and direct-product decomposability while allowing one to measure its state variables using classical methods. Such an optimal combination of characteristics is a perfect match for simulating quantum systems. The model includes a transitional component of quantum potential (that has been overlooked in previous treatment of the Madelung equation). The role of the transitional potential is to provide a jump from a deterministic state to a random state with prescribed probability density. This jump is triggered by blowup instability due to violation of Lipschitz condition generated by the quantum potential. As a result, the dynamics attains quantum properties on a classical scale. The model can be implemented physically as an analog VLSI-based (very-large-scale integration-based) computer, or numerically on a digital computer. This work opens a way of developing fundamentally new algorithms for quantum simulations of exponentially complex problems that expand NASA capabilities in conducting space activities. It has been illustrated that the complexity of simulations of particle interaction can be reduced from an exponential one to a polynomial one.

Zak, Michail

Quantum-Assisted Variational Segmentation for Image-to-Image Wildfire Detection Using Satellite Data

The quantum computing community has been searching for suitable applications to demonstrate the potential of near-term quantum devices. Quantum machine learning is a potential candidate, particularly using models that cannot be efficiently simulated with classical computers [1, 2]. This work focuses on a transition phase of quantum computers where the quantum machine learning model is still simulable classically but projected not to be simulable as the size of the model grows. Ultimately quantum computers may have advantages for high-dimensional real-world problems. Due to the limited number of qubits in current noisy intermediate-scale quantum (NISQ) devices, the direct application of quantum computers in high dimensional data is not feasible. To remedy this problem, an encoder-decoder architecture can be utilized. The encoder model would transform the high-dimensional data into a compact representation, to a level that small quantum computers can be used today (or in the near future), and the decoder would take the quantum processed outputs back to the high-dimensional space. Addressing the two challenges of quantum machine learning, this work investigates a hybrid supervised generative model with a quantum Ising Born machine embedded as the latent distribution. The model contains four main parts (Figure 1.a.): (1) a U-NET architecture responsible for learning segmentation flow, (2) a Prior network responsible for learning an encoded latent distribution of the input data, (3) a Born machine which represents the latent distribution, and (4) a Posterior network in charge of learning the joint encoded latent distribution of inputs and target data. The initial model, proposed by [3], is optimized by (1) maximizing the overlap of the prior and posterior latent distributions, and (2) minimizing the segmentation loss. The proposed model is designed to be investigated in a simulation environment applied to the real-world application of wildfire segmentation. Specifically, the model is designed to solve the patchy wildfire segmentations of Moderate Resolution Imaging Spectroradiometer (MODIS) by taking the MODIS observations and using Visible Infrared Imaging Radiometer Suite’s (VIIRS) consistent wildfire product as the target. The model solves patchy wildfire segmentations and provides insight into the epistemic errors sourced from model variation. The model utilizes the Born machine as a QUBO solver to represent the latent space as a Bernoulli distribution. The proposed configuration allows the variational segmentation model to leverage the true quantum probabilistic nature and derive a more expressive latent configuration, increasing the model performance in describing wildfire segmentations. The quantum probabilistic information of the Born machine is directly incorporated in the Kullback-Leibler divergence loss in the prior and posterior distributions, forcing the Bernoulli latent distribution to maximize the overlap of input and joint input-target distributions. The proposed model is then trained and compared with a baseline only consisting of direct Bernoulli latent distribution with no Born machine representing the latent space. The models are evaluated based on the segmentation metrics, such as precision, recall, intersect of union, with uncertainty boundaries accounting for the stochastic nature of the model. Our findings show that even in low latent-dimensional space (due to the limit in computational power of the classical quantum simulator), we are able to effectively capture the latent representation and hence the model performs better than the baseline. The findings are a projection for scaling the model into higher dimensional latent space with the Born machine surpassing the baseline performance. Figure 1. Sub-figure (a) demonstrates the architecture for the training phase. The model consists of a Prior and Posterior network that encode inputs and joint input-target data into compact representations, respectively. The Born machine represents the latent distribution, and the U-NET branch learns the segmentation patterns of the data. The stochasticity is introduced to the U-NET through its last layer to create meaningful but stochastic segmentations. Sub-figure (b) represents the inference phase where the model takes the stochastic behavior from the prior network and injects that into the U-NET. Each attempt of inference will generate different but similar segmentations from the same distribution of the wildfire event. REFERENCES [1] Coyle, B., Mills, D., Danos, V., & Kashefi, E. (2020). The Born supremacy: quantum advantage and training of an Ising Born machine. npj Quantum Information, 6(1), 1-11. [2] Liu, J. G., & Wang, L. (2018). Differentiable learning of quantum circuit born machines. Physical Review A, 98(6), 062324. [3] Kohl, S., Romera-Paredes, B., Meyer, C., De Fauw, J., Ledsam, J. R., Maier-Hein, K., ... & Ronneberger, O. (2018). A probabilistic u-net for segmentation of ambiguous images. Advances in neural information processing systems, 31.

quantum machine learning

A NASA Perspective on Quantum Computing: Algorithmic Opportunities and Challenges

In the last couple of decades, the world has seen several stunning instances of quantum algorithms that provably outperform the best classical algorithms. For most problems, however, it is currently unknown whether quantum algorithms can provide an advantage, and if so how to design quantum algorithms that realize such advantages. Today, classical heuristics are used to solve many of the most challenging computational problems arising in the practical world, algorithms that have been shown to be effective empirically but have not been mathematically proven to outperform other approaches. With the advent of quantum advantage, the ability of current quantum hardware to do certain computations beyond the ability of even that largest supercomputers, we have an unprecedented opportunity to explore heuristic quantum algorithms. The next few years will be exciting as empirical testing of quantum heuristic algorithms becomes more and more feasible. The talk will begin overview of the NASA QuAIL team’s ongoing quantum computing investigations, and then focus on both near-term and longer term algorithms for optimization, including distributed algorithms.

quantum computing

Quantum Machine Learning

Quantum computing promises an unprecedented ability to solve intractable problems by harnessing quantum mechanical effects such as tunneling, superposition, and entanglement. The Quantum Artificial Intelligence Laboratory (QuAIL) at NASA Ames Research Center is the space agency's primary facility for conducting research and development in quantum information sciences. QuAIL conducts fundamental research in quantum physics but also explores how best to exploit and apply this disruptive technology to enable NASA missions in aeronautics, Earth and space sciences, and space exploration. At the same time, machine learning has become a major focus in computer science and captured the imagination of the public as a panacea to myriad big data problems. In this talk, we will discuss how classical machine learning can take advantage of quantum computing to significantly improve its effectiveness. Although we illustrate this concept on a quantum annealer, other quantum platforms could be used as well. If explored fully and implemented efficiently, quantum machine learning could greatly accelerate a wide range of tasks leading to new technologies and discoveries that will significantly change the way we solve real-world problems.

Biswas, Rupak

Quantum efficiencies of imaging detectors with alkali halide photocathodes. I - Microchannel plates with separate and integral CsI photocathodes

Measurements and comparisons have been made of the quantum efficiencies of microchannel plate (MCP) detectors in the far-UV (below 2000-A) wavelength range using CsI photocathodes (a) deposited on the front surfaces of microchannel plates and (b) deposited on solid substrates as opaque photocathodes with the resulting photoelectrons input to microchannel plates. The efficiences were measured in both pulse-counting and photodiode modes of operation. Typical efficiencies are about 15 percent at 1216 A for a CsI-coated MCP compared with 65 percent for an opaque CsI photocathode MCP detector. Special processing has yielded an efficiency as high as 20 percent for a CsI-coated MCP. This may possibly be further improved by optimization of the tilt angle of the MCP channels relative to the front face of the MCP and incident radiation. However, at present there still remains a factor of at least 3 quantum efficiency advantage in the separate opaque CsI photocathode configuration.

Carruthers, George R.

Advantages of an indirect semiconductor quantum well system for infrared detection

The infrared intersubband absorption process in quantum well systems with anisotropic bulk effective masses, which usually occurs in indirect semiconductors was analyzed. It is found that the anisotropic effective mass can be utilized to provide allowed intersubband transitions at normal incidence to the quantum well growth direction. This transition is known to be forbidden for cases of isotropic effective mass. This property can be exploited for infrared sensor application of quantum well structures by allowing direct illumination of large surface areas without using special waveguide structures. The 10-micron intersubband absorption in quantum wells made of the silicon-based system Si/Si(1-x)Ge(x) was calculated. It is found that it is readily possible to achieve an absorption constant of the order of 10,000/cm in these Si quantum wells with current doping technology.

Yang, Chan-Lon

Intersubband absorption of silicon-based quantum wells for infrared imaging

The 10-micron intersubband absorption in quantum wells made of the silicon-based system, Si/Si(1-x)Ge(x), has been calculated. The necessary details of the effective-mass anisotropy are included in the present analysis. It is found that it is readily possible to achieve an absorption constant of order of 10,000/cm in Si quantum wells with current doping technology. For 110-line and 111-line growth directions, a further advantage of Si quantum wells is pointed out, namely, an allowed absorption at normal incidence due to the anisotropic effective mass in Si.

Yang, Chan-Ion

Characteristics of square pore and low noise microchannel plate stacks

An evaluation is conducted of several square-pore microchannel plates (MCPs) with either 25- or 85-micron diameter pores and 80:1 or 50:1 channel length/diameter ratio. Flat field measurements show that the 25-micron-pored MCPs, unlike those with 85-micron pores, exhibit periodic modulation; this may be due to the MCP stacking configurations. Attention is given to the relative quantum detection efficiency advantages of the two MCPs.

Siegmund, Oswald H. W.