{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T01:57:03Z","timestamp":1771898223378,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031360299","type":"print"},{"value":"9783031360305","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-36030-5_19","type":"book-chapter","created":{"date-parts":[[2023,6,28]],"date-time":"2023-06-28T17:02:13Z","timestamp":1687971733000},"page":"233-245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Constructing Generalized Unitary Group Designs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-7604-1449","authenticated-orcid":false,"given":"\u00c1goston","family":"Kaposi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-9837-5534","authenticated-orcid":false,"given":"Zolt\u00e1n","family":"Kolarovszki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-5734-4871","authenticated-orcid":false,"given":"Adrian","family":"Solymos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4484-9172","authenticated-orcid":false,"given":"Tam\u00e1s","family":"Kozsik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2184-526X","authenticated-orcid":false,"given":"Zolt\u00e1n","family":"Zimbor\u00e1s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,26]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Arienzo, M., Heinrich, M., Roth, I., Kliesch, M.: Closed-form analytic expressions for shadow estimation with brickwork circuits. arXiv preprint (2022). https:\/\/doi.org\/10.48550\/arXiv.2211.09835","DOI":"10.26421\/QIC23.11-12-5"},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/aaf8cf","volume":"21","author":"J Bae","year":"2019","unstructured":"Bae, J., Hiesmayr, B.C., McNulty, D.: Linking entanglement detection and state tomography via quantum 2-designs. New J. Phys. 21(1), 013012 (2019). https:\/\/doi.org\/10.1088\/1367-2630\/aaf8cf","journal-title":"New J. Phys."},{"issue":"3","key":"19_CR3","doi-asserted-by":"publisher","first-page":"909","DOI":"10.2969\/jmsj\/82228222","volume":"72","author":"E Bannai","year":"2020","unstructured":"Bannai, E., Navarro, G., Rizo, N., Tiep, P.H.: Unitary $$t$$-groups. J. Math. Soc. Japan 72(3), 909\u2013921 (2020). https:\/\/doi.org\/10.2969\/jmsj\/82228222","journal-title":"J. Math. Soc. Japan"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Bengtsson, I., \u017byczkowski, K.: Geometry of quantum states: an introduction to quantum entanglement. Cambridge University Press (2017)","DOI":"10.1017\/9781139207010"},{"issue":"9","key":"19_CR5","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.124.090503","volume":"124","author":"J Czartowski","year":"2020","unstructured":"Czartowski, J., Goyeneche, D., Grassl, M., \u017byczkowski, K.: Isoentangled mutually unbiased bases, symmetric quantum measurements, and mixed-state designs. Phys. Rev. Lett. 124(9), 090503 (2020). https:\/\/doi.org\/10.1103\/physrevlett.124.090503","journal-title":"Phys. Rev. Lett."},{"key":"19_CR6","doi-asserted-by":"publisher","unstructured":"Dankert, C., Cleve, R., Emerson, J., Livine, E.: Exact and approximate unitary 2-designs and their application to fidelity estimation. Physical Review A 80(1) (2009). https:\/\/doi.org\/10.1103\/physreva.80.012304","DOI":"10.1103\/physreva.80.012304"},{"key":"19_CR7","unstructured":"Di Matteo, O.: A short introduction to unitary 2-designs. CS867\/QIC890 (2014)"},{"issue":"5","key":"19_CR8","doi-asserted-by":"publisher","DOI":"10.1063\/1.2716992","volume":"48","author":"D Gross","year":"2007","unstructured":"Gross, D., Audenaert, K., Eisert, J.: Evenly distributed unitaries: On the structure of unitary designs. J. Mathem. Phys. 48(5), 052104 (2007). https:\/\/doi.org\/10.1063\/1.2716992","journal-title":"J. Mathem. Phys."},{"issue":"2","key":"19_CR9","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s00041-014-9361-2","volume":"21","author":"D Gross","year":"2014","unstructured":"Gross, D., Krahmer, F., Kueng, R.: A partial derandomization of phaselift using spherical designs. J. Fourier Anal. Appl. 21(2), 229\u2013266 (2014). https:\/\/doi.org\/10.1007\/s00041-014-9361-2","journal-title":"J. Fourier Anal. Appl."},{"issue":"5","key":"19_CR10","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1090\/S1088-4165-05-00192-5","volume":"9","author":"R Guralnick","year":"2005","unstructured":"Guralnick, R., Tiep, P.: Decompositions of small tensor powers and Larsen\u2019s conjecture. Representation Theory 9(5), 138\u2013208 (2005). https:\/\/doi.org\/10.1090\/S1088-4165-05-00192-5","journal-title":"Representation Theory"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Helsen, J., Walter, M.: Thrifty shadow estimation: re-using quantum circuits and bounding tails. arXiv preprint (2022). https:\/\/doi.org\/10.48550\/arXiv.2212.06240","DOI":"10.1103\/PhysRevLett.131.240602"},{"key":"19_CR12","unstructured":"Kueng, R., Gross, D.: Qubit stabilizer states are complex projective 3-designs. arXiv preprint arXiv:1510.02767 (2015). https:\/\/doi.org\/10.48550\/arXiv.1510.02767"},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s10623-009-9290-2","volume":"53","author":"A Roy","year":"2009","unstructured":"Roy, A., Scott, A.J.: Unitary designs and codes. Designs Codes Cryptograp. 53(1), 13\u201331 (2009). https:\/\/doi.org\/10.1007\/s10623-009-9290-2","journal-title":"Designs Codes Cryptograp."},{"issue":"5","key":"19_CR14","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/41\/5\/055308","volume":"41","author":"AJ Scott","year":"2008","unstructured":"Scott, A.J.: Optimizing quantum process tomography with unitary 2-designs. J. Phys. A: Mathem. Theoret. 41(5), 055308 (2008). https:\/\/doi.org\/10.1088\/1751-8113\/41\/5\/055308","journal-title":"J. Phys. A: Mathem. Theoret."},{"issue":"3","key":"19_CR15","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0001-8708(84)90022-7","volume":"52","author":"P Seymour","year":"1984","unstructured":"Seymour, P., Zaslavsky, T.: Averaging sets: A generalization of mean values and spherical designs. Adv. Math. 52(3), 213\u2013240 (1984). https:\/\/doi.org\/10.1016\/0001-8708(84)90022-7","journal-title":"Adv. Math."},{"key":"19_CR16","unstructured":"The GAP Group: Gap-groups, algorithms, and programming, vol. 412, p. 2 (2022), https:\/\/www.gap-system.org"},{"issue":"10","key":"19_CR17","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/16\/10\/103032","volume":"16","author":"JJ Wallman","year":"2014","unstructured":"Wallman, J.J., Flammia, S.T.: Randomized benchmarking with confidence. New J. Phys. 16(10), 103032 (2014). https:\/\/doi.org\/10.1088\/1367-2630\/16\/10\/103032","journal-title":"New J. Phys."},{"key":"19_CR18","doi-asserted-by":"publisher","unstructured":"Webb, Z.: The Clifford group forms a unitary 3-design. Quantum Inform. Comput. 16, 1379\u20131400 (2015). https:\/\/doi.org\/10.26421\/QIC16.15-16-8","DOI":"10.26421\/QIC16.15-16-8"},{"key":"19_CR19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.96.062336","volume":"96","author":"H Zhu","year":"2017","unstructured":"Zhu, H.: Multiqubit Clifford groups are unitary 3-designs. Phys. Rev. A 96, 062336 (2017). https:\/\/doi.org\/10.1103\/PhysRevA.96.062336","journal-title":"Phys. Rev. A"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-36030-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,24]],"date-time":"2024-05-24T01:04:13Z","timestamp":1716512653000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36030-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031360299","9783031360305"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36030-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"26 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2023\/","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":"530","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":"188","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":"94","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":"35% - 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":"2,8","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":"3,2","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)"}}]}}