Wrapping your head around quantum physics is tricky, no matter how well-educated you are -- if it were easy, there wouldn't be problems making quantum computers. However, researchers at the National ...

In theory, quantum physics can bypass the hard mathematical problems at the root of modern encryption. A new proof shows how.

Enormous disks of stars or debris can operate under the same rules as subatomic particles, changing based on the Schrodinger equation, which physicists use to model quantum-mechanical systems. Viewing ...

In 1994, MIT professor of applied mathematics Peter Shor developed a groundbreaking quantum computing algorithm capable of factoring numbers (that is, finding the prime numbers for any integer N) ...

Lauda and his colleagues solve some of the problems with topological qubits by using a class of theoretical particles they call neglectons, named for how they were derived from overlooked theoretical ...

Researchers have successfully used a quantum algorithm to solve a complex century-old mathematical problem long considered impossible for even the most powerful conventional supercomputers. The ...

An experimental computer made by a Canadian company has proved its ability to solve increasingly complex mathematical problems. But the question remains — just how much of this calculating power is ...

Hard problems are usually not a welcome sight. But cryptographers love them. That’s because certain hard math problems underpin the security of modern encryption. Any clever trick for solving them ...

The original version of this story appeared in Quanta Magazine. Hard problems are usually not a welcome sight. But cryptographers love them. That’s because certain hard math problems underpin the ...