Quantum Algorithm for the Container Check-in Problem

This guest post discusses the complex topic of quantum computing and provides an application example from logistics. Rainer A. Stawarz, founder and CEO of K&S Informatik, which specializes in customs solutions based in Zurich, attempts to illustrate what is possible with a suitable quantum algorithm using simple words, exemplified by the assignment of containers to parking spaces in port terminals.

By: Rainer A. Stawarz

(Zurich) This article addresses a problem that can occur in container ports: the efficient allocation of storage spaces for incoming containers. It is not only important to find an available space but also to consider the cargo of the surrounding containers. This is particularly relevant to avoid accidents like the severe explosion in the port of Tianjin in 2015.

The Problem at a Glance

Imagine a large container ship, like the “Sovereign Maersk,” arriving at a port, here exemplified by Shanghai, and needing to unload 7,500 containers. The port system now has the task of finding a suitable storage space for each of these containers and reserving it.

In the world’s largest container port in Shanghai, over 47 million standard containers (TEU) were handled in 2023. This means that thousands of containers need to be newly stored and unloaded daily. An efficient system for managing storage spaces is therefore essential.

Challenges of the Classical Method

In conventional methods, each possible parking space is checked individually. Even if each check takes only a tiny fraction of a second, the computation time can add up to several hours with thousands of parking spaces and containers. Although there are optimizations in practice, such as grouping similar containers or excluding certain areas from the search, bottlenecks can still occur—especially when legal regulations for hazardous materials, fire protection, or safety distances are further tightened. In such cases, computation time quickly becomes a critical factor.

The Quantum Approach as a Solution

Here, quantum computing could provide a solution. In 1996, Indian mathematician Lov Grover developed a quantum algorithm that significantly accelerates database searches. Instead of searching each parking space individually, a quantum computer using this algorithm can perform the search in significantly fewer steps. In our example with 40,000 possible parking spaces, the quantum algorithm would only require about 200 computation steps for this. This could reduce the total computation time from several hours to just a few minutes or even seconds—without compromising on accuracy.

Practical Challenges and Outlook

However, one challenge remains: the evaluation of parking spaces is based on several criteria that can be summarized in a so-called “suitability vector.” A quantum computer, however, works with qubits that cannot directly handle such complex data structures. Therefore, the algorithm would need to be adjusted to process the individual evaluation criteria separately. While this might slow down the calculation somewhat, the method would still be significantly faster than conventional systems.

Microsoft is Close with the “Majoran 1” Project

In summary, this article shows how quantum computers could revolutionize logistics in container ports—provided that the theoretical concepts can be implemented in practice. Current developments, such as Microsoft’s “Majoran 1” project, give hope that such quantum algorithms could soon become a reality.

Rainer A. Stawarz is the founder and CEO of K&S Informatik. He studied nuclear energy systems and theoretical computer science.

https://www.linkedin.com/in/rainer-a-stawarz-60894397/

Title image: © Loginfo24