Pith. sign in

Defineγ 1 :=α √nN(θ k) and recall the projected simplicial phaseθ k [−] =B k θk andθ k [+] =B T k+1θk

Simplicial order parameter estimation AssumeU Θk prepares|Θ k⟩= 1 α |θk⟩ |0⟩⊗a +|⊥ Θ⟩, where|θ k⟩is the normalized amplitude encoding ofθ k, (1⊗⟨0| ⊗a)|⊥ Θ⟩= 0 as in Definition

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

fields

quant-ph 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Efficient Quantum Algorithms for Higher-Order Coupled Oscillators

quant-ph · 2026-04-22 · unverdicted · novelty 7.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Efficient Quantum Algorithms for Higher-Order Coupled Oscillators quant-ph · 2026-04-22 · unverdicted · none · ref 94

    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.