{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T19:01:46Z","timestamp":1750705306933,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030193102"},{"type":"electronic","value":"9783030193119"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-19311-9_4","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:32:32Z","timestamp":1558348352000},"page":"30-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quantum Dual Adversary for Hidden Subgroups and Beyond"],"prefix":"10.1007","author":[{"given":"Aleksandrs","family":"Belovs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,26]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Belovs, A., Regev, O., de Wolf, R.: Efficient quantum algorithms for (gapped) group testing and junta testing. In: Proceedings of 27th ACM-SIAM SODA, pp. 903\u2013922 (2016)","DOI":"10.1137\/1.9781611974331.ch65"},{"key":"4_CR2","unstructured":"Babai, L., Chakraborty, S.: Property testing of equivalence under a permutation group action (2008)"},{"key":"4_CR3","unstructured":"Bacon, D., Childs, A.M., van Dam, W.: From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups. In: Proceedings of 46th IEEE FOCS, pp. 469\u2013478 (2005)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-39206-1_10","volume-title":"Automata, Languages, and Programming","author":"A Belovs","year":"2013","unstructured":"Belovs, A., Childs, A.M., Jeffery, S., Kothari, R., Magniez, F.: Time-efficient quantum walks for 3-distinctness. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part I. LNCS, vol. 7965, pp. 105\u2013122. Springer, Heidelberg (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-642-39206-1_10"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-642-33090-2_18","volume-title":"Algorithms \u2013 ESA 2012","author":"A Belovs","year":"2012","unstructured":"Belovs, A., Reichardt, B.W.: Span programs and quantum algorithms for st-connectivity and claw detection. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 193\u2013204. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-33090-2_18"},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.ipl.2004.01.024","volume":"91","author":"M Ettinger","year":"2004","unstructured":"Ettinger, M., H\u00f8yer, P., Knill, E.: The quantum query complexity of the hidden subgroup problem is polynomial. Inf. Process. Lett. 91(1), 43\u201348 (2004)","journal-title":"Inf. Process. Lett."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Friedl, K., Ivanyos, G., Magniez, F., Santha, M., Sen, P.: Hidden translation and orbit coset in quantum computing. In: Proceedings of 35th ACM STOC, pp. 1\u20139 (2003)","DOI":"10.1145\/780543.780544"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s00493-004-0009-8","volume":"24","author":"M Grigni","year":"2004","unstructured":"Grigni, M., Schulman, L., Vazirani, M., Vazirani, U.: Quantum mechanical algorithms for the nonabelian hidden subgroup problem. Combinatorica 24(1), 137\u2013154 (2004)","journal-title":"Combinatorica"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Harrow, A.W., Lin, C.Y.Y., Montanaro, A.: Sequential measurements, disturbance and property testing. In: Proceedings of 28th ACM-SIAM SODA, pp. 1598\u20131611 (2017)","DOI":"10.1137\/1.9781611974782.105"},{"issue":"12","key":"4_CR10","doi-asserted-by":"publisher","first-page":"2385","DOI":"10.1080\/09500349414552221","volume":"41","author":"P Hausladen","year":"1994","unstructured":"Hausladen, P., Wootters, W.K.: A \u201cpretty good\u201d measurement for distinguishing quantum states. J. Mod. Opt. 41(12), 2385\u20132390 (1994)","journal-title":"J. Mod. Opt."},{"key":"4_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"RA Horn","year":"1985","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1985)"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"H\u00f8yer, P., Lee, T., \u0160palek, R.: Negative weights make adversaries stronger. In: Proceedings of 39th ACM STOC, pp. 526\u2013535 (2007)","DOI":"10.1145\/1250790.1250867"},{"key":"4_CR13","unstructured":"Kitaev, A.: Quantum measurements and the Abelian stabilizer problem (1995)"},{"issue":"1","key":"4_CR14","first-page":"178","volume":"1","author":"H Kobayashi","year":"2006","unstructured":"Kobayashi, H., Le Gall, F.: Dihedral hidden subgroup problem: a survey. Inf. Media Technol. 1(1), 178\u2013185 (2006)","journal-title":"Inf. Media Technol."},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/S0097539703436345","volume":"35","author":"G Kuperberg","year":"2005","unstructured":"Kuperberg, G.: A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. SIAM J. Comput. 35, 170\u2013188 (2005)","journal-title":"SIAM J. Comput."},{"key":"4_CR16","unstructured":"Kuperberg, G.: Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem (2011)"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Lee, T., Mittal, R., Reichardt, B.W., \u0160palek, R., Szegedy, M.: Quantum query complexity of state conversion. In: Proceedings of 52nd IEEE FOCS, pp. 344\u2013353 (2011)","DOI":"10.1109\/FOCS.2011.75"},{"key":"4_CR18","unstructured":"Moore, C., Rockmore, D., Russell, A., Schulman, L.J.: The power of basis selection in Fourier sampling: hidden subgroup problems in affine groups. In: Proceedings of 15th ACM-SIAM SODA, pp. 1113\u20131122 (2004)"},{"issue":"3","key":"4_CR19","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1137\/S0097539703440678","volume":"33","author":"O Regev","year":"2004","unstructured":"Regev, O.: Quantum computation and lattice problems. SIAM J. Comput. 33(3), 738\u2013760 (2004)","journal-title":"SIAM J. Comput."},{"key":"4_CR20","unstructured":"Regev, O.: A subexponential time algorithm for the dihedral hidden subgroup problem with polynomial space (2004)"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Reichardt, B.W.: Span programs and quantum query complexity: the general adversary bound is nearly tight for every boolean function. In: Proceedings of 50th IEEE FOCS, pp. 544\u2013551 (2009)","DOI":"10.1109\/FOCS.2009.55"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Reichardt, B.W.: Reflections for quantum query algorithms. In: Proceedings of 22nd ACM-SIAM SODA, pp. 560\u2013569 (2011)","DOI":"10.1137\/1.9781611973082.44"},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"4_CR24","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1137\/S0097539796298637","volume":"26","author":"D Simon","year":"1997","unstructured":"Simon, D.: On the power of quantum computation. SIAM J. Comput. 26, 1474\u20131483 (1997)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation and Natural Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19311-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,11]],"date-time":"2019-10-11T03:19:03Z","timestamp":1570763943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19311-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030193102","9783030193119"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19311-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"26 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"UCNC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Unconventional Computation and Natural Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"uc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ucnc2019.uec.ac.jp\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4 abstracts of invited talks and one full paper of an invited talk are included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}