{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T23:40:15Z","timestamp":1767915615667,"version":"3.49.0"},"reference-count":69,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF","award":["OMA-2120757 (QLCI)"],"award-info":[{"award-number":["OMA-2120757 (QLCI)"]}]},{"name":"NSF","award":["CIF-2330909"],"award-info":[{"award-number":["CIF-2330909"]}]},{"name":"Institute for Mathematical and Statistical Innovation"},{"name":"National Science Foundation","award":["DMS-1929348"],"award-info":[{"award-number":["DMS-1929348"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/jsait.2025.3570832","type":"journal-article","created":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T13:47:41Z","timestamp":1747403261000},"page":"127-137","source":"Crossref","is-referenced-by-count":3,"title":["Transversal Clifford and\n                    <i>T<\/i>\n                    -Gate Codes of Short Length and High Distance"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3409-1126","authenticated-orcid":false,"given":"Shubham P.","family":"Jain","sequence":"first","affiliation":[{"name":"Joint Center for Quantum Information and Computer Science, University of Maryland, College Park, MD, USA"}]},{"given":"Victor V.","family":"Albert","sequence":"additional","affiliation":[{"name":"Joint Center for Quantum Information and Computer Science, University of Maryland, College Park, MD, USA"}]}],"member":"263","reference":[{"issue":"1954","key":"ref1","doi-asserted-by":"crossref","first-page":"2551","DOI":"10.1098\/rspa.1996.0136","article-title":"Multiple particle interference and quantum error correction","volume":"452","author":"Steane","year":"1996","journal-title":"Proc. Roy. Soc. London. Ser. A, Math., Phys. Eng. Sci."},{"key":"ref2","article-title":"Doubled color codes","author":"Bravyi","year":"2015","journal-title":"arXiv:1509.03239"},{"issue":"18","key":"ref3","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevLett.97.180501","article-title":"Topological quantum distillation","volume":"97","author":"Bombin","year":"2006","journal-title":"Phys. Rev. Lett."},{"issue":"6","key":"ref4","doi-asserted-by":"crossref","first-page":"4741","DOI":"10.1103\/PhysRevA.54.4741","article-title":"Simple quantum error correcting codes","volume":"54","author":"Steane","year":"1996","journal-title":"Physical Rev. A"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.109.042416"},{"issue":"1","key":"ref6","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0012-365X(99)00318-0","article-title":"Extremal self-dual codes with the smallest covering radius","volume":"215","author":"Harada","year":"2000","journal-title":"Discrete Math."},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.26421\/QIC9.7-8-1"},{"issue":"1","key":"ref8","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0893-9659(97)00140-7","article-title":"The existence of a formally self-dual even [70, 35, 14] code","volume":"11","author":"Gulliver","year":"1998","journal-title":"Appl. Math. Lett."},{"key":"ref9","volume-title":"Tables of self-dual codes","author":"Philippe","year":"2007"},{"issue":"1","key":"ref10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1112\/jlms\/jdr054","article-title":"On triply even binary codes","volume":"86","author":"Betsumiya","year":"2012","journal-title":"J. London Math. Soc."},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.97.042327"},{"key":"ref12","article-title":"Quantum fault tolerance in small experiments","author":"Gottesman","year":"2016","journal-title":"arXiv:1610.03507"},{"issue":"1","key":"ref13","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevA.81.012319","article-title":"Topological color codes on union Jack lattices: A stable implementation of the whole clifford group","volume":"81","author":"Katzgraber","year":"2010","journal-title":"Phys. Rev. A"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"2","DOI":"10.22331\/q-2017-04-25-2","article-title":"The surface code with a twist","volume":"1","author":"Yoder","year":"2017","journal-title":"Quantum"},{"key":"ref15","article-title":"The smallest code with transversal T","author":"Koutsioumpas","year":"2022","journal-title":"arXiv:2210.14066"},{"issue":"3","key":"ref16","doi-asserted-by":"crossref","DOI":"10.1103\/PRXQuantum.3.030319","article-title":"Morphing quantum codes","volume":"3","author":"Vasmer","year":"2022","journal-title":"PRX Quantum"},{"issue":"2","key":"ref17","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevA.71.022316","article-title":"Universal quantum computation with ideal clifford gates and noisy ancillas","volume":"71","author":"Bravyi","year":"2005","journal-title":"Phys. Rev. A"},{"issue":"7671","key":"ref18","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1038\/nature23460","article-title":"Roads towards fault-tolerant universal quantum computation","volume":"549","author":"Campbell","year":"2017","journal-title":"Nature"},{"key":"ref19","article-title":"Computation with quantum reed-muller codes and their mapping onto 2D atom arrays","author":"Gong","year":"2024","journal-title":"arXiv:2410.23263"},{"key":"ref20","article-title":"Efficient fault-tolerant code switching via one-way transversal CNOT gates","author":"Heu\u00dfen","year":"2024","journal-title":"arXiv:2409.13465"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.111.090505"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/17\/8\/083002"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1103\/physrevx.6.031039"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.113.080501"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.22331\/q-2019-02-04-120"},{"key":"ref26","article-title":"The not-so-secret fourth parameter of quantum codes","author":"Kubischta","year":"2024","journal-title":"arXiv:2310.17652"},{"key":"ref27","article-title":"Stabilizer codes and quantum error correction","author":"Gottesman","year":"1997","journal-title":"arXiv:9705052"},{"issue":"3","key":"ref28","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1103\/PhysRevLett.78.405","article-title":"Quantum error correction and orthogonal geometry","volume":"78","author":"Calderbank","year":"1997","journal-title":"Phys. Rev. Lett."},{"key":"ref29","volume-title":"Bounds on the minimum distance of linear codes and quantum codes","author":"Grassl","year":"2007"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1126\/science.1231298"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1063\/1.4976737"},{"issue":"7997","key":"ref32","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1038\/s41586-023-06927-3","article-title":"Logical quantum processor based on reconfigurable atom arrays","volume":"626","author":"Bluvstein","year":"2024","journal-title":"Nature"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.86.052329"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.106.012437"},{"issue":"7","key":"ref35","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevB.75.075103","article-title":"Exact topological quantum order in D=3 and beyond: Branyons and Brane-net condensates","volume":"75","author":"Bombin","year":"2007","journal-title":"Phys. Rev. B"},{"issue":"6","key":"ref36","first-page":"657","article-title":"Notes on digital coding","volume":"37","author":"Golay","year":"1949","journal-title":"Proc. IRE"},{"key":"ref37","volume-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1977"},{"issue":"2","key":"ref38","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1103\/PhysRevA.54.1098","article-title":"Good quantum error-correcting codes exist","volume":"54","author":"Calderbank","year":"1996","journal-title":"Phys. Rev. A"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.77.793"},{"issue":"10","key":"ref40","doi-asserted-by":"crossref","first-page":"7163","DOI":"10.1109\/TIT.2011.2165812","article-title":"A construction of quantum Stabilizer codes based on syndrome assignment by classical parity-check matrices","volume":"57","author":"Lai","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref41","article-title":"Quantum BCH codes","author":"Grassl","year":"1999","journal-title":"arXiv:quant-ph\/9910060"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-024-04485-9"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"802","DOI":"10.22331\/q-2022-09-08-802","article-title":"Designing the quantum channels induced by diagonal gates","volume":"6","author":"Hu","year":"2022","journal-title":"Quantum"},{"issue":"2","key":"ref44","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1109\/JSAIT.2020.3012914","article-title":"On optimality of CSS codes for transversal T","volume":"1","author":"Rengaswamy","year":"2020","journal-title":"IEEE J. Select. Areas Inf. Theory"},{"key":"ref45","first-page":"1891","article-title":"Classical coding problem from transversal T gates","volume-title":"Proc. IEEE Int. Symp. Inf. Theory (ISIT)","author":"Rengaswamy"},{"issue":"3","key":"ref46","doi-asserted-by":"crossref","DOI":"10.1103\/PRXQuantum.3.030322","article-title":"Achieving fault tolerance on capped color codes with few ancillas","volume":"3","author":"Tansuwannont","year":"2022","journal-title":"PRX Quantum"},{"key":"ref47","article-title":"CSS-T codes from reed muller codes for quantum fault tolerance","author":"Andrade","year":"2023","journal-title":"arXiv:2305.06423"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-024-04427-5"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-024-01415-9"},{"key":"ref50","article-title":"Asymptotically good CSS-T codes exist","author":"Berardini","year":"2024","journal-title":"arXiv:2412.08586"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT-W61686.2024.10591766"},{"key":"ref52","first-page":"1","article-title":"Binary Triorthogonal and CSS-T codes for quantum error correction","volume-title":"Proc. 60th Annu. Allerton Conf. Commun., Control, Comput.","author":"Camps-Moreno"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.22331\/q-2018-06-07-71"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/bf01223730"},{"key":"ref55","article-title":"Divisible codes","author":"Kurz","year":"2023","journal-title":"arXiv:2112.11763"},{"key":"ref56","article-title":"Divisible codes for quantum computation","author":"Hu","year":"2022","journal-title":"arXiv:2204.13176"},{"key":"ref57","article-title":"Complex instruction set computing architecture for performing accurate quantum Z rotations with less magic","author":"Landahl","year":"2013","journal-title":"arXiv:1302.3240"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.95.022316"},{"key":"ref59","article-title":"Self-dual codes","author":"Rains","year":"2002","journal-title":"arXiv:math\/0208001"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2006.883612"},{"key":"ref61","volume-title":"Surviving as a quantum computer in a classical world (2024 Draft)","author":"Gottesman","year":"2024"},{"key":"ref62","first-page":"39","article-title":"An introduction to QR code technology","volume-title":"Proc. Int. Conf. Inf. Technol. (ICIT)","author":"Tiwari"},{"issue":"2","key":"ref63","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0012-365X(90)90015-A","article-title":"Weight polarization and divisibility","volume":"83","author":"Ward","year":"1990","journal-title":"Discrete Math."},{"key":"ref64","volume-title":"Introduction to Analytic Number Theory","author":"Apostol","year":"1976"},{"issue":"4","key":"ref65","doi-asserted-by":"crossref","first-page":"1238","DOI":"10.1109\/18.605587","article-title":"Linear programming bounds for doubly-even self-dual codes","volume":"43","author":"Krasikov","year":"1997","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-005-7654-8"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9069-7"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.26421\/QIC9.11-12-7"},{"key":"ref69","volume-title":"Application-Driven Coding Theory","year":"2024"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8700143\/10852562\/11006024-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/8700143\/10852562\/11006024.pdf?arnumber=11006024","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T18:15:50Z","timestamp":1767896150000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11006024\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":69,"URL":"https:\/\/doi.org\/10.1109\/jsait.2025.3570832","relation":{},"ISSN":["2641-8770"],"issn-type":[{"value":"2641-8770","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}