Industry · Early Pilots
Quantum Computing for Logistics
Optimization-heavy logistics problems are a natural testing ground for quantum and quantum-inspired algorithms, with several companies running active pilots.
Maturity
Early pilots, mostly with annealers and quantum-inspired solvers
Most credible quantum workload
Combinatorial optimization on fault-tolerant machines using quadratic-speedup search, plus heuristics
Hardware needed
Not yet known for a clear advantage; today's pilots use hundreds to thousands of annealing qubits
Strongest classical competition
Mixed-integer solvers, OR-Tools, LKH, and metaheuristics
Notable pilot results
Reported runtime reductions on scheduling at Ford Otosan and grocery chains using D-Wave hybrid solvers
Realistic horizon
Uncertain; incremental pilots now, clear advantage not established
Overview
Logistics is the study of moving goods and people efficiently, and it is built from optimization problems: which truck takes which route, in what order to pick items in a warehouse, how to load a container, how to schedule drivers and loading docks. These problems are famous in computer science for being hard in the worst case, and companies solve them every day with heuristics that give good, not perfect, answers.
That is why logistics shows up in almost every list of quantum computing applications. It is also a field where honesty matters, because strong classical solvers are already extremely good and a large part of the reported benefit of quantum pilots has come from reformulating the problem or from quantum-inspired classical hardware.
Why this industry is a candidate for quantum computing
Many logistics problems are instances of vehicle routing, bin packing, scheduling, and network design. Their search spaces grow combinatorially, and no efficient exact algorithm is known for the hard cases. Quantum algorithms offer a provable quadratic speedup for unstructured search and a family of heuristic methods, such as quantum annealing and QAOA, designed for this kind of problem.
The economic stakes are large and measured in fuel, time, and labor. A one-percent improvement in routing for a big carrier is worth a great deal, which makes even a modest gain attractive and explains the steady flow of pilots with companies such as DHL, Volkswagen, and Ford Otosan.
Key facts and numbers
| Item | Detail |
|---|---|
| Traveling salesman encoding | N squared binary variables, so 10 cities need about 81 qubits after fixing the start |
| Classical TSP record | Concorde has solved an instance with 85,900 cities to proven optimality |
| Grover-type speedup | Square root: about 1,000 steps instead of a million for an unstructured search |
| Annealer size | D-Wave Advantage2 has more than 4,400 qubits, but embedding reduces the problem size that fits |
| Ford Otosan report | Production scheduling time reduced from tens of minutes to a few minutes with a hybrid solver |
| Vehicle routing | Classical heuristics handle instances with thousands to tens of thousands of stops in practice |
Where quantum computing could help
Vehicle routing and fleet scheduling
The problem: Deciding which vehicles serve which customers, in what order, within time windows and capacity limits is the vehicle routing problem, a generalization of the traveling salesman problem. Industrial instances have thousands of stops and many side constraints.
The quantum approach: The problem is encoded as a quadratic binary optimization and given to a quantum annealer or QAOA, usually as part of a hybrid solver that splits the work and refines results classically.
Where things stand: Quantum devices handle only small instances in direct form, and hybrid solvers get most of their power from the classical components. Classical solvers routinely find near-optimal routes for instances with tens of thousands of nodes, so a quantum edge has not been shown.
Related algorithms: Quantum Approaches to the Traveling Salesman Problem, Quantum Approximate Optimization Algorithm (QAOA), Quantum Annealing
Warehouse operations and order picking
The problem: Choosing the order in which pickers visit shelves, how to slot products, and how to batch orders reduces walking time, which is the biggest cost in many warehouses.
The quantum approach: Pick-path and batching problems are formulated as routing and assignment problems and tried on annealers and quantum-inspired hardware.
Where things stand: Pilots report improvements over existing heuristics in some cases. Several of those gains also appear when the same formulation is solved with classical methods, which suggests the formulation, not the quantum hardware, supplies much of the benefit.
Related algorithms: Quantum Annealing, Max-Cut with Quantum Algorithms (QAOA and Quantum Max-Cut)
Container loading and packing
The problem: Placing items in containers or trucks to use space well while respecting weight, stacking, and delivery-order constraints is a three-dimensional bin packing problem.
The quantum approach: Researchers cast packing as optimization on a lattice of positions and test quantum annealing and variational circuits.
Where things stand: Only small, simplified instances fit on today's machines. Packing heuristics used in industry are fast and effective, so this is a research benchmark more than a deployed tool.
Related algorithms: Quantum Approximate Optimization Algorithm (QAOA), Grover's Algorithm
Supply chain network design and planning
The problem: Choosing where to put factories, warehouses, and inventory, and how to route flows through the network under uncertain demand, mixes optimization with simulation.
The quantum approach: Quantum amplitude estimation could speed up the simulation of demand scenarios, and quantum linear programming and semidefinite programming solvers are being studied for the optimization layer.
Where things stand: These approaches are theoretical. They rely on fault-tolerant hardware and quantum data access, and the quadratic gains must be weighed against overhead.
Related algorithms: Quantum Amplitude Estimation, Quantum Algorithms for Semidefinite Programming, Quantum Algorithms and Quantum Optimal Transport
Who is working on it
- Ford Otosan, which has described using D-Wave hybrid solvers for production and vehicle scheduling, with reported reductions in solution time.
- Volkswagen, which ran traffic flow and fleet optimization pilots with D-Wave in Beijing and Lisbon.
- DHL, whose trend research has examined quantum computing for routing, network design, and warehouse optimization.
- Grocery and retail chains in Canada and elsewhere that have used D-Wave hybrid solvers for scheduling, with reported large reductions in computation time.
- Software and hardware firms such as D-Wave, IBM, IonQ, and Quantinuum, and quantum-inspired providers including Fujitsu, Toshiba, and Hitachi.
Realistic timeline
| Horizon | What to expect |
|---|---|
| Now to 2028 | Hybrid solver pilots continue, quantum-inspired hardware delivers some commercial value, and the main work is benchmarking against classical solvers. |
| 2028 to 2032 | Early fault-tolerant machines enable provable quadratic speedups on small search subroutines. Whether they beat tuned classical heuristics on real fleet problems is an open question. |
| 2032 and later | If hardware scales, quantum-accelerated planning and simulation could appear in supply chain software. No guarantee that logistics will be a leading application. |
How to judge quantum claims in this sector
Logistics pilots often report impressive percentage improvements, so the first question is the baseline. Many company systems use simple rules or older heuristics, and almost any modern optimizer beats them. The relevant comparison is a state-of-the-art solver such as Gurobi, OR-Tools, or LKH, tuned by an expert, run for the same time on comparable hardware. If a quantum or hybrid approach is better only against a weak baseline, the finding is about the formulation, not the quantum hardware.
A second question is the role of the classical part. Hybrid solvers decompose a large problem, solve pieces on a quantum processor, and stitch the results together. If most of the work is the decomposition and the stitching, the quantum processor may be incidental. The most convincing evidence would be a controlled experiment that replaces the quantum step with a classical subsolver and shows a loss in quality or speed.
What stands in the way
- Classical solvers are very strong and keep improving, with GPU acceleration.
- Encoding overhead: routing problems need many qubits for a few vehicles and stops.
- Constraints: real problems have messy rules that are hard to express in quantum-friendly form.
- Proof of value: pilots often compare against weak baselines, so credible benchmarks are needed.
What organizations in this sector should do now
- Benchmark your current optimizer against the best open and commercial solvers first, so you know how much headroom exists.
- If you run pilots, define success in terms of solution quality and cost, with an honest classical baseline.
- Consider quantum-inspired solvers, which can be used today on conventional hardware.
- Track the research on quantum speedups for combinatorial search, which is where proven gains live.
Myths versus reality
- Myth: quantum computers will find the best route among all possibilities instantly. Reality: the best known quantum speedups for search are quadratic, and optimization problems stay hard.
- Myth: reported speedups from pilots prove quantum advantage. Reality: many came from reformulation or classical components in hybrid solvers.
- Myth: logistics will be the first quantum success story. Reality: chemistry and simulation have stronger theoretical cases.
The bottom line
Logistics is a sensible area for experiments because the problems are real and the data are available. It is not yet an area with proven quantum advantage. Companies can gain today from better optimization software, including quantum-inspired solvers, and should keep quantum pilots small, benchmarked, and honest.
Frequently asked questions
Is quantum computing used in logistics today?
In pilots, mainly with D-Wave hybrid solvers and quantum-inspired hardware. These are not widespread production systems, and the value of the quantum part is still debated.
Can a quantum computer solve the traveling salesman problem?
Not efficiently in general. It remains NP-hard, and the known quantum speedups for exact methods are modest.
What are quantum-inspired solvers?
Classical hardware or software, such as Fujitsu's Digital Annealer, that borrows ideas from quantum annealing to solve optimization problems. They run on conventional chips.
Which algorithms matter for logistics?
QAOA, quantum annealing, and Grover-style search for combinatorial problems, plus amplitude estimation for simulation inside planning tools.
When will logistics benefit?
Pilots yield incremental gains now. A clear, general quantum advantage is not established and may take until the 2030s or later, if it happens.
Keep exploring
- Algorithm: Quantum Approaches to the Traveling Salesman Problem
- Algorithm: Quantum Approximate Optimization Algorithm (QAOA)
- Algorithm: Quantum Annealing
- Algorithm: Max-Cut with Quantum Algorithms (QAOA and Quantum Max-Cut)
- Hardware: D-Wave Advantage2
- Hardware: IBM Heron (r1, r2, and r3)
- Company: D-Wave Quantum
- Company: IBM
- Company: IonQ
- Research: Hardware-Aware Circuit Compilation Improves QAOA Performance on Real Devices
- Research: Warm-Start Initialization Techniques Improve QAOA Convergence Speed
- Industry: Quantum Computing for Transportation
- Industry: Quantum Computing for Retail and Consumer Goods
- Industry: Quantum Computing for Manufacturing
- Industry: Quantum Computing for the Automotive Industry
This page is written for educational purposes and summarizes public announcements, published research, and published resource estimates (last reviewed September 30, 2026). Vendor and customer claims have not all been independently verified, timelines are estimates, and nothing here is investment or business advice.