aiqbench takeQuantum Computing

This paper establishes a fundamental theoretical limit on the resource efficiency of lattice surgery when applied to sparse stabilizer codes, demonstrating that worst-case scenarios require quadratic overhead in ancillary qubits. The finding implies that constant-overhead implementations are severely restricted in their ability to perform arbitrary measurements for codes with large parameters $k$. This result is critical for quantum hardware architects evaluating the practical feasibility of fault-tolerant measurement protocols.

Source coveringarXiv

What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

A lower bound on the overhead of surgery on sparse stabiliser codes

arXivOctober 9, 20261 min read

arXiv:2610.11097v1 Announce Type: new Abstract: We show that performing lattice surgery on sparse stabiliser codes with sparse ancillas requires $\tilde{\Omega}(k^2)$ ancillary qubits in the worst case. As a result, for codes with large $k$, constant overhead ancillas can only realise a small fraction of possible measurements.

Abstract:We show that performing lattice surgery on sparse stabiliser codes with sparse ancillas requires $\tilde{\Omega}(k^2)$ ancillary qubits in the worst case. As a result, for codes with large $k$, constant overhead ancillas can only realise a small fraction of possible measurements.

arXiv:2610.11097 [quant-ph]

(or arXiv:2610.11097v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2610.11097 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 132 words

Read at arXiv ↗Ask about this article