Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.39980

Logical information localisation in stabiliser codes via single-qubit measurements

Jelena Mackeprang, Hemant Sharma, Jonas Helsen

quant-phSubmitted Sep 30, 2026• Announced Oct 1, 2026• 0 citations
arXivHTMLPDF

Abstract

Stabiliser path finding (SPF) has previously been introduced as a method to localise logical information in a stabiliser code undergoing loss onto a single pre-specified target qubit, using only one round of single-qubit measurements. When working with limited resources and flying qubits, this fast read-out of logical information is a helpful tool for fault-tolerant communication. In this work, we provide a broad analytical and computational study of localisation via SPF. We introduce $g$-SPF, where the task is to localise the logical information onto a set of at most $g$ unspecified target qubits. Through analytical arguments based on percolation theory and the disjointness of stabiliser codes, we prove that for i.i.d. qubit loss with probability $p<1/2$ and sufficiently large planar surface codes, localisation via $g$-SPF for constant $g$ succeeds with a probability converging to one, which establishes a localisation threshold. Furthermore, we propose and implement two algorithms to solve SPF. The first is exact and formulates SPF as an integer linear program, whereas the second is heuristic and formulates SPF as a decoding problem. We validate both algorithms by numerically reproducing the localisation threshold for the surface code and demonstrate that the heuristic algorithm is considerably faster. Our work significantly reduces the time required to solve SPF compared to current state-of-the-art algorithms, allowing us to study localisation in substantially larger stabiliser codes than previously considered in the literature. Together, these theoretical and computational results open the door to various applications, such as fault-tolerant teleportation and efficient logical fusion.

AI Summary

The paper studies whether logical information in a stabiliser code undergoing qubit loss can be localised using one round of single-qubit Pauli measurements. It generalises stabiliser path finding (SPF), originally targeting a prescribed surviving qubit, to $g$-SPF: finding logical $X$ and $Z$ representatives that avoid lost qubits and anticommute qubit-wise on at most $g$ unspecified qubits. For planar surface codes under independent loss with probability $p<1/2$, it proves that some constant $g=g(p)$ permits localisation with probability approaching one as code size grows. For $p>1/2$, success approaches zero. The proof combines percolation bounds giving $\Omega(\sqrt n)$ disjoint surviving representatives of each logical operator with the intersection bound $\min_{X,Z}|\operatorname{supp}(X)\cap\operatorname{supp}(Z)|\leq n/(\Delta_X\Delta_Z)$. The resulting failure bound is exponentially small in lattice width. Two computational methods are introduced: D-LoFi, an exact integer-programming formulation minimising measurement support, and H-LoFi, a heuristic using weighted decoding. Simulations reach rotated surface-code distance 9 (81 qubits) and graph codes with 51 qubits, versus 18 in the previous benchmark. Numerics suggest a threshold near $1/2$ even for $g=1$, with H-LoFi generally faster and approximately reproducing exact success rates. The theorem does not establish $g=1$ or extend to general codes. H-LoFi has no completeness guarantee and performs less reliably in some small-code regimes. Complexity classification, multiple logical qubits, and measurement policies for unheralded loss remain open.

Little sign of AI-generated text

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Fault-Tolerant Logical Operators in Quantum Error-Correcting Codes

Paul Webster

Performing quantum computing that is robust against noise will require that all operations are fault-tolerant, meaning that they succeed with high probability even if a limited number of errors occur. We address the problem of fault-tolerantly implementing logical operators on quantum error-correcting codes – operators that apply logic gates to information protected by such codes. Specifically, we investigate what classes of logical operators are possible by particular approaches in important types of codes, especially topological stabiliser codes. We also analyse what fundamental limitations constrain the goal of realising fault-tolerant quantum computing by such implementations and how these limitations can be overcome. \n \nWe begin by presenting necessary background theory on quantum computing, quantum error-correcting codes and fault tolerance. We then specifically consider the approach to fault tolerance of locality-preserving logical operators in topological stabiliser codes. We present a method for determining the set of such operators admitted by a wide range of such codes and apply this method to important examples such as surface codes and colour codes. Next, we consider the alternative approach of implementing logical operators in topological stabiliser codes with defects, especially by the technique of braiding. We show that such approaches are fundamentally limited, but that effective schemes can nonetheless be constructed, both within these limitations and by circumventing them. We then consider fault tolerance in a more general context. We prove a highly general no-go theorem in this context, applicable to a wide range of stabiliser codes. We also show that this proof illuminates how it can be circumvented and provides perspective on a range of fault-tolerant schemes. Finally, we conclude by reviewing how these results collectively address our research questions and suggesting future work.

