Quantum
Omniva Wins QEst Hack 2026 with Quantum Parcel Routing Project
Publication: The Quantum Insider
Author: Mohib Ur Rehman
Source published: 17/11/2026, 12:49:31 UTC
Briefing created: 17/11/2026, 13:47:22 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 17/11/2026, 13:19:25 UTC.
Briefings
Omniva won the QEst Hack 2026 prize for a three-month pilot project focused on quantum-classical computing for parcel delivery optimization in Tallinn. The project aims to identify smaller, high-impact tasks where quantum algorithms can assist conventional computers, such as route replanning after traffic accidents. Six Estonian companies participated, including Omniva, Coop Pank, and Metrosert, with the hackathon serving as a training ground for future quantum engineers in Estonia.
Key points
- Omniva's Engineering Manager Deniss Kross led the winning team that identified parcel delivery route optimization as a task requiring significantly more powerful quantum computers than currently available.
- The project involves a three-month pilot awarding Omniva access to quantum experts and tickets to the sTARTUp Day festival to explore smaller delivery-planning tasks alongside conventional computing.
Context
The QEst Hack 2026 was organized by Metrosert in cooperation with BDA, IBM, and the Institut quantique at the Université de Sherbrooke, with support from Estonia's Ministry of Economic Affairs and Communications. It brought together six Estonian companies to explore business applications of quantum computing, including investment portfolios, staff scheduling, and electricity sales forecasting.
Limitations
Evidence covers only the QEst Hack 2026 event and its immediate outcomes. The pilot project's specific technical implementation details, the exact scale of quantum hardware required, and long-term commercial viability remain unverified. No data on participant outcomes beyond the hackathon is provided.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 17/11/2026, 13:47:22 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeigd6cjln73a4vz3d7u2ics3bckqtjeulifnipdrczvbigstazaqci