Answers are grounded in this paper and cite their sources.
Fault-tolerant quantum computation demands significant resources: large numbers of physical qubits must be checked for errors repeatedly to protect quantum data as logic gates are implemented in the presence of noise. We demonstrate that an approach based on the color code can lead to considerable reductions in the resource overheads compared with conventional methods, while remaining compatible with a two-dimensional layout. We propose a lattice surgery scheme that exploits the rich structure of the color-code phase to perform arbitrary pairs of commuting logical Pauli measurements in parallel while keeping the space cost low. Compared to lattice surgery schemes based on the surface code with the same code distance, and assuming the same amount of time is needed to complete a round of syndrome measurements, our approach yields about a <a:math xmlns:a="http://www.w3.org/1998/Math/MathML"><a:mrow><a:mn>3</a:mn><a:mo>×</a:mo></a:mrow></a:math> improvement in the space-time overhead, obtained from a combination of a <b:math xmlns:b="http://www.w3.org/1998/Math/MathML"><b:mrow><b:mn>1.5</b:mn><b:mo>×</b:mo></b:mrow></b:math> improvement in spatial overhead together with a <c:math xmlns:c="http://www.w3.org/1998/Math/MathML"><c:mrow><c:mn>2</c:mn><c:mo>×</c:mo></c:mrow></c:math> speedup due to the parallelization of commuting logical measurements. Even when taking into account the color code's lower error threshold using current decoders, the overhead is reduced by 10% at a physical error rate of <d:math xmlns:d="http://www.w3.org/1998/Math/MathML"><d:msup><d:mn>10</d:mn><d:mrow><d:mo>−</d:mo><d:mn>3</d:mn></d:mrow></d:msup></d:math> and by 50% at <e:math xmlns:e="http://www.w3.org/1998/Math/MathML"><e:msup><e:mn>10</e:mn><e:mrow><e:mo>−</e:mo><e:mn>4</e:mn></e:mrow></e:msup></e:math>.
No takes yet. Share an insight, caveat, or question.
Thomsen et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: