pith. sign in

arxiv: quant-ph/0610214 · v3 · submitted 2006-10-25 · 🪐 quant-ph · cond-mat.mes-hall· cond-mat.supr-con· gr-qc· math-ph· math.MP

Arbitrary accuracy iterative phase estimation algorithm as a two qubit benchmark

classification 🪐 quant-ph cond-mat.mes-hallcond-mat.supr-congr-qcmath-phmath.MP
keywords algorithmbenchmarkdiscussestimationgateiterativephasequbit
0
0 comments X
read the original 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 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.