Annealing vs Gate Model for Optimization: Which Quantum Approach Helps Real Businesses?
Two different machines, one hopeful goal
Both families want to help with optimization: finding the best schedule, route, mix or plan among a huge number of choices. But they work differently. Our general comparison is in gate model versus quantum annealing and the hardware types are in types of quantum computers. Here we focus on what each means for real business problems.
Quantum annealing in one paragraph
An annealer is a special-purpose machine. You describe your problem as an energy landscape with many hills and valleys, and the machine is set up so that its physical state settles toward a low valley, which is a good answer. It cannot run Shor's algorithm or general programs, but it can have thousands of qubits and it is available now through the cloud. D-Wave is the main company, and it launched its Advantage2 system in May 2025.
Gate model in one paragraph
A gate-model machine runs step-by-step circuits of quantum gates (see gates and circuits). It is universal: in principle it can run any quantum algorithm, including Shor's, Grover-style search and QAOA. Today these machines have fewer qubits than annealers, but they are more flexible and are the path to error-corrected computing. IBM, Quantinuum Ltd, IonQ and others build them.
What D-Wave customers report
D-Wave's Q1 2026 presentation, as relayed by press coverage, says it recognized revenue from more than 100 customers in the quarter, with over half commercial enterprises (a year earlier it reported 133, and counts depend on how customers are defined, so check the date and the filing). Two examples are worth knowing, both announced by the companies:
- Ford Otosan (March 2025): a hybrid quantum application for sequencing more than 1,500 Ford Transit variants through body, paint and assembly constraints. The announcement says scheduling for 1,000 vehicles per run dropped from 30 minutes to under five. It gives no peak throughput figure and is a company release.
- Volkswagen in Lisbon (2019): a pilot where a D-Wave computer calculated routes for nine buses in near real time during a conference. The release promised shorter travel times, but a measured before-and-after study was not found.
What independent benchmarks say
An academic study (arXiv 2409.05542) tested D-Wave's hybrid solver against CPLEX, Gurobi and IPOPT. Its findings, in plain terms:
- Binary quadratic problems: the most promising case, where the hybrid solver outperformed the classical solvers tested, including being faster than CPLEX.
- Linear binary problems: near-optimal answers, but runtime grows significantly with size.
- Many added constraints: solution quality diverges from classical and runtime becomes too high.
- A real unit commitment (power scheduling) problem: Gurobi beat the hybrid solver on both time and quality.
The authors conclude the advantage is currently limited to binary quadratic problems, while noting that annealing is advancing quickly and classical solvers improve too, so regular benchmarking is needed. That is a measured, fair summary: there is a niche where annealing shines, and it is not yet a universal optimizer.
There has also been long debate over D-Wave's 2025 supremacy-style claims. Reports describe a Flatiron Institute team building a classical method that matched or beat the annealer on some of the same systems, though that was a preprint when reported. Science benefits from this back and forth.
So which approach wins?
| Question | Annealing | Gate model |
|---|---|---|
| Available for business trials now? | Yes, with paying customers reported | Yes, but smaller and noisier |
| Problem types | Optimization, mostly binary quadratic | Anything, in principle |
| Path to error correction | Not the main plan | Central to roadmaps |
| Best-known caveat | Strong classical solvers still win on many problems | Needs fault tolerance for big gains |
Which one wins is an open question, and it may be both: annealing for near-term niche wins, gate-model for long-term power. Fair judging tools such as the QOBLIB library described in our portfolio guide should help.
A buyer's mindset
If you run a business and a vendor promises quantum savings, ask for a head-to-head test against your current best classical solver on your own data, with total cost and time. A good vendor will welcome that. A hybrid solver that calls classical tools in the background can be useful, just do not credit all the gain to the quantum part without evidence. Also remember that classical improvements, such as a better algorithm or a faster chip, can erase a small edge.
The optimistic view is simple: competition between annealing, gate-model and classical teams makes everyone better. This is educational content and not financial advice about any company or token.
Sources and further reading
- arXiv 2409.05542: quantum annealing versus classical solvers
- D-Wave Q1 2026 presentation
- Ford Otosan and D-Wave announcement (March 2025)
- Volkswagen Group: Lisbon bus pilot (2019)
- IEEE Spectrum: D-Wave quantum computing claim disputed
Reported as of 2026-10-09. Pilot results are mostly announced by the companies involved. This is an educational overview, not financial advice. The QNT memecoin is independent of Quantinuum Ltd and of every bank, lab or company named here.
Frequently asked questions
Is quantum annealing a real quantum computer?
It is a real quantum device built for optimization, but it is special-purpose and cannot run general algorithms like Shor's.
Does D-Wave beat classical solvers?
An academic benchmark found its hybrid solver competitive with or better than classical solvers on some binary quadratic problems, but behind Gurobi on others such as unit commitment.
Which approach will win?
Unknown. Annealing has near-term niches and gate-model machines aim at error-corrected power later.
Is this financial advice?
No. It is an educational comparison, not a view on any company or asset.
Keep reading
- Gate Model vs Quantum Annealing: What Is the Difference?
Gate model quantum computers run circuits of gates; quantum annealers solve optimization problems. Learn the difference in plain English and why it matters. - Types of Quantum Computers: Superconducting, Ion, Photonic and More
A guide to the main ways quantum computers are built, with the strengths and trade-offs of each approach. - Quantum Portfolio Optimization: A Reality Check With Real Optimism
Portfolio optimization is the most-hyped quantum finance idea. Here is what QAOA, annealing and benchmarking efforts like QOBLIB really show in 2026. - Quantum for the Power Grid and Logistics: Promising Pilots, Early Evidence
Unit commitment, vehicle sequencing and bus routing are real quantum pilots. Here is what IonQ and Oak Ridge, Ford Otosan and Volkswagen reported, and what is still unproven.
All Quantum computing guides | Back to top | Search the site
Main pages: Quantum computing explained | Quantum and crypto | Companies | Quantum news | Glossary