This is a preview. Log in through your library . Abstract We present a new algorithm for estimating the star discrepancy of arbitrary point sets. Similar to the algorithm for discrepancy approximation ...

The DOE SC program in Advanced Scientific Computing Research (ASCR) hereby announces its interest in basic research in the design, development, analysis, and scalability of randomized algorithms for ...

Researchers demonstrated a quantum algorithmic speedup with the quantum approximate optimization algorithm, laying the groundwork for advancements in telecommunications, financial modeling, materials ...

A few years back, Google made waves when it claimed that some of its hardware had achieved quantum supremacy, performing ...

Unlock the full InfoQ experience by logging in! Stay updated with your favorite authors and topics, engage with content, and download exclusive resources. This article dives into the happens-before ...

Since the very first days of computer science — a field known for its methodical approach to problem-solving — randomness has played an important role. The first program to run on the world’s first ...

Quantum optimization team: from left to right are Kilian Ender, Clemens Dlaska, Wolfgang Lechner, Rick van Bijnen, Andreas Kruckenhauser and Glen Bigan Mbeng Quantum computers are often discussed as a ...

The traveling salesman problem is one of the basic problems that many theoretical computer scientists have been working on. Many scientists think that there is no algorithm for the traveling salesman ...