Quantum code syndrome extraction limited by hardware connectivity
The Intrinsic Cost of Quantum Syndrome Extraction
Information Theory
Summary
Measuring errors in quantum computers requires extracting information called syndromes from codes protecting the quantum bits. The authors studied how the connections in quantum hardware limit the speed of this extraction. They created a new way to measure the minimum interaction needed that does not depend on how the code is described. Their work shows fundamental lower bounds on how fast syndrome extraction can be done and provides examples that challenge previous assumptions about these limits. This helps engineers understand unavoidable costs before designing hardware layouts.
What this means in practice
- •For quantum hardware engineers: Assess unavoidable circuit depth costs for syndrome extraction based on device connectivity before finalizing hardware designs.
- •For quantum circuit designers: Optimize syndrome extraction circuits by understanding theoretical depth limits and designing around hardware-induced constraints.
A theory result. No direct application yet.
Authors
Chia-Tung Chu
Abstract
How much time is fundamentally required to extract the syndrome of a stabilizer code on hardware with a given connectivity graph? Previous work by Delfosse--Beverland--Tremblay (2021) and Baspin--Fawzi--Shayeghi (2023) established bounds connecting syndrome extraction to locality constraints on quantum hardware. Here, we address this question by first formulating an intrinsic measure of the interaction required for syndrome extraction directly from the stabilizer group, independent of the generating set used to describe the code. We then show that this measure yields hardware-dependent lower bounds on exact syndrome-extraction depth for arbitrary stabilizer codes. Guided by this measure, we also construct annular surface-code examples with constant-depth local syndrome extraction that provide a counterexample to Corollary 1 of DBT21. Furthermore, for a fixed quantum Tanner family, this measure strengthens the depth bound explicitly stated in BFS23 and, together with our matching construction, establishes an asymptotically tight space--depth tradeoff. In theory, our results connect the information required by syndrome extraction to the communication capacity of a device; while in practice, they provide a way to assess unavoidable circuit costs before committing to a hardware layout.