{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00062124","sets":["1164:2592:5623:5682"]},"path":["5682"],"owner":"10","recid":"62124","title":["Average/Worst-Case Gap of Quantum Query Complexities"],"pubdate":{"attribute_name":"公開日","attribute_value":"2009-05-04"},"_buckets":{"deposit":"db401220-80c6-4a75-93a8-0cf68556c987"},"_deposit":{"id":"62124","pid":{"type":"depid","value":"62124","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"Average/Worst-Case Gap of Quantum Query Complexities","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Average/Worst-Case Gap of Quantum Query Complexities"},{"subitem_title":"Average/Worst-Case Gap of Quantum Query Complexities","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2009-05-04","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Institute of Mathematics and Computer Science, University of Latvia, Latvia."},{"subitem_text_value":"School of Informatics, Kyoto University."},{"subitem_text_value":"Graduate School of Information Science, NAIST."},{"subitem_text_value":"School of Science, Osaka Prefecture University."},{"subitem_text_value":"Tokyo Research Laboratory, IBM Japan."},{"subitem_text_value":"NTT Communication Science Laboratories, NTT Corporation.,JST ERATO-SORST QCI Project"},{"subitem_text_value":"College of Information Science and Engineering, Ritsumeikan University."}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Institute of Mathematics and Computer Science, University of Latvia, Latvia.","subitem_text_language":"en"},{"subitem_text_value":"School of Informatics, Kyoto University.","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science, NAIST.","subitem_text_language":"en"},{"subitem_text_value":"School of Science, Osaka Prefecture University.","subitem_text_language":"en"},{"subitem_text_value":"Tokyo Research Laboratory, IBM Japan.","subitem_text_language":"en"},{"subitem_text_value":"NTT Communication Science Laboratories, NTT Corporation.,JST ERATO-SORST QCI Project","subitem_text_language":"en"},{"subitem_text_value":"College of Information Science and Engineering, Ritsumeikan University.","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/62124/files/IPSJ-AL09124008.pdf"},"date":[{"dateType":"Available","dateValue":"2011-05-04"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL09124008.pdf","filesize":[{"value":"154.5 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"17dd9770-52de-4ccc-a393-cc98aa273d57","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2009 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Andris, Ambainis"},{"creatorName":"Kazuo, Iwama"},{"creatorName":"Masaki, Nakanishi"},{"creatorName":"Harumichi, Nishimura"},{"creatorName":"Rudy, Raymond"},{"creatorName":"Seiichiro, Tani"},{"creatorName":"Shigeru, Yamashita"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Andris, Ambainis","creatorNameLang":"en"},{"creatorName":"Kazuo, Iwama","creatorNameLang":"en"},{"creatorName":"Masaki, Nakanishi","creatorNameLang":"en"},{"creatorName":"Harumichi, Nishimura","creatorNameLang":"en"},{"creatorName":"Rudy, Raymond","creatorNameLang":"en"},{"creatorName":"Seiichiro, Tani","creatorNameLang":"en"},{"creatorName":"Shigeru, Yamashita","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"The difference between average-case and worst-case complexities is one of the central topics in theoretical computer science, and it has been extensively studied for decades. In the quantum setting, however, only a few results are known. This paper shows a super-linear tight gap between the average-case and worst-case quantum query complexities over the families of Boolean functions defined by a natural parameter. More concretely, we consider the size of the on-set of a Boolean function ｆ, i.e., the number of inputs for which ｆ = 1, as the parameter, and give the tight gap over the families of N-variable Boolean functions with on-set size M for poly (N) < M < 2N /2.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The difference between average-case and worst-case complexities is one of the central topics in theoretical computer science, and it has been extensively studied for decades. In the quantum setting, however, only a few results are known. This paper shows a super-linear tight gap between the average-case and worst-case quantum query complexities over the families of Boolean functions defined by a natural parameter. More concretely, we consider the size of the on-set of a Boolean function ｆ, i.e., the number of inputs for which ｆ = 1, as the parameter, and give the tight gap over the families of N-variable Boolean functions with on-set size M for poly (N) < M < 2N /2.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2009-05-04","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"8","bibliographicVolumeNumber":"2009-AL-124"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"created":"2025-01-18T23:24:08.619614+00:00","updated":"2025-01-22T02:49:04.073159+00:00","id":62124}