Cited by 209Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum Mechanics and Applications

Arbitrary accuracy iterative quantum phase estimation algorithm using a single ancillary qubit: A two-qubit benchmark

Open access
Dobšíček, Miroslav, Johansson, Göran, Shumeiko, Vitaly, Wendin, Göran·2007·Physical Review A

Abstract

We discuss the implementation of an iterative quantum phase estimation algorithm with a single ancillary qubit. We suggest using this algorithm as a benchmark for multiqubit implementations. Furthermore, we describe in detail the smallest possible realization, using only two qubits, and exemplify with a superconducting circuit. We discuss the robustness of the algorithm in the presence of gate errors, and show that seven bits of precision is obtainable, even with very limited gate accuracies.

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1103/physreva.76.030306

Cites

35 of 35 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • In the adiabatic regime, the evolved state has support at least 1 - O(1/T) on the ground state.

    “This is a so-called adiabatic regime where the evolved state has support at least 1 -O ( 1 T ) on the ground state 292 .”

    From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [292]

Self-check

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

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

Cites

Flagged first, then by citations

Research works printed but not linked: 4

  1. ͓3͔ A. C. J. ter Haar, Ph.D. thesis, Delft University, 2005 ͑unpub- lished͒.
  2. ͓17͔ R. Cleve, A. Ekert, C. Macchiavello, and M. Mosca, Proc. R. Soc. London, Ser. A 454, 339 ͑1998͒;
  3. Michael A. Nielsen and Isaac L. Chuang, Quantum Computation and Quantum Infor- mation ͑Cambridge University Press, Cambridge, England, 2001͒.
  4. ͓28͔ G. Wendin and V. S. Shumeiko, in Handbook of Theoretical and Computational Nanotechnology, edited by M. Rieth and W. Schommers ͑ASP, Los Angeles, 2006͒, Vol. 3, pp. 223-309.

Cited by

Sorted by citations

Authors
Dobšíček, M., Johansson, G., Shumeiko, V., & Wendin, G.
Affiliations
Chalmers University of Technology (SE)
Venue
Physical Review A
Published
2007-09-19
Volume
76
Issue
3
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W149097284
Cited by
208
References
33
Citations by year
2026: 9 · 2025: 17 · 2024: 25 · 2023: 46 · 2022: 23 · 2021: 28 · 2020: 14 · 2019: 12 · 2018: 1 · 2017: 3 · 2016: 4 · 2015: 2 · 2014: 1 · 2013: 4 · 2012: 3
FWCI
3.94
Type
journal article
Language
en
Open access
Locations
  • Physical Review A (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • Chalmers Publication Library (Chalmers University of Technology) (submittedVersion)
  • Chalmers Research (Chalmers University of Technology) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
quantum phase estimation, iterative phase estimation, superconducting circuits, quantum benchmarking

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