## Latest Articles

### The Question of What’s Fair Illuminates the Question of What’s Hard

Computational complexity theorists have discovered a surprising new way to understand what makes certain problems hard.

### Scientists Find a Fast Way to Describe Quantum Systems

After years of false starts, a team of computer scientists has found a way to efficiently deduce the Hamiltonian of a physical system at any constant temperature.

### Physicists Finally Find a Problem for Quantum Computers Alone

Researchers have shown that a problem relating to the energy of a quantum system is easy for quantum computers but hard for classical ones.

### Researchers Approach New Speed Limit for Seminal Problem

Integer linear programming can help find the answer to a variety of real-world problems. Now researchers have found a much faster way to do it.

### Machine Learning Aids Classical Modeling of Quantum Systems

By using “classical shadows,” ordinary computers can beat quantum computers at the tricky task of understanding quantum behaviors.

### How Ancient War Trickery Is Alive in Math Today

Legend says the Chinese military once used a mathematical ruse to conceal its troop numbers. The technique relates to many deep areas of modern math research.