Iterative Quantum Optimization: From Greedy Reductions to Branch-and-Bound
quant-ph
Submitted: 2026-10-31
Updated: 2026-10-31
Terminology
Sources
- A Quantum Approximate Optimization Algorithm
- A scalable quantum-enhanced greedy algorithm for maximum independent set problems
- qReduMIS: A Quantum-Informed Reduction Algorithm for the Maximum Independent Set Problem
- Quantum-Informed Portfolio Selection: An End-to-End Pipeline Validated on Trapped-Ion Hardware with Real Market Data
- Ising formulations of many NP problems
- Adaptive Shot Allocation for Recursive QAOA via Reinforcement Learning
- Universal Quantum Speedup for Branch-and-Bound, Branch-and-Cut, and Tree-Search Algorithms
- The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples
- Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks
- A quantum-classical hybrid branch & bound algorithm
- Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem
- Solving QUBOs with a quantum-amenable branch and bound method
- Efficient Internal Strategies in Quantum Relaxation based Branch-and-Bound
- Quantum and classical correlations in shrinking algorithms for optimization
- Quantum-informed surrogate sampling for combinatorial optimization
- A Unified Complexity-Algorithm Account of Constant-Round QAOA Expectation Computation
- Evaluating QAOA expectation values can be as hard as counting optimal solutions
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements