{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T19:12:11Z","timestamp":1770491531440,"version":"3.49.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T00:00:00Z","timestamp":1595980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T00:00:00Z","timestamp":1595980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11471040"],"award-info":[{"award-number":["11471040"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11761131002"],"award-info":[{"award-number":["11761131002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11671388"],"award-info":[{"award-number":["11671388"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key Basic Research Program","award":["2018YFA0704705"],"award-info":[{"award-number":["2018YFA0704705"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s11128-020-02777-4","type":"journal-article","created":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T06:03:44Z","timestamp":1596002624000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Quantum QR decomposition in the computational basis"],"prefix":"10.1007","volume":"19","author":[{"given":"Guangsheng","family":"Ma","sequence":"first","affiliation":[]},{"given":"Hongbo","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jiman","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,29]]},"reference":[{"key":"2777_CR1","unstructured":"Ahuja, A., Kapoor, S.: A quantum algorithm for finding the maximum. arXiv:quant-ph\/9911082 (1999)"},{"key":"2777_CR2","doi-asserted-by":"crossref","unstructured":"Berry, D.W., Childs, A.M., Kothari, R.: Hamiltonian simulation with nearly optimal dependence on all parameters. In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp. 792\u2013809. IEEE (2015)","DOI":"10.1109\/FOCS.2015.54"},{"issue":"7671","key":"2777_CR3","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1038\/nature23474","volume":"549","author":"J Biamonte","year":"2017","unstructured":"Biamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., Lloyd, S.: Quantum machine learning. Nature 549(7671), 195 (2017)","journal-title":"Nature"},{"key":"2777_CR4","doi-asserted-by":"crossref","unstructured":"Brassard, G., H\u00f8yer, P., Tapp, A.: Quantum counting. In: International Colloquium on Automata, Languages, and Programming, pp. 820\u2013831. Springer (1998)","DOI":"10.1007\/BFb0055105"},{"issue":"16","key":"2777_CR5","doi-asserted-by":"publisher","first-page":"167902","DOI":"10.1103\/PhysRevLett.87.167902","volume":"87","author":"H Buhrman","year":"2001","unstructured":"Buhrman, H., Cleve, R., Watrous, J., De Wolf, R.: Quantum fingerprinting. Phys. Rev. Lett. 87(16), 167902 (2001)","journal-title":"Phys. Rev. Lett."},{"issue":"3","key":"2777_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01436084","volume":"7","author":"P Businger","year":"1965","unstructured":"Businger, P., Golub, G.H.: Linear least squares solutions by householder transformations. Numer. Math. 7(3), 269\u2013276 (1965)","journal-title":"Numer. Math."},{"key":"2777_CR7","unstructured":"Chakraborty, S., Gily\u00e9n, A., Jeffery, S.: The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation. arXiv:1804.01973 (2018)"},{"issue":"11\u201312","key":"2777_CR8","first-page":"901","volume":"12","author":"AM Childs","year":"2012","unstructured":"Childs, A.M., Wiebe, N.: Hamiltonian simulation using linear combinations of unitary operations. Quantum Inf. Comput. 12(11\u201312), 901\u2013924 (2012)","journal-title":"Quantum Inf. Comput."},{"issue":"25","key":"2777_CR9","doi-asserted-by":"publisher","first-page":"250504","DOI":"10.1103\/PhysRevLett.110.250504","volume":"110","author":"BD Clader","year":"2013","unstructured":"Clader, B.D., Jacobs, B.C., Sprouse, C.R.: Preconditioned quantum linear system algorithm. Phys. Rev. Lett. 110(25), 250504 (2013)","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"2777_CR10","first-page":"81","volume":"6","author":"CM Dawson","year":"2006","unstructured":"Dawson, C.M., Nielsen, M.A.: The Solovay\u2013Kitaev algorithm. Quantum Inf. Comput. 6(1), 81\u201395 (2006)","journal-title":"Quantum Inf. Comput."},{"key":"2777_CR11","doi-asserted-by":"crossref","unstructured":"Gily\u00e9n, A., Su, Y., Low, G.H., Wiebe, N.: Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pp. 193\u2013204. ACM (2019)","DOI":"10.1145\/3313276.3316366"},{"issue":"15","key":"2777_CR12","doi-asserted-by":"publisher","first-page":"150502","DOI":"10.1103\/PhysRevLett.103.150502","volume":"103","author":"AW Harrow","year":"2009","unstructured":"Harrow, A.W., Hassidim, A., Lloyd, S.: Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 103(15), 150502 (2009)","journal-title":"Phys. Rev. Lett."},{"key":"2777_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411","volume-title":"Matrix Analysis","author":"RA Horn","year":"2012","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (2012)"},{"key":"2777_CR14","unstructured":"Kerenidis, I., Prakash, A.: Quantum gradient descent for linear systems and least squares. arXiv:1704.04992 (2017)"},{"key":"2777_CR15","unstructured":"Kerenidis, I., Prakash, A.: Quantum recommendation systems. In: 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"key":"2777_CR16","unstructured":"Lloyd, S., Mohseni, M., Rebentrost, P.: Quantum algorithms for supervised and unsupervised machine learning. arXiv:1307.0411 (2013)"},{"issue":"9","key":"2777_CR17","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1038\/nphys3029","volume":"10","author":"S Lloyd","year":"2014","unstructured":"Lloyd, S., Mohseni, M., Rebentrost, P.: Quantum principal component analysis. Nat. Phys. 10(9), 631 (2014)","journal-title":"Nat. Phys."},{"key":"2777_CR18","volume-title":"Quantum Computation and Quantum Information","author":"ME Nielsen","year":"2000","unstructured":"Nielsen, M.E., Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"issue":"1","key":"2777_CR19","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/5992.814656","volume":"2","author":"BN Parlett","year":"2000","unstructured":"Parlett, B.N.: The QR algorithm. Comput. Sci. Eng. 2(1), 38 (2000)","journal-title":"Comput. Sci. Eng."},{"issue":"3","key":"2777_CR20","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1137\/0612041","volume":"12","author":"L Reichel","year":"1991","unstructured":"Reichel, L.: Fast QR decomposition of vandermonde-like matrices and polynomial least squares approximation. SIAM J. Matrix Anal. Appl. 12(3), 552\u2013564 (1991)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"2777_CR21","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1080\/00107514.2014.964942","volume":"56","author":"M Schuld","year":"2015","unstructured":"Schuld, M., Sinayskiy, I., Petruccione, F.: An introduction to quantum machine learning. Contemp. Phys. 56(2), 172\u2013185 (2015)","journal-title":"Contemp. Phys."},{"key":"2777_CR22","unstructured":"Shao, C.: From linear combination of quantum states to Grover\u2019s searching algorithm. arXiv:1807.09693 (2018)"},{"key":"2777_CR23","unstructured":"Shao, C.: A quantum model for multilayer perceptron. arXiv:1808.10561 (2018)"},{"issue":"1","key":"2777_CR24","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s11424-019-9008-0","volume":"32","author":"C Shao","year":"2019","unstructured":"Shao, C., Li, Y., Li, H.: Quantum algorithm design: techniques and applications. J. Syst. Sci. Complex. 32(1), 375\u2013452 (2019)","journal-title":"J. Syst. Sci. Complex."},{"key":"2777_CR25","unstructured":"Wang, C., Wossnig, L.: A quantum algorithm for simulating non-sparse Hamiltonians. arXiv:1803.08273 (2018)"},{"issue":"5","key":"2777_CR26","doi-asserted-by":"publisher","first-page":"050502","DOI":"10.1103\/PhysRevLett.120.050502","volume":"120","author":"L Wossnig","year":"2018","unstructured":"Wossnig, L., Zhao, Z., Prakash, A.: Quantum linear system algorithm for dense matrices. Phys. Rev. Lett. 120(5), 050502 (2018)","journal-title":"Phys. Rev. Lett."},{"issue":"3","key":"2777_CR27","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/s11128-017-1515-0","volume":"16","author":"S Zhou","year":"2017","unstructured":"Zhou, S., Loke, T., Izaac, J.A., Wang, J.B.: Quantum Fourier transform in computational basis. Quantum Inf. Process. 16(3), 82 (2017)","journal-title":"Quantum Inf. Process."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-020-02777-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-020-02777-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-020-02777-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T03:13:20Z","timestamp":1632453200000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-020-02777-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,29]]},"references-count":27,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["2777"],"URL":"https:\/\/doi.org\/10.1007\/s11128-020-02777-4","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,29]]},"assertion":[{"value":"21 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"271"}}