Papers › Fixed-point Grover Adaptive Search for Quadratic Binary Optimization Problems
Fixed-point Grover Adaptive Search for Quadratic Binary Optimization Problems
Ákos Nagy, Jaime Park, Cindy Zhang, Atithi Acharya, Alex Khan
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We study a Grover-type method for Quadratic Unconstrained Binary Optimization (QUBO) problems. For an n-dimensional QUBO problem with m nonzero terms, we construct a marker oracle for such problems with a tuneable parameter, Λ∈[ 1, m ] ∩ℤ. At d ∈ℤ_+ precision, the oracle uses O (n + Λd) qubits, has total depth of O ( mΛ log₂ (n) + log₂ (d) ), and non-Clifford depth of O ( mΛ ). Moreover, each qubit required to be connected to at most O ( log₂ (Λ+ d) ) other qubits. In the case of a maximum graph cuts, as d = 2 ⌈log₂ (n) ⌉ always suffices, the depth of the marker oracle can be made as shallow as O (log₂ (n)). For all values of Λ, the non-Clifford gate count of these oracles is strictly lower (at least by a factor of ∼2) than previous constructions. Furthermore, we introduce a novel \textit{Fixed-point Grover Adaptive Search for QUBO Problems}, using our oracle design and a hybrid Fixed-point Grover Search, motivated by the works of Boyer et al. and Li et al. This method has better performance guarantees than previous Grover Adaptive Search methods. Some of our results are novel and useful for any method based on Fixed-point Grover Search. Finally, we give a heuristic argument that, with high probability and in O ( log₂ (n)√(ϵ) ) time, this adaptive method finds a configuration that is among the best ϵ2ⁿ ones.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections