CoChat

Efficient quantum algorithm for preparing molecular-system-like states on a quantum computer

Open access
Wang, Hefeng, Ashhab, S., Nori, Franco · 2009 · Physical Review A
Cited by 47

The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.

Abstract

We present an efficient quantum algorithm for preparing a pure state on a quantum computer, where the quantum state corresponds to that of a molecular system with a given number $m$ of electrons occupying a given number $n$ of spin orbitals. Each spin orbital is mapped to a qubit: the states $|1⟩$ and $|0⟩$ of the qubit represent, respectively, whether the spin orbital is occupied by an electron or not. To prepare a general state in the full Hilbert space of $n$ qubits, which is of dimension ${2}^{n}$, $O({2}^{n})$ controlled-NOT gates are needed, i.e., the number of gates scales exponentially with the number of qubits. We make use of the fact that the state to be prepared lies in a smaller Hilbert space, and we find an algorithm that requires at most $O({2}^{m+1}{n}^{m}/m!)$ gates, i.e., scales polynomially with the number of qubits $n$, provided $n⪢m$. The algorithm is simulated numerically for the cases of the hydrogen molecule and the water molecule. The numerical simulations show that when additional symmetries of the system are considered, the number of gates to prepare the state can be drastically reduced, in the examples considered in this paper, by several orders of magnitude, from the above estimate.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physreva.79.042335

Cites

16 of 16 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Cited by

See all 47

Metadata

Authors
Wang, H., Ashhab, S., & Nori, F.
Venue
Physical Review A
Published
2009-04-28
Volume
79
Issue
4
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W1994186974
Cited by
47
References
16
FWCI
4.70
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.