{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:56:58Z","timestamp":1781031418139,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100006785","name":"AFOSR","doi-asserted-by":"publisher","award":["FA9550-23-1-0363"],"award-info":[{"award-number":["FA9550-23-1-0363"]}],"id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSF","award":["CCF-2530159"],"award-info":[{"award-number":["CCF-2530159"]}]},{"name":"NSF","award":["CCF-2144219"],"award-info":[{"award-number":["CCF-2144219"]}]},{"name":"NSF","award":["CCF-2329939"],"award-info":[{"award-number":["CCF-2329939"]}]},{"name":"Google PhD fellowship","award":["N\/A"],"award-info":[{"award-number":["N\/A"]}]},{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","award":["N\/A"],"award-info":[{"award-number":["N\/A"]}],"id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800799","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"845-856","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Magic and Communication Complexity"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3055-9406","authenticated-orcid":false,"given":"Uma","family":"Girish","sequence":"first","affiliation":[{"name":"Columbia University, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4030-5410","authenticated-orcid":false,"given":"Alex","family":"May","sequence":"additional","affiliation":[{"name":"Perimeter Institute for Theoretical Physics, Waterloo, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8792-1229","authenticated-orcid":false,"given":"Natalie","family":"Parham","sequence":"additional","affiliation":[{"name":"Columbia University, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2565-9907","authenticated-orcid":false,"given":"Henry","family":"Yuen","sequence":"additional","affiliation":[{"name":"Columbia University, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Improved simulation of stabilizer circuits. Physical Review A\u2014Atomic, Molecular, and Optical Physics, 70, 5","author":"Aaronson Scott","year":"2004","unstructured":"Scott Aaronson and Daniel Gottesman. 2004. Improved simulation of stabilizer circuits. Physical Review A\u2014Atomic, Molecular, and Optical Physics, 70, 5 (2004), 052328."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2024-06-27-1387"},{"key":"e_1_3_2_1_3_1","volume-title":"International Conference on the Theory and Application of Cryptology and Information Security. 129\u2013157","author":"Ananth Prabhanjan","year":"2024","unstructured":"Prabhanjan Ananth, Vipul Goyal, Jiahui Liu, and Qipeng Liu. 2024. Unclonable secret sharing. In International Conference on the Theory and Application of Cryptology and Information Security. 129\u2013157."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/JHEP08(2024)152"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2023.25"},{"key":"e_1_3_2_1_6_1","unstructured":"Srinivasan Arunachalam Uma Girish and Noam Lifshitz. 2023. One Clean Qubit Suffices for Quantum Communication Advantage. arXiv preprint arXiv:2310.02406."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007379"},{"key":"e_1_3_2_1_8_1","volume-title":"Universal quantum computation with ideal Clifford gates and noisy ancillas. Physical Review A\u2014Atomic, Molecular, and Optical Physics, 71, 2","author":"Bravyi Sergey","year":"2005","unstructured":"Sergey Bravyi and Alexei Kitaev. 2005. Universal quantum computation with ideal Clifford gates and noisy ancillas. Physical Review A\u2014Atomic, Molecular, and Optical Physics, 71, 2 (2005), 022316."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/130913687"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.50"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422455"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195408"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374393"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897545"},{"key":"e_1_3_2_1_15_1","unstructured":"Dmytro Gavinsky. 2019. Quantum versus classical simultaneity in communication complexity. arxiv:1705.07211. arxiv:1705.07211"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384243"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250866"},{"key":"e_1_3_2_1_18_1","unstructured":"Uma Girish Alex May Leo Orshansky and Chris Waddell. 2025. Comparing classical and quantum conditional disclosure of secrets. arxiv:2505.02939. arxiv:2505.02939"},{"key":"e_1_3_2_1_19_1","volume-title":"Quantum versus randomized communication complexity, with efficient players. computational complexity, 31, 2","author":"Girish Uma","year":"2022","unstructured":"Uma Girish, Ran Raz, and Avishay Tal. 2022. Quantum versus randomized communication complexity, with efficient players. computational complexity, 31, 2 (2022), 17."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3717823.3718155"},{"key":"e_1_3_2_1_21_1","unstructured":"David Gosset Robin Kothari and Chenyi Zhang. [n. d.]. Multi-qubit Toffoli with exponentially fewer T gates. to appear"},{"key":"e_1_3_2_1_22_1","unstructured":"Daniel Gottesman. 1998. The Heisenberg representation of quantum computers. arXiv preprint quant-ph\/9807006."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISTCS.1997.595170"},{"key":"e_1_3_2_1_24_1","unstructured":"Dale Jacobs John Jeang Vladimir Podolskii Morgan Prior and Ilya Volkovich. 2025. Communication Complexity of Equality and Error Correcting Codes. https:\/\/eccc.weizmann.ac.il\/report\/2025\/068\/"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62265"},{"key":"e_1_3_2_1_26_1","volume-title":"Quantum tagging: Authenticating location via quantum information and relativistic signaling constraints. Physical Review A\u2014Atomic, Molecular, and Optical Physics, 84, 1","author":"Kent Adrian","year":"2011","unstructured":"Adrian Kent, William J Munro, and Timothy P Spiller. 2011. Quantum tagging: Authenticating location via quantum information and relativistic signaling constraints. Physical Review A\u2014Atomic, Molecular, and Optical Physics, 84, 1 (2011), 012326."},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the 43rd ACM Symposium on Theory of Computing","author":"Klartag Bo\u2019az","year":"2011","unstructured":"Bo\u2019az Klartag and Oded Regev. 2011. Quantum One-way Communication can be Exponentially Stronger than Classical Communication. In Proceedings of the 43rd ACM Symposium on Theory of Computing, San Jose, CA, USA, 6-8 June 2011. ACM, 31\u201340."},{"key":"e_1_3_2_1_28_1","volume-title":"Advances in Computers. 44","author":"Kushilevitz Eyal","unstructured":"Eyal Kushilevitz. 1997. Communication complexity. In Advances in Computers. 44, Elsevier, 331\u2013360."},{"key":"e_1_3_2_1_29_1","volume-title":"Communication Complexity","author":"Kushilevitz Eyal","unstructured":"Eyal Kushilevitz and Noam Nisan. 1996. Communication Complexity. Cambridge University Press."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/JHEP08(2020)132"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796491"},{"key":"e_1_3_2_1_32_1","volume-title":"Paul Erdos is Eighty, 1, 301-315","author":"Nisan Noam","year":"1993","unstructured":"Noam Nisan. 1993. The communication complexity of threshold gates. Combinatorics, Paul Erdos is Eighty, 1, 301-315 (1993), 6."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301343"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.87.042302"},{"key":"e_1_3_2_1_35_1","volume-title":"Instantaneous Non-Local Computation of Low T-Depth Quantum Circuits. In 11th Conference on the Theory of Quantum Computation, Communication and Cryptography.","author":"Speelman Florian","year":"2016","unstructured":"Florian Speelman. 2016. Instantaneous Non-Local Computation of Low T-Depth Quantum Circuits. In 11th Conference on the Theory of Quantum Computation, Communication and Cryptography."}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800799","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800799","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:57:18Z","timestamp":1781027838000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800799"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":35,"alternative-id":["10.1145\/3798129.3800799","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800799","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}