A US physicist and a Canadian computer scientist have won this year's Turing Award for their invention of a form of seemingly unbreakable encryption. Charles H Bennett and Gilles Brassard's work, which dates back to 1984, is known as quantum cryptography and has redefined secure communication and computing, the award's body said. Scientists believe their work will be central to electronic communications in a world that depends heavily on data-sharing, but which for years has been trying to develop more powerful quantum computers. The Turing Award, named after the mathematician and code-breaker Alan Turing, is known as the Nobel Prize of computing. It comes with a $1m (£800,000) prize.

Charles Bennett and Gilles Brassard pioneered quantum information theory. Now they've been awarded the highest honor in computer science. Today it's widely acknowledged that the future of computing will involve the quantum realm . Companies like Google, Microsoft, IBM, and a few well-funded startups are frantically building quantum computers and routinely claiming advances that seem to bring this exotic, world-changing technology within reach. In 1979 all of this was unthinkable.

In quantum computers, the information is contained in qubits that can work through vast numbers of different outcomes, which is not possible with classical computers. In quantum computers, the information is contained in qubits that can work through vast numbers of different outcomes, which is not possible with classical computers. The UK will not let quantum computing talent slip through its fingers and must learn lessons from US dominance of the AI race, the technology secretary has said, as the government announced a £1bn quantum funding pledge. Liz Kendall said the government hoped to retain homegrown quantum startups, engineers and researchers rather than lose them to competing countries, with the US stealing a march on its western rivals in AI. "I do look at what's happened on AI," said Kendall. "I do think we need to learn the lessons and make sure we give our brilliant scientists, spinouts and startups the ability to stay here and make it happen. And that requires a government that is bold and ambitious and confident in these technologies of the future."

This content was produced by Insights, the custom content arm of MIT Technology Review. It was not written by MIT Technology Review's editorial staff. AI-enabled fraud and the coming impact of quantum computing are redefining digital-asset security, putting pressure on owners and service providers to act now. Cryptocurrency thieves are getting creative. Taking advantage of the desire to learn more about crypto and banking on the digital assets' reputation as a way to get rich quick, AI-generated video tutorials are touting ways of make money from crypto-trading arbitrage -- purportedly teaching viewers how to create maximal extractable value from trades using smart contracts.

The errors that quantum computers make are holding the technology back. Quantum computers won't be truly useful until they can correct their mistakes Quantum computers are already here, but they make far too many errors. This is arguably the biggest obstacle to the technology really becoming useful, but recent breakthroughs suggest a solution may be on the horizon. Errors creep into traditional computers too, but there are well-established techniques for correcting them. They rely on redundancy, where extra bits are used to detect when 0s incorrectly swap to 1s or vice versa.

In this interview series, we're meeting some of the AAAI/SIGAI Doctoral Consortium participants to find out more about their research. We sat down with Maxime Meyer to chat about his current research, future plans, and how he found the doctoral consortium experience. Could you start with an introduction to yourself, where you're studying and the topic of your research? My research focuses on large language models. Which aspect of large language models are you looking at?

Chemistry may not be the'killer app' for quantum computers after all Quantum chemistry calculations that could advance drug development or agriculture have recently emerged as a promising "killer application" of quantum computers, but a new analysis suggests this is unlikely to be the case. Progress in building quantum computers has greatly accelerated in recent years, but it remains an open question what uses are most likely to justify the ongoing investment in this technology. One popular contender is solving problems in quantum chemistry, such as calculating the energy levels of molecules relevant for biomedicine or industry. This requires accounting for the behavior of many quantum particles - electrons in the molecule - simultaneously, so it seems like a good match for computers made from many quantum parts. Quantum computers have finally arrived, but will they ever be useful? However, Xavier Waintal at CEA Grenoble in France and his colleagues have now shown that two leading quantum computing algorithms for this task may actually have, at best, limited use.

Algorithms called phantom codes could help quantum computers run complex programs without errors, overcoming a big hurdle for making the technology more broadly useful. Early on, some physicists doubted that quantum computers would ever be useful because they expected these devices to be too prone to hard-to-correct errors. Today, several types of quantum computers exist and have already been used for scientific discovery and exploration. Yet, while progress has been made, researchers have not managed to fully curtail the error-making problem. Quantum computers have finally arrived, but will they ever be useful?