Analytical expression for dynamical Lie algebra of QAOA-MaxCut on complete graphs with proof that loss variance scales linearly in qubit number.
Classification of dynamical Lie algebras of 2-local spin systems on linear, circular and fully connected topologies
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 3years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.
Quantum simulation methods for Thirring and Gross-Neveu fermionic models with arbitrary flavors, including gate complexity bounds and ground-state preparation up to 20 qubits.
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.
-
Bridging Krylov Complexity and Universal Analog Quantum Simulator
Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.
-
Quantum simulation of massive Thirring and Gross--Neveu models for arbitrary number of flavors
Quantum simulation methods for Thirring and Gross-Neveu fermionic models with arbitrary flavors, including gate complexity bounds and ground-state preparation up to 20 qubits.