The path to quantum advantage in optimization
Summary
IBM quantum experts Dr. Stefan Verer and Dr. Emmed Amani presented on the path to quantum advantage in optimization, highlighting the field's nuances and industry applications. Quantum optimization is often misunderstood, with claims ranging from evaluating all solutions simultaneously to only achieving quadratic speedups; the truth is more subtle, with disruptive quantum advantage likely to be heuristic. The discussion distinguished between provably exact, approximation, and heuristic algorithms, noting that most practical classical and quantum optimization algorithms are heuristics. IBM's Quantum Optimization Working Group published a benchmarking library with 10 diverse problem classes to foster community-driven progress. Recent algorithmic advances include graph decomposition, quantum-enhanced Markov chain Monte Carlo, and multi-objective optimization, with demonstrations on hardware up to 111 qubits. Industry applications span finance (Vanguard's portfolio optimization), drug discovery (Moderna's mRNA folding), manufacturing (Boeing's ply composite design), energy (E.ON's grid optimization, Woodside Energy's workforce scheduling), automotive (Hyundai's electric fleet routing), and financial fraud detection (UK retail banking group). These projects leverage hybrid classical-quantum techniques and dense encoding strategies to push the limits of current quantum hardware.
Key takeaway
For AI Scientists and Research Scientists exploring quantum optimization, recognize that quantum advantage will likely emerge from heuristic algorithms, not provably exact ones. Focus your efforts on rigorous, community-driven benchmarking using diverse problem sets and well-defined metrics to identify specific "sweet spots" where quantum approaches outperform classical methods. Prioritize problems that are classically hard, practically relevant, and potentially benefit from multi-objective or other non-standard optimization techniques to accelerate the path to demonstrable quantum advantage.
Key insights
Quantum advantage in optimization is likely heuristic, requiring empirical testing and rigorous benchmarking against classical state-of-the-art.
Principles
- Quantum advantage is a moving target.
- Empirical trial-and-error research complements theoretical work.
- Benchmarking with well-defined metrics is crucial.
Method
The Quantum Approximate Optimization Algorithm (QAOA) uses a truncated adiabatic approach, optimizing variational parameters in a parameterized quantum circuit to find good solutions for difficult combinatorial optimization problems.
In practice
- Explore multi-objective optimization for complex trade-offs.
- Utilize dense encoding to optimize qubit usage.
- Apply subgraph matching for complex fraud patterns.
Topics
- Quantum Optimization
- Quantum Approximate Optimization Algorithm
- Combinatorial Optimization
- Quantum Advantage Benchmarking
- Multi-objective Optimization
Best for: AI Scientist, Research Scientist, AI Researcher, AI Engineer, Director of AI/ML
Related on AIssential
Editorial summary, takeaway, and curation by AIssential. Original article published by IBM Research.