•Jan 1, 2021•0 citations

Nearest-neighbour gates are all you need: High-rate quantum low-density parity-check codes on a planar grid

Boren Gu, Tamas Noszko, Vincent Steffan +4 more

High-performance quantum low-density parity-check codes promise substantial reductions in the overhead of fault-tolerant quantum computation, but most constructions require long-range connectivity or qubit shuttling, both of which are difficult to realise in superconducting architectures. Here we introduce a family of quantum low-density parity-check codes that, for the first time, combines planar open-boundary layouts, finite-size advantages over surface codes, and syndrome extraction using only nearest-neighbour gates on a planar grid of qubits with either square or hexagonal connectivity. The resulting circuits achieve optimal constant-depth stabiliser measurement, independent of code size, and naturally remove leakage from the system by exchanging the roles of check and data qubits at each syndrome extraction round. We find finite-size instances such as a [[323,14,15]] code, whose code-efficiency ratio is nearly an order of magnitude larger than that of rotated surface-code patches. At around 40 circuit qubits per logical qubit, the best directional tile-code layouts reduce the per-logical per-round logical error rate by a factor of 100 relative to rotated surface-code memories. These results show that the advantages of quantum low-density parity-check codes can survive compilation into strictly planar nearest-neighbour circuits, bringing low-overhead fault-tolerant memories closer to near-term hardware.

quant-pharXiv:2606.19482•Jun 19, 2026•22 citations

Robustness and measurement-induced percolation of the surface code

Thomas Botzung, Michael Buchhold, Sebastian Diehl +1 more

Abstract We examine the robustness of a logical qubit in the planar surface code subject to ‘measurement-errors’, i.e. to local Pauli measurements at known positions. This yields a measurement-only dynamics, which is driven by the competition between local Pauli measurements and stabilizer measurements. The setup differs from the conventional surface code for which errors are caused by decoherence and their positions are unknown. Yet, our setting allows us to examine the dynamics of the encoded logical qubit by using a combination of analytical arguments based on percolation theory and numerical simulations. Firstly, we show that for a single round of Pauli measurements only, the threshold corresponding to the irreversible loss of the logical qubit depends only on the rate of X ^ - and Z ^ -measurements, and that this loss of logical quantum information is equivalent to the bond percolation transition in a 2D square lattice. Local Y ^ -measurements, which affect both X and Z stabilizers, erase the logical qubit only if all physical qubits along one of the diagonals are measured, and are thus negligible at large code distance. Secondly, we examine the dynamics in the code by considering the interplay between rounds of Pauli measurements and rounds of stabilizer measurements. Focusing on the lifetime of the logical qubit, we obtain a rich phase diagram featuring different dynamical regimes. We argue that the loss of the logical qubit in this setting can still be understood by percolation theory and underpin our arguments with numerical simulations.

arXiv:2311.14338•Journal of Physics A Mathematical and Theoretical•May 1, 2025•14 citations

Lower overhead fault-tolerant building blocks for noisy quantum computers

Prithviraj Prabhu

Quantum computation holds the promise of solving certain complex problems exponentially faster than classical computers. However, the high prevalent noise in current quantum devices impedes the accurate execution of even basic algorithms. This can be remedied by protecting quantum information with a quantum error-correcting code, where the logical information of an algorithmic qubit is spread across multiple physical qubits. Individual quantum errors are then located and corrected by the fault-tolerant measurement of multi-qubit stabilizer operators (parity checks). Unfortunately, error correction and fault tolerance both impose large demands on the qubit overhead: hundreds to thousands of physical qubits per logical qubit. We reduce the spacetime cost of fault tolerance by redesigning key building blocks of an error-corrected quantum computer. First, we develop a combinatorial proof with flag fault tolerance that exponentially reduces the extra qubits needed to measure a stabilizer of any size, while tolerating one fault. We leverage these proofs to then design state preparation circuits for the Steane and Golay codes with 100% yield. Next, we improve error correction on a planar layout by showing that a distance-four code encoding six logical qubits protects information as well as the distance-five surface code, using one-tenth as many physical qubits. Finally, we optimize the time overhead of logical gates in surface code quantum computers by protecting measurement results with a classical code, cutting computation time by a factor of two to six. Our hardware-agnostic optimizations of fault tolerance overheads thus suggest new routes to advance the timeline of error-free quantum computing.

