### Abstract

As quantum computing technology improves and quantum computers with a small but nontrivial number of N≥100 qubits appear feasible in the near future the question of possible applications of small quantum computers gains importance. One frequently mentioned application is Feynman's original proposal of simulating quantum systems and, in particular, the electronic structure of molecules and materials. In this paper, we analyze the computational requirements for one of the standard algorithms to perform quantum chemistry on a quantum computer. We focus on the quantum resources required to find the ground state of a molecule twice as large as what current classical computers can solve exactly. We find that while such a problem requires about a 10-fold increase in the number of qubits over current technology, the required increase in the number of gates that can be coherently executed is many orders of magnitude larger. This suggests that for quantum computation to become useful for quantum chemistry problems, drastic algorithmic improvements will be needed.

Original language | English (US) |
---|---|

Article number | 022305 |

Journal | Physical Review A - Atomic, Molecular, and Optical Physics |

Volume | 90 |

Issue number | 2 |

DOIs | |

State | Published - Aug 6 2014 |

### Fingerprint

### ASJC Scopus subject areas

- Atomic and Molecular Physics, and Optics

### Cite this

*Physical Review A - Atomic, Molecular, and Optical Physics*,

*90*(2), [022305]. https://doi.org/10.1103/PhysRevA.90.022305

**Gate-count estimates for performing quantum chemistry on small quantum computers.** / Wecker, Dave; Bauer, Bela; Clark, Bryan K.; Hastings, Matthew B.; Troyer, Matthias.

Research output: Contribution to journal › Article

*Physical Review A - Atomic, Molecular, and Optical Physics*, vol. 90, no. 2, 022305. https://doi.org/10.1103/PhysRevA.90.022305

}

TY - JOUR

T1 - Gate-count estimates for performing quantum chemistry on small quantum computers

AU - Wecker, Dave

AU - Bauer, Bela

AU - Clark, Bryan K.

AU - Hastings, Matthew B.

AU - Troyer, Matthias

PY - 2014/8/6

Y1 - 2014/8/6

N2 - As quantum computing technology improves and quantum computers with a small but nontrivial number of N≥100 qubits appear feasible in the near future the question of possible applications of small quantum computers gains importance. One frequently mentioned application is Feynman's original proposal of simulating quantum systems and, in particular, the electronic structure of molecules and materials. In this paper, we analyze the computational requirements for one of the standard algorithms to perform quantum chemistry on a quantum computer. We focus on the quantum resources required to find the ground state of a molecule twice as large as what current classical computers can solve exactly. We find that while such a problem requires about a 10-fold increase in the number of qubits over current technology, the required increase in the number of gates that can be coherently executed is many orders of magnitude larger. This suggests that for quantum computation to become useful for quantum chemistry problems, drastic algorithmic improvements will be needed.

AB - As quantum computing technology improves and quantum computers with a small but nontrivial number of N≥100 qubits appear feasible in the near future the question of possible applications of small quantum computers gains importance. One frequently mentioned application is Feynman's original proposal of simulating quantum systems and, in particular, the electronic structure of molecules and materials. In this paper, we analyze the computational requirements for one of the standard algorithms to perform quantum chemistry on a quantum computer. We focus on the quantum resources required to find the ground state of a molecule twice as large as what current classical computers can solve exactly. We find that while such a problem requires about a 10-fold increase in the number of qubits over current technology, the required increase in the number of gates that can be coherently executed is many orders of magnitude larger. This suggests that for quantum computation to become useful for quantum chemistry problems, drastic algorithmic improvements will be needed.

UR - http://www.scopus.com/inward/record.url?scp=84905643815&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84905643815&partnerID=8YFLogxK

U2 - 10.1103/PhysRevA.90.022305

DO - 10.1103/PhysRevA.90.022305

M3 - Article

AN - SCOPUS:84905643815

VL - 90

JO - Physical Review A

JF - Physical Review A

SN - 2469-9926

IS - 2

M1 - 022305

ER -