Papers › Arbitrary accuracy iterative phase estimation algorithm as a two qubit benchmark

Arbitrary accuracy iterative phase estimation algorithm as a two qubit benchmark

25 Oct 2006arXiv:quant-ph/0610214links table onlyarchive 2025-07-28

M. Dobsicek, G. Johansson, V. S. Shumeiko, G. Wendin

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

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 multi-qubit 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 7 bits of precision is obtainable, even with very limited gate accuracies.

PaperPDFCode

Code

nmoran/qiskit-qdrift-quid19 mentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections