Quantum computing has shown significant potential for addressing complex optimization and computationally intensive problems across a range of domains. Its adoption in spatial data applications presents substantial opportunities for advancing spatial computing. This tutorial provides an in-depth introduction to quantum computing, covering both the quantum circuit model (gate model) and quantum annealing, and discusses their applications in spatial computing. The tutorial is organized into three parts. The first part introduces fundamental concepts in quantum computing. The second part presents quantum gates, highlighting examples of basic gates and their use in circuits. The third part introduces quantum annealing, including Quadratic Unconstrained Binary Optimization (QUBO) modeling and hybrid solvers that combine the power of Quantum Processing Units (QPUs) with classical CPUs. The tutorial also points readers to key resources at the intersection of quantum computing and spatial computing.
Quantum computing has shown significant potential for addressing complex optimization and computationally intensive problems across a range of domains. Its adoption in spatial data applications presents substantial opportunities for advancing spatial computing. This tutorial provides an in-depth introduction to quantum computing, covering both the quantum circuit model (gate model) and quantum annealing, and discusses their applications in spatial computing. The tutorial is organized into three parts. The first part introduces fundamental concepts in quantum computing. The second part presents quantum gates, highlighting examples of basic gates and their use in circuits. The third part introduces quantum annealing, including Quadratic Unconstrained Binary Optimization (QUBO) modeling and hybrid solvers that combine the power of Quantum Processing Units (QPUs) with classical CPUs. The tutorial also points readers to key resources at the intersection of quantum computing and spatial computing.
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.
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.
The Quantum Approximate Optimization Algorithm (QAOA) is a promising variational quantum algorithm introduced to tackle classically intractable combinatorial optimization problems. This tutorial offers a comprehensive, first-principles introduction to QAOA and its properties, focusing on its application to Quadratic and Polynomial Unconstrained Binary Optimization (QUBO and PUBO) problems. The tutorial begins by outlining variational quantum circuits and QUBO problems, focusing on their key properties and the encoding of problem constraints through quadratic penalty terms. Next, it explores the QAOA in detail, covering its Hamiltonian formulation, gate decomposition, and example applications, along with their implementation and performance results. This is followed by an analysis of the algorithm's energy landscape, where proofs are provided for its symmetry and periodicity, and where a resulting parameter space reduction is proposed. Finally, the tutorial extends these concepts to PUBO problems by generalizing the results to higher-order Hamiltonians and discussing the associated symmetries and circuit construction.
Quantum computing, a transformative field that emerged from quantum mechanics and computer science, has gained immense attention for its potential to revolutionize computation. This paper aims to address the fundamentals of quantum computing and provide a comprehensive guide for both novices and experts in the field of quantum computing. Beginning with the foundational principles of quantum computing, we introduce readers to the fundamental concepts of qubits, superposition, entanglement, interference, and noise. We explore quantum hardware, quantum gates, and basic quantum circuits. This study offers insight into the current phase of quantum computing, including the noisy intermediate-scale quantum (NISQ) era and its potential for solving real-world problems. Furthermore, we discuss the development of quantum algorithms and their applications, with a focus on famous algorithms like Shor’s algorithm and Grover’s algorithm. We also touch upon quantum computing’s impact on various industries, such as cryptography, optimization, machine learning, and material science. By the end of this paper, readers will have a solid understanding of quantum computing’s principles, applications, and the steps involved in developing quantum circuits. Our goal is to provide a valuable resource for those eager to embark on their quantum computing journey and for researchers looking to stay updated on this rapidly evolving field.
With its potential to completely change computation, quantum computing—a groundbreaking discipline that sprung from computer science and quantum mechanics—has attracted a lot of interest. This essay attempts to cover the foundations of quantum computing and offer a thorough manual for readers who are not specialists in the subject. We start by going over the basic ideas of quantum computing and then take readers through the concepts of qubits, superposition, entanglement, interference, and noise. We study quantum gates, quantum hardware, and fundamental quantum circuits. This paper provides an overview of the present state of quantum computing, focusing on the noisy intermediate-scale quantum (NISQ) era and its possible applications to practical issues. delve into the creation of quantum algorithms and their uses, emphasizing well-known algorithms like as Grover's and Shor's. We also discuss how several fields, like material science, machine learning, encryption, and optimization, are affected by quantum computing. Upon finishing this paper, readers will possess a firm grasp of the fundamentals, practical uses, and procedures of quantum circuit development. Our objective is to offer an invaluable resource for scholars hoping to keep current on this quickly developing topic as well as for those ready to start their adventure with quantum computing
Quantum Bridge Analytics relates to methods and systems for hybrid classical-quantum computing and is devoted to developing tools for bridging classical and quantum computing to gain the benefits of their alliance in the present and enable enhanced practical application of quantum computing in the future. This is the second of a two-part tutorial that surveys key elements of Quantum Bridge Analytics and its applications. Part I focused on the Quadratic Unconstrained Binary Optimization (QUBO) model which is presently the most widely applied optimization model in the quantum computing area, and which unifies a rich variety of combinatorial optimization problems. Part II (the present paper) introduces the domain of QUBO-Plus models that enables a larger range of problems to be handled effectively. After illustrating the scope of these QUBO-Plus models with examples, we give special attention to an importance instance of these models called the Asset Exchange Problem (AEP).