Quantum chemistry on quantum computers

January 2, 2019, Osaka City University
Credit: CC0 Public Domain

Quantum computing and quantum information processing technology have attracted attention in recently emerging fields. Among many important and fundamental issues in science, solving the Schroedinger equation (SE) of atoms and molecules is one of the ultimate goals in chemistry, physics and their related fields. SE is the first principle of non-relativistic quantum mechanics, whose solutions, termed wave functions, can afford any information of electrons within atoms and molecules, predicting their physicochemical properties and chemical reactions.

Dr. K. Sugisaki, Profs. K. Sato and T. Takui and coworkers, all researchers from Osaka City University (OCU) in Japan, have found a novel algorithm enabling us to perform full configuration interaction (Full-CI) calculations suitable for "" without exponential/combinatorial explosion. Full-CI gives the exact numerical solutions of SE, which are intractable problems even for supercomputers. Such a quantum algorithm contributes to the acceleration of implementing practical quantum computers. Since 1929, chemistry and physics have sought to predict complex reactions by invoking Full-CI approaches, but they have never been successful until now. Full-CI calculations are potentially capable of predicting chemical reactions. The researchers of the current study report a new Full-CI approach implemented on quantum computers for the first time.

The paper is published in ACS Central Science.

They write, "As Dirac claimed in 1929 when quantum mechanics was established, the exact application of mathematical theories to solve SE leads to equations too complicated to be solvable. In fact, the number of variables to be determined in the Full-CI method grows exponentially against the system size, and it easily runs into astronomical figures such as exponential explosion. For example, the dimension of the Full-CI for benzene molecule C6H6, in which only 42 electrons are involved, amounts to 1044, which is impossible to be dealt with by any supercomputer. Worse, molecular systems during the dissociation process are characterized by extremely complex electronic structures (multiconfigurational nature), and relevant numerical calculations are impossible on any supercomputer."

According to the OCU research group, quantum computers date back to Feynman's suggestion in 1982 that quantum mechanics can be simulated by a itself built of quantum mechanical elements that obey quantum mechanical laws. More than 20 years later, Prof. Aspuru-Guzik, Harvard Univ. (Toronto Univ. since 2018) and coworkers have proposed a quantum algorithm capable of calculating the energies of atoms and molecules not exponentially but polynomially against the number of the variables of the systems, making a breakthrough in the field of quantum chemistry on quantum computers.

When Aspuru's quantum algorithm is applied to the Full-CI calculations on quantum computers, good approximate close to the exact wave functions of SE under study are required. Otherwise, bad wave functions need an extreme number of steps of repeated calculations to reach the exact ones, hampering the advantages of . This problem becomes extremely serious for the analyses of chemical reactions, which have a multiconfigurational nature due to electrons not participating in chemical bonding during the bond dissociation. The OCU researchers have tackled this problem, one of the most intractable issues in quantum science and chemistry, and made a breakthrough in implementing a new quantum algorithm generating particular wave functions called configuration state functions (CSFs) in polynomial computing time.

The previously proposed algorithms for quantum computing, however, inevitably involve the dissociation and formation of many chemical bonds, and as a result, generate many electrons not participating in chemical bonds, making the quantum algorithms difficult to apply. This is termed the "Quantum Dilemma."

The OCU researchers have introduced a diradical character, yi(0 ~ 1), to measure and characterize the nature of open shell electronic structures, and have exploited the diradical characters to construct multiconfigurational wave functions required for chemical reactions, executing the Full-CI calculations along the whole reaction pathway on quantum computers. This new procedure requires no time-consuming post-Hartree-Fock calculations, avoiding the exponential explosion of the calculation, solving the "Quantum Dilemma" for the first time. The OCU group writes, "This is the first example of a practical quantum algorithm that makes quantum chemical calculations for predicting chemical reaction pathways realizable on quantum computers equipped with a sizable number of qubits. The implementation empowers practical applications of quantum chemical calculations on quantum computers in many important fields of chemistry and materials science."

Explore further: First proof of quantum computer advantage

More information: Kenji Sugisaki et al, Quantum Chemistry on Quantum Computers: A Method for Preparation of Multiconfigurational Wave Functions on Quantum Computers without Performing Post-Hartree–Fock Calculations, ACS Central Science (2018). DOI: 10.1021/acscentsci.8b00788

Related Stories

First proof of quantum computer advantage

October 18, 2018

For many years, quantum computers were not much more than an idea. Today, companies, governments and intelligence agencies are investing in the development of quantum technology. Robert König, professor for the theory of ...

How to certify a quantum computer

November 5, 2018

Quantum computers are being developed by teams working not only at universities but also at Google, IBM, Microsoft and D-Wave, a start-up company. And things are evolving quickly, says Nicolas Sangouard, SNSF Professor at ...

Quantum algorithm breakthrough

February 24, 2013

An international research group led by scientists from the University of Bristol, UK, and the University of Queensland, Australia, has demonstrated a quantum algorithm that performs a true calculation for the first time. ...

Recommended for you

Physicists discover new class of pentaquarks

March 26, 2019

Tomasz Skwarnicki, professor of physics in the College of Arts and Sciences at Syracuse University, has uncovered new information about a class of particles called pentaquarks. His findings could lead to a new understanding ...

Coffee-based colloids for direct solar absorption

March 22, 2019

Solar energy is one of the most promising resources to help reduce fossil fuel consumption and mitigate greenhouse gas emissions to power a sustainable future. Devices presently in use to convert solar energy into thermal ...

Physicists reveal why matter dominates universe

March 21, 2019

Physicists in the College of Arts and Sciences at Syracuse University have confirmed that matter and antimatter decay differently for elementary particles containing charmed quarks.

1 comment

Adjust slider to filter visible comments by rank

Display comments: newest first

5 / 5 (2) Jan 02, 2019
One of the first problems I tackled in high school (in the 1960's) was calculating the Schroedinger equation for a single point. Brings back memories of Fortran and card decks and an old IBM 1620 computer with 16k words of memory.

Even with the simplifications found in this latest work, the number of qubits required for practical problems probably runs into the thousands (anyone with more accurate info than my speculation please correct me). I am confident that quantum computers of that size will be eventually built, but not today.

I am recently retired after 45 years as a professional software developer and I one of the things I most hope to see in my lifetime is such computers coming into widespread enough use I will be able to program one.

Probably not, but I am eternally optimistic.

Please sign in to add a comment. Registration is free, and takes less than a minute. Read more

Click here to reset your password.
Sign in to get notified via email when new comments are made.