QMill announces a six-fold leap in reaching quantum advantage
The latest results from QMill aim for a paradigm shift in the early use of quantum computers, requiring only 48 qubits and a level of accuracy which has already been demonstrated to obtain quantum advantage that can be readily verified with a regular laptop.
QMILL PRESS RELEASE
Espoo, Finland, 22 January 2026 – QMill is announcing new simulation results indicating that its latest quantum algorithm is poised to demonstrate quantum advantage on a 48‑qubit quantum computer operating at 99.94% accuracy. This is a six-fold improvement in fault tolerance when compared with earlier estimates that required 99.99% accuracy and 200 qubits. With this algorithm, a quantum computer can solve a certain problem faster than El Capitan, the world’s most powerful supercomputer. By design, the method can be used to verify with a common laptop whether a cloud‑hosted system is genuinely quantum.
These performance metrics are based on advanced mathematical estimations and numerical calculations conducted by QMill’s algorithm team and are pending experiments, scientific peer review, and publication. Based on current evidence, the team estimates that achieving useful quantum advantage is very close.
“Our goal is to make verification of cloud-based quantum computers practical on the best machines available now and on all good machines in the near term. The ability to validate quantum computation with relatively light classical checks and having quantum speed‑up over the fastest supercomputers is an enabler of useful quantum computing,” said Mikko Möttönen, Chief Scientist and Co‑Founder of QMill.
“Unlocking quantum advantage involves not just algorithms that outperform classical computers but also demonstrating their practical value. The next technological step is converting this algorithm into a product that delivers real benefits in the quantum computing market,” said Ville Kotovirta, CTO and Co-Founder of QMill.
“These results bring quantum advantage within reach—an important signal for the quantum community as well as our current and future customers. Together, we need to be prepared to make use of these emerging opportunities in the NISQ era. We will be bringing quantum verification to market soon,” said Hannu Kauppinen, CEO and Co-Founder of QMill.
QMill develops quantum algorithms for real-world industrial use cases on existing and near‑term quantum computers, grounded in rigorous in‑house research and development. The QMill Algorithm team fosters an innovative and collaborative environment to construct and analyze novel quantum algorithms, evaluate them using both simulators and real quantum hardware, and benchmark the results against the state-of-the-art classical methods. The most promising ideas are then made available as algorithms implemented in their cloud-based products.
About QMill
QMill is a quantum‑algorithm and software company making quantum computing practical and accessible for real-world industrial use cases on existing and near‑term quantum computers. The company develops algorithms especially geared towards the NISQ era, supporting quantum researchers and developers as well as industrial sectors such as energy, logistics, and telecom. QMill is headquartered in Espoo, Finland. www.qmill.com
* * *
Notes to editors:
Algorithms will unlock value as quantum hardware matures
Today’s quantum computers operate in the noisy intermediate-scale quantum (NISQ) era: devices are becoming powerful enough to run meaningful computations, but they are still relatively small and prone to errors.As a result, the most useful algorithms are compact, resilient to noise, and paired with classical checks that confirm the result. The NISQ phase will persist for years, until error-corrected, fault-tolerant quantum computers are generally available.
Quantum computing is progressing on a multi‑year trajectory where maturing hardware and breakthrough algorithms reinforce one another. Independent market research indicates growing investment and a pathway to tens of billions of dollars in quantum-computing revenue by the mid‑2030s, with an increasing share for quantum software.
Major efforts are underway across the field to define and validate quantum advantage, emphasizing that it must be scientifically verifiable and benchmarked against the best available classical methods. Quantum advantage means that a quantum computer solves a computational problem faster, more accurately, or with lower cost or fewer other resources than a classical computer. Recently, quantum computers have been observed to produce results that classical computers stumble with, but it has not been possible to easily verify the correctness of such results with classical computers.
QMill’s role is to translate near‑term hardware into practical outcomes by developing algorithms that meet industrial constraints while keeping results readily checkable. The company focuses on use cases where near‑term devices can already perform useful tasks faster than any classical computer alone.
A quantum algorithm is a recipe that constructs a quantum circuit—a program executed on a quantum processor. For example, the famous Grover’s search and Shor’s factoring algorithms theoretically illustrate potential gains but require fault‑tolerant quantum computers beyond near-term capabilities. Other algorithms that are less demanding for quantum computers require too much computing power for verification. This is why the present NISQ era calls for algorithms that can deliver credible speed‑ups under subtle noise and depth limits on problems that can be verified with classical computers.
Cloud verification of quantum computers is a natural early application of near-term quantum algorithms. Because classical simulation of quantum computations is generally exponentially expensive, the ability to classically check the result of the quantum computer for a problem that a classical hardware cannot solve or simulate as quickly, offers a pragmatic way to build trust in quantum cloud services as the ecosystem scales. Research communities continue to advance verifiable computation methods, underscoring the value of designs that allow rigorous checks without sacrificing practicality.