Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Computing: A Brief Introduction and Its Applications in Spatial Computing

Amr Magdy, Ibrahim Sabek, Moustafa A. Youssef

Published Nov 3, 2025• 2 citations
Publisher

Abstract

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.

DOI
10.1145/3764923.3777406

Related papers

Quantum computing for space applications: a selective review and perspectives

Pietro Torta, Rebecca Casati, Stefano Bruni +2 more

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.

EPJ Quantum Technology•Jun 5, 2025•17 citations

Quantum Computing: Circuits, Algorithms, and Applications

Muhammad Ali Shafique, Arslan Munir, Imran Latif

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.

IEEE Access•Jan 1, 2024•111 citations

An Introduction to the Quantum Approximate Optimization Algorithm

Alessandro Giovagnoli

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.

quant-pharXiv:2511.18377•Nov 25, 2025•3 citations

Five Starter Problems: Solving Quadratic Unconstrained Binary Optimization Models on Quantum Computers

Arul Rhik Mazumder, SRIDHAR R. TAYUR

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.

arXiv:2401.08989•Oct 1, 2025•9 citations

Introduction to Quantum Computing

Shilpa Mehta, Celestine Iwendi

Quantum computing is one of the emerging fields that combines the principles of quantum mechanics with computer science. The focus of this chapter is to provide readers with a detailed introduction to quantum computing by describing the fundamental concepts that differentiate quantum computing from classical computing. Moreover, the chapter provides an overview of quantum gates followed by quantum algorithms. Various hardware and software platforms are also explored in the chapter to provide readers with information on available quantum hardware and software platforms for exploration and research purposes. Some of the important applications are also covered in the chapter, and the current state-of-the-art section depicts problems that have been successfully resolved upon utilization of quantum computing approaches and what are the benefits and shortcomings of such approaches. The chapter concludes with a summary and provides a point of view on future directions.

Wiley eBooks•Jan 9, 2026•0 citations

Mini-scale traffic flow optimization: an iterative QUBOs approach converting from hybrid solver to pure quantum processing unit

Hadi Salloum, Sanzhar Zhanalin, Amer Al Badr +1 more

Traffic congestion continues to pose a significant challenge in urban environments, necessitating innovative approaches to traffic management. This paper explores the application of Quantum Annealing (QA) for real-world traffic optimization, expanding on the pioneering work of Volkswagen and D-Wave. In 2017, a collaborative team demonstrated the potential of QA to optimize traffic flow by solving a complex Quadratic Unconstrained Binary Optimization (QUBO) problem involving 418 cars, which required 1,254 qubits. Later, this research culminated in a pilot project at the Web Summit conference in Lisbon, one of Europe's largest technology events, showcasing quantum computing-based traffic optimization. Since the QPU alone could not directly handle the full problem size, the team employed a hybrid classical-quantum approach, leading to significant improvements in traffic distribution. This paper builds on that foundation by investigating potential speedups using a purely quantum approach, particularly by utilizing the QPU for smaller QUBO problems. The proposed method (MTF) enhances traffic management by decomposing the overall optimization problem into smaller, more manageable subproblems. This decomposition enables us to harness the advantages of the QPU while tackling more complex traffic scenarios that previous approaches struggled to manage. By breaking the problem into smaller parts, we mitigate the challenges associated with embedding large-scale problems into the QPU, which often presents computational difficulties. To evaluate our approach, we conducted experiments involving 100, 200, 300, 400, and 500 cars on a complex traffic map featuring multiple start and end points. We successfully embedded the problem into the D-Wave Advantage Quantum Processing Unit, utilizing the "Pegasus" topology, which resulted in a significant acceleration of the solution process. The experiment results show improved speed and effectiveness in real-world scenarios by leveraging the QPU for better traffic optimization.

Scientific Reports•Jul 1, 2025•20 citations
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.
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.
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.
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.
Quantum computing is one of the emerging fields that combines the principles of quantum mechanics with computer science. The focus of this chapter is to provide readers with a detailed introduction to quantum computing by describing the fundamental concepts that differentiate quantum computing from classical computing. Moreover, the chapter provides an overview of quantum gates followed by quantum algorithms. Various hardware and software platforms are also explored in the chapter to provide readers with information on available quantum hardware and software platforms for exploration and research purposes. Some of the important applications are also covered in the chapter, and the current state-of-the-art section depicts problems that have been successfully resolved upon utilization of quantum computing approaches and what are the benefits and shortcomings of such approaches. The chapter concludes with a summary and provides a point of view on future directions.
Traffic congestion continues to pose a significant challenge in urban environments, necessitating innovative approaches to traffic management. This paper explores the application of Quantum Annealing (QA) for real-world traffic optimization, expanding on the pioneering work of Volkswagen and D-Wave. In 2017, a collaborative team demonstrated the potential of QA to optimize traffic flow by solving a complex Quadratic Unconstrained Binary Optimization (QUBO) problem involving 418 cars, which required 1,254 qubits. Later, this research culminated in a pilot project at the Web Summit conference in Lisbon, one of Europe's largest technology events, showcasing quantum computing-based traffic optimization. Since the QPU alone could not directly handle the full problem size, the team employed a hybrid classical-quantum approach, leading to significant improvements in traffic distribution. This paper builds on that foundation by investigating potential speedups using a purely quantum approach, particularly by utilizing the QPU for smaller QUBO problems. The proposed method (MTF) enhances traffic management by decomposing the overall optimization problem into smaller, more manageable subproblems. This decomposition enables us to harness the advantages of the QPU while tackling more complex traffic scenarios that previous approaches struggled to manage. By breaking the problem into smaller parts, we mitigate the challenges associated with embedding large-scale problems into the QPU, which often presents computational difficulties. To evaluate our approach, we conducted experiments involving 100, 200, 300, 400, and 500 cars on a complex traffic map featuring multiple start and end points. We successfully embedded the problem into the D-Wave Advantage Quantum Processing Unit, utilizing the "Pegasus" topology, which resulted in a significant acceleration of the solution process. The experiment results show improved speed and effectiveness in real-world scenarios by leveraging the QPU for better traffic optimization.