REVIEW 3 cited by
Diamond Circuits for Surface Codes
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We present and benchmark an interesting circuit family which we call diamond circuits, that use a mid-cycle construction built around the subsystem surface code to implement a surface code on a Lieb or "Heavy-Square" lattice. This makes them more qubit- and measurement-efficient than previous constructions. These circuits are described via the LUCI framework, and are effectively circuits with half the measure qubits dropped out of the grid. These circuits preserve the spacelike distance of the code, but suffer a penalty in timelike distance, and could be useful in regimes where quantum computers are limited by frequency collisions or number of control lines.
Forward citations
Cited by 3 Pith papers
-
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.
-
Adaptive Deformation of Color Code in Square Lattices with Defects
A universal superstabilizer method adapts color codes on square lattices to isolated defects in data and ancilla qubits, with optimizations that reuse resources and support Clifford gates plus lattice surgery.
-
Block algebra for morphing circuits
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.
Discussion (0). Sign in to comment.