A QAOA simulation study of graph similarity through edge overlap finds that a compact encoding with many infeasible states causes QAOA to underperform random sampling as graphs grow.
Matrix exponentials and parallel prefix computation in a quantum control problem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2024 1verdicts
REJECT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Quantum Approximate Optimisation Applied to Graph Similarity
A QAOA simulation study of graph similarity through edge overlap finds that a compact encoding with many infeasible states causes QAOA to underperform random sampling as graphs grow.