Analytical expression for dynamical Lie algebra of QAOA-MaxCut on complete graphs with proof that loss variance scales linearly in qubit number.
A Quantum Observable for the Graph Isomorphism Problem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Suppose we are given two graphs on $n$ vertices. We define an observable in the Hilbert space $\Co[(S_n \wr S_2)^m]$ which returns the answer ``yes'' with certainty if the graphs are isomorphic and ``no'' with probability at least $1-n!/2^m$ if the graphs are not isomorphic. We do not know if this observable is efficiently implementable.
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Dynamical Lie Algebra of QAOA-MaxCut on the Complete Graph
Analytical expression for dynamical Lie algebra of QAOA-MaxCut on complete graphs with proof that loss variance scales linearly in qubit number.