REVIEW 4 cited by
SSIP: automated surgery with quantum LDPC 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
abstract
We present Safe Surgery by Identifying Pushouts (SSIP), an open-source lightweight Python package for automating surgery between qubit CSS codes. SSIP is flexible: it is capable of performing both external surgery, that is surgery between two codeblocks, and internal surgery, that is surgery within the same codeblock. Under the hood, it performs linear algebra over $\mathbb{F}_2$ governed by universal constructions in the category of chain complexes. We demonstrate on quantum Low-Density Parity Check (qLDPC) codes, which are not topological codes in general, and are of interest for near-term fault-tolerant quantum computing. Such qLDPC codes include lift-connected surface codes, generalised bicycle codes and bivariate bicycle codes. We show that various logical measurements can be performed cheaply by surgery without sacrificing the high code distance. For example, half of the single-qubit logical measurements in the $Z$ or $X$ basis on the $[[ 144 ,12, 12 ]]$ gross code require only 30 total additional qubits each, assuming the upper bound on distance given by QDistRnd is tight. This is two orders of magnitude lower than the additional qubit count of 1380 initially predicted by Bravyi et al.
Forward citations
Cited by 4 Pith papers
-
Fast logical operations in quantum LDPC codes using simple resource states
A scheduler-code protocol jointly measures up to 20 commuting logical operators in quantum LDPC codes with ~1.7 cat states per operator, yielding up to 3x faster logical measurements and up to 74x faster Clifford circ...
-
Hardware-tailored logical Clifford circuits for stabilizer codes
A discrete optimization over Clifford gauges compiles hardware-tailored logical Clifford circuits for arbitrary stabilizer codes, demonstrated on iceberg, twisted toric, and color codes.
-
Lifting Lifted Product Codes
Group-extension lifts systematically enlarge any LP code, transfer logical gadgets via chain maps (often with less surgery overhead), improve some code parameters, and give candidate thermodynamic families with cohere...
-
Sequences of Bivariate Bicycle Codes from Covering Graphs
Bivariate bicycle quantum codes form infinite families via graph covers: the [[144,12,12]] gross code is a double cover of [[72,12,6]], with logical-operator lifting and parameter bounds.
Discussion (0). Continue with ORCID to comment.