Quantum Computing has been invigorated by the introduction of the first commercially available computers. Quantum Annealers (QAs) like the D-Wave are now housing ~5000 quantum-bits, and quantum computing, a potentially disruptive technology, is closer to becoming a reality than ever. Here we investigate quantum-assisted approaches to image registration of MODIS images using QAs. We present two approaches: (1) a mapping of image matching to a quadratic-unconstrained-binary optimization problem and (2) a machine learning approach that employs generative models trained using quantum annealing statistics. Results are shown and discussed.
Quantum Computing has been invigorated by the introduction of the first commercially available computers. Quantum Annealers (QAs) like the D-Wave are now housing ~5000 quantum-bits, and quantum computing, a potentially disruptive technology, is closer to becoming a reality than ever. Here we investigate quantum-assisted approaches to image registration of MODIS images using QAs. We present two approaches: (1) a mapping of image matching to a quadratic-unconstrained-binary optimization problem and (2) a machine learning approach that employs generative models trained using quantum annealing statistics. Results are shown and discussed.
To date, conventional computers have never been able to efficiently handle certain tasks, where the number of computation steps is likely to blow up as the problem size increases. As an emerging technology and new computing paradigm, quantum computing has a great potential to tackle those hard tasks efficiently. Among all the existing quantum computation models, quantum annealing has drawn significant attention in recent years due to the realization of the commercialized quantum annealer, sparking research interests in developing applications to solve problems that are intractable for classical computers.However, designing and implementing algorithms that manage to harness the enormous computation power from quantum annealer remains a challenging task. Generally, it requires mapping of the given optimization problem into quadratic unconstrained binary optimization(QUBO) problem and embedding the subsequent QUBO onto the physical architecture of quantum annealer. Additionally, practical quantum annealers are susceptible to errors leading to low probability of the correct solution.In this study, we focus on solving Boolean satisfiability (SAT) problem using quantum annealer while addressing practical limitations. We have proposed a mapping technique that maps SAT problem to QUBO, and we have further devised a tool flow that embeds the QUBO onto the architecture of a quantum annealing device. Additionally, We have optimized the proposed embedding flow to reduce run-time in addition to shortening the qubit chain length, leading to robust quantum annealing. To further improve the reliability of quantum annealing, we have also developed a post processing embedding technique that enlarges the energy gap between ground state and the first excited state. To demonstrate the effectiveness of proposed methods, we have conducted experiments on real quantum annealing devices manufactured by D-Wave Systems, showing compelling result of using quantum annealer to solve SAT problem.
This tutorial offers a quick, hands-on introduction to solving Quadratic Unconstrained Binary Optimization (QUBO) models on currently available quantum computers and their simulators. We cover both IBM and D-Wave machines: IBM utilizes a gate-circuit architecture, and D-Wave is a quantum annealer. We provide examples of three canonical problems and two models from practical applications. The tutorial is structured to bridge the gap between theory and practice: we begin with an overview of QUBOs, explain their relevance and connection to quantum algorithms, introduce key quantum computing concepts, provide the foundations for two quantum heuristics, and provide detailed implementation guides. An associated GitHub repository provides the codes in five companion notebooks. In addition to reaching undergraduate and graduate students in computationally intensive disciplines, this article aims to reach working industry professionals seeking to explore the potential of near-term quantum applications. As our title indicates, this tutorial is intended to be a starting point in a journey towards solving more complex QUBOs on quantum computers.
Space science and technology are among the most challenging and strategic fields in which quantum computing promises to have a pervasive and long-lasting impact. We provide an overview of selected published works reporting the application of quantum computing to space science and technology. Our systematic analysis identifies three major classes of problems that have been approached with quantum computing. The first category includes optimization tasks, often cast into Quadratic Unconstrained Binary Optimization and solved using quantum annealing, with scheduling problems serving as a notable example. A second class comprises learning tasks, such as image classification in Earth Observation, often tackled with gate-based hybrid quantum-classical computation, namely with Quantum Machine Learning concepts and tools. Finally, integrating quantum computing with other quantum technologies may lead to new disruptive technologies, for instance, the creation of a quantum satellite internet constellation and distributed quantum computing. We organize our exposition by providing a critical analysis of the main challenges and methods at the core of different quantum computing paradigms and algorithms, which are often fundamentally similar across different domains of application in the space sector and beyond.
The development of quantum technologies opens new possibilities for the optimization of machine learning (ML) algorithms. In this contribution, we report on the experimental use of quantum computing for training ML algorithms and models designed to be deployed for inference on embedded systems with limited computational resources. Due to the small size of resource-efficient models for embedded systems, this application of quantum computing provides an excellent opportunity to evaluate a technology that is currently being developed in the noisy intermediate-scale quantum era. We develop an approach based on transforming classical supervised learning problems into a discrete form, enabling their solution using quantum annealing (QA) methods. Three models are presented: a binary XNORNet network, a support vector machine (SVM) with a discrete representation of dual coefficients, and a convolutional neural network. All experiments are performed on the MNIST dataset, using classical optimization methods, simulated annealing, and QA on the D-Wave Advantage system. While classical gradientbased methods maintain superior absolute accuracy (up to 95.97% for SVM), the D-Wave system demonstrates a significant reduction in core optimization time, achieving speedups of up to 15.6× compared to classical optimization on a central processing unit when the system overhead is excluded. Preliminary results suggest that while QA entails a slight accuracy and memory requirements penalty, a drastic reduction in active annealing duration serves as a promising strategy to reduce training latency in future embedded-focused ML applications.
Quantum computing, with its promise of exponential speedups and novel algorithms, has emerged as a revolutionary technology in various computational fields, including image processing. This survey provides a comprehensive review of the applications of quantum computing in image processing, exploring how quantum algorithms and hardware can address classical challenges such as image compression, enhancement, pattern recognition, and image recovery. The paper delves into the theoretical foundations of quantum computing, discusses current advancements, and compares quantum methods with traditional approaches. Moreover, it identifies the key challenges, such as scalability and hardware limitations, that currently hinder the widespread adoption of quantum techniques in image processing. Finally, the survey outlines future research directions, highlighting the potential for further integration of quantum computing with advanced image processing technologies like deep learning. This work aims to serve as a foundational reference for researchers and practitioners interested in the intersection of quantum computing and image processing.
The advent of commercially available quantum computers has marked the beginning of quantum computing as a reality. Both quantum gate and annealing computers have been released by major computer hardware companies. In this work, the D-Wave 2XTM quantum annealing computer housed at the NASA Advanced Systems computational facility is investigated to accelerate Machine Learning (ML) for image registration. NASA collects large amounts of images over the globe remotely using space-based monitoring. Images of a fixed areas of the land surface are taken over time. Due to the orbit of the sensors, the viewing angles deviate slightly, and it is necessary to align or register the images precisely to create image time series over the land surface. Unaligned images can lead to substantial analysis errors. These time-series are then used in modeling Earth Systems models such as hydrological, weather, and carbon monitoring models. In this work, we consider the Moderate Resolution Image Spectrometer (MODIS) data collected by the NASA's terra satellite. Artificial Neural Networks (ANNs) is a natural fit for ML modelling of images. Several successes have been reported using machine learning related to image processing. We investigate the use of ML to register MODIS images. ANNs are investigated in combination with a Restricted Boltzmann Machines (RBM) as an auto-encoder. We will present results showing the accuracy and efficiency of this approach.The D-Wave 2XTM quantum annealer samples the ground-state wave-function of a spin-Ising systems with quadratic interactions between qubits and a Chimera connectivity. The system sits in a ~15 mK thermal bath. One can think of the system as being placed in the ground state initially and subject to thermal excitations governed by Boltzmann statistics. If this is assumed true, one can use the statistics from the D-Wave 2XTM to train RBMs. Generating statistics for training Boltzmann machines is an NP-hard problem and constitutes the largest compute cost. We investigate the use of the D-Wave 2XTM to accelerate the training of the RBMs in our ANNs and report on the results.