quant-pharXiv:2605.12385•May 13, 2026•0 citations

Measurement-free fault-tolerant logical-zero-state encoding of the distance-three nine-qubit surface code in a one-dimensional qubit array

Hayato Goto, Yinghao Ho, Taro Kanao

Generation of logical zero states encoded with a quantum error-correcting code is the first step for fault-tolerant quantum computation but requires considerably large resource overheads in general. To reduce such overheads, we propose an efficient encoding method for the distance-three, nine-qubit surface code and show its fault tolerance. This method needs no measurement, unlike other fault-tolerant encoding methods. Moreover, this is applicable to a one-dimensional qubit array. Observing these facts, we experimentally demonstrate the logical-zero-state encoding of the surface code using a superconducting quantum computer on the cloud. We also experimentally demonstrate the suppression of fast dephasing due to intrinsic residual interactions in this machine by a dynamical decoupling technique dedicated to the qubit array. To extend this method to larger codes, we also investigate the concatenation of the surface code with itself, resulting in a distance-nine, 81-qubit code. We numerically show that fault-tolerant encoding of this large code can be achieved by appropriate error detection.

arXiv:2303.17211•Physical Review Research•Nov 9, 2023•13 citations

Optimal logical Bell measurements on stabilizer codes with linear optics

Simon D. Reiß, Peter van Loock

Bell measurements (BMs) are ubiquitous in quantum information and technology. They are basic elements for quantum commmunication, computation, and error correction. In particular, when performed on logical qubits encoded in physical photonic qubits, they allow for a read-out of stabilizer syndrome information to enhance loss tolerance in qubit-state transmission and fusion. However, even in an ideal setting without photon loss, BMs cannot be done perfectly based on the simplest experimental toolbox of linear optics. Here we demonstrate that any logical BM on stabilizer codes can always be mapped onto a single physical BM perfomed on any qubit pair from the two codes. As a necessary condition for the success of a logical BM, this provides a general upper bound on its success probability, especially ruling out the possibility that the stabilizer information obtainable from only partially succeeding, physical linear-optics BMs could be combined into the full logical stabilizer information. We formulate sufficient criteria to find schemes for which a single successful BM on the physical level will always allow to obtain the full logical information by suitably adapting the subsequent physical measurements. Our approach based on stabilizer group theory is generally applicable to any stabilizer code, which we demonstrate for quantum parity, five-qubit, standard and rotated planar surface, tree, and seven-qubit Steane codes. Our schemes attain the general upper bound for all these codes, while this bound had previously only been reached for the quantum parity code.

