Welcome to this week’s update on quantum computing. Today, we look at a new limit in theory, a launch in post-quantum security, a federal policy memo, and a fresh record for hardware. Let’s go! Take ...

In computer science, NP refers to problems where a solution can be verified quickly, even if finding that solution may take enormous time. This class has guided much of modern complexity theory. Its ...