Automated framework synthesizes logical CNOT gates between arbitrary CSS codes via chain maps, recovering known constructions and finding new low-depth solutions for heterogeneous quantum architectures.
Title resolution pending
7 Pith papers cite this work. Polarity classification is still indexing.
7
Pith papers citing it
citation-role summary
background 2
method 1
citation-polarity summary
fields
quant-ph 7years
2026 7representative citing papers
Space-group codes—CSS codes whose stabilizers use crystallographic point-group symmetries—can be topologically ordered and geometrically local, and some match or beat bivariate-bicycle benchmarks.
Coset-based generalization of 2BGA codes produces new quantum LDPC codes with parameters such as [[48,8,6]] and competitive noise thresholds under BP-OSD decoding.
Full extractors for HGP codes are built to enable logical processing via PBC without compilation overhead, with sizes 50-80% of base codes and low error rates in simulations.
New structural conditions on affine permutation matrices yield ultra-high-rate quantum LDPC codes (rate >1/2) with near-teraquop logical error rates under circuit-level noise on reconfigurable atom arrays.
Morphing circuits optimize syndrome extraction for Abelian 2BGA and other QEC codes, yielding new circuits with improved parameters, connectivity, and stability against measurement errors.
Geometry choices in bivariate-bicycle qLDPC syndrome extraction determine leading correlated error structure via weighted exposure, which correlates strongly with logical error rates and is reduced by biplanar layouts.
citing papers explorer
-
Automated logical Clifford gadgets for heterogeneous architectures via chain maps
Automated framework synthesizes logical CNOT gates between arbitrary CSS codes via chain maps, recovering known constructions and finding new low-depth solutions for heterogeneous quantum architectures.
-
Topological Codes from Space Groups: A Route beyond Translation Invariance
Space-group codes—CSS codes whose stabilizers use crystallographic point-group symmetries—can be topologically ordered and geometrically local, and some match or beat bivariate-bicycle benchmarks.
-
Breaking the bicycle frame: Coset-based quantum LDPC codes
Coset-based generalization of 2BGA codes produces new quantum LDPC codes with parameters such as [[48,8,6]] and competitive noise thresholds under BP-OSD decoding.
-
Full Extractors for Logical Processing in Hypergraph Product Codes
Full extractors for HGP codes are built to enable logical processing via PBC without compilation overhead, with sizes 50-80% of base codes and low error rates in simulations.
-
Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays
New structural conditions on affine permutation matrices yield ultra-high-rate quantum LDPC codes (rate >1/2) with near-teraquop logical error rates under circuit-level noise on reconfigurable atom arrays.
-
Optimising Quantum Error Correction Using Morphing Circuits
Morphing circuits optimize syndrome extraction for Abelian 2BGA and other QEC codes, yielding new circuits with improved parameters, connectivity, and stability against measurement errors.
-
Geometry-induced correlated noise in qLDPC syndrome extraction
Geometry choices in bivariate-bicycle qLDPC syndrome extraction determine leading correlated error structure via weighted exposure, which correlates strongly with logical error rates and is reduced by biplanar layouts.