CoChat

Near-optimal quantum circuit for Grover's unstructured search using a transverse field

Open access
Jiang, Zhang, Rieffel, Eleanor G., Wang, Zhihui · 2017 · Physical Review A
Cited by 142

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

Abstract

Inspired by a class of algorithms proposed by Farhi et al. (arXiv:1411.4028), namely, the quantum approximate optimization algorithm (QAOA), we present a circuit-based quantum algorithm to search for a needle in a haystack, obtaining the same quadratic speedup achieved by Grover's original algorithm. In our algorithm, the problem Hamiltonian (oracle) and a transverse field are applied alternately to the system in a periodic manner. We introduce a technique, based on spin-coherent states, to analyze the composite unitary in a single period. This composite unitary drives a closed transition between two states that have high degrees of overlap with the initial state and the target state, respectively. The transition rate in our algorithm is of order $\mathrm{\ensuremath{\Theta}}(1/\sqrt{N})$, and the overlaps are of order $\mathrm{\ensuremath{\Theta}}(1)$, yielding a nearly optimal query complexity of $T\ensuremath{\simeq}\sqrt{N}\phantom{\rule{0.4pt}{0ex}}(\ensuremath{\pi}/2\sqrt{2})$. Our algorithm is a QAOA circuit that demonstrates a quantum advantage with a large number of iterations that is not derived from Trotterization of an adiabatic quantum optimization (AQO) algorithm. It also suggests that the analysis required to understand QAOA circuits involves a very different process from estimating the energy gap of a Hamiltonian in AQO.

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.95.062317

Cites

10 of 10 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

Show all 10 references

Research works printed but not linked: 8

  1. L. K. Grover, 1996, Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing: STOC '96
  2. 10.1103/PhysRevX.4.031027 · DOI · Paper page
  3. 10.1103/PhysRevA.57.2403 · DOI · Paper page
  4. Z. Diao, 2002, Z. Naturforsch., 57a, 701, 10.1515/zna-2002-0810 · DOI
  5. 10.1103/PhysRevLett.117.180402 · DOI · Paper page
  6. 10.1088/0305-4470/4/3/009 · DOI · Paper page
  7. A. Perelomov, 1986, Generalized Coherent States and Their Applications, 10.1007/978-3-642-61629-7 · DOI · Paper page
  8. 10.1103/PhysRevX.3.041013 · DOI

Cited by

See all 142

Metadata

Authors
Jiang, Z., Rieffel, E. G., & Wang, Z.
Venue
Physical Review A
Published
2017-06-12
Volume
95
Issue
6
ISSN
  • 0556-2791 (ISSN-L)
  • 2469-9926
  • 2469-9934
OpenAlex
W2625750408
Cited by
142
References
10
FWCI
4.76
Type
journal article
Language
en
Open access
green
Funders
  • National Aeronautics and Space Administration
  • Air Force Research Laboratory (F4HBKC4162G001)
  • Office of the Director of National Intelligence

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Near-optimal quantum circuit for Grover's unstructured search using a transverse field. https://app.cochat.ai/papers/10.1103/physreva.95.062317
The paper
Jiang, Z., Rieffel, E. G., & Wang, Z. (2017). Near-optimal quantum circuit for Grover's unstructured search using a transverse field. Physical Review A. https://doi.org/10.1103/physreva.95.062317

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.