{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:49:51Z","timestamp":1781077791608,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1122374, 1249349, CCF-1319245"],"award-info":[{"award-number":["1122374, 1249349, CCF-1319245"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000005","name":"U.S. Department of Defense","doi-asserted-by":"publisher","award":["Vannevar Bush Fellowship"],"award-info":[{"award-number":["Vannevar Bush Fellowship"]}],"id":[{"id":"10.13039\/100000005","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,19]]},"DOI":"10.1145\/3055399.3055453","type":"proceedings-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T20:27:45Z","timestamp":1497558465000},"page":"317-327","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["The computational complexity of ball permutations"],"prefix":"10.1145","author":[{"given":"Scott","family":"Aaronson","sequence":"first","affiliation":[{"name":"University of Texas at Austin, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adam","family":"Bouland","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Greg","family":"Kuperberg","sequence":"additional","affiliation":[{"name":"University of California at Davis, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saeed","family":"Mehraban","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.2005.1546"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993682"},{"key":"e_1_3_2_2_3_1","volume-title":"Greg Kuperberg and Saeed Mehraban. The computational complexity of ball permutations. arXiv:1610.06646","author":"Aaronson Scott","year":"2016","unstructured":"Scott Aaronson , Adam Bouland , Greg Kuperberg and Saeed Mehraban. The computational complexity of ball permutations. arXiv:1610.06646 , 2016 . Scott Aaronson, Adam Bouland, Greg Kuperberg and Saeed Mehraban. The computational complexity of ball permutations. arXiv:1610.06646, 2016."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/13\/3\/035019"},{"key":"e_1_3_2_2_5_1","volume-title":"Polynomial quantum algorithms for additive approximations of the Potts model and other points of the Tutte plane. arXiv:quant-ph\/0702008","author":"Aharonov Dorit","year":"2007","unstructured":"Dorit Aharonov , Itai Arad , Elad Eban , and Zeph Landau . Polynomial quantum algorithms for additive approximations of the Potts model and other points of the Tutte plane. arXiv:quant-ph\/0702008 , 2007 . Dorit Aharonov, Itai Arad, Elad Eban, and Zeph Landau. Polynomial quantum algorithms for additive approximations of the Potts model and other points of the Tutte plane. arXiv:quant-ph\/0702008, 2007."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9168-0"},{"key":"e_1_3_2_2_7_1","volume-title":"9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014","author":"Alagic Gorjan","year":"2014","unstructured":"Gorjan Alagic , Aniruddha Bapat , and Stephen Jordan . Classical simulation of Yang-Baxter gates . 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014 ), 161-175, 2014 . Gorjan Alagic, Aniruddha Bapat, and Stephen Jordan. Classical simulation of Yang-Baxter gates. 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014), 161-175, 2014."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1540612"},{"key":"e_1_3_2_2_9_1","volume-title":"Proceedings of the International Conference on Experimental Implementation of Quantum Computation","author":"Bacon D","year":"2001","unstructured":"D Bacon , J Kempe , DP DiVincenzo , DA Lidar , and KB Whaley . Encoded universality in physical implementations of a quantum computer . Proceedings of the International Conference on Experimental Implementation of Quantum Computation , Sydney, Australia (IQC 01), 257-264 , Rinton Press, 2001 . D Bacon, J Kempe, DP DiVincenzo, DA Lidar, and KB Whaley. Encoded universality in physical implementations of a quantum computer. Proceedings of the International Conference on Experimental Implementation of Quantum Computation, Sydney, Australia (IQC 01), 257-264, Rinton Press, 2001."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.85.1758"},{"key":"e_1_3_2_2_11_1","volume-title":"Universality of single quantum gates. arXiv:1404.7822","author":"Bauer Bela","year":"2014","unstructured":"Bela Bauer , Claire Levaillant , and Michael Freedman . Universality of single quantum gates. arXiv:1404.7822 , 2014 . Bela Bauer, Claire Levaillant, and Michael Freedman. Universality of single quantum gates. arXiv:1404.7822, 2014."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0003-4916(72)90335-1"},{"key":"e_1_3_2_2_13_1","volume-title":"Quantum gates between flying qubits via spin-independent scattering. arXiv:1106.2329","author":"Bose Sougato","year":"2011","unstructured":"Sougato Bose and Vladimir Korepin . Quantum gates between flying qubits via spin-independent scattering. arXiv:1106.2329 , 2011 . Sougato Bose and Vladimir Korepin. Quantum gates between flying qubits via spin-independent scattering. arXiv:1106.2329, 2011."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.2010.0301"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1038\/nphys1157"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2011679.2011685"},{"key":"e_1_3_2_2_17_1","volume-title":"\u201cIntroduction to Integrability"","author":"de Leeuw Marius","year":"2013","unstructured":"Marius de Leeuw and Constantin Candu . Lecture Notes for \u201cIntroduction to Integrability" , 2013 . Marius de Leeuw and Constantin Candu. Lecture Notes for \u201cIntroduction to Integrability", 2013."},{"key":"e_1_3_2_2_18_1","unstructured":"Retrieved April 10 2017 from ETH Z\u00fcrich: http:\/\/edu.itp.phys.ethz.ch\/fs13\/int\/  Retrieved April 10 2017 from ETH Z\u00fcrich: http:\/\/edu.itp.phys.ethz.ch\/fs13\/int\/"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1038\/35042541"},{"issue":"11","key":"e_1_3_2_2_20_1","first-page":"1003","article-title":"Universal quantum computation and leakage reduction in the 3-qubit decoherence free subsystem. Quantum Information &","volume":"11","author":"Fong Bryan H","year":"2011","unstructured":"Bryan H Fong and Stephen M Wandzura . Universal quantum computation and leakage reduction in the 3-qubit decoherence free subsystem. Quantum Information & Computation , 11 ( 11-12 ): 1003 \u2013 1018 , 2011 . Bryan H Fong and Stephen M Wandzura. Universal quantum computation and leakage reduction in the 3-qubit decoherence free subsystem. Quantum Information & Computation, 11(11-12):1003\u20131018, 2011.","journal-title":"Computation"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1651"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-02-00964-3"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/0601025"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.64.012310"},{"key":"e_1_3_2_2_25_1","volume-title":"Reading","author":"James Gordon","year":"1981","unstructured":"Gordon James and Adalbert Kerber . The representation theory of the symmetric group . Reading , Mass , 1981 . Gordon James and Adalbert Kerber. The representation theory of the symmetric group. Reading, Mass, 1981."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055453"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2011362.2011369"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.63.042307"},{"issue":"4","key":"e_1_3_2_2_29_1","first-page":"33","article-title":"Encoded universality from a single physical interaction. Quantum Information &","volume":"1","author":"Kempe Julia","year":"2001","unstructured":"Julia Kempe , David Bacon , David P DiVincenzo , and K Brigitta Whaley . Encoded universality from a single physical interaction. Quantum Information & Computation , 1 ( 4 ): 33 \u2013 55 , 2001 . Julia Kempe, David Bacon, David P DiVincenzo, and K Brigitta Whaley. Encoded universality from a single physical interaction. Quantum Information & Computation, 1(4):33\u201355, 2001.","journal-title":"Computation"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.65.052330"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.81.5672"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1038\/35051009"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.811917"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.2140\/gt.2011.15.11"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1672"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0219749904000055"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.112.130502"},{"key":"e_1_3_2_2_38_1","volume-title":"An Introduction to Quantum Field Theory","author":"Peskin Michael E.","year":"1995","unstructured":"Michael E. Peskin and Daniel V. Schroeder . An Introduction to Quantum Field Theory . Perseus Books , 1995 . Michael E. Peskin and Daniel V. Schroeder. An Introduction to Quantum Field Theory. Perseus Books, 1995."},{"issue":"8","key":"e_1_3_2_2_39_1","first-page":"681","article-title":"Estimating Jones polynomials is a complete problem for one clean qubit. Quantum Information &","volume":"8","author":"Shor Peter W","year":"2008","unstructured":"Peter W Shor and Stephen P Jordan . Estimating Jones polynomials is a complete problem for one clean qubit. Quantum Information & Computation , 8 ( 8 ): 681 \u2013 714 , 2008 . Peter W Shor and Stephen P Jordan. Estimating Jones polynomials is a complete problem for one clean qubit. Quantum Information & Computation, 8(8):681\u2013714, 2008.","journal-title":"Computation"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11005-011-0530-9"},{"issue":"2","key":"e_1_3_2_2_41_1","first-page":"134","article-title":"Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games. Quantum Information &","volume":"4","author":"Terhal Barbara M","year":"2004","unstructured":"Barbara M Terhal and David P DiVincenzo . Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games. Quantum Information & Computation 4 ( 2 ): 134 \u2013 145 , 2004 . Barbara M Terhal and David P DiVincenzo. Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games. Quantum Information & Computation 4 (2): 134\u2013145, 2004.","journal-title":"Computation"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220053"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01294465"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.65.042318"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.19.1312"},{"key":"e_1_3_2_2_46_1","volume-title":"Relativistic factorized S-matrix in two dimensions having O (N) isotopic symmetry Annals of physics, 133(3): 253\u2013291","author":"Zamolodchikov Alexander","year":"1979","unstructured":"Zamolodchikov, Alexander B and Zamolodchikov , Alexey B. Relativistic factorized S-matrix in two dimensions having O (N) isotopic symmetry Annals of physics, 133(3): 253\u2013291 , 1979 . Zamolodchikov, Alexander B and Zamolodchikov, Alexey B. Relativistic factorized S-matrix in two dimensions having O (N) isotopic symmetry Annals of physics, 133(3): 253\u2013291, 1979."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/0550-3213(78)90239-0"}],"event":{"name":"STOC '17: Symposium on Theory of Computing","location":"Montreal Canada","acronym":"STOC '17","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055453","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055453","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055453","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:19Z","timestamp":1750217779000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055453"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":47,"alternative-id":["10.1145\/3055399.3055453","10.1145\/3055399"],"URL":"https:\/\/doi.org\/10.1145\/3055399.3055453","relation":{},"subject":[],"published":{"date-parts":[[2017,6,19]]},"assertion":[{"value":"2017-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}