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
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 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
AL-QHD benchmarks on nonconvex test functions and ACOPF power problems show useful accuracy at fixed qubit cost but require roughly 10^8 T gates for realistic instances.
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.
-
Benchmarking and Resource Analysis for Augmented-Lagrangian Quantum Hamiltonian Descent
AL-QHD benchmarks on nonconvex test functions and ACOPF power problems show useful accuracy at fixed qubit cost but require roughly 10^8 T gates for realistic instances.