2022
DOI: 10.1007/s11227-022-04462-y
|View full text |Cite
|
Sign up to set email alerts
|

A quantum approximate optimization algorithm for solving Hamilton path problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
0
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 15 publications
0
0
0
Order By: Relevance
“…Subsequently, we set the time step to 4, where for each time step t, we used the data features from t-1, t-2, and t-5 as inputs. Ultimately, the input data size for each timestep became [4,3].…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Subsequently, we set the time step to 4, where for each time step t, we used the data features from t-1, t-2, and t-5 as inputs. Ultimately, the input data size for each timestep became [4,3].…”
Section: Methodsmentioning
confidence: 99%
“…Quantum computing can harness special properties, including superposition and entanglement, to execute these tasks even at exponential speeds. Research and applications in quantum computing have achieved significant success, including quantum simulation, quantum approximate optimization algorithm [3], quantum machine learning [4], among other technologies. As researchers delve deeper, models such as quantum reinforcement learning [5], quantum support vector machines [6], quantum neural networks [7] have emerged successively.…”
Section: Introductionmentioning
confidence: 99%