Answers are grounded in this paper and cite their sources.
Quantum code surgery is a flexible and low-overhead technique for performing logical measurements on quantum error-correcting codes, which generalizes lattice surgery. In this work, we present a code surgery scheme, applicable to any qubit stabilizer low-density parity check (LDPC) code, that fault-tolerantly measures many logical Pauli operators in parallel. For a collection of logically disjoint Pauli product measurements supported on <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline"> <a:mi>t</a:mi> </a:math> logical qubits, our scheme uses <c:math xmlns:c="http://www.w3.org/1998/Math/MathML" display="inline"> <c:mrow> <c:mi mathvariant="script">O</c:mi> </c:mrow> <c:mrow> <c:mo>(</c:mo> <c:mi>t</c:mi> <c:mi>ω</c:mi> <c:mo stretchy="false">(</c:mo> <c:mi>log</c:mi> <c:mo></c:mo> <c:mi>t</c:mi> <c:mo>+</c:mo> <c:msup> <c:mi>log</c:mi> <c:mn>3</c:mn> </c:msup> <c:mo></c:mo> <c:mi>ω</c:mi> <c:mo stretchy="false">)</c:mo> <c:mo>)</c:mo> </c:mrow> </c:math> ancilla qubits, where <h:math xmlns:h="http://www.w3.org/1998/Math/MathML" display="inline"> <h:mi>ω</h:mi> <h:mo>≥</h:mo> <h:mi>d</h:mi> </h:math> is the maximum weight of the single logical Pauli representatives involved in the measurements and <j:math xmlns:j="http://www.w3.org/1998/Math/MathML" display="inline"> <j:mi>d</j:mi> </j:math> is the code distance. This is all done in time <l:math xmlns:l="http://www.w3.org/1998/Math/MathML" display="inline"> <l:mrow> <l:mi mathvariant="script">O</l:mi> </l:mrow> <l:mo stretchy="false">(</l:mo> <l:mi>d</l:mi> <l:mo stretchy="false">)</l:mo> </l:math> independent of <q:math xmlns:q="http://www.w3.org/1998/Math/MathML" display="inline"> <q:mi>t</q:mi> </q:math> . Our proposed scheme preserves both the LDPC property and the fault-distance of the original code, without requiring ancillary logical codeblocks, which may be costly to prepare. This addresses a shortcoming of several recently introduced surgery schemes, which can only be applied to measure a limited number of logical operators in parallel if they overlap on data qubits.
No takes yet. Share an insight, caveat, or question.
Cowtan et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: