Researchers have demonstrated a quantum speedup over the most efficient classical computer algorithm possible for what is believed to be the first time. The accomplishment was performed on an IBM Montreal Quantum Falcon r4 27-qubit device. The more unknown variables a problem has, the harder it usually is for a computer to solve. Scholars can evaluate a computer’s performance by playing a type of game with it to see how quickly an algorithm can guess hidden information.
This efficiency comes from running a quantum algorithm developed more than 25 years ago by computer scientists Ethan Bernstein and Umesh Vazirani. The study conclusively demonstrates that with proper error control, quantum computers can execute complete algorithms with better scaling of the time it takes to find the solution than conventional computers, even in the NISQ era.
Source: science daily
