Pith. sign in

Lowering connectivity requirements for bivariate bicycle codes using morphing circuits

2 Pith papers cite this work, alongside 10 external citations. Polarity classification is still indexing.

2 Pith papers citing it
10 external citations · OpenAlex

citation-role summary

background 1

citation-polarity summary

fields

quant-ph 2

years

2026 2

verdicts

UNVERDICTED 2

roles

background 1

polarities

background 1

representative citing papers

Block algebra for morphing circuits

quant-ph · 2026-06-10 · unverdicted · novelty 5.0

Four block-algebra constructions for morphing circuits are given, recovering a prior surface-code result and adding a new three-round color-code model via numerical search over finite-group representations.

citing papers explorer

Showing 2 of 2 citing papers.

  • Distributed Quantum Error Correction with Bivariate Bicycle Codes in a Modular Architecture quant-ph · 2026-05-06 · unverdicted · none · ref 26

    The [[144,12,12]] bivariate bicycle code is distributed across 4 to 12 processors in a star network, with simulations showing logical error rates under varying nonlocal noise scaling.

  • Block algebra for morphing circuits quant-ph · 2026-06-10 · unverdicted · none · ref 1

    Four block-algebra constructions for morphing circuits are given, recovering a prior surface-code result and adding a new three-round color-code model via numerical search over finite-group representations.