SearcharxivSearch

arXiv subjects

Stasiu Wolanski

Publications and source records attributed to Stasiu Wolanski.

2 recordsLinked to original sources

Automated Compilation Including Dropouts: Tolerating Defective Components in Stabiliser Codes

Utility-scale solid-state quantum devices will need to fabricate quantum devices at scale using imperfect processes. By introducing tolerance to fabrication defects into the design of the quantum devices, we can improve the yield of usable quantum chips and lower the cost of useful systems. Automated Compilation Including Dropouts (ACID) is a framework that works in the ancilla-free (or `middle-out') paradigm, to generate syndrome extraction circuits for general stabiliser codes in the presence of defective couplers or qubits. In the ancilla-free paradigm, we do not designate particular qubits as measurement ancillas, instead measuring stabilisers using any of the data qubits in their support. This approach leads to a great deal of flexibility in how syndrome extraction circuits can be implemented. ACID works by constructing and solving an optimisation problem within the ancilla-free paradigm to find a short syndrome extraction circuit. Applied to the surface code, ACID produces syndrome-extraction circuits of depth between $1\times$ (no overhead) and $1.5\times$ relative to the depth of defect-free circuits. The LUCI algorithm, the best prior art, yielded a $2 \times$ overhead, so ACID offers a significant time saving. The yield of surface code chips with a logical error rate at most $10\times$ the dropout-free baseline is up to $3\times$ higher using ACID than using LUCI. I demonstrate the broad applicability of ACID by compiling syndrome extraction circuits for bivariate bicycle codes and the colour code. For these circuits, we incur a circuit-depth overhead of between $1\times$ (no overhead) and $2.5\times$ relative to defect-free circuits. I believe this work is the first to simulate both of these families of codes in the presence of fabrication defects.

quant-ph

Ambiguity Clustering: an accurate and efficient decoder for qLDPC codes

Error correction allows a quantum computer to preserve states long beyond the decoherence time of its physical qubits. Key to any scheme of error correction is the decoding algorithm, which estimates the error state of qubits from the results of syndrome measurements. The leading proposal for quantum error correction, the surface code, has fast and accurate decoders, but several recently proposed quantum low-density parity check (qLDPC) codes allow more logical information to be encoded in significantly fewer physical qubits. The state-of-the-art decoder for general qLDPC codes, BP-OSD, has a cheap Belief Propagation stage, followed by linear algebra and search stages which can each be slow in practice. We introduce the Ambiguity Clustering decoder (AC) which, after the Belief Propagation stage, divides the measurement data into clusters that can be decoded independently. We benchmark AC on the recently proposed bivariate bicycle qLDPC codes and find that, with 0.3% circuit-level depolarising noise, AC is up to 27x faster than BP-OSD with matched accuracy. Our implementation of AC decodes the 144-qubit Gross code in 135us per round of syndrome extraction on an M2 CPU, already fast enough to keep up with neutral atom and trapped ion systems.

quant-ph