This paper investigates the algebraic structure of a higher-dimensional analog of the Quantum Max Cut (QMC) problem for ...

Judged purely on its puzzling skills, AI is improving a lot—and quickly. In late 2024, even the best models could figure out ...

A preliminary paper from an Amazon Web Services cryptographer describes a polynomial-time quantum algorithm for a long-standing mathematical problem whose solution could have implications for ...

Researchers at the University of Toronto Scarborough have developed an open-source framework for comparing classical and quantum approaches to solving the notoriously difficult Traveling Salesman ...

Katie has a PhD in maths, specializing in the intersection of dynamical systems and number theory. She reports on topics from maths and history to society and animals. Katie has a PhD in maths, ...

Timely reconstruction of epidemic dynamics is essential for public health, and structured coalescent models constitute an essential tool for this purpose. However, statistical and computational ...

NP-complete for general graphs APX-hard: difficult to approximate within a constant factor Generalizes well-known problems such as maximum clique and subgraph isomorphism ...

Using an advanced Monte Carlo method, Caltech researchers found a way to tame the infinite complexity of Feynman diagrams and solve the long-standing polaron problem, unlocking deeper understanding of ...

We study the problem of estimating the size of a maximum matching in sublinear time. The problem has been studied extensively in the literature and various algorithms and lower bounds are known for it ...

Combinatorial optimisation problems arise in many fields, from logistics and network design to machine learning and bioinformatics. Most classical formulations are NP-hard, rendering exact ...