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

Apress eBooks

Quantum Solutions

Bhagvan Kommadi

Published Jan 1, 2020• 0 citations
Publisher

Abstract

This chapter covers the topic of quantum solutions. You will see how quantum AI algorithms are implemented in different real-life solutions. The solutions covered in this chapter are the traveling salesman problem, scheduling, fraud detection, and distribution solution.
DOI
10.1007/978-1-4842-6516-1_12

Related papers

Evolving Quantum Solutions

Bhagvan Kommadi

This chapter covers the topic of evolving quantum solutions. You will see how quantum AI algorithms are implemented in different real-life solutions. The solutions covered in this chapter are related to quantum annealing, quantum key distribution, and quantum teleportation.

Apress eBooks•Jan 1, 2020•0 citations

Quantum AI Algorithms

Bhagvan Kommadi

This chapter covers the topic of quantum AI algorithms. You can see how quantum AI algorithms are implemented in day-to-day life. Code examples are presented for specific algorithms such as quantum probability, quantum walks, quantum search, quantum deep learning, and quantum parallelism.

Apress eBooks•Jan 1, 2020•0 citations

Quantum Classification Algorithms

Bhagvan Kommadi

This chapter covers the topic of quantum classification algorithms. You will see how quantum classification algorithms are implemented in real life. Code examples are presented for different algorithms such as quantum classifiers, support vector machines, and sparse support vector machines.

Apress eBooks•Jan 1, 2020•0 citations

Quantum Data Processing

Bhagvan Kommadi

This chapter covers the topic of quantum data processing (see Figure 10-1). You will see how quantum data processing algorithms are implemented in day-to-day life. Code examples are presented for algorithms such as k-means, k-medians, and quantum clustering.

Apress eBooks•Jan 1, 2020•1 citation

Quantum Neural Network Algorithms

Bhagvan Kommadi

This chapter covers the topic of quantum neural networks. You will see how quantum neural networks are implemented in real life. Code examples are presented for the quantum neural network topics related to quantum artificial neural networks (ANNs), quantum associative memory, quantum dots, quantum generative adversarial networks (GANs) , and quantum random access memory.

Apress eBooks•Jan 1, 2020•0 citations

Hybrid Quantum - Classical AI based approach to solve the Traveling Tournament Problem

Desmond Lobo, Kalpita Ajinkya Wagaskar, Sarang Gawane +1 more

Scheduling has always been deemed as a perfunctory task for most organizations. It could nevertheless become an extremely arduous task if involves the management of events and of the dynamic variables that control it. Herein, we present an idea/solution to the Travelling Tournament Problem (TTP), which is a unique combinatorial problem tackling both feasibility and optimality of the solution. As the TTP belongs to the category of NP-Hard problems, generating solutions usually tend to be extremely costly, with most of the solutions having a time complexity of as high as O(n!). However, two of the many burgeoning fields, artificial intelligence and quantum computing are making headway and we believe that quantum computers possess enough potential to be competent enough to solve such scheduling problems. The aforementioned technologies have provided us with an excellent framework, which we have consequently adopted in our implementation. In the following paper, we portray a hybrid solution that utilizes the immense computational power of a quantum computer while also tweaking the classical algorithm to dynamically reduce the number of iterations and subsequently the cost. We draw parallels between the Travelling Salesman Problem (TSP) and the TTP by utilizing the insights obtained from a detailed analysis of the existing Simulated Annealing based approach, and thus propose certain unique modifications to the best known classical only solutions.

International Journal of Computer Sciences and Engineering•Jun 30, 2021•0 citations
Scheduling has always been deemed as a perfunctory task for most organizations. It could nevertheless become an extremely arduous task if involves the management of events and of the dynamic variables that control it. Herein, we present an idea/solution to the Travelling Tournament Problem (TTP), which is a unique combinatorial problem tackling both feasibility and optimality of the solution. As the TTP belongs to the category of NP-Hard problems, generating solutions usually tend to be extremely costly, with most of the solutions having a time complexity of as high as O(n!). However, two of the many burgeoning fields, artificial intelligence and quantum computing are making headway and we believe that quantum computers possess enough potential to be competent enough to solve such scheduling problems. The aforementioned technologies have provided us with an excellent framework, which we have consequently adopted in our implementation. In the following paper, we portray a hybrid solution that utilizes the immense computational power of a quantum computer while also tweaking the classical algorithm to dynamically reduce the number of iterations and subsequently the cost. We draw parallels between the Travelling Salesman Problem (TSP) and the TTP by utilizing the insights obtained from a detailed analysis of the existing Simulated Annealing based approach, and thus propose certain unique modifications to the best known classical only solutions.