We care about your data, and we'd like to use cookies to give you a smooth browsing experience. Please agree and read more about our privacy policy.

Three computer scientists have posted a proof of the NLTS conjecture, showing that systems of entangled particles can remain difficult to analyze even away from extremes.

Computer scientists have found a new type of problem that quantum computers can solve dramatically faster than their classical counterparts.

Daniel Spielman solves important problems by thinking hard — about other questions.

Why verify every line of a proof, when just a few checks will do?

Finding out whether a question is too difficult to ever solve efficiently depends on figuring out just how hard it is. Researchers have now shown how to do that for a major class of problems.

Language processing programs are notoriously hard to interpret, but smaller versions can provide important insights into how they work.

For the first time, experiments demonstrate the possibility of sharing secrets with perfect privacy — even when the devices used to share them cannot be trusted.

Two researchers show that for neural networks to be able to remember better, they need far more parameters than previously thought.

A new result shows that quantum information can theoretically be protected from errors just as well as classical information can.

Previous