{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:19:16Z","timestamp":1742998756712,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319947754"},{"type":"electronic","value":"9783319947761"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94776-1_48","type":"book-chapter","created":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T01:48:06Z","timestamp":1530236886000},"page":"579-591","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Amplitude Amplification for Operator Identification and Randomized Classes"],"prefix":"10.1007","author":[{"given":"Debajyoti","family":"Bera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,29]]},"reference":[{"key":"48_CR1","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of 28th STOC (1996)","DOI":"10.1145\/237814.237866"},{"issue":"2","key":"48_CR2","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/050643684","volume":"37","author":"F Magniez","year":"2007","unstructured":"Magniez, F., Santha, M., Szegedy, M.: Quantum algorithms for the triangle problem. SIAM J. Comput. 37(2), 413\u2013424 (2007)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"48_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2493252.2493256","volume":"5","author":"M Ozols","year":"2013","unstructured":"Ozols, M., Roetteler, M., Roland, J.: Quantum rejection sampling. ACM Trans. Comput. Theory 5(3), 1\u201333 (2013)","journal-title":"ACM Trans. Comput. Theory"},{"key":"48_CR4","unstructured":"Kobayashi, H., Matsumoto, K., Tani, S.: Simpler exact leader election via quantum reduction. Chic. J. Theor. Comput. Sci. 2014(10) (2014)"},{"key":"48_CR5","doi-asserted-by":"crossref","unstructured":"Berry, D.W., Childs, A.M., Cleve, R., Kothari, R., Somma, R.D.: Exponential improvement in precision for simulating sparse Hamiltonians. In: Proceedings of the 46th STOC (2014)","DOI":"10.1145\/2591796.2591854"},{"key":"48_CR6","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 amplication and estimation. Contemp. Math. 305, 53\u201374 (2002)","journal-title":"Contemp. Math."},{"key":"48_CR7","doi-asserted-by":"publisher","first-page":"210501","DOI":"10.1103\/PhysRevLett.113.210501","volume":"113","author":"TJ Yoder","year":"2014","unstructured":"Yoder, T.J., Low, G.H., Chuang, I.L.: Fixed-point quantum search with an optimal number of queries. Phys. Rev. Lett. 113, 210501 (2014). https:\/\/journals.aps.org\/prl\/abstract\/10.1103\/PhysRevLett.113.210501","journal-title":"Phys. Rev. Lett."},{"key":"48_CR8","volume-title":"Quantum Algorithms via Linear Algebra: A Primer","author":"RJ Lipton","year":"2014","unstructured":"Lipton, R.J., Regan, K.W.: Quantum Algorithms via Linear Algebra: A Primer. The MIT Press, Cambridge (2014)"},{"key":"48_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-319-62389-4_26","volume-title":"Computing and Combinatorics","author":"A Kawachi","year":"2017","unstructured":"Kawachi, A., Kawano, K., Le Gall, F., Tamaki, S.: Quantum query complexity of unitary operator discrimination. In: Cao, Y., Chen, J. (eds.) COCOON 2017. LNCS, vol. 10392, pp. 309\u2013320. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62389-4_26"},{"issue":"3","key":"48_CR10","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1109\/TCAD.2017.2717783","volume":"37","author":"Debajyoti Bera","year":"2018","unstructured":"Bera, D.: Detection and diagnosis of single faults in quantum circuits. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 37(3), 587\u2013600 (2018)","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"issue":"17","key":"48_CR11","doi-asserted-by":"publisher","first-page":"177901","DOI":"10.1103\/PhysRevLett.87.177901","volume":"87","author":"A Acin","year":"2001","unstructured":"Acin, A.: Statistical distinguishability between unitary operations. Phys. Rev. Lett. 87(17), 177901 (2001)","journal-title":"Phys. Rev. Lett."},{"issue":"5","key":"48_CR12","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/S0097539796300933","volume":"26","author":"CH Bennett","year":"1997","unstructured":"Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. SIAM J. Comput. 26(5), 1510\u20131523 (1997)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"48_CR13","doi-asserted-by":"publisher","first-page":"2742","DOI":"10.1103\/PhysRevA.60.2742","volume":"60","author":"E Biham","year":"1999","unstructured":"Biham, E., Biham, O., Biron, D., Grassl, M., Lidar, D.A.: Grover\u2019s quantum search algorithm for an arbitrary initial amplitude distribution. Phys. Rev. A 60(4), 2742 (1999)","journal-title":"Phys. Rev. A"},{"issue":"6","key":"48_CR14","doi-asserted-by":"publisher","first-page":"062301","DOI":"10.1103\/PhysRevA.66.062301","volume":"66","author":"E Biham","year":"2002","unstructured":"Biham, E., Kenigsberg, D.: Grover\u2019s quantum search algorithm for an arbitrary initial mixed state. Phys. Rev. A 66(6), 062301 (2002)","journal-title":"Phys. Rev. A"},{"issue":"5","key":"48_CR15","doi-asserted-by":"publisher","first-page":"052304","DOI":"10.1103\/PhysRevA.62.052304","volume":"62","author":"P H\u00f8yer","year":"2000","unstructured":"H\u00f8yer, P.: Arbitrary phases in quantum amplitude amplification. Phys. Rev. A 62(5), 052304 (2000)","journal-title":"Phys. Rev. A"},{"issue":"27","key":"48_CR16","doi-asserted-by":"publisher","first-page":"270404","DOI":"10.1103\/PhysRevLett.87.270404","volume":"87","author":"GM D\u2019Ariano","year":"2001","unstructured":"D\u2019Ariano, G.M., Presti, P.L., Paris, M.G.: Using entanglement improves the precision of quantum measurements. Phys. Rev. Lett. 87(27), 270404 (2001)","journal-title":"Phys. Rev. Lett."},{"issue":"10","key":"48_CR17","doi-asserted-by":"publisher","first-page":"100503","DOI":"10.1103\/PhysRevLett.98.100503","volume":"98","author":"R Duan","year":"2007","unstructured":"Duan, R., Feng, Y., Ying, M.: Entanglement is not necessary for perfect discrimination between unitary operations. Phys. Rev. Lett. 98(10), 100503 (2007)","journal-title":"Phys. Rev. Lett."},{"key":"48_CR18","doi-asserted-by":"crossref","unstructured":"Bera, D.: Amplitude amplification for operator identification and randomized classes. Technical report TR14-151. Electronic Colloquium on Computational Complexity (2018)","DOI":"10.1007\/978-3-319-94776-1_48"},{"issue":"2","key":"48_CR19","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/1272729.1272739","volume":"38","author":"D Bera","year":"2007","unstructured":"Bera, D., Green, F., Homer, S.: Small depth quantum circuits. ACM SIGACT News 38(2), 35\u201350 (2007)","journal-title":"ACM SIGACT News"},{"key":"48_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-45841-7_24","volume-title":"STACS 2002","author":"P H\u00f8yer","year":"2002","unstructured":"H\u00f8yer, P., de Wolf, R.: Improved quantum communication complexity bounds for disjointness and equality. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 299\u2013310. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45841-7_24"},{"key":"48_CR21","unstructured":"Buhrman, H., de Wolf, R.: Communication complexity lower bounds by polynomials. In: Proceedings of the 16th CCC (2001)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94776-1_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:36:47Z","timestamp":1710347807000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94776-1_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319947754","9783319947761"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94776-1_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qing Dao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon2018.sdu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}