{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T15:39:45Z","timestamp":1761665985524,"version":"build-2065373602"},"reference-count":45,"publisher":"Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften","license":[{"start":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:00:00Z","timestamp":1761609600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["quantum-journal.org"],"crossmark-restriction":false},"short-container-title":["Quantum"],"abstract":"<jats:p>Quantum error correction plays a prominent role in the realization of quantum computation, and quantum low-density parity-check (qLDPC) codes are believed to be practically useful stabilizer codes. While qLDPC codes are defined to have constant weight parity-checks, the weight of these parity checks could be large constants that make implementing these codes challenging. Large constants can also result in long syndrome extraction times and bad error propagation that can impact error correction performance. Hastings recently introduced weight reduction techniques for qLDPC codes that reduce the weight of the parity checks as well as the maximum number of checks that acts on any data qubit. However, the fault tolerance of these techniques remains an open question. In this paper, we analyze the effective distance of the weight-reduced code when single-ancilla syndrome extraction circuits are considered for error correction. We prove that there exists single-ancilla syndrome extraction circuits that largely preserve the effective distance of the weight-reduced qLDPC codes. In addition, we also show that the distance balancing technique introduced by Evra et al. \\cite{evra2022decodable} preserves effective distance. As a corollary, our result shows that higher-dimensional hypergraph product (HGP) codes, also known as homological product codes corresponding to the product of 1-complexes, have no troublesome hook errors when using any single-ancilla syndrome extraction circuit.<\/jats:p>","DOI":"10.22331\/q-2025-10-28-1897","type":"journal-article","created":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T15:32:23Z","timestamp":1761665543000},"page":"1897","update-policy":"https:\/\/doi.org\/10.22331\/q-crossmark-policy-page","source":"Crossref","is-referenced-by-count":0,"title":["Effective Distance of Higher Dimensional HGPs and Weight-Reduced Quantum LDPC Codes"],"prefix":"10.22331","volume":"9","author":[{"given":"Shi Jie Samuel","family":"Tan","sequence":"first","affiliation":[{"name":"Joint Center for Quantum Information and Computer Science, University of Maryland, College Park, MD 20742, USA"},{"name":"Department of Computer Science, University of Maryland, MD 20742, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lev","family":"Stambler","sequence":"additional","affiliation":[{"name":"Joint Center for Quantum Information and Computer Science, University of Maryland, College Park, MD 20742, USA"},{"name":"Department of Computer Science, University of Maryland, MD 20742, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"9598","published-online":{"date-parts":[[2025,10,28]]},"reference":[{"key":"0","doi-asserted-by":"publisher","unstructured":"Panos Aliferis and Andrew W Cross. Subsystem fault tolerance with the bacon-shor code. Physical review letters, 98(22):220502, 2007. doi:10.1103\/PhysRevLett.98.220502.","DOI":"10.1103\/PhysRevLett.98.220502"},{"key":"1","doi-asserted-by":"publisher","unstructured":"Dorit Aharonov and Lior Eldar. Quantum locally testable codes. SIAM Journal on Computing, 44(5):1230\u20131262, 2015. doi:10.1137\/140975498.","DOI":"10.1137\/140975498"},{"key":"2","doi-asserted-by":"publisher","unstructured":"Dave Bacon. Operator quantum error-correcting subsystems for self-correcting quantum memories. Physical Review A, 73(1):012340, 2006. doi:10.1103\/PhysRevA.73.012340.","DOI":"10.1103\/PhysRevA.73.012340"},{"key":"3","doi-asserted-by":"publisher","unstructured":"Natalie C Brown, Andrew Cross, and Kenneth R Brown. Critical faults of leakage errors on the surface code. In 2020 IEEE International Conference on Quantum Computing and Engineering (QCE), pages 286\u2013294. IEEE, 2020. doi:10.1109\/QCE49297.2020.00043.","DOI":"10.1109\/QCE49297.2020.00043"},{"key":"4","doi-asserted-by":"crossref","unstructured":"Sergey Bravyi, Guillaume Duclos-Cianci, David Poulin, and Martin Suchara. Subsystem surface codes with three-qubit check operators. arXiv preprint arXiv:1207.1443, 2012.","DOI":"10.26421\/QIC13.11-12-4"},{"key":"5","doi-asserted-by":"publisher","unstructured":"Hector Bombin, Chris Dawson, Ryan V Mishmash, Naomi Nickerson, Fernando Pastawski, and Sam Roberts. Logical blocks for fault-tolerant topological quantum computation. PRX Quantum, 4(2):020303, 2023. doi:10.1103\/PRXQuantum.4.020303.","DOI":"10.1103\/PRXQuantum.4.020303"},{"key":"6","doi-asserted-by":"publisher","unstructured":"Dave Bacon, Steven T Flammia, Aram W Harrow, and Jonathan Shi. Sparse quantum codes from quantum circuits. IEEE Transactions on Information Theory, 63(4):2464\u20132479, 2017. doi:10.1109\/TIT.2017.2663199.","DOI":"10.1109\/TIT.2017.2663199"},{"key":"7","doi-asserted-by":"publisher","unstructured":"Sergey Bravyi and Matthew B Hastings. Homological product codes. In Proceedings of the forty-sixth annual ACM symposium on Theory of computing, pages 273\u2013282, 2014. doi:10.1145\/2591796.2591870.","DOI":"10.1145\/2591796.2591870"},{"key":"8","doi-asserted-by":"publisher","unstructured":"H\u00e9ctor Bomb\u00edn. Topological subsystem codes. Physical review A, 81(3):032301, 2010. doi:10.1103\/PhysRevA.81.032301.","DOI":"10.1103\/PhysRevA.81.032301"},{"key":"9","doi-asserted-by":"publisher","unstructured":"Earl T Campbell. A theory of single-shot error correction for adversarial noise. Quantum Science and Technology, 4(2):025006, 2019. doi:10.1088\/2058-9565\/aafc8f.","DOI":"10.1088\/2058-9565\/aafc8f"},{"key":"10","doi-asserted-by":"publisher","unstructured":"A Robert Calderbank and Peter W Shor. Good quantum error-correcting codes exist. Physical Review A, 54(2):1098, 1996. doi:10.1103\/PhysRevA.54.1098.","DOI":"10.1103\/PhysRevA.54.1098"},{"key":"11","doi-asserted-by":"publisher","unstructured":"Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill. Topological quantum memory. Journal of Mathematical Physics, 43(9):4452\u20134505, 2002. doi:10.1063\/1.1499754.","DOI":"10.1063\/1.1499754"},{"key":"12","doi-asserted-by":"publisher","unstructured":"Julio C Magdalena de la Fuente. Dynamical weight reduction of pauli measurements. arXiv preprint arXiv:2410.12527, 2024. doi:10.48550\/arXiv.2410.12527.","DOI":"10.48550\/arXiv.2410.12527"},{"key":"13","doi-asserted-by":"crossref","unstructured":"Irit Dinur, Ting-Chun Lin, and Thomas Vidick. Expansion of higher-dimensional cubical complexes with application to quantum locally testable codes. arXiv preprint arXiv:2402.07476, 2024.","DOI":"10.1109\/FOCS61266.2024.00031"},{"key":"14","unstructured":"Nicolas Delfosse and Adam Paetznick. Spacetime codes of clifford circuits. arXiv preprint arXiv:2304.05943, 2023."},{"key":"15","doi-asserted-by":"publisher","unstructured":"Lior Eldar and Aram W Harrow. Local hamiltonians whose ground states are hard to approximate. In 2017 IEEE 58th annual symposium on foundations of computer science (FOCS), pages 427\u2013438. IEEE, 2017. doi:10.1109\/FOCS.2017.46.","DOI":"10.1109\/FOCS.2017.46"},{"key":"16","doi-asserted-by":"publisher","unstructured":"Shai Evra, Tali Kaufman, and Gilles Z\u00e9mor. Decodable quantum ldpc codes beyond the n distance barrier using high-dimensional expanders. SIAM Journal on Computing, (0):FOCS20\u2013276, 2022. doi:10.1137\/20M1383689.","DOI":"10.1137\/20M1383689"},{"key":"17","unstructured":"Michael H Freedman and Matthew B Hastings. Quantum systems on non-$ k $-hyperfinite complexes: A generalization of classical statistical mechanics on expander graphs. arXiv preprint arXiv:1301.1363, 2013."},{"key":"18","doi-asserted-by":"publisher","unstructured":"Michael Freedman and Matthew Hastings. Building manifolds from quantum codes. Geometric and Functional Analysis, 31(4):855\u2013894, 2021. doi:10.1007\/s00039-021-00567-3.","DOI":"10.1007\/s00039-021-00567-3"},{"key":"19","doi-asserted-by":"publisher","unstructured":"Austin G Fowler, Matteo Mariantoni, John M Martinis, and Andrew N Cleland. Surface codes: Towards practical large-scale quantum computation. Physical Review A, 86(3):032324, 2012. doi:10.1103\/PhysRevA.86.032324.","DOI":"10.1103\/PhysRevA.86.032324"},{"key":"20","doi-asserted-by":"publisher","unstructured":"Craig Gidney. A pair measurement surface code on pentagons. Quantum, 7:1156, 2023. doi:10.22331\/q-2023-10-25-1156.","DOI":"10.22331\/q-2023-10-25-1156"},{"key":"21","unstructured":"Daniel Gottesman. Stabilizer codes and quantum error correction. California Institute of Technology, 1997."},{"key":"22","unstructured":"Daniel Gottesman. Opportunities and challenges in fault-tolerant quantum computation. arXiv preprint arXiv:2210.15844, 2022."},{"key":"23","doi-asserted-by":"publisher","unstructured":"Linnea Grans-Samuelsson, Ryan V Mishmash, David Aasen, Christina Knapp, Bela Bauer, Brad Lackey, Marcus P da Silva, and Parsa Bonderson. Improved pairwise measurement-based surface code. Quantum, 8:1429, 2024. doi:10.22331\/q-2024-08-02-1429.","DOI":"10.22331\/q-2024-08-02-1429"},{"key":"24","unstructured":"Matthew B Hastings. Weight reduction for quantum codes. arXiv preprint arXiv:1611.03790, 2016."},{"key":"25","unstructured":"Matthew B Hastings. On quantum weight reduction. arXiv preprint arXiv:2102.10030, 2021."},{"key":"26","doi-asserted-by":"publisher","unstructured":"Oscar Higgott and Nikolas P Breuckmann. Subsystem codes with high thresholds by gauge fixing and reduced qubit overhead. Physical Review X, 11(3):031039, 2021. doi:10.1103\/PhysRevX.11.031039.","DOI":"10.1103\/PhysRevX.11.031039"},{"key":"27","doi-asserted-by":"publisher","unstructured":"Matthew B Hastings and Jeongwan Haah. Dynamically generated logical qubits. Quantum, 5:564, 2021. doi:10.22331\/q-2021-10-19-564.","DOI":"10.22331\/q-2021-10-19-564"},{"key":"28","doi-asserted-by":"publisher","unstructured":"Alioscia Hamma, Paolo Zanardi, and Xiao-Gang Wen. String and membrane condensation on three-dimensional lattices. Phys. Rev. B, 72:035307, Jul 2005. doi:10.1103\/PhysRevB.72.035307.","DOI":"10.1103\/PhysRevB.72.035307"},{"key":"29","doi-asserted-by":"publisher","unstructured":"Tomas Jochym-O&apos;Connor and Theodore J. Yoder. Four-dimensional toric code with non-clifford transversal gates. Physical Review Research, 3(1), February 2021. doi:10.1103\/PhysRevResearch.3.013118.","DOI":"10.1103\/PhysRevResearch.3.013118"},{"key":"30","doi-asserted-by":"publisher","unstructured":"A Yu Kitaev. Fault-tolerant quantum computation by anyons. Annals of physics, 303(1):2\u201330, 2003. doi:10.1016\/S0003-4916(02)00018-0.","DOI":"10.1016\/S0003-4916(02)00018-0"},{"key":"31","doi-asserted-by":"publisher","unstructured":"Anirudh Krishna and David Poulin. Fault-tolerant gates on hypergraph product codes. Physical Review X, 11(1):011023, 2021. doi:10.1103\/PhysRevX.11.011023.","DOI":"10.1103\/PhysRevX.11.011023"},{"key":"32","unstructured":"Andrew J Landahl, Jonas T Anderson, and Patrick R Rice. Fault-tolerant quantum computing with color codes. arXiv preprint arXiv:1108.5738, 2011."},{"key":"33","doi-asserted-by":"publisher","unstructured":"Anthony Leverrier and Gilles Z\u00e9mor. Quantum tanner codes. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), pages 872\u2013883. IEEE, 2022. doi:10.1109\/FOCS54457.2022.00117.","DOI":"10.1109\/FOCS54457.2022.00117"},{"key":"34","doi-asserted-by":"publisher","unstructured":"Argyris Giannisis Manes and Jahan Claes. Distance-preserving stabilizer measurements in hypergraph product codes. arXiv preprint arXiv:2308.15520, 2023.","DOI":"10.22331\/q-2025-01-30-1618"},{"key":"35","doi-asserted-by":"publisher","unstructured":"Pavel Panteleev and Gleb Kalachev. Asymptotically good quantum and locally testable classical ldpc codes. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pages 375\u2013388, 2022. doi:10.1145\/3519935.3520017.","DOI":"10.1145\/3519935.3520017"},{"key":"36","doi-asserted-by":"publisher","unstructured":"Armanda O Quintavalle and Earl T Campbell. Reshape: A decoder for hypergraph product codes. IEEE Transactions on Information Theory, 68(10):6569\u20136584, 2022. doi:10.1109\/TIT.2022.3184108.","DOI":"10.1109\/TIT.2022.3184108"},{"key":"37","doi-asserted-by":"publisher","unstructured":"Armanda O Quintavalle, Michael Vasmer, Joschka Roffe, and Earl T Campbell. Single-shot error correction of three-dimensional homological product codes. PRX Quantum, 2(2):020340, 2021. doi:10.1103\/PRXQuantum.2.020340.","DOI":"10.1103\/PRXQuantum.2.020340"},{"key":"38","doi-asserted-by":"publisher","unstructured":"Eric Sabo, Lane G Gunderman, Benjamin Ide, Michael Vasmer, and Guillaume Dauphinais. Weight reduced stabilizer codes with lower overhead. arXiv preprint arXiv:2402.05228, 2024.","DOI":"10.1103\/PRXQuantum.5.040302"},{"key":"39","doi-asserted-by":"publisher","unstructured":"Andrew Steane. Multiple-particle interference and quantum error correction. Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, 452(1954):2551\u20132577, 1996. doi:10.1098\/rspa.1996.0136.","DOI":"10.1098\/rspa.1996.0136"},{"key":"40","doi-asserted-by":"publisher","unstructured":"Jean-Pierre Tillich and Gilles Z\u00e9mor. Quantum ldpc codes with positive rate and minimum distance proportional to the square root of the blocklength. IEEE Transactions on Information Theory, 60(2):1193\u20131202, 2013. doi:10.1109\/TIT.2013.2292061.","DOI":"10.1109\/TIT.2013.2292061"},{"key":"41","unstructured":"Adam Wills, Ting-Chun Lin, and Min-Hsiu Hsieh. General distance balancing for quantum locally testable codes. arXiv preprint arXiv:2305.00689, 2023."},{"key":"42","unstructured":"Adam Wills, Ting-Chun Lin, and Min-Hsiu Hsieh. Tradeoff constructions for quantum locally testable codes. arXiv preprint arXiv:2309.05541, 2023."},{"key":"43","doi-asserted-by":"publisher","unstructured":"Qian Xu, Hengyun Zhou, Guo Zheng, Dolev Bluvstein, J Ataides, Mikhail D Lukin, and Liang Jiang. Fast and parallelizable logical computation with homological product codes. Physical Review X, 15:021065, 2025. doi:10.1103\/PhysRevX.15.021065.","DOI":"10.1103\/PhysRevX.15.021065"},{"key":"44","doi-asserted-by":"publisher","unstructured":"Weilei Zeng and Leonid P Pryadko. Higher-dimensional quantum hypergraph-product codes with finite rates. Physical review letters, 122(23):230501, 2019. doi:10.1103\/PhysRevLett.122.230501.","DOI":"10.1103\/PhysRevLett.122.230501"}],"container-title":["Quantum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/quantum-journal.org\/papers\/q-2025-10-28-1897\/pdf\/","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T15:32:28Z","timestamp":1761665548000},"score":1,"resource":{"primary":{"URL":"https:\/\/quantum-journal.org\/papers\/q-2025-10-28-1897\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,28]]},"references-count":45,"URL":"https:\/\/doi.org\/10.22331\/q-2025-10-28-1897","archive":["CLOCKSS"],"relation":{},"ISSN":["2521-327X"],"issn-type":[{"value":"2521-327X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,28]]},"article-number":"1897"}}