2023
DOI: 10.1103/physrevresearch.5.023171
|View full text |Cite
|
Sign up to set email alerts
|

Quantum dropout: On and over the hardness of quantum approximate optimization algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 9 publications
(1 citation statement)
references
References 37 publications
0
1
0
Order By: Relevance
“…These algorithms have been briefly introduced in Section 2.1. It has been observed that the ruggedness of the search or optimization landscape creates amenability for quantum advantage (see Section 4 of the Supporting Information for a detailed discussion). The quantum advantage appears when there is a least amount of information or a highest amount of uncertainty about the search space which is also known as the “worst case” in algorithmic complexity analysis.…”
Section: Quantum Computing: a Brief Introductionmentioning
confidence: 99%
“…These algorithms have been briefly introduced in Section 2.1. It has been observed that the ruggedness of the search or optimization landscape creates amenability for quantum advantage (see Section 4 of the Supporting Information for a detailed discussion). The quantum advantage appears when there is a least amount of information or a highest amount of uncertainty about the search space which is also known as the “worst case” in algorithmic complexity analysis.…”
Section: Quantum Computing: a Brief Introductionmentioning
confidence: 99%