2021
DOI: 10.48550/arxiv.2108.05945
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Lyapunov control-inspired strategies for quantum combinatorial optimization

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 72 publications
0
2
0
Order By: Relevance
“…A QOCT landscape analysis has been applied to the combinatorial optimization problem MaxCut [370]. Quantum combinatorial optimization without classical optimization can be based on another class of strategies well-known from QOCT, those inspired by Lyapunov control [404]. Grover's quantum search problem can be mapped to a time-optimal control problem, and then described through the Pontryagin Maximum Principle [387].…”
Section: Quantum Algorithmsmentioning
confidence: 99%
“…A QOCT landscape analysis has been applied to the combinatorial optimization problem MaxCut [370]. Quantum combinatorial optimization without classical optimization can be based on another class of strategies well-known from QOCT, those inspired by Lyapunov control [404]. Grover's quantum search problem can be mapped to a time-optimal control problem, and then described through the Pontryagin Maximum Principle [387].…”
Section: Quantum Algorithmsmentioning
confidence: 99%
“…A QOCT landscape analysis has been applied to the combinatorial optimization problem MaxCut [366]. Quantum combinatorial optimization without classical optimization can be based on another class of strategies well-known from QOCT, those inspired by Lyapunov control [400]. Grover's quantum search problem can be mapped to a time-optimal control problem, and then described through the Pontryagin Maximum Principle [380].…”
Section: Quantum Algorithmsmentioning
confidence: 99%