Pith. sign in

Gullans, Yifan Hong, Maryam Mudassar, and Shi Jie Samuel Tan

3 Pith papers cite this work. Polarity classification is still indexing.

3 Pith papers citing it

citation-role summary

background 1

citation-polarity summary

fields

quant-ph 3

years

2026 3

roles

background 1

polarities

background 1

representative citing papers

Generalized Bicycle Codes as Cyclic Submodules and their Automorphism Structure

quant-ph · 2026-06-03 · unverdicted · novelty 7.0

GB codes are expressed as cyclic submodules of R_ℓ² to derive necessary and sufficient conditions for block-separable automorphisms and fold-transversal gates, with the new MCR family demonstrated to generate the 2-qubit Clifford group for k=2 codes up to distance 13.

Spatial overhead reduction for 2D hypergraph product codes

quant-ph · 2026-05-11 · unverdicted · novelty 6.0

A qubit-reduction method for hypergraph product codes preserves dimension, distance, and fault-tolerance properties, producing smaller codes such as [[441,64,6]] from [[610,64,6]] with comparable noise performance and compatibility with logical gates.

citing papers explorer

Showing 3 of 3 citing papers.

  • Achieving Optimal-Distance Atom-Loss Correction via Pauli Envelope quant-ph · 2026-03-04 · conditional · none · ref 52

    Pauli Envelope framework enables optimal loss-distance correction (d_loss ~ d) for rotated surface codes via Mid-SWAP circuits and Envelope-MLE decoder, with simulations showing up to 40% higher thresholds.

  • Generalized Bicycle Codes as Cyclic Submodules and their Automorphism Structure quant-ph · 2026-06-03 · unverdicted · none · ref 24

    GB codes are expressed as cyclic submodules of R_ℓ² to derive necessary and sufficient conditions for block-separable automorphisms and fold-transversal gates, with the new MCR family demonstrated to generate the 2-qubit Clifford group for k=2 codes up to distance 13.

  • Spatial overhead reduction for 2D hypergraph product codes quant-ph · 2026-05-11 · unverdicted · none · ref 70

    A qubit-reduction method for hypergraph product codes preserves dimension, distance, and fault-tolerance properties, producing smaller codes such as [[441,64,6]] from [[610,64,6]] with comparable noise performance and compatibility with logical gates.