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

The Japanese Society for Artificial Intelligence

Total Quantum Search of Optimal Solution in Quantum Computing

Tomah Sogabe

Published Apr 8, 2019• 1 citation
OpenAlex

Related papers

Quantum computing and quantum search algorithms

Zijian Diao, Goong Chen

•Jan 1, 2001•0 citations

A Quantum Optimization Algorithm for Single Machine Total Weighted Tardiness Minimization

Youhao Steve Wang, Julian Cheng

A single machine total weighted tardiness minimization (TWTM) problem in operational planning is considered. The problem is formulated as an NP-hard constrained combinatorial problem, which has no known deterministic polynomial complexity solution using classical computing. Based on efficient Grover's quantum search and Trugenberger's quantum optimization algorithms, a novel efficient quantum optimization algorithm is proposed to solve the NP-hard single machine TWTM problem, which makes the desired solution satisfying the searching constraints and showing the minimal TWT value be measured with the highest probability.

arXiv:2209.13712•Sep 27, 2022•0 citations

Travelling Salesperson Problem with Quantum Computing

Bhanu Lalith Aakash Medury, Vyoma Harshitha Podapati

Combinatorial optimization problems involve find-ing an optimal solution from a finite set of feasible solutions.Dynamic Programming attempts to solve a combinatorial prob-lem by performing an exhaustive search over the entire domain of the problem.In many such cases, this exhaustive search is not effective or tractable.Travelling salesperson problem is an important combinatorial optimization problem in which the salesperson is given N cities to travel with the condition that he has to travel each city exactly once and return to the origin.Among the finite set of feasible routes, the salesperson has to choose an optimal route with shortest total distance.The route can be optimal either by cost or by distance.The classical algorithm which attempts to find the shortest distance/cost to travel all the cities run in exponential time complexity.For small number of cities, the classical algorithm is effective and feasible but as the number of cities increase, the number of possible routes and the time required to compute them grows exponentially.However, addressing this problem by implementing quantum computing significantly reduces the time required to compute these routes.A quantum algorithm is required to run on a quantum computer to obtain meaningful results as quantum computers use Quantum Bits which differ from the bits used by a classical computer.A.

International Journal of Engineering Research and•Mar 12, 2020•1 citation

Implementation of a quantum search algorithm on a quantum computer

Jonathan A. Jones, Michele Mosca, Rasmus H. Hansen

arXiv:quant-ph/9805069•Nature•May 1, 1998•553 citations

Algorithms of quantum computation

Shinil Cho

Institute of Physics eBooks•Jul 1, 2022•8 citations

Evolutionary Quantum Transition (EQUATe): A Novel Solution to Optimization Problems

Anand Ravishankar, Santhi Natarajan, Bharathi Malakreddy A

Quantum Computing (QC) has often been presented as an esoteric field of computing research. However, the possible advantages offered by the inherent quantum fundamentals beseeches extensive additional ventures into this field. Likewise, Evolutionary Computing (EC) offers a multi-pronged approach by deploying several candidates into the search space with constraints guiding the search process. In this paper, we present Evolutionary Quantum Transition (EQUATe) to provide a unique solution to solving state transition optimization problems using concepts borrowed from QC and EC. The combination leverages compute power to explore the space of candidate solutions by introducing smarter techniques. The solution so obtained provides the optimal transition solution with an automated circuit design and selection process.

International Conference on Energy, Power and Environment (ICEPE)•Mar 5, 2021•0 citations
A single machine total weighted tardiness minimization (TWTM) problem in operational planning is considered. The problem is formulated as an NP-hard constrained combinatorial problem, which has no known deterministic polynomial complexity solution using classical computing. Based on efficient Grover's quantum search and Trugenberger's quantum optimization algorithms, a novel efficient quantum optimization algorithm is proposed to solve the NP-hard single machine TWTM problem, which makes the desired solution satisfying the searching constraints and showing the minimal TWT value be measured with the highest probability.
Combinatorial optimization problems involve find-ing an optimal solution from a finite set of feasible solutions.Dynamic Programming attempts to solve a combinatorial prob-lem by performing an exhaustive search over the entire domain of the problem.In many such cases, this exhaustive search is not effective or tractable.Travelling salesperson problem is an important combinatorial optimization problem in which the salesperson is given N cities to travel with the condition that he has to travel each city exactly once and return to the origin.Among the finite set of feasible routes, the salesperson has to choose an optimal route with shortest total distance.The route can be optimal either by cost or by distance.The classical algorithm which attempts to find the shortest distance/cost to travel all the cities run in exponential time complexity.For small number of cities, the classical algorithm is effective and feasible but as the number of cities increase, the number of possible routes and the time required to compute them grows exponentially.However, addressing this problem by implementing quantum computing significantly reduces the time required to compute these routes.A quantum algorithm is required to run on a quantum computer to obtain meaningful results as quantum computers use Quantum Bits which differ from the bits used by a classical computer.A.
Quantum Computing (QC) has often been presented as an esoteric field of computing research. However, the possible advantages offered by the inherent quantum fundamentals beseeches extensive additional ventures into this field. Likewise, Evolutionary Computing (EC) offers a multi-pronged approach by deploying several candidates into the search space with constraints guiding the search process. In this paper, we present Evolutionary Quantum Transition (EQUATe) to provide a unique solution to solving state transition optimization problems using concepts borrowed from QC and EC. The combination leverages compute power to explore the space of candidate solutions by introducing smarter techniques. The solution so obtained provides the optimal transition solution with an automated circuit design and selection process.