Quantum computing

Despite the hype, it’s been surprisingly challenging to find quantum algorithms that outperform classical ones. In this episode, Ewin Tang discusses her pioneering work in “dequantizing” quantum algorithms — and what it means for the future of quantum computing.

Randomness is essential to some research, but it’s always been prohibitively complicated. Now, we can use “pseudorandomness” instead.

It’s been difficult to find important questions that quantum computers can answer faster than classical machines, but a new algorithm appears to do it for some critical optimization tasks.

Hypothetical devices that can quickly and accurately answer questions have become a powerful tool in computational complexity theory.

Researchers got a better look at the thoughts of chatbots, amateurs learned exactly how complicated simple systems can be, and quantum computers passed an essential milestone.

In a first, researchers have shown that adding more “qubits” to a quantum computer can make it more resilient. It’s an essential step on the long road to practical applications.

Researchers are exploring new ways that quantum computers will be able to reveal the secrets of complex quantum systems.

While devising a new quantum algorithm, four researchers accidentally established a hard limit on entanglement.

Researchers have proved that secure quantum encryption is possible in a world without hard problems.