Many challenges lie ahead before quantum annealing, the analogue version of quantum computation, contributes to solve combinatorial optimization problems.

Traditional computational tools are simply not powerful enough to solve some complex optimisation problems, like, for example, protein folding. Quantum annealing, a potentially successful implementation of analogue , would bring about an ultra-performant computational method. A series of reviews in this topical issue of EPJ ST, guest-edited by Sei Suzuki from Saitama Medical University, Japan, and Arnab Das from the Indian Association for the Cultivation of Science, Kolkota, India, focuses on the state of the art and challenges in . This approach, if proven viable, could greatly boost the capabilities of large-scale simulations and revolutionise several research fields, from biology to economics, medicine and material science.

To read more, click here.