quant-pharXiv:2601.08820•Physical Review A•Jan 14, 2026•5 citations
Stabiliser path finding (SPF) has previously been introduced as a method to localise logical information in a stabiliser code undergoing loss onto a single pre-specified target qubit, using only one round of single-qubit measurements. When working with limited resources and flying qubits, this fast read-out of logical information is a helpful tool for fault-tolerant communication. In this work, we provide a broad analytical and computational study of localisation via SPF. We introduce ggg-SPF, where the task is to localise the logical information onto a set of at most ggg unspecified target qubits. Through analytical arguments based on percolation theory and the disjointness of stabiliser codes, we prove that for i.i.d. qubit loss with probability p<1/2p<1/2p<1/2 and sufficiently large planar surface codes, localisation via ggg-SPF for constant ggg succeeds with a probability converging to one, which establishes a localisation threshold. Furthermore, we propose and implement two algorithms to solve SPF. The first is exact and formulates SPF as an integer linear program, whereas the second is heuristic and formulates SPF as a decoding problem. We validate both algorithms by numerically reproducing the localisation threshold for the surface code and demonstrate that the heuristic algorithm is considerably faster. Our work significantly reduces the time required to solve SPF compared to current state-of-the-art algorithms, allowing us to study localisation in substantially larger stabiliser codes than previously considered in the literature. Together, these theoretical and computational results open the door to various applications, such as fault-tolerant teleportation and efficient logical fusion.
The paper studies whether logical information in a stabiliser code undergoing qubit loss can be localised using one round of single-qubit Pauli measurements. It generalises stabiliser path finding (SPF), originally targeting a prescribed surviving qubit, to ggg-SPF: finding logical XXX and ZZZ representatives that avoid lost qubits and anticommute qubit-wise on at most ggg unspecified qubits.
For planar surface codes under independent loss with probability p<1/2p<1/2p<1/2, it proves that some constant g=g(p)g=g(p)g=g(p) permits localisation with probability approaching one as code size grows. For p>1/2p>1/2p>1/2, success approaches zero. The proof combines percolation bounds giving Ω(n)\Omega(\sqrt n)Ω(n​) disjoint surviving representatives of each logical operator with the intersection bound min⁡X,Z∣supp⁡(X)∩supp⁡(Z)∣≤n/(ΔXΔZ)\min_{X,Z}|\operatorname{supp}(X)\cap\operatorname{supp}(Z)|\leq n/(\Delta_X\Delta_Z)minX,Z​∣supp(X)∩supp(Z)∣≤n/(ΔX​ΔZ​). The resulting failure bound is exponentially small in lattice width.
Two computational methods are introduced: D-LoFi, an exact integer-programming formulation minimising measurement support, and H-LoFi, a heuristic using weighted decoding. Simulations reach rotated surface-code distance 9 (81 qubits) and graph codes with 51 qubits, versus 18 in the previous benchmark. Numerics suggest a threshold near 1/21/21/2 even for g=1g=1g=1, with H-LoFi generally faster and approximately reproducing exact success rates.
The theorem does not establish g=1g=1g=1 or extend to general codes. H-LoFi has no completeness guarantee and performs less reliably in some small-code regimes. Complexity classification, multiple logical qubits, and measurement policies for unheralded loss remain open.
Performing quantum computing that is robust against noise will require that all operations are fault-tolerant, meaning that they succeed with high probability even if a limited number of errors occur. We address the problem of fault-tolerantly implementing logical operators on quantum error-correcting codes – operators that apply logic gates to information protected by such codes. Specifically, we investigate what classes of logical operators are possible by particular approaches in important types of codes, especially topological stabiliser codes. We also analyse what fundamental limitations constrain the goal of realising fault-tolerant quantum computing by such implementations and how these limitations can be overcome. \n \nWe begin by presenting necessary background theory on quantum computing, quantum error-correcting codes and fault tolerance. We then specifically consider the approach to fault tolerance of locality-preserving logical operators in topological stabiliser codes. We present a method for determining the set of such operators admitted by a wide range of such codes and apply this method to important examples such as surface codes and colour codes. Next, we consider the alternative approach of implementing logical operators in topological stabiliser codes with defects, especially by the technique of braiding. We show that such approaches are fundamentally limited, but that effective schemes can nonetheless be constructed, both within these limitations and by circumventing them. We then consider fault tolerance in a more general context. We prove a highly general no-go theorem in this context, applicable to a wide range of stabiliser codes. We also show that this proof illuminates how it can be circumvented and provides perspective on a range of fault-tolerant schemes. Finally, we conclude by reviewing how these results collectively address our research questions and suggesting future work.
High-performance quantum low-density parity-check codes promise substantial reductions in the overhead of fault-tolerant quantum computation, but most constructions require long-range connectivity or qubit shuttling, both of which are difficult to realise in superconducting architectures. Here we introduce a family of quantum low-density parity-check codes that, for the first time, combines planar open-boundary layouts, finite-size advantages over surface codes, and syndrome extraction using only nearest-neighbour gates on a planar grid of qubits with either square or hexagonal connectivity. The resulting circuits achieve optimal constant-depth stabiliser measurement, independent of code size, and naturally remove leakage from the system by exchanging the roles of check and data qubits at each syndrome extraction round. We find finite-size instances such as a [[323,14,15]] code, whose code-efficiency ratio is nearly an order of magnitude larger than that of rotated surface-code patches. At around 40 circuit qubits per logical qubit, the best directional tile-code layouts reduce the per-logical per-round logical error rate by a factor of 100 relative to rotated surface-code memories. These results show that the advantages of quantum low-density parity-check codes can survive compilation into strictly planar nearest-neighbour circuits, bringing low-overhead fault-tolerant memories closer to near-term hardware.
Abstract We examine the robustness of a logical qubit in the planar surface code subject to ‘measurement-errors’, i.e. to local Pauli measurements at known positions. This yields a measurement-only dynamics, which is driven by the competition between local Pauli measurements and stabilizer measurements. The setup differs from the conventional surface code for which errors are caused by decoherence and their positions are unknown. Yet, our setting allows us to examine the dynamics of the encoded logical qubit by using a combination of analytical arguments based on percolation theory and numerical simulations. Firstly, we show that for a single round of Pauli measurements only, the threshold corresponding to the irreversible loss of the logical qubit depends only on the rate of X ^ - and Z ^ -measurements, and that this loss of logical quantum information is equivalent to the bond percolation transition in a 2D square lattice. Local Y ^ -measurements, which affect both X and Z stabilizers, erase the logical qubit only if all physical qubits along one of the diagonals are measured, and are thus negligible at large code distance. Secondly, we examine the dynamics in the code by considering the interplay between rounds of Pauli measurements and rounds of stabilizer measurements. Focusing on the lifetime of the logical qubit, we obtain a rich phase diagram featuring different dynamical regimes. We argue that the loss of the logical qubit in this setting can still be understood by percolation theory and underpin our arguments with numerical simulations.
Quantum computation holds the promise of solving certain complex problems exponentially faster than classical computers. However, the high prevalent noise in current quantum devices impedes the accurate execution of even basic algorithms. This can be remedied by protecting quantum information with a quantum error-correcting code, where the logical information of an algorithmic qubit is spread across multiple physical qubits. Individual quantum errors are then located and corrected by the fault-tolerant measurement of multi-qubit stabilizer operators (parity checks). Unfortunately, error correction and fault tolerance both impose large demands on the qubit overhead: hundreds to thousands of physical qubits per logical qubit. We reduce the spacetime cost of fault tolerance by redesigning key building blocks of an error-corrected quantum computer. First, we develop a combinatorial proof with flag fault tolerance that exponentially reduces the extra qubits needed to measure a stabilizer of any size, while tolerating one fault. We leverage these proofs to then design state preparation circuits for the Steane and Golay codes with 100% yield. Next, we improve error correction on a planar layout by showing that a distance-four code encoding six logical qubits protects information as well as the distance-five surface code, using one-tenth as many physical qubits. Finally, we optimize the time overhead of logical gates in surface code quantum computers by protecting measurement results with a classical code, cutting computation time by a factor of two to six. Our hardware-agnostic optimizations of fault tolerance overheads thus suggest new routes to advance the timeline of error-free quantum computing.
Generation of logical zero states encoded with a quantum error-correcting code is the first step for fault-tolerant quantum computation but requires considerably large resource overheads in general. To reduce such overheads, we propose an efficient encoding method for the distance-three, nine-qubit surface code and show its fault tolerance. This method needs no measurement, unlike other fault-tolerant encoding methods. Moreover, this is applicable to a one-dimensional qubit array. Observing these facts, we experimentally demonstrate the logical-zero-state encoding of the surface code using a superconducting quantum computer on the cloud. We also experimentally demonstrate the suppression of fast dephasing due to intrinsic residual interactions in this machine by a dynamical decoupling technique dedicated to the qubit array. To extend this method to larger codes, we also investigate the concatenation of the surface code with itself, resulting in a distance-nine, 81-qubit code. We numerically show that fault-tolerant encoding of this large code can be achieved by appropriate error detection.
Bell measurements (BMs) are ubiquitous in quantum information and technology. They are basic elements for quantum commmunication, computation, and error correction. In particular, when performed on logical qubits encoded in physical photonic qubits, they allow for a read-out of stabilizer syndrome information to enhance loss tolerance in qubit-state transmission and fusion. However, even in an ideal setting without photon loss, BMs cannot be done perfectly based on the simplest experimental toolbox of linear optics. Here we demonstrate that any logical BM on stabilizer codes can always be mapped onto a single physical BM perfomed on any qubit pair from the two codes. As a necessary condition for the success of a logical BM, this provides a general upper bound on its success probability, especially ruling out the possibility that the stabilizer information obtainable from only partially succeeding, physical linear-optics BMs could be combined into the full logical stabilizer information. We formulate sufficient criteria to find schemes for which a single successful BM on the physical level will always allow to obtain the full logical information by suitably adapting the subsequent physical measurements. Our approach based on stabilizer group theory is generally applicable to any stabilizer code, which we demonstrate for quantum parity, five-qubit, standard and rotated planar surface, tree, and seven-qubit Steane codes. Our schemes attain the general upper bound for all these codes, while this bound had previously only been reached for the quantum parity code.