The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Efficient Bayesian Phase Estimation
Open accessAbstract
We introduce a new method called rejection filtering that we use to perform adaptive Bayesian phase estimation. Our approach has several advantages: it is classically efficient, easy to implement, achieves Heisenberg limited scaling, resists depolarizing noise, tracks time-dependent eigenstates, recovers from failures, and can be run on a field programmable gate array. It also outperforms existing iterative phase estimation algorithms such as Kitaev's method.
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
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
CONDENSATION—Conditional Density Propagation for Visual Tracking
Isard, M., & Blake, A. (1998) · International Journal of Computer Vision · doi:10.1023/a:1008078328650 · Cited by 4,886
A variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552
Quantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325
Quantum amplitude amplification and estimation
Brassard, G., Høyer, P., Mosca, M., & Tapp, A. (2002) · Contemporary Mathematics · doi:10.1090/conm/305/05215 · Cited by 1,680
Simulated Quantum Computation of Molecular Energies
Aspuru-Guzik, A., Dutoi, A. D., Love, P. J., & Head-Gordon, M. (2005) · Science · doi:10.1126/science.1113479 · Cited by 1,418
Towards quantum chemistry on a quantum computer
Lanyon, B. P., Whitfield, J. D., Gillett, G. G., Goggin, M. E., Almeida, M. P., Kassal, I., Biamonte, J. D., Mohseni, M., Powell, B. J., Barbieri, M., et al. (2010) · Nature Chemistry · doi:10.1038/nchem.483 · Cited by 796
Progress towards practical quantum variational algorithms
Wecker, D., Hastings, M. B., & Troyer, M. (2015) · Physical Review A · doi:10.1103/physreva.92.042303 · Cited by 716
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
Cited by
Quantum computational chemistry
McArdle, S., Endo, S., Aspuru-Guzik, A., Benjamin, S. C., & Yuan, X. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.015003 · Cited by 1,621
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560
Quantum Algorithms for Quantum Chemistry and Quantum Materials Science
Bauer, B., Bravyi, S., Motta, M., & Chan, G. K.-L. (2020) · Chemical Reviews · doi:10.1021/acs.chemrev.9b00829 · Cited by 848
Elucidating reaction mechanisms on quantum computers
Reiher, M., Wiebe, N., Svore, K. M., Wecker, D., & Troyer, M. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1619152114 · Cited by 745
“The guess heuristic used in the above discussion is known as the particle guess heuristic [28], which is known to be nearly optimal for non–parallelized phase estimation algorithms.”
BackgroundMethodInfluentialSelf-citationA Survey on quantum computing technology
Gyongyosi, L., & Imre, S. (2019) · Computer Science Review · doi:10.1016/j.cosrev.2018.11.002 · Cited by 646
Quantum Chemistry Calculations on a Trapped-Ion Quantum Simulator
Hempel, C., Maier, C., Romero, J., McClean, J., Monz, T., Shen, H., Jurcevic, P., Lanyon, B. P., Love, P., Babbush, R., et al. (2018) · Physical Review X · doi:10.1103/physrevx.8.031022 · Cited by 446
Polino, E., Valeri, M., Spagnolo, N., & Sciarrino, F. (2020) · AVS Quantum Science · doi:10.1116/5.0007577 · Cited by 414
Building a Fault-Tolerant Quantum Computer Using Concatenated Cat Codes
Chamberland, C., Noh, K., Arrangoiz-Arriola, P., Campbell, E. T., Hann, C. T., Iverson, J., Putterman, H., Bohdanowicz, T. C., Flammia, S. T., Keller, A., et al. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010329 · Cited by 281
Quantum computing enhanced computational catalysis
von Burg, V., Low, G. H., Häner, T., Steiger, D. S., Reiher, M., Roetteler, M., & Troyer, M. (2020) · arXiv · doi:10.48550/arxiv.2007.14460 · Cited by 258
Accelerated Variational Quantum Eigensolver
Wang, D., Higgott, O., & Brierley, S. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.140504 · Cited by 241
VQE method: a short survey and recent developments
Fedorov, D. A., Peng, B., Govind, N., & Alexeev, Y. (2022) · Materials Theory · doi:10.1186/s41313-021-00032-6 · Cited by 224
“QPE converges quadratically faster with scaling of O( 1 ) [32].”
BackgroundKivlichan, I. D., Gidney, C., Berry, D. W., Wiebe, N., McClean, J., Sun, W., Jiang, Z., Rubin, N., Fowler, A., Aspuru-Guzik, A., et al. (2020) · Quantum · doi:10.22331/q-2020-07-16-296 · Cited by 173
Self-citationFault-tolerant quantum simulations of chemistry in first quantization
Su, Y., Berry, D. W., Wiebe, N., Rubin, N., & Babbush, R. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040332 · Cited by 123
Self-citationExperimental phase estimation enhanced by machine learning
Lumino, A., Polino, E., Rab, A. S., Milani, G., Spagnolo, N., Wiebe, N., & Sciarrino, F. (2018) · Physical Review Applied · doi:10.1103/physrevapplied.10.044033 · Cited by 97
“compared with a previously proposed adaptive Bayesian approach [65], employed as a benchmark for the investigated techniques.”
BackgroundMethodMinimizing Estimation Runtime on Noisy Quantum Computers
Wang, G., Koh, D. E., Johnson, P. D., & Cao, Y. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010346 · Cited by 77
Metadata
- Authors
- Wiebe, N., & Granade, C.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2016-06-30
- Volume
- 117
- Issue
- 1
- Pages
- 010503-010503
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2282673650
- Cited by
- 197
- References
- 13
- FWCI
- 10.51
- 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.