{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T18:20:50Z","timestamp":1781634050309,"version":"3.54.5"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T00:00:00Z","timestamp":1578528000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T00:00:00Z","timestamp":1578528000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","award":["Quantum Leap Flagship Program Grant Number JPMXS0118067285"],"award-info":[{"award-number":["Quantum Leap Flagship Program Grant Number JPMXS0118067285"]}],"id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2020,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper focuses on the quantum amplitude estimation algorithm, which is a core subroutine in quantum computation for various applications. The conventional approach for amplitude estimation is to use the phase estimation algorithm, which consists of many controlled amplification operations followed by a quantum Fourier transform. However, the whole procedure is hard to implement with current and near-term quantum computers. In this paper, we propose a quantum amplitude estimation algorithm without the use of expensive controlled operations; the key idea is to utilize the maximum likelihood estimation based on the combined measurement data produced from quantum circuits with different numbers of amplitude amplification operations. Numerical simulations we conducted demonstrate that our algorithm asymptotically achieves nearly the optimal quantum speedup with a reasonable circuit length.<\/jats:p>","DOI":"10.1007\/s11128-019-2565-2","type":"journal-article","created":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T07:11:56Z","timestamp":1578553916000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":191,"title":["Amplitude estimation without phase estimation"],"prefix":"10.1007","volume":"19","author":[{"given":"Yohichi","family":"Suzuki","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shumpei","family":"Uno","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rudy","family":"Raymond","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tomoki","family":"Tanaka","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tamiya","family":"Onodera","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8497-4608","authenticated-orcid":false,"given":"Naoki","family":"Yamamoto","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,1,9]]},"reference":[{"key":"2565_CR1","unstructured":"IBM Q Experience: https:\/\/quantumexperience.ng.bluemix.net\/qx\/editor (2019). Accessed 26 Mar 2019"},{"key":"2565_CR2","first-page":"021012","volume":"8","author":"N Friis","year":"2018","unstructured":"Friis, N., Marty, O., Maier, C., Hempel, C., Holz\u00e4pfel, M., Jurcevic, P., Plenio, M.B., Huber, M., Roos, C., Blatt, R., Lanyon, B.: Observation of entangled states of a fully controlled 20-qubit system. Phys. Rev. X 8, 021012 (2018)","journal-title":"Phys. Rev. X"},{"key":"2565_CR3","doi-asserted-by":"publisher","first-page":"180511","DOI":"10.1103\/PhysRevLett.119.180511","volume":"119","author":"C Song","year":"2017","unstructured":"Song, C., Xu, K., Liu, W., Yang, Cp, Zheng, S.B., Deng, H., Xie, Q., Huang, K., Guo, Q., Zhang, L., Zhang, P., Xu, D., Zheng, D., Zhu, X., Wang, H., Chen, Y.A., Lu, C.Y., Han, S., Pan, J.W.: 10-qubit entanglement and parallel logic operations with a superconducting circuit. Phys. Rev. Lett. 119, 180511 (2017)","journal-title":"Phys. Rev. Lett."},{"key":"2565_CR4","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill, J.: Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018)","journal-title":"Quantum"},{"key":"2565_CR5","doi-asserted-by":"publisher","first-page":"023023","DOI":"10.1088\/1367-2630\/18\/2\/023023","volume":"18","author":"JR McClean","year":"2016","unstructured":"McClean, J.R., Romero, J., Babbush, R., Aspuru-Guzik, A.: The theory of variational hybrid quantum-classical algorithms. New J. Phys. 18, 023023 (2016)","journal-title":"New J. Phys."},{"key":"2565_CR6","doi-asserted-by":"publisher","first-page":"3589","DOI":"10.1038\/srep03589","volume":"4","author":"MH Yung","year":"2014","unstructured":"Yung, M.H., Casanova, J., Mezzacapo, A., McClean, J., Lamata, L., Aspuru-Guzik, A., Solano, E.: From transistor to trapped-ion computers for quantum chemistry. Sci. Rep. 4, 3589 (2014)","journal-title":"Sci. Rep."},{"key":"2565_CR7","doi-asserted-by":"publisher","first-page":"012328","DOI":"10.1103\/PhysRevA.75.012328","volume":"75","author":"E Knill","year":"2007","unstructured":"Knill, E., Ortiz, G., Somma, R.D.: Optimal quantum measurements of expectation values of observables. Phys. Rev. A 75, 012328 (2007)","journal-title":"Phys. Rev. A"},{"key":"2565_CR8","doi-asserted-by":"publisher","first-page":"18681","DOI":"10.1073\/pnas.0808245105","volume":"105","author":"I Kassala","year":"2008","unstructured":"Kassala, I., Jordan, S.P., Lovec, P.J., Mohsenia, M., Aspuru-Guzik, A.: Polynomial-time quantum algorithm for the simulation of chemical dynamics. Proc. Natl. Acad. Sci. USA 105, 18681\u201318686 (2008)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2565_CR9","doi-asserted-by":"publisher","first-page":"022321","DOI":"10.1103\/PhysRevA.98.022321","volume":"98","author":"P Rebentrost","year":"2018","unstructured":"Rebentrost, P., Gupt, B., Bromley, T.R.: Quantum computational finance: Monte Carlo pricing of financial derivatives. Phys. Rev. A 98, 022321 (2018)","journal-title":"Phys. Rev. A"},{"key":"2565_CR10","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1038\/s41534-019-0130-6","volume":"5","author":"S Woerner","year":"2019","unstructured":"Woerner, S., Egger, D.J.: Quantum risk analysis. npj Quantum Inf. 5, 15 (2019)","journal-title":"npj Quantum Inf."},{"key":"2565_CR11","first-page":"316","volume":"15","author":"N Wiebe","year":"2015","unstructured":"Wiebe, N., Kapoor, A., Svore, K.M.: Quantum algorithms for nearest-neighbor methods for supervised and unsupervised learning. Quantum Inf. Comput. 15, 316\u2013356 (2015)","journal-title":"Quantum Inf. Comput."},{"key":"2565_CR12","first-page":"541","volume":"16","author":"N Wiebe","year":"2016","unstructured":"Wiebe, N., Kapoor, A., Svore, K.M.: Quantum deep learning. Quantum Inf. Comput. 16, 541\u2013587 (2016)","journal-title":"Quantum Inf. Comput."},{"key":"2565_CR13","unstructured":"Wiebe, N., Kapoor, A., Svore, K.M.: Quantum perceptron models. In: Proceedings of the 30th International Conference on Neural Information Processing Systems, pp. 4006\u20134014 (2016)"},{"key":"2565_CR14","unstructured":"Kerenidis, I., Landman, J., Luongo, A., Prakash, A.: q-means: A quantum algorithm for unsupervised machine learning. arXiv:1812.03584 (2018)"},{"key":"2565_CR15","doi-asserted-by":"publisher","first-page":"20150301","DOI":"10.1098\/rspa.2015.0301","volume":"471","author":"A Montanaro","year":"2015","unstructured":"Montanaro, A.: Quantum speedup of Monte Carlo methods. Proc. Royal Soc. A 471, 20150301 (2015)","journal-title":"Proc. Royal Soc. A"},{"key":"2565_CR16","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1090\/conm\/305\/05215","volume":"305","author":"G Brassard","year":"2002","unstructured":"Brassard, G., H\u00f8yer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. Contemp. Math. Ser. Millenn. 305, 53\u201374 (2002)","journal-title":"Contemp. Math. Ser. Millenn."},{"key":"2565_CR17","unstructured":"Kitaev, A.Y.: Quantum measurements and the Abelian stabilizer problem. Electron. Colloq. Comput. Complex. arXiv:quant-ph\/9511026 (1996)"},{"key":"2565_CR18","first-page":"306","volume":"14","author":"KM Svore","year":"2014","unstructured":"Svore, K.M., Hastings, M.B., Freedman, M.: Faster phase estimation. Quantum Inf. Comput. 14, 306\u2013328 (2014)","journal-title":"Quantum Inf. Comput."},{"key":"2565_CR19","doi-asserted-by":"publisher","first-page":"010503","DOI":"10.1103\/PhysRevLett.117.010503","volume":"117","author":"N Wiebe","year":"2016","unstructured":"Wiebe, N., Granade, C.: Efficient Bayesian phase estimation. Phys. Rev. Lett. 117, 010503 (2016)","journal-title":"Phys. Rev. Lett."},{"key":"2565_CR20","doi-asserted-by":"publisher","first-page":"023022","DOI":"10.1088\/1367-2630\/aafb8e","volume":"21","author":"TE O\u2019Brien","year":"2019","unstructured":"O\u2019Brien, T.E., Tarasinski, B., Terhal, B.M.: Quantum phase estimation of multiple eigenvalues for small-scale (noisy) experiments. New J. Phys. 21, 023022 (2019)","journal-title":"New J. Phys."},{"key":"2565_CR21","unstructured":"van\u00a0den Berg, E.: Practical sampling schemes for quantum phase estimation. arXiv:1902.11168 (2019)"},{"key":"2565_CR22","doi-asserted-by":"crossref","unstructured":"Wie, C.R.: Simpler quantum counting. arXiv:1907.08119 (2019)","DOI":"10.26421\/QIC19.11-12-5"},{"key":"2565_CR23","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of 28th Annual ACM Symposium on Theory of Computing, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"2565_CR24","unstructured":"Abrams, D.S., Williams, C.P.: Fast quantum algorithms for numerical integrals and stochastic processes. arXiv:quant-ph\/9908083 (1999)"},{"key":"2565_CR25","doi-asserted-by":"publisher","first-page":"062306","DOI":"10.1103\/PhysRevA.93.062306","volume":"93","author":"I Zintchenko","year":"2016","unstructured":"Zintchenko, I., Wiebe, N.: Randomized gap and amplitude estimation. Phys. Rev. A 93, 062306 (2016)","journal-title":"Phys. Rev. A"},{"key":"2565_CR26","unstructured":"Brassard, G., H\u00f8yer, P.: An exact quantum polynomial-time algorithm for Simon\u2019s problem. In: Proceedings of the 5th Israeli Symposium on Theory of Computing and Systems, pp. 12\u201323 (1997)"},{"key":"2565_CR27","doi-asserted-by":"publisher","first-page":"4329","DOI":"10.1103\/PhysRevLett.80.4329","volume":"80","author":"LK Grover","year":"1998","unstructured":"Grover, L.K.: Quantum computers can search rapidly by using almost any transformation. Phys. Rev. Lett. 80, 4329\u20134332 (1998)","journal-title":"Phys. Rev. Lett."},{"key":"2565_CR28","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316436","volume-title":"Linear Statistical Inference and its Applications","author":"CR Rao","year":"1973","unstructured":"Rao, C.R.: Linear Statistical Inference and its Applications, vol. 2. Wiley, New York (1973)"},{"key":"2565_CR29","doi-asserted-by":"publisher","unstructured":"Aleksandrowicz, G., Alexander, T., Barkoutsos, P., Bello, L., Ben-Haim, Y., Bucher, D., Cabrera-Hern\u00e1dez, F.J., Carballo-Franquis, J., Chen, A., Chen, C.F., Chow, J.M., C\u00f3rcoles-Gonzales, A.D., Cross, A.J., Cross, A., Cruz-Benito, J., Culver, C., Gonz\u00e1lez, S.D.L.P., Torre, E.D.L., Ding, D., Dumitrescu, E., Duran, I., Eendebak, P., Everitt, M., Sertage, I.F., Frisch, A., Fuhrer, A., Gambetta, J., Gago, B.G., Gomez-Mosquera, J., Greenberg, D., Hamamura, I., Havlicek, V., Hellmers, J., Herok, \u0141., Horii, H., Hu, S., Imamichi, T., Itoko, T., Javadi-Abhari, A., Kanazawa, N., Karazeev, A., Krsulich, K., Liu, P., Luh, Y., Maeng, Y., Marques, M., Mart\u00edn-Fern\u00e1ndez, F.J., McClure, D.T., McKay, D., Meesala, S., Mezzacapo, A., Moll, N., Rodr\u00edguez, D.M., Nannicini, G., Nation, P., Ollitrault, P., O\u2019Riordan, L.J., Paik, H., P\u00e9rez, J., Phan, A., Pistoia, M., Prutyanov, V., Reuter, M., Rice, J., Davila, A.R., Rudy, R.H.P., Ryu, M., Sathaye, N., Schnabel, C., Schoute, E., Setia, K., Shi, Y., Silva, A., Siraichi, Y., Sivarajah, S., Smolin, J.A., Soeken, M., Takahashi, H., Tavernelli, I., Taylor, C., Taylour, P., Trabing, K., Treinish, M., Turner, W., Vogt-Lee, D., Vuillot, C., Wildstrom, J.A., Wilson, J., Winston, E., Wood, C., Wood, S., W\u00f6rner, S., Akhalwaya, I.Y., Zoufal, C.: Qiskit: An open-source framework for quantum computing (2019). https:\/\/doi.org\/10.5281\/zenodo.2562110","DOI":"10.5281\/zenodo.2562110"},{"key":"2565_CR30","unstructured":"Qiskit Community Tutorials: Amplitude estimation without quantum Fourier transform and controlled grover operators. https:\/\/github.com\/Qiskit\/qiskit-community-tutorials\/blob\/master\/algorithms\/SimpleIntegral_AEwoPE.ipynb (2019). Accessed 30 Oct 2019"},{"key":"2565_CR31","doi-asserted-by":"crossref","unstructured":"Aaronson, S., Rall, P.: Quantum approximate counting, simplified. arXiv:1908.10846 (2019)","DOI":"10.1137\/1.9781611976014.5"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-019-2565-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-019-2565-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-019-2565-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,21]],"date-time":"2021-02-21T12:32:12Z","timestamp":1613910732000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-019-2565-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,9]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["2565"],"URL":"https:\/\/doi.org\/10.1007\/s11128-019-2565-2","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,9]]},"assertion":[{"value":"29 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 December 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"75"}}