In this work, we introduce a fast implementation of the minimum-weight perfect matching
(MWPM) decoder, the most widely used decoder for several important families of quantum …

The general routing problem (GRP) is a fundamental 𝒩 𝒫‐hard vehicle routing problem, first
defined by Orloff in 1974. It contains as special cases the Chinese postman problem, the …

Low density graphs are considered to be a realistic graph class for modelling road networks.
It has advantages over other popular graph classes for road networks, such as planar …

This article argues that the first important comprehensive efforts by US mathematicians to
survey, translate, and disseminate the work of Chinese mathematicians resulted from Cold …

Building a scalable quantum computer requires the use of quantum error correction, which
protects components and quantum operations from noise and imperfections that would …

The construction of efficient vehicle routes is of crucial importance in modern society, for
both economic and environmental reasons. This leads to a family of combinatorial …

A typical plan of winter road maintenance of a region consists of hundreds of routes and is
regionally divided into many independent parts. Each part services an assigned district of …