Mathematical tool helps calculate properties of quantum materials more quickly

Intelligent mathematical tools for the simulation of spin systems reduce the computing time required on supercomputers. Some of the fastest supercomputers in the world are currently located at Forschungszentrum Jülich (shown here is JUWELS).

Intelligent mathematical tools for the simulation of spin systems reduce the computing time required on supercomputers. Some of the fastest supercomputers in the world are currently located at Forschungszentrum Jülich (shown here is JUWELS). © Forschungszentrum Jülich/Sascha Kreklau

Many quantum materials have been nearly impossible to simulate mathematically because the computing time required is too long. Now a joint research group at Freie Universität Berlin and the Helmholtz-Zentrum Berlin (HZB) has demonstrated a way to considerably reduce the computing time. This could accelerate the development of materials for energy-efficient IT technologies of the future.

Supercomputers around the world work around the clock on research problems. In principle, even novel materials can be simulated in computers in order to calculate their magnetic and thermal properties as well as their phase transitions. The gold standard for this kind of modelling is known as the quantum Monte Carlo method.

Wave-Particle Dualism

However, this method has an intrinsic problem: due to the physical wave-particle dualism of quantum systems, each particle in a solid-state compound not only possesses particle-like properties such as mass and momentum, but also wave-like properties such as phase. Interference causes the “waves“ to be superposed on each other, so that they either amplify (add) or cancel (subtract) each other locally. This makes the calculations extremely complex. It is referred to the sign problem of the quantum Monte Carlo method.

Minimisation of the problem

“The calculation of quantum material characteristics costs about one million hours of CPU on mainframe computers every day“, says Prof. Jens Eisert, who heads the joint research group at Freie Universität Berlin and the HZB. “This is a very considerable proportion of the total available computing time.“ Together with his team, the theoretical physicist has now developed a mathematical procedure by which the computational cost of the sign problem can be greatly reduced. “We show that solid-state systems can be viewed from very different perspectives. The sign problem plays a different role in these different perspectives. It is then a matter of dealing with the solid-state system in such a way that the sign problem is minimised“, explains Dominik Hangleiter, first author of the study that has now been published in Science Advances.

From simple spin systems to more complex ones

For simple solid-state systems with spins, which form what are known as Heisenberg ladders, this approach has enabled the team to considerably reduce the computational time for the sign problem. However, the mathematical tool can also be applied to more complex spin systems and promises faster calculation of their properties.

“This provides us with a new method for accelerated development of materials with special spin properties“, says Eisert. These types of materials could find application in future IT technologies for which data must be processed and stored with considerably less expenditure of energy.

 

Science Advances 2020: Easing the Monte Carlo sign problem; Dominik Hangleiter, Ingo Roth, Daniel Nagaj, Jens Eisert

Doi: 10.1126/sciadv.abb8341

arö


You might also be interested in

  • Neutron experiment at BER II reveals new spin phase in quantum materials
    Science Highlight
    18.03.2024
    Neutron experiment at BER II reveals new spin phase in quantum materials
    New states of order can arise in quantum magnetic materials under magnetic fields. An international team has now gained new insights into these special states of matter through experiments at the Berlin neutron source BER II and its High-Field Magnet. BER II served science until the end of 2019 and has since been shut down. Results from data at BER II are still being published.

  • Where quantum computers can score
    Science Highlight
    15.03.2024
    Where quantum computers can score
    The travelling salesman problem is considered a prime example of a combinatorial optimisation 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 methods.
  • The future of BESSY
    News
    07.03.2024
    The future of BESSY
    At the end of February 2024, a team at HZB published an article in Synchrotron Radiation News (SRN). They describe the next development goals for the light source as well as the BESSY II+ upgrade programme and the successor source BESSY III.