Explicit gate-based Grover oracle for densest k-subgraph using Dicke states and QFT for edge counting, shown via numerical simulations to give quadratic speedup over brute force.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Explicit Quantum Search Algorithm for the Densest k-Subgraph Problem
Explicit gate-based Grover oracle for densest k-subgraph using Dicke states and QFT for edge counting, shown via numerical simulations to give quadratic speedup over brute force.