The authors equip CSS codes with cup product structures to generate logical operators in the Λ-th Clifford hierarchy level on Λ code copies via constant-depth unitaries, and construct code families supporting this for any Λ.
Available: https://link.aps.org/doi/10.1103/PhysRevX.6
3 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
fields
quant-ph 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
An algorithm converts topological data of 2D bulk stabilizer codes into 1D boundary subsystem codes via operator algebra and normal forms, enabling automatic generation of boundaries and defects demonstrated on toric, color, and other codes.
PureMagic dynamically schedules magic state cultivation by repurposing ancilla patches for routing and cultivation in surface codes, reporting 40-150% efficiency gains and up to 15x improvement over DASCOT on 29 benchmarks.
citing papers explorer
-
Cups and Gates I: Cohomology invariants and logical quantum operations
The authors equip CSS codes with cup product structures to generate logical operators in the Λ-th Clifford hierarchy level on Λ code copies via constant-depth unitaries, and construct code families supporting this for any Λ.
-
Operator algebra and algorithmic construction of boundaries and defects in (2+1)D topological Pauli stabilizer codes
An algorithm converts topological data of 2D bulk stabilizer codes into 1D boundary subsystem codes via operator algebra and normal forms, enabling automatic generation of boundaries and defects demonstrated on toric, color, and other codes.
-
PureMagic: A Dynamic Scheduler for Lattice Surgery
PureMagic dynamically schedules magic state cultivation by repurposing ancilla patches for routing and cultivation in surface codes, reporting 40-150% efficiency gains and up to 15x improvement over DASCOT on 29 benchmarks.