Quantum versions of a classical calculation could circumvent limiting factor for large data sets.

The smallest enclosing circle is a well-known problem. In this paper, we propose modifications to speed-up the existing Weltzl’s algorithm. We perform preprocessing reduce as many input points possible. reduction step has lower computational complexity than algorithm and thus speed-ups its computation. Next, some changes end are summarized results, that show for ${10^{6}}$ up 100 times compared...