2021 IEEE Congress on Evolutionary Computation (CEC) 2021
DOI: 10.1109/cec45853.2021.9504923
|View full text |Cite
|
Sign up to set email alerts
|

Hybrid Quantum Computing - Tabu Search Algorithm for Partitioning Problems: Preliminary Study on the Traveling Salesman Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7
2
1

Relationship

2
8

Authors

Journals

citations
Cited by 25 publications
(11 citation statements)
references
References 32 publications
0
11
0
Order By: Relevance
“…The performance mechanisms in resolving important industrial problems are highlighted by the distinctions between classical computing and QC. The QC mechanics use fundamental quantum properties like superposition, entanglement, and the measurement paradox to find the best answers to challenging issues [43], [44].…”
Section: Quantum Computingmentioning
confidence: 99%
“…The performance mechanisms in resolving important industrial problems are highlighted by the distinctions between classical computing and QC. The QC mechanics use fundamental quantum properties like superposition, entanglement, and the measurement paradox to find the best answers to challenging issues [43], [44].…”
Section: Quantum Computingmentioning
confidence: 99%
“…However, researchers are forced to devise problems tailored to hardware capacity, which often fall short from advanced or realistic formulations [61], [63], [70]. Furthermore, the necessity of taking a step forward and advance in the formulation of more realistic problems is a widely accepted open challenge [31], [49], [65], [67]. Within this frame of reference, the following research lines have been identified by the community as future work: i) the efficient modeling of advanced routing problems, focusing on building mathematical formulations which optimize the problem embedding [60], [65], ii) the solving of real-world problems oriented to realistic applications (such as traffic optimization or detecting routing anomalies), even if the size of these problems is restricted [49], [68], [69] and iii) the development of hybrid solvers using classical optimization mechanisms to tackle complex problems [33], [71].…”
Section: • Researchers With Background In Traditional Artificialmentioning
confidence: 99%
“…Besides, as can read in [16], current D'WAVE computers cannot solve TSP instances with a size greater than 9 nodes [20], because of the current qubit amount limitation. For this reason, in order to cope with Burma'12, Burma'13 and Burma'14 instances, the quantum-classical hybrid method described in [21] has been adopted. This procedure relies on the partition of the whole instance into similar-sized sub-problems to be solved independently by the quantum computer.…”
Section: Testing the Efficiency Of The H-qubo On Additional Tsp Insta...mentioning
confidence: 99%