Optimal Quantum Circuits for General Phase Estimation
Open accessThe DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
We address the problem of estimating the phase $\ensuremath{\phi}$ given $N$ copies of the phase-rotation gate ${u}_{\ensuremath{\phi}}$. We consider, for the first time, the optimization of the general case where the circuit consists of an arbitrary input state, followed by any arrangement of the $N$ phase rotations interspersed with arbitrary quantum operations, and ending with a general measurement. Using the polynomial method, we show that, in all cases where the measure of quality of the estimate $\stackrel{\texttildelow{}}{\ensuremath{\phi}}$ for $\ensuremath{\phi}$ depends only on the difference $\stackrel{\texttildelow{}}{\ensuremath{\phi}}\ensuremath{-}\ensuremath{\phi}$, the optimal scheme has a very simple fixed form. This implies that an optimal general phase estimation procedure can be found by just optimizing the amplitudes of the initial state.
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.
Integrity signals
Registry
Cites
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.
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
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Probabilistic and Statistical Aspects of Quantum Theory
Holevo, A. (2011) · doi:10.1007/978-88-7642-378-9 · Cited by 2,582
Giovannetti, V., Lloyd, S., & Maccone, L. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.010401 · Cited by 2,440
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
Quantum lower bounds by polynomials
Beals, R., Buhrman, H., Cleve, R., Mosca, M., & de Wolf, R. (2001) · Journal of the ACM · doi:10.1145/502090.502097 · Cited by 639
Self-citationEstimation of shift parameters of a quantum state
Holevo, A. S. (1978) · Reports on Mathematical Physics · doi:10.1016/0034-4877(78)90065-4 · Cited by 71
Cited by
Giovannetti, V., Lloyd, S., & Maccone, L. (2011) · Nature Photonics · doi:10.1038/nphoton.2011.35 · Cited by 3,894
Entanglement-free Heisenberg-limited phase estimation
Higgins, B. L., Berry, D. W., Bartlett, S. D., Wiseman, H. M., & Pryde, G. J. (2007) · Nature · doi:10.1038/nature06257 · Cited by 628
“[26] van Dam, W.”
MethodOn the Relationship Between Continuous- and Discrete-Time Quantum Walk
Childs, A. M. (2010) · Communications in Mathematical Physics · doi:10.1007/s00220-009-0930-1 · Cited by 411
“In particular, the initial state √ 2 M + 1 M−1 ∑ x=0 sin π(x+ 1) M + 1 |x〉 (48) minimizes the variance of the estimate [11, 20, 34], so it gives the best possible bound in (47).”
BackgroundPolino, E., Valeri, M., Spagnolo, N., & Sciarrino, F. (2020) · AVS Quantum Science · doi:10.1116/5.0007577 · Cited by 414
Chiribella, G., D’Ariano, G. M., & Perinotti, P. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.060401 · Cited by 381
Self-citation
Metadata
- Authors
- van Dam, W., D’Ariano, G. M., Ekert, A., Macchiavello, C., & Mosca, M.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2007-03-01
- Volume
- 98
- Issue
- 9
- Pages
- 090501-090501
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2143531065
- Cited by
- 94
- References
- 6
- FWCI
- 7.09
- 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.