Quantum algorithms achieve polynomial advantage for synchronization estimation and super-polynomial advantage for no-phase-locking certification in higher-order simplicial Kuramoto models under stated assumptions.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2years
2026 2roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Efficient Quantum Algorithms for Higher-Order Coupled Oscillators
Quantum algorithms achieve polynomial advantage for synchronization estimation and super-polynomial advantage for no-phase-locking certification in higher-order simplicial Kuramoto models under stated assumptions.
- Enabling Lie-Algebraic Classical Simulation beyond Free Fermions