Towards the Practical Application of Near-Term Quantum Computers in Quantum Chemistry Simulations: A Problem Decomposition Approach

06/04/2018
by   Takeshi Yamazaki, et al.
0

With the aim of establishing a framework to efficiently perform the practical application of quantum chemistry simulation on near-term quantum devices, we envision a hybrid quantum--classical framework for leveraging problem decomposition (PD) techniques in quantum chemistry. Specifically, we use PD techniques to decompose a target molecular system into smaller subsystems requiring fewer computational resources. In our framework, there are two levels of hybridization. At the first level, we use a classical algorithm to decompose a target molecule into subsystems, and utilize a quantum algorithm to simulate the quantum nature of the subsystems. The second level is in the quantum algorithm. We consider the quantum--classical variational algorithm that iterates between an expectation estimation using a quantum device and a parameter optimization using a classical device. We investigate three popular PD techniques for our hybrid approach: the fragment molecular-orbital (FMO) method, the divide-and-conquer (DC) technique, and the density matrix embedding theory (DMET). We examine the efficacy of these techniques in correctly differentiating conformations of simple alkane molecules. In particular, we consider the ratio between the number of qubits for PD and that of the full system; the mean absolute deviation; and the Pearson correlation coefficient and Spearman's rank correlation coefficient. Sampling error is introduced when expectation values are measured on the quantum device. Therefore, we study how this error affects the predictive performance of PD techniques. The present study is our first step to opening up the possibility of using quantum chemistry simulations at a scale close to the size of molecules relevant to industry on near-term quantum hardware.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/13/2020

A quantum-classical cloud platform optimized for variational hybrid algorithms

In order to support near-term applications of quantum computing, a new c...
research
07/24/2018

Computational speedups using small quantum devices

Suppose we have a small quantum computer with only M qubits. Can such a ...
research
06/28/2023

Increasing the Measured Effective Quantum Volume with Zero Noise Extrapolation

Quantum Volume is a full-stack benchmark for near-term quantum computers...
research
07/02/2019

A hybrid algorithm framework for small quantum computers with application to finding Hamiltonian cycles

Recent works have shown that quantum computers can polynomially speed up...
research
09/12/2021

Towards a variational Jordan-Lee-Preskill quantum algorithm

Rapid developments of quantum information technology show promising oppo...
research
04/16/2022

Boson sampling cannot be faithfully simulated by only the lower-order multi-boson interferences

To simulate noisy boson sampling approximating it by only the lower-orde...
research
04/30/2023

Efficient MILP Decomposition in Quantum Computing for ReLU Network Robustness

Emerging quantum computing technologies, such as Noisy Intermediate-Scal...

Please sign up or login with your details

Forgot password? Click here to reset