{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T20:42:09Z","timestamp":1784407329672,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":89,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T00:00:00Z","timestamp":1561248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Research Council","award":["615307-QPROGRES"],"award-info":[{"award-number":["615307-QPROGRES"]}]},{"name":"U.S. Department of Energy, Office of Science, Office of Advanced Scientific Computing Research, Quantum Algorithms Teams program","award":["17-020469"],"award-info":[{"award-number":["17-020469"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["grant 1526380"],"award-info":[{"award-number":["grant 1526380"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"QuantERA","award":["QuantAlgo 680-91-034"],"award-info":[{"award-number":["QuantAlgo 680-91-034"]}]},{"name":"Army Research Office","award":["MURI award W911NF-16-1-0349"],"award-info":[{"award-number":["MURI award W911NF-16-1-0349"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,23]]},"DOI":"10.1145\/3313276.3316366","type":"proceedings-article","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T12:19:08Z","timestamp":1561033148000},"page":"193-204","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":465,"title":["Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics"],"prefix":"10.1145","author":[{"given":"Andr\u00e1s","family":"Gily\u00e9n","sequence":"first","affiliation":[{"name":"CWI, Netherlands \/ University of Amsterdam, Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuan","family":"Su","sequence":"additional","affiliation":[{"name":"University of Maryland, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guang Hao","family":"Low","sequence":"additional","affiliation":[{"name":"Microsoft Research, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nathan","family":"Wiebe","sequence":"additional","affiliation":[{"name":"Microsoft Research, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,6,23]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Scott Aaronson. 2006. The ten most annoying questions in quantum computing. https:\/\/www.scottaaronson.com\/blog\/?p=112.  Scott Aaronson. 2006. The ten most annoying questions in quantum computing. https:\/\/www.scottaaronson.com\/blog\/?p=112."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1070\/RM9729"},{"key":"e_1_3_2_1_3_1","unstructured":"Andris Ambainis. 2004.  Andris Ambainis. 2004."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.54"},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP). (to appear) arXiv","author":"van Apeldoorn Joran","year":"2019","unstructured":"Joran van Apeldoorn and Andr\u00e1s Gily\u00e9n . 2019 . Improvements in Quantum SDPSolving with Applications . In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP). (to appear) arXiv : 1804.05058 Joran van Apeldoorn and Andr\u00e1s Gily\u00e9n. 2019. Improvements in Quantum SDPSolving with Applications. In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP). (to appear) arXiv: 1804.05058"},{"key":"e_1_3_2_1_6_1","unstructured":"Joran van Apeldoorn and Andr\u00e1s Gily\u00e9n. 2019. Quantum algorithms for zero-sum games. (2019).  Joran van Apeldoorn and Andr\u00e1s Gily\u00e9n. 2019. Quantum algorithms for zero-sum games. (2019)."},{"key":"e_1_3_2_1_7_1","unstructured":"arXiv: 1904.03180  arXiv: 1904.03180"},{"key":"e_1_3_2_1_8_1","unstructured":"Joran van Apeldoorn Andr\u00e1s Gily\u00e9n Sander Gribling and Ronald de Wolf. 2017.  Joran van Apeldoorn Andr\u00e1s Gily\u00e9n Sander Gribling and Ronald de Wolf. 2017."},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the 58th IEEE Symposium on Foundations of Computer Science (FOCS). 403\u2013414","author":"Solvers Quantum","year":"1843","unstructured":"Quantum SDP- Solvers : Better upper and lower bounds . In Proceedings of the 58th IEEE Symposium on Foundations of Computer Science (FOCS). 403\u2013414 . arXiv: 1705.0 1843 Quantum SDP-Solvers: Better upper and lower bounds. In Proceedings of the 58th IEEE Symposium on Foundations of Computer Science (FOCS). 403\u2013414. arXiv: 1705.01843"},{"key":"e_1_3_2_1_10_1","unstructured":"Simon Apers and Alain Sarlette. 2018. Quantum Fast-Forwarding Markov Chains. (2018).  Simon Apers and Alain Sarlette. 2018. Quantum Fast-Forwarding Markov Chains. (2018)."},{"key":"e_1_3_2_1_11_1","unstructured":"arXiv: 1804.02321  arXiv: 1804.02321"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837020"},{"key":"e_1_3_2_1_13_1","volume-title":"Sanders","author":"Berry Dominic W.","year":"2007","unstructured":"Dominic W. Berry , Graeme Ahokas , Richard Cleve , and Barry C . Sanders . 2007 . Dominic W. Berry, Graeme Ahokas, Richard Cleve, and Barry C. Sanders. 2007."},{"key":"e_1_3_2_1_14_1","volume-title":"Communications in Mathematical Physics 270, 2","author":"Simulating Sparse Hamiltonians Efficient Quantum","year":"2007","unstructured":"Efficient Quantum Algorithms for Simulating Sparse Hamiltonians . Communications in Mathematical Physics 270, 2 ( 2007 ), 359\u2013371. arXiv: quant-ph\/0508139 Efficient Quantum Algorithms for Simulating Sparse Hamiltonians. Communications in Mathematical Physics 270, 2 (2007), 359\u2013371. arXiv: quant-ph\/0508139"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the 46th ACM Symposium on the Theory of Computing (STOC). 283\u2013292","author":"Berry Dominic W.","unstructured":"Dominic W. Berry , Andrew M. Childs , Richard Cleve , Robin Kothari , and Rolando D. Somma . 2014. Exponential improvement in precision for simulating sparse Hamiltonians . In Proceedings of the 46th ACM Symposium on the Theory of Computing (STOC). 283\u2013292 . arXiv: 1312.1414 Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, and Rolando D. Somma. 2014. Exponential improvement in precision for simulating sparse Hamiltonians. In Proceedings of the 46th ACM Symposium on the Theory of Computing (STOC). 283\u2013292. arXiv: 1312.1414"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.114.090502"},{"key":"e_1_3_2_1_17_1","unstructured":"arXiv: 1412.4687  arXiv: 1412.4687"},{"key":"e_1_3_2_1_18_1","unstructured":"Dominic W. Berry Andrew M. Childs and Robin Kothari. 2015.  Dominic W. Berry Andrew M. Childs and Robin Kothari. 2015."},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the 56th IEEE Symposium on Foundations of Computer Science (FOCS). 792\u2013809","author":"Nearly Optimal Hamiltonian Simulation","unstructured":"Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters . In Proceedings of the 56th IEEE Symposium on Foundations of Computer Science (FOCS). 792\u2013809 . arXiv: 1501.01715 Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters. In Proceedings of the 56th IEEE Symposium on Foundations of Computer Science (FOCS). 792\u2013809. arXiv: 1501.01715"},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP). (to appear) arXiv: 1710","author":"Brand\u00e3o Fernando G. S. L.","year":"2019","unstructured":"Fernando G. S. L. Brand\u00e3o , Amir Kalev , Tongyang Li , Cedric Yen-Yu Lin , Krysta M. Svore , and Xiaodi Wu . 2019 . Quantum SDP Solvers: Large Speed-ups, Optimality, and Applications to Quantum Learning . In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP). (to appear) arXiv: 1710 .02581 Fernando G. S. L. Brand\u00e3o, Amir Kalev, Tongyang Li, Cedric Yen-Yu Lin, Krysta M. Svore, and Xiaodi Wu. 2019. Quantum SDP Solvers: Large Speed-ups, Optimality, and Applications to Quantum Learning. In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP). (to appear) arXiv: 1710.02581"},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of the 58th IEEE Symposium on Foundations of Computer Science (FOCS). 415\u2013426","author":"Fernando G. S.","unstructured":"Fernando G. S. L. Brand\u00e3o and Krysta M. Svore. 2017. Quantum Speed-ups for Solving Semidefinite Programs . In Proceedings of the 58th IEEE Symposium on Foundations of Computer Science (FOCS). 415\u2013426 . arXiv: 1609.05537 Fernando G. S. L. Brand\u00e3o and Krysta M. Svore. 2017. Quantum Speed-ups for Solving Semidefinite Programs. In Proceedings of the 58th IEEE Symposium on Foundations of Computer Science (FOCS). 415\u2013426. arXiv: 1609.05537"},{"key":"e_1_3_2_1_22_1","series-title":"Contemporary Mathematics Series","volume-title":"Quantum Computation and Quantum Information: A Millennium Volume","author":"Brassard Gilles","unstructured":"Gilles Brassard , Peter H\u00f8yer , Michele Mosca , and Alain Tapp . 2002. Quantum Amplitude Amplification and Estimation . In Quantum Computation and Quantum Information: A Millennium Volume . Contemporary Mathematics Series , Vol. 305 . AMS , 53\u201374. arXiv: quant-ph\/0005055 Gilles Brassard, Peter H\u00f8yer, Michele Mosca, and Alain Tapp. 2002. Quantum Amplitude Amplification and Estimation. In Quantum Computation and Quantum Information: A Millennium Volume. Contemporary Mathematics Series, Vol. 305. AMS, 53\u201374. arXiv: quant-ph\/0005055"},{"key":"e_1_3_2_1_23_1","unstructured":"Shantanav Chakraborty Andr\u00e1s Gily\u00e9n and Stacey Jeffery. 2019.  Shantanav Chakraborty Andr\u00e1s Gily\u00e9n and Stacey Jeffery. 2019."},{"key":"e_1_3_2_1_24_1","volume-title":"Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP). (to appear) arXiv: 1804","author":"The","year":"1973","unstructured":"The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation . In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP). (to appear) arXiv: 1804 .0 1973 The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation. In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP). (to appear) arXiv: 1804.01973"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1087072"},{"key":"e_1_3_2_1_26_1","unstructured":"arXiv: 1511.02306  arXiv: 1511.02306"},{"key":"e_1_3_2_1_27_1","unstructured":"Andrew M. Childs Dmitri Maslov Yunseong Nam Neil J. Ross and Yuan Su. 2017. Toward the first quantum simulation with quantum speedup. (2017). arXiv: 1711.10980  Andrew M. Childs Dmitri Maslov Yunseong Nam Neil J. Ross and Yuan Su. 2017. Toward the first quantum simulation with quantum speedup. (2017). arXiv: 1711.10980"},{"key":"e_1_3_2_1_28_1","volume-title":"Childs and Nathan Wiebe","author":"Andrew","year":"2012","unstructured":"Andrew M. Childs and Nathan Wiebe . 2012 . Hamiltonian simulation using linear combinations of unitary operations. Quantum Information and Computation 12, 11&12 (2012), 901\u2013924. arXiv: 1202.5822 Andrew M. Childs and Nathan Wiebe. 2012. Hamiltonian simulation using linear combinations of unitary operations. Quantum Information and Computation 12, 11&12 (2012), 901\u2013924. arXiv: 1202.5822"},{"key":"e_1_3_2_1_29_1","volume-title":"Somma","author":"Chowdhury Anirban Narayan","year":"2017","unstructured":"Anirban Narayan Chowdhury and Rolando D . Somma . 2017 . Anirban Narayan Chowdhury and Rolando D. Somma. 2017."},{"key":"e_1_3_2_1_30_1","volume-title":"Quantum Information and Computation 17, 1&2","author":"Quantum","year":"2017","unstructured":"Quantum algorithms for Gibbs sampling and hitting-time estimation. Quantum Information and Computation 17, 1&2 ( 2017 ), 41\u201364. arXiv: 1603.02940 Quantum algorithms for Gibbs sampling and hitting-time estimation. Quantum Information and Computation 17, 1&2 (2017), 41\u201364. arXiv: 1603.02940"},{"key":"e_1_3_2_1_31_1","volume-title":"Nikolskaya","author":"Farforovskaya Yuliya B.","year":"2009","unstructured":"Yuliya B. Farforovskaya and Ludmila N . Nikolskaya . 2009 . Modulus of continuity of operator functions. St. Petersburg Math. J. \u2013 Algebra i Analiz 20, 3 (2009), 493\u2013506. Yuliya B. Farforovskaya and Ludmila N. Nikolskaya. 2009. Modulus of continuity of operator functions. St. Petersburg Math. J. \u2013 Algebra i Analiz 20, 3 (2009), 493\u2013506."},{"key":"e_1_3_2_1_32_1","unstructured":"Richard P. Feynman. 1982.  Richard P. Feynman. 1982."},{"key":"e_1_3_2_1_33_1","volume-title":"International Journal of Theoretical Physics 21, 6-7","author":"Simulating","year":"1982","unstructured":"Simulating physics with computers. International Journal of Theoretical Physics 21, 6-7 ( 1982 ), 467\u2013488. Simulating physics with computers. International Journal of Theoretical Physics 21, 6-7 (1982), 467\u2013488."},{"key":"e_1_3_2_1_34_1","volume-title":"Proceedings of the 33rd International Conference on Machine Learning (ICML). 2349\u20132357","author":"Frostig Roy","year":"2016","unstructured":"Roy Frostig , Cameron Musco , Christopher Musco , and Aaron Sidford . 2016 . Principal Component Projection Without Principal Component Analysis . In Proceedings of the 33rd International Conference on Machine Learning (ICML). 2349\u20132357 . Roy Frostig, Cameron Musco, Christopher Musco, and Aaron Sidford. 2016. Principal Component Projection Without Principal Component Analysis. In Proceedings of the 33rd International Conference on Machine Learning (ICML). 2349\u20132357."},{"key":"e_1_3_2_1_35_1","unstructured":"arXiv: 1602.06872  arXiv: 1602.06872"},{"key":"e_1_3_2_1_36_1","unstructured":"Andr\u00e1s Gily\u00e9n. 2019.  Andr\u00e1s Gily\u00e9n. 2019."},{"key":"e_1_3_2_1_37_1","unstructured":"Quantum Singular Value Transformation & Its Algorithmic Applications. Ph.D. Dissertation. University of Amsterdam. Advisor(s) Ronald de Wolf.  Quantum Singular Value Transformation & Its Algorithmic Applications. Ph.D. Dissertation. University of Amsterdam. Advisor(s) Ronald de Wolf."},{"key":"e_1_3_2_1_38_1","unstructured":"Andr\u00e1s Gily\u00e9n and Or Sattath. 2017.  Andr\u00e1s Gily\u00e9n and Or Sattath. 2017."},{"key":"e_1_3_2_1_39_1","volume-title":"Preparing Ground States of Gapped Hamiltonians: An Efficient Quantum Lov\u00e1sz Local Lemma. In Proceedings of the 58th IEEE Symposium on Foundations of Computer Science (FOCS). 439\u2013450","author":"On","unstructured":"On Preparing Ground States of Gapped Hamiltonians: An Efficient Quantum Lov\u00e1sz Local Lemma. In Proceedings of the 58th IEEE Symposium on Foundations of Computer Science (FOCS). 439\u2013450 . arXiv: 1611.08571 On Preparing Ground States of Gapped Hamiltonians: An Efficient Quantum Lov\u00e1sz Local Lemma. In Proceedings of the 58th IEEE Symposium on Foundations of Computer Science (FOCS). 439\u2013450. arXiv: 1611.08571"},{"key":"e_1_3_2_1_40_1","volume-title":"Guang Hao Low, and Nathan Wiebe","author":"Gily\u00e9n Andr\u00e1s","year":"2018","unstructured":"Andr\u00e1s Gily\u00e9n , Yuan Su , Guang Hao Low, and Nathan Wiebe . 2018 . Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics. {Full version} arXiv: 1806.01838 Andr\u00e1s Gily\u00e9n, Yuan Su, Guang Hao Low, and Nathan Wiebe. 2018. Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics. {Full version} arXiv: 1806.01838"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.95.150501"},{"key":"e_1_3_2_1_43_1","unstructured":"arXiv: quant-ph\/0503205  arXiv: quant-ph\/0503205"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Jeongwan Haah. 2018. Product Decomposition of Periodic Functions in Quantum Signal Processing. (2018).  Jeongwan Haah. 2018. Product Decomposition of Periodic Functions in Quantum Signal Processing. (2018).","DOI":"10.22331\/q-2019-10-07-190"},{"key":"e_1_3_2_1_45_1","unstructured":"arXiv: 1806.10236  arXiv: 1806.10236"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.103.150502"},{"key":"e_1_3_2_1_47_1","unstructured":"arXiv: 0811.3171  arXiv: 0811.3171"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039791"},{"key":"e_1_3_2_1_49_1","unstructured":"Yong He Ming-Xing Luo E. Zhang Hong-Ke Wang and Xiao-Feng Wang. 2017.  Yong He Ming-Xing Luo E. Zhang Hong-Ke Wang and Xiao-Feng Wang. 2017."},{"key":"e_1_3_2_1_50_1","volume-title":"International Journal of Theoretical Physics 56, 7","author":"Toffoli Decompositions","year":"2017","unstructured":"Decompositions of n-qubit Toffoli Gates with Linear Circuit Complexity . International Journal of Theoretical Physics 56, 7 ( 2017 ), 2350\u20132361. Decompositions of n-qubit Toffoli Gates with Linear Circuit Complexity. International Journal of Theoretical Physics 56, 7 (2017), 2350\u20132361."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.62.052304"},{"key":"e_1_3_2_1_52_1","unstructured":"arXiv: quant-ph\/0006031  arXiv: quant-ph\/0006031"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.24033\/bsmf.90"},{"key":"e_1_3_2_1_54_1","unstructured":"Iordanis Kerenidis and Alessandro Luongo. 2018. Quantum classification of the MNIST dataset via Slow Feature Analysis. (2018).  Iordanis Kerenidis and Alessandro Luongo. 2018. Quantum classification of the MNIST dataset via Slow Feature Analysis. (2018)."},{"key":"e_1_3_2_1_55_1","unstructured":"arXiv: 1805.08837  arXiv: 1805.08837"},{"key":"e_1_3_2_1_56_1","unstructured":"Iordanis Kerenidis and Anupam Prakash. 2017. Quantum gradient descent for linear systems and least squares. (2017).  Iordanis Kerenidis and Anupam Prakash. 2017. Quantum gradient descent for linear systems and least squares. (2017)."},{"key":"e_1_3_2_1_57_1","unstructured":"arXiv: 1704.04992  arXiv: 1704.04992"},{"key":"e_1_3_2_1_58_1","unstructured":"Iordanis Kerenidis and Anupam Prakash. 2017.  Iordanis Kerenidis and Anupam Prakash. 2017."},{"key":"e_1_3_2_1_59_1","volume-title":"Recommendation Systems. In Proceedings of the 8th Innovations in Theoretical Computer Science Conference (ITCS). 49:1\u201349:21","author":"Quantum","unstructured":"Quantum Recommendation Systems. In Proceedings of the 8th Innovations in Theoretical Computer Science Conference (ITCS). 49:1\u201349:21 . arXiv: 1603.08675 Quantum Recommendation Systems. In Proceedings of the 8th Innovations in Theoretical Computer Science Conference (ITCS). 49:1\u201349:21. arXiv: 1603.08675"},{"key":"e_1_3_2_1_60_1","volume-title":"Guang Hao Low, Maris Ozols, and Theodore J. Yoder.","author":"Kimmel Shelby","year":"2017","unstructured":"Shelby Kimmel , Cedric Yen-Yu Lin , Guang Hao Low, Maris Ozols, and Theodore J. Yoder. 2017 . Shelby Kimmel, Cedric Yen-Yu Lin, Guang Hao Low, Maris Ozols, and Theodore J. Yoder. 2017."},{"key":"e_1_3_2_1_61_1","volume-title":"npj Quantum Information 3, 1","author":"Hamiltonian","year":"2017","unstructured":"Hamiltonian simulation with optimal sample complexity. npj Quantum Information 3, 1 ( 2017 ), 13. arXiv: 1608.00281 Hamiltonian simulation with optimal sample complexity. npj Quantum Information 3, 1 (2017), 13. arXiv: 1608.00281"},{"key":"e_1_3_2_1_62_1","unstructured":"Seth Lloyd. 1996.  Seth Lloyd. 1996."},{"key":"e_1_3_2_1_63_1","volume-title":"Science 273, 5278","author":"Simulators Universal Quantum","year":"1996","unstructured":"Universal Quantum Simulators . Science 273, 5278 ( 1996 ), 1073\u20131078. Universal Quantum Simulators. Science 273, 5278 (1996), 1073\u20131078."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1038\/nphys3029"},{"key":"e_1_3_2_1_65_1","volume-title":"Chuang","author":"Low Guang Hao","year":"2016","unstructured":"Guang Hao Low and Isaac L . Chuang . 2016 . Hamiltonian Simulation by Qubitization . (2016). Guang Hao Low and Isaac L. Chuang. 2016. Hamiltonian Simulation by Qubitization. (2016)."},{"key":"e_1_3_2_1_66_1","unstructured":"arXiv: 1610.06546  arXiv: 1610.06546"},{"key":"e_1_3_2_1_67_1","volume-title":"Chuang","author":"Low Guang Hao","year":"2017","unstructured":"Guang Hao Low and Isaac L . Chuang . 2017 . Hamiltonian Simulation by Uniform Spectral Amplification . (2017). Guang Hao Low and Isaac L. Chuang. 2017. Hamiltonian Simulation by Uniform Spectral Amplification. (2017)."},{"key":"e_1_3_2_1_68_1","unstructured":"arXiv: 1707.05391  arXiv: 1707.05391"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.118.010501"},{"key":"e_1_3_2_1_70_1","first-page":"041067","article-title":"Methodology of Resonant Equiangular Composite Quantum Gates","author":"Low Guang Hao","year":"2016","unstructured":"Guang Hao Low , Theodore J. Yoder , and Isaac L. Chuang . 2016 . Methodology of Resonant Equiangular Composite Quantum Gates . Physical Review X 6, 4 (2016), 041067 . Guang Hao Low, Theodore J. Yoder, and Isaac L. Chuang. 2016. Methodology of Resonant Equiangular Composite Quantum Gates. Physical Review X 6, 4 (2016), 041067.","journal-title":"Physical Review"},{"key":"e_1_3_2_1_71_1","unstructured":"arXiv: 1603.03996  arXiv: 1603.03996"},{"key":"e_1_3_2_1_72_1","unstructured":"Fr\u00e9d\u00e9ric Magniez Ashwin Nayak J\u00e9r\u00e9mie Roland and Miklos Santha. 2011.  Fr\u00e9d\u00e9ric Magniez Ashwin Nayak J\u00e9r\u00e9mie Roland and Miklos Santha. 2011."},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1137\/090745854"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-005-0194-x"},{"key":"e_1_3_2_1_75_1","volume-title":"Fast Amplification of QMA. Quantum Information and Computation 9, 11&12","author":"Nagaj Daniel","year":"2009","unstructured":"Daniel Nagaj , Pawel Wocjan , and Yong Zhang . 2009. Fast Amplification of QMA. Quantum Information and Computation 9, 11&12 ( 2009 ), 1053\u20131068. Daniel Nagaj, Pawel Wocjan, and Yong Zhang. 2009. Fast Amplification of QMA. Quantum Information and Computation 9, 11&12 (2009), 1053\u20131068."},{"key":"e_1_3_2_1_76_1","unstructured":"arXiv: 0904.1549  arXiv: 0904.1549"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.103.220502"},{"key":"e_1_3_2_1_78_1","unstructured":"arXiv: 0905.2199  arXiv: 0905.2199"},{"key":"e_1_3_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000065"},{"key":"e_1_3_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/42\/18\/185302"},{"key":"e_1_3_2_1_81_1","unstructured":"arXiv: 0810.3843  arXiv: 0810.3843"},{"key":"e_1_3_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_3_2_1_83_1","unstructured":"Earlier version in FOCS\u201994. arXiv: quant-ph\/9508027  Earlier version in FOCS\u201994. arXiv: quant-ph\/9508027"},{"key":"e_1_3_2_1_84_1","unstructured":"Peter W. Shor. 2003.  Peter W. Shor. 2003."},{"key":"e_1_3_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1145\/602382.602408"},{"key":"e_1_3_2_1_86_1","unstructured":"M\u00e1ri\u00f3 Szegedy. 2004.  M\u00e1ri\u00f3 Szegedy. 2004."},{"key":"e_1_3_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.53"},{"key":"e_1_3_2_1_88_1","volume-title":"Guang Hao Low, and Isaac L. Chuang","author":"Yoder Theodore J.","year":"2014","unstructured":"Theodore J. Yoder , Guang Hao Low, and Isaac L. Chuang . 2014 . Theodore J. Yoder, Guang Hao Low, and Isaac L. Chuang. 2014."},{"key":"e_1_3_2_1_89_1","volume-title":"Physical Review Letters 113, 21","author":"Quantum Fixed-Point","year":"2014","unstructured":"Fixed-Point Quantum Search with an Optimal Number of Queries . Physical Review Letters 113, 21 ( 2014 ), 210501. Fixed-Point Quantum Search with an Optimal Number of Queries. Physical Review Letters 113, 21 (2014), 210501."}],"event":{"name":"STOC '19: 51st Annual ACM SIGACT Symposium on the Theory of Computing","location":"Phoenix AZ USA","acronym":"STOC '19","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316366","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3313276.3316366","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3313276.3316366","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:32Z","timestamp":1750204472000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316366"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,23]]},"references-count":89,"alternative-id":["10.1145\/3313276.3316366","10.1145\/3313276"],"URL":"https:\/\/doi.org\/10.1145\/3313276.3316366","relation":{},"subject":[],"published":{"date-parts":[[2019,6,23]]},"assertion":[{"value":"2019-06-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}