Quantum computers can solve combinatorial optimization problems more easily than conventional methods, research shows
The traveling salesman problem is considered a prime example of a combinatorial optimization problem. Now a Berlin team led by theoretical physicist Prof. Dr. Jens Eisert of Freie Universität Berlin and HZB has shown that a certain class of such problems can actually be solved better and much faster with quantum computers than with conventional
Elegant use of noise for quantum computing
Scientists around the world work hard to rinse quantum systems for noise, which may disturb the function of tomorrow’s powerful quantum computers. Researchers from the Niels Bohr Institute (NBI) have found a way to use noise to process quantum information. This raises the performance of the quantum computing unit, the qubit.Quantum Physics NewsRead More