A nested amplitude amplification protocol for knapsack performs partial amplification on initial variables via an Inner Iteration Finder before global GAS, reducing solution improvement costs versus baseline in simulations on large instances.
Constrained Quantum Optimization at Utility Scale: Application to the Knapsack Problem
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A sandbox platform enables end-to-end hybrid workflows that reduce graph problems, run QAOA on IBM hardware up to 128 qubits, and refine outputs classically for problems including vertex cover and clique.
citing papers explorer
-
A Nested Amplitude Amplification Protocol for the Binary Knapsack Problem
A nested amplitude amplification protocol for knapsack performs partial amplification on initial variables via an Inner Iteration Finder before global GAS, reducing solution improvement costs versus baseline in simulations on large instances.
-
Experimental Workflows for Combinatorial Optimization: Towards Quantum Advantage
A sandbox platform enables end-to-end hybrid workflows that reduce graph problems, run QAOA on IBM hardware up to 128 qubits, and refine outputs classically for problems including vertex cover and clique.