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 ...

Good enough solutions can be found using approximation methods. The team led by Jens Eisert and his colleague Jean-Pierre Seifert has now used purely analytical methods to evaluate how a quantum ...

D-Wave quantum supremacy challenged: Flatiron Institute physicists showed that a classical algorithm using 3D tensor networks ...

Strongly interacting systems play an important role in quantum physics and quantum chemistry. Stochastic methods such as Monte Carlo simulations are a proven method for investigating such systems.

Google’s Willow quantum processor ran a specific algorithm 13,000 times faster than a classical supercomputer, according to results published in Nature. The experiment measured out-of-time-order ...