Computer Science

Pure, verifiable randomness is hard to come by. Two proposals show how to make quantum computers into randomness factories.

Neven’s law states that quantum computers are improving at a “doubly exponential” rate. If it holds, quantum supremacy is around the corner.

The universe of problems that a computer can check has grown. The researchers’ secret ingredient? Quantum entanglement.

Quantum computers can’t selectively forget information. A new algorithm for multiplication shows a way around that problem.

By chopping up large numbers into smaller ones, researchers have rewritten a fundamental mathematical speed limit.

Researchers have just released hacker-proof cryptographic code — programs with the same level of invincibility as a mathematical proof.

The latest AI algorithms are probing the evolution of galaxies, calculating quantum wave functions, discovering new chemical compounds and more. Is there anything that scientists do that can’t be automated?

Neural networks are famously incomprehensible, so Been Kim is developing a “translator for humans.”

The same codes needed to thwart errors in quantum computers may also give the fabric of space-time its intrinsic robustness.