Using quantum computers for computational chemistry and materials science will enable us to tackle problems that are intractable on classical computers. In this paper, we show how the relative energy of defective graphene structures can be calculated by using a quantum annealer. This simple system is used to guide the reader through the steps needed to translate a chemical structure (a set of atoms) and energy model to a representation that can be implemented on quantum annealers (a set of qubits). We discuss in detail how different energy contributions can be included in the model and what their effect is on the final result. The code used to run the simulation on D-Wave quantum annealers is made available as a Jupyter Notebook. This Tutorial was designed to be a quick-start guide for the computational chemists interested in running their first quantum annealing simulations. The methodology outlined in this paper represents the foundation for simulating more complex systems, such as solid solutions and disordered systems.
Using quantum computers for computational chemistry and materials science will enable us to tackle problems that are intractable on classical computers. In this paper, we show how the relative energy of defective graphene structures can be calculated by using a quantum annealer. This simple system is used to guide the reader through the steps needed to translate a chemical structure (a set of atoms) and energy model to a representation that can be implemented on quantum annealers (a set of qubits). We discuss in detail how different energy contributions can be included in the model and what their effect is on the final result. The code used to run the simulation on D-Wave quantum annealers is made available as a Jupyter Notebook. This Tutorial was designed to be a quick-start guide for the computational chemists interested in running their first quantum annealing simulations. The methodology outlined in this paper represents the foundation for simulating more complex systems, such as solid solutions and disordered systems.
Abstract A promising area of application of quantum computing is computational materials science. In addition to the actively discussed use of quantum computers as simulators for modeling quantum systems, the possibility of using quantum computing to solve the problems of determining the parameters of model multiparameter potentials of intermolecular interaction is of great interest. Especially attractive for these purposes is the method of quantum annealing, as currently the most developed quantum computing technology to solve complex optimization problems. As a first step, the paper presents the algorithms developed for determining the parameters of two classical potentials—Lennard-Jones and Buckingham, designed for implementation on a quantum annealer. We demonstrate mathematical methods for the development of such algorithms. One of them seems to be worthy for the further development and promising for solving more complex problems. Also, we evaluate the scalability of the presented algorithms and justify the possibility of their practical implementation on the current version of the D-Wave quantum annealer.
Quantum annealers have grown in complexity to the point that quantum computations involving a few thousand qubits are now possible. In this paper, with the intentions to show the feasibility of quantum annealing to tackle problems of physical relevance, we used a simple model, compatible with the capability of current quantum annealers, to study the relative stability of graphene vacancy defects. By mapping the crucial interactions that dominate carbon-vacancy interchange onto a quadratic unconstrained binary optimization problem, our approach exploits the ground state as well as the excited states found by the quantum annealer to extract all the possible arrangements of multiple defects on the graphene sheet together with their relative formation energies. This approach reproduces known results and provides a stepping stone towards applications of quantum annealing to problems of physical-chemical interest.
Abstract Quantum materials exhibit a wide array of exotic phenomena and practically useful properties. A better understanding of these materials can provide deeper insights into fundamental physics in the quantum realm as well as advance information processing technology and sustainability. The emergence of digital quantum computers (DQCs), which can efficiently perform quantum simulations that are otherwise intractable on classical computers, provides a promising path forward for testing and analyzing the remarkable, and often counter-intuitive, behavior of quantum materials. Equipped with these new tools, scientists from diverse domains are racing towards achieving physical quantum advantage (i.e. using a quantum computer to learn new physics with a computation that cannot feasibly be run on any classical computer). The aim of this review, therefore, is to provide a summary of progress made towards this goal that is accessible to scientists across the physical sciences. We will first review the available technology and algorithms, and detail the myriad ways to represent materials on quantum computers. Next, we will showcase the simulations that have been successfully performed on currently available DQCs, emphasizing the variety of properties, both static and dynamic, that can be studied with this nascent technology. Finally, we work through three examples of how to perform various materials simulation problems on DQCs, with full code included in the supplementary material ( https://stacks.iop.org/QST/6/043002/mmedia ). It is our hope that this review can serve as an organized overview of progress in the field for domain experts and an accessible introduction to scientists in related fields interested in beginning to perform their own simulations of quantum materials on DQCs.
Materials science has been developed over the last few decades with great help from digital simulations on the supercomputers that we have available in the current century. However, there are certainly known limits to how far these simulations can go and which systems we can simulate in an effective computation time. Quantum computing comes with promises to break certain barriers of classical computing, increasing the computing capacity available for the most diverse tasks, and, possibly, one of them will be materials science. In our work, we carried out a bibliographic review of what is currently done for the simulation of periodic materials through quantum computing, as well as we also carried out some simulations on quantum computers available for public access. A major point of our survey was that, among all applications of quantum computing, the application in periodic solid physics is still modest, while the applications on molecules being one of the largest sources of works and references. With that in mind, we were able to perform simulations for the band structure of some atoms, such as silicon and graphene, in a local simulator. We were also able to simulate a generalized Hamiltonian model in a quantum machine in silico, to study its behavior as we varied its parameters. For graphene, we were able to compute its structure in a local simulator and the result was similar to that expected in the literature. For silicon, we obtained a marked difference in its excited energy state, which we believe to be due to the simplicity of our approximation.
Computational chemistry plays a vital role in material sciences. A fast evolving technology called quantum computing has shifted computational capabilities as it promises to solve impossible calculations in some areas of material sciences and drug development. In principle, quantum computers can solve certain problems in chemistry exponentially more quickly than classical computers. As quantum computers have an error-corrected quantum system, it reduces the quantum resources to run the quantum calculations in space drastically using the Trotterization approach with small qubitization. This nascent field is showing fast progress and potential benefits as it can process large amounts of information. The algorithms used for optimization and quantum simulations help to improve the advanced computational calculations for large clusters. These algorithms help in protein structure prediction to network analysis. Yet this nascent field has its own caveats and challenges. In this chapter, we introduce the basic architecture of quantum computing and its promises and limitations in the field of computational chemistry. The quantum algorithms revolutionizing quantum computing are discussed in detail.
Accurate prediction of chemical and material properties from first principles quantum chemistry is a challenging task on traditional computers. Recent developments in quantum computation offer a route toward highly accurate solutions with polynomial cost. —Jarrod R. McClean, Ryan Babbush, Peter J. Love, and Alán Aspuru-Guzik, J. Phys. Chem. Lett. , 24:4368– 4380 (2014), https://pubs.acs.org/ doi/10.1021/jz501649m. Information processing employing mathematical modeling using qubits has enormous potential in drug development for clinical trials against dreadful diseases. There are many different ways in which a molecule can be folded to optimize a chemical reaction. Designing smart materials for emerging technologies also requires mathematical simulations, most efficiently implemented on a quantum computer. In this appendix, we provide a cursory introduction to the young and expanding field of electron structure studies with qubits. The original meaning of the term quantum supremacy proposed by John Preskill in 2012 was intended to describe the point where quantum computers can do things that classical computers cannot . It is often interpreted as the demonstrated and quantified ability to process any problem faster on a quantum computer than on a classic computer. The term quantum advantage is also much in vogue; it is used to describe attainment of a quantum computational algorithm in solving a real-world problem faster than on a classical computer. Platforms for the development of quantum computing architecture include (a) quantum gate – based (Chapter 11) and (b) quantum annealing – based approach (which employs optimization techniques akin to those in operations research). Industry giants such as Google, Honeywell, IBM, and Intel use the quantum gate–based platform, while D-wave systems employs quantum annealing. The quantum phase estimation (QPE) was the first algorithm that was proposed to solve the Schrödinger equation on a quantum computer. It is a fully quantum algorithm to obtain eigenvalues of a Hamiltonian, but it requires rather sophisticated hardware and employs the inverse quantum Fourier transform (IQFT) method. It is a multipurpose program that is a part of other quantum algorithms, including Shor's algorithm. A full configuration-interaction computation that provides variationally the best wavefunction has been carried out using the QPE algorithm [1]. However, QPE requires a very large number of qubits. An alternative approach employs the variational quantum eigensolver (VQE), which utilizes quantum and classical resources to solve quantum eigenvalue problems [2]. Of specific interest is the study of many-electron correlations.