Quantum algorithms save time in the calculation of electron dynamics

The calculations allow the electron densities and the changes after excitation to be determined with high spatial and temporal resolution. Here, the example of the lithium hydride molecule shows the shift of electron density from cyanide (red) to lithium (green) during a laser pulse.

The calculations allow the electron densities and the changes after excitation to be determined with high spatial and temporal resolution. Here, the example of the lithium hydride molecule shows the shift of electron density from cyanide (red) to lithium (green) during a laser pulse. © F. Langkabel / HZB

Quantum computers promise significantly shorter computing times for complex problems. But there are still only a few quantum computers worldwide with a limited number of so-called qubits. However, quantum computer algorithms can already run on conventional servers that simulate a quantum computer. A team at HZB has succeeded to calculate the electron orbitals and their dynamic development on the example of a small molecule after a laser pulse excitation. In principle, the method is also suitable for investigating larger molecules that cannot be calculated using conventional methods.

 

"These quantum computer algorithms were originally developed in a completely different context. We used them here for the first time to calculate electron densities of molecules, in particular also their dynamic evolution after excitation by a light pulse," says Annika Bande, who heads a group on theoretical chemistry at HZB. Together with Fabian Langkabel, who is doing his doctorate with Bande, she has now shown in a study how well this works.

Error-free quantum computer

"We developed an algorithm for a fictitious, completely error-free quantum computer and ran it on a classical server simulating a quantum computer of ten Qbits," says Fabian Langkabel. The scientists limited their study to smaller molecules in order to be able to perform the calculations without a real quantum computer and to compare them with conventional calculations.

Faster computation

Indeed, the quantum algorithms produced the expected results. In contrast to conventional calculations, however, the quantum algorithms are also suitable for calculating significantly larger molecules with future quantum computers: "This has to do with the calculation times. They increase with the number of atoms that make up the molecule," says Langkabel. While the computing time multiplies with each additional atom for conventional methods, this is not the case for quantum algorithms, which makes them much faster.

Photocatalysis, light reception and more

The study thus shows a new way to calculate electron densities and their "response" to excitations with light in advance with very high spatial and temporal resolution. This makes it possible, for example, to simulate and understand ultrafast decay processes, which are also crucial in quantum computers made of so-called quantum dots. Also predictions about the physical or chemical behaviour of molecules are possible, for example during the absorption of light and the subsequent transfer of electrical charges. This could facilitate the development of photocatalysts for the production of green hydrogen with sunlight or help to understand processes in the light-sensitive receptor molecules in the eye.

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.