betaFeedback

WorksPhysics and Astronomy

Local enhancement of finite-strength code preparation: recoverability and Wilson coherence

Abstract

Stabilizer measurements provide a direct route to preparing quantum error-correcting codes and long-range entangled states. In realistic implementations, however, finite measurement strength can coherently deform the encoding map away from the projective limit. Certain nonlocal signatures associated with long-range order can survive such a deformation, but this alone does not guarantee that the resulting state protects encoded quantum information. We show that, at fixed strength, local logical leakage obstructs asymptotically faithful recovery; along logical operators' supports, its accumulation forces the relevant measurement strength to grow logarithmically with code distance. We then prove that this obstruction can be removed locally: for fixed toric registers under sufficiently weak local-stochastic errors, enhancing only a vanishing fraction of checks near selected logical supports restores recovery while the bulk remains at finite measurement strength. With recoverability restored, we prove a further dimensional distinction in logical operations. In the strict three-dimensional deconfined phase, suitable enhanced tubes restore the equivalence of macroscopically separated representatives, so either representative asymptotically implements the same controlled logical action on a fixed encoding. In two dimensions, recoverability alone does not restore this equivalence: the representatives can remain inequivalent even when both associated encodings are recoverable.

Introduction

Stabilizer measurements provide a direct way to prepare quantum error-correcting codes by imposing commuting constraints on a many-body state [1, 2]. Preparing topological order from a product state by bounded local unitary dynamics requires a time that grows with system size [3]. Measurements and classical feed-forward can instead prepare such states with constant quantum depth [5] [4], with constructions extending to a broad range of topological orders [6, 7]. A toric-code implementation using mid-circuit measurements and feed-forward has also been demonstrated experimentally [8]. In the ideal code space, the measured constraints both protect information against local errors and make different physical representatives of a logical operator act identically.

In practice, imperfect control of the system–ancilla interaction can produce deviations from the intended projective measurement [9, 10]. We describe such deviations through finite-strength measurement operators that retain coherent amplitudes across different check sectors and thereby deform the encoding map itself [11, 12]. In many-body states, such measurements can drive phase transitions [10, 13, 14, 15, 16] yet preserve long-range entanglement, including in a three-dimensional toric code [10, 17]. Finite-strength protocols can nevertheless retain long-range entanglement, including in a three-dimensional toric code [10, 17]. For the all-plus branch, the corresponding ferromagnetic Z2Z_2 gauge theory has an area law at every finite strength in two dimensions but a finite-strength deconfined perimeter-law regime in three dimensions [18, 19, 20, 21]. Yet the survival of these nonlocal signatures or of bulk order does not by itself show that the prepared state is a useful quantum code, which must protect an unknown input and keep its logical representatives equivalent. We ask whether both operational requirements are governed by the same bulk order when stabilizer measurements are only approximate.

Approximate quantum error correction (AQEC) relates recoverability to logical information leaked to the noise environment [22, 23, 24]. Local correctability and subsystem variance connect protection to code geometry and complexity [25, 26], while studies of noisy topological phases relate quantum-memory stability to mixed-state order and reversibility [27, 28, 29]. Finite-strength preparation can obstruct recovery [30] and make the encoding depend on the chosen logical representative [12]. Inspired by earlier work on quasi-locally dressed and locally error-corrected Wilson observables [31, 32], we ask whether AQEC recoverability can similarly be restored through spatially selective control: can measurement accuracy be concentrated near selected logical supports while the bulk remains at fixed finite strength? If such selective control is sufficient, how must its strength and spatial extent scale with code size? Even then, a second question remains: does the same local control make macroscopically separated representatives act identically on a fixed encoded state, or does their equivalence require an additional condition on the intervening bulk?

We identify a local source of logical leakage in the conditioned Calderbank–Shor–Steane (CSS) encodings Figure 1(a). A single-qubit XX error on a selected toric support reverses only O(1)O(1) measured checks. At finite strength, each logical-basis codeword has a nonzero overlap with its error image, with a sign set by the logical input. This makes logical inputs locally distinguishable and allows independent noise to transfer information to the environment. At a fixed nonzero error rate, the leakage persists as the code grows if the incident strengths remain bounded, even in the three-dimensional deconfined phase. The same mechanism leaves nonzero leakage per selected logical qubit in CSS quantum low-density parity-check (qLDPC) encodings at uniformly bounded strength. Along a straight toric representative, dd local signals can retain finite collective leakage even when each vanishes, requiring the common incident-check strength to grow at least logarithmically with ideal code distance dd (Theorem 1 and Corollary 1).

Figure 1. Logical structure of the results. (a) Local errors reveal selected logical information in general CSS encodings. Along toric representatives, accumulated leakage makes logarithmic measurement strength necessary. (b) Strengthening nearby checks restores AQEC at low noise and sufficient width. (c) Once both encodings are recoverable, their representative equivalence still depends on the bulk: the Wilson overlap vanishes in 2D with macroscopic unenhanced fillings, whereas sufficiently enhanced tubes restore it to one in the strict 3D deconfined phase.

We prove that enhancing neighborhoods of selected logical representatives restores recovery while the bulk remains at fixed finite strength [Figure 1(b)]. Increasing the measurement strength of the enhanced checks suppresses error overlaps whenever their syndrome enters the protected region, while increasing its width forces any logical crossing that leaves no protected syndrome to involve a larger support. Under sufficiently weak local-stochastic noise, without assuming independent error locations, these two mechanisms give entanglement fidelity approaching one for a fixed logical register. For straight toric representatives, enhancement strength O(log⁡d)O(\log d) suffices, with widths O(log⁡d)O(\log d) in two dimensions and O(log⁡d)O(\sqrt{\log d}) in three; both constructions use O(dlog⁡d)O(d\log d) enhanced checks, a vanishing fraction of the total. For CSS codes with good linear confinement, the sufficient width is reduced to O(log⁡log⁡U)O(\log\log U), where UU is the union size of the selected supports. The toric logarithmic strength matches the independent-noise lower bound in order, while the recovery construction requires no bulk phase condition (Theorem 2; Corollary 2).

With recoverability established, we compare two straight, parallel, macroscopically separated representatives of the same toric logical class in the same enhanced preparation [Figure 1(c)]. Their equivalence is measured by the Wilson overlap w=⟨ZℓZℓ′⟩w=\langle Z^{\ell}Z^{\ell'}\rangle, which tests whether the two physical strings act the same on a fixed encoding. In two dimensions, both fillings relating the strings retain macroscopic unenhanced area, so finite-strength factors accumulate and force w→0w\to0, even with projective strips. In the strict three-dimensional deconfined phase, full enhanced tubes suppress the dual obstructions that distinguish the representatives; logarithmic radius and strength suffice to give w→1w\to1. The same overlap directly quantifies logical action: substituting one representative for the other in an ideal controlled operation incurs the exact operator-norm error 2(1−w)\sqrt{2(1-w)}. Thus recoverability and coherent representative equivalence are distinct requirements (Theorem 3; Corollary 4).

Two implications follow for code preparation and logical control:

  • Preparation accuracy can be concentrated near selected logical supports. For the stated toric protocols, strengthening a vanishing fraction of checks suffices for recovery at fixed logical-register size. The required accuracy scales with accumulated local leakage, rather than the location of a bulk phase boundary.

  • Local enhancement and three-dimensional deconfinement jointly restore representative equivalence. Once local enhancement establishes recoverability, sufficiently strong full tubes in the three-dimensional deconfined phase also restore representative equivalence. The two-dimensional comparison shows that recoverability alone does not ensure this agreement.

Results

We first identify the leakage that the enhanced checks must suppress, then bound the strength and width needed for recovery. With recoverability established, we compare the coherent actions of distant representatives.

Background: finite-strength preparation and logical representatives

Consider a Calderbank–Shor–Steane (CSS) code on nn physical qubits, with XX checks Aμ=XaμA_\mu= X^{a_\mu} and measured ZZ checks Bj=ZhjB_j = Z^{h_j} satisfying [Aμ,Bj]=0[A_\mu, B_j] = 0 [34, 35]. The vectors hjh_j are the rows of the binary matrix HZH_Z; all checks are unsigned, and redundant checks are allowed. For the edge-qubit toric codes, AvA_v is a vertex star and Bp=∏e∈∂pZeB_p = \prod_{e \in\partial p} Z_e is a plaquette check [1, 2]. Starting from ∣+⟩⊗n|+\rangle^{\otimes n} fixes every Aμ=+1A_\mu= +1. Measuring the commuting BjB_j then imposes the remaining constraints. Finite-strength measurements replace these projective constraints by conditional filters [10, 30]; coherent deviations in syndrome extraction motivate studying this preparation error separately from subsequent noise [11, 12].

Figure 2(a) gives a circuit for one check. Prepare an ancilla in ∣+⟩a|+\rangle_a, apply Uj(tj)=exp⁡[−itjZa⊗Bj]U_j(t_j) = \exp[-\mathrm{i}t_j Z_a \otimes B_j], and measure YaY_a with result sj=±1s_j = \pm1. Here tj∈[0,π/4]t_j \in[0,\pi/4] is a dimensionless interaction angle. Taking the ancilla matrix element gives, up to a branch-global phase [9, 10, 30],

Mj,sj=cos⁡tjI+sjsin⁡tjBj2=esjβjBj/22cosh⁡βj,(1)M_{j,s_j} = \frac{\cos t_j I + s_j \sin t_j B_j}{\sqrt{2}} = \frac{e^{s_j\beta_j B_j/2}}{\sqrt{2\cosh\beta_j}}, \tag*{(1)}
tanh⁡(βj/2)=tan⁡tj,tanh⁡βj=sin⁡(2tj).\tanh(\beta_j/2) = \tan t_j,\qquad\tanh\beta_j = \sin(2t_j).

Thus βj=2artanh⁡(tan⁡tj)\beta_j = 2\operatorname{artanh}(\tan t_j) is the dimensionless filter strength. At tj=0t_j = 0 (βj=0\beta_j = 0), Mj,sj=I/2M_{j,s_j} = I/\sqrt{2} and the readout carries no check information; at tj=π/4t_j = \pi/4 (βj→∞\beta_j \to\infty), it becomes the projector (I+sjBj)/2(I + s_j B_j)/2. At intermediate strength, the conditional operation preserves coherence between check sectors while changing their relative amplitudes. The exact ancilla contraction and its outcome probabilities are derived in Supplementary Note 1.

We condition throughout on the all-plus record, sj=+1s_j = +1 for every measured check. Multiplying the commuting Kraus operators and normalizing gives

∣ψβ⟩=exp⁡(12∑jβjBj)∣+⟩⊗nZβ,|\psi_\beta\rangle= \frac{\exp\left(\frac{1}{2}\sum_j \beta_j B_j\right)|+\rangle^{\otimes n}}{\sqrt{Z_\beta}},
Zβ=⟨+∣⊗nexp⁡(∑jβjBj)∣+⟩⊗n,(2)Z_\beta= \langle+|^{\otimes n}\exp\left(\sum_j \beta_j B_j\right)|+\rangle^{\otimes n}, \tag*{(2)}
p+=Zβ∏j2cosh⁡βj.p_+ = \frac{Z_\beta}{\prod_j 2\cosh\beta_j}.

Here p+p_+ is the probability of obtaining that record, and β\beta in subscripts abbreviates the full strength profile. This is a conditional pure-state preparation. Averaging over, or discarding, the readout instead defines a different quantum channel [10, 17]. We do not assume that a generic outcome record can be converted to this branch at no cost; Supplementary Note 1 gives the general-record state, the postselection probability including redundant checks, and the distinction from outcome averaging.

Choose kk ideal ZZ-logical representatives that are independent modulo the ZZ stabilizers, and set K=2kK = 2^k. They define an encoding Vβ:HL→HQ\mathcal{V}_\beta: \mathcal{H}_L \to\mathcal{H}_Q, where LL is the logical input register and QQ is the nn-qubit physical system,

Vβ∣q⟩L=∣qβ⟩=Zℓ(q)∣ψβ⟩,\mathcal{V}_\beta|q\rangle_L = |q_\beta\rangle= Z^{\ell(q)}|\psi_\beta\rangle,
ℓ(q)=⨁a=1kqaℓa,q∈F2k.(3)\ell(q) = \bigoplus_{a=1}^{k} q_a \ell_a,\qquad q \in\mathbb{F}_2^k. \tag*{(3)}

Here ∣q⟩L|q\rangle_L is an abstract logical basis state and ∣qβ⟩|q_\beta\rangle is its physical codeword. Complementary physical logical XX operators distinguish these codewords, so Vβ†Vβ=IK\mathcal{V}_\beta^\dagger\mathcal{V}_\beta= I_K. Postselection has input-independent success probability, including for reference-entangled inputs (Appendix and Supplementary Note 1). Write Pβ=VβVβ†P_\beta= \mathcal{V}_\beta\mathcal{V}_\beta^\dagger. The register can contain some or all ideal logical qubits; dd denotes the ideal code distance, not an exact distance of the imperfect subspace. In the toric examples, qubits lie on edges of a periodic square or cubic lattice and the measured checks are plaquette boundaries. Here d=Ld = L, the torus side length.

The focus on the BjB_j sector follows from the asymmetry of this preparation. Every AμA_\mu remains an exact stabilizer of the entire encoded subspace; it stabilizes the initial state and commutes with both the filter and the chosen logical ZZ operators. In the toric language, the gauge charges remain absent while plaquette fluxes fluctuate, as in the finite-strength measurement construction of Ref. [10]. More strongly, the filtered encoding retains exact correction of any set of pure ZZ errors whose pairwise differences have weight below the ideal ZZ distance dZd_Z. Supplementary Note 1, “Why the BjB_j sector is the relevant recovery problem,” proves this statement from the Knill–Laflamme condition [36]; it does not require the BjB_j to be sharp. Physical XX errors, by contrast, anticommute with the weakened BjB_j checks and acquire the residual logical XX operators studied below. We therefore analyze the quantum recovery problem for subsequent XX noise. This sector-specific recovery problem concerns arbitrary encoded quantum inputs, including their entanglement with a reference.

The Born weights of Eq. (2) define a classical multispin model for any CSS code in this construction, with the generalized Ising form of Ref. [18]. For a computational-basis configuration s∈F2rs \in\mathbb{F}_2^r, its action and probability measure are

Sβ(s)=−∑jβj(−1)(HZs)j,S_\beta(s) = -\sum_j \beta_j(-1)^{(H_Zs)_j},
πβ(s)=e−Sβ(s)∑s′e−Sβ(s′).(4)\pi_\beta(s) = \frac{e^{-S_\beta(s)}}{\sum_{s'}e^{-S_\beta(s')}}. \tag*{(4)}

Diagonal quantum expectations equal averages in this measure. For toric codes, each check eigenvalue is the plaquette product ∏e∈∂p(−1)se\prod_{e\in\partial p}(-1)^{s_e}, so SβS_\beta is the ferromagnetic Z2\mathbb{Z}_2 Wilson action on the square or cubic lattice. The fixed all-plus branch introduces no measurement-record disorder.

Two representatives ℓ,ℓ′\ell,\ell' of one logical class differ by a check product W=ZcW=Z^c, with c=ℓ⊕ℓ′∈im⁡HZTc=\ell\oplus\ell'\in\operatorname{im}H_Z^T. Their difference on the prepared state satisfies

∥(Zℓ−Zℓ′)∣ψβ⟩∥2=2(1−⟨W⟩β).(5)\left\Vert(Z^\ell-Z^{\ell'})|\psi_\beta\rangle\right\Vert^2=2(1-\langle W\rangle_\beta). \tag*{(5)}

References

  1. [5]Zhao, Y. & Liu, D. E. Vulnerability of fault-tolerant topological quantum error correction to quantum deviations in code space. PAS Nexus 4, pgaf063 (2025). 2301.12859.
  2. [6]Lee, J. Y., Ji, W., Bi, Z. & Fisher, M. P. A. Decoding measurement-prepared quantum phases and transitions: from Ising model to gauge theory, and beyond (2022). ArXiv:2208.11699, 2208.11699.arxiv.org/abs/2208.11699
  3. [7]Calderbank, A. R. & Shor, P. W. Good quantum error-correcting codes exist. Physical Review A 54, 1098–1106 (1996). quant-ph/9512032.pubmed.ncbi.nlm.nih.gov/9913578
  4. [8]Steane, A. M. Multiple particle interference and quantum error correction. Proceedings of the Royal Society of London A 452, 2551–2577 (1996). quant-ph/9601029.
  5. [9]Kitaev, A. Y. Fault-tolerant quantum computation by anyons. Annals of Physics 303, 2–30 (2003). quant-ph/9707021.DOI
  6. [10]Dennis, E., Kitaev, A., Landahl, A. & Preskill, J. Topological quantum memory. Journal of Mathematical Physics 43, 4452–4505 (2002). quant-ph/0110143.DOI
  7. [11]Knill, E. & Laflamme, R. Theory of quantum error-correcting codes. Physical Review A 55, 900–911 (1997). quant-ph/9604034.DOI
  8. [12]Wegner, F. J. Duality in generalized Ising models and phase transitions without local order parameters. Journal of Mathematical Physics 12, 2259–2272 (1971).DOI
  9. [13]Wegner, F. J. Duality in generalized Ising models (2014). 1411.5815.arxiv.org/abs/1411.5815
  10. [14]Kogut, J. B. An introduction to lattice gauge theory and spin systems. Reviews of Modern Physics 51, 659–713 (1979).DOI
  11. [15]Duncan, P. & Schweinhart, B. A sharp deconfinement transition for Potts lattice gauge theory in codimension two. Communications in Mathematical Physics 406, 164 (2025). 2308.07534.DOI
  12. [16]Duncan, P. & Schweinhart, B. Topological phases in the plaquette random-cluster model and Potts lattice gauge theory. Communications in Mathematical Physics 406, 145 (2025). 2207.08339.arxiv.org/abs/2207.08339
  13. [17]Forsström, M. P. & Viklund, F. Free energy and quark potential in Ising lattice gauge theory via cluster expansions. International Mathematics Research Notices 2025, rnaf163 (2025). 2304.08286.DOI
  14. [18]Kotecký, R. & Preiss, D. Cluster expansions for abstract polymer models. Communications in Mathematical Physics 103, 491–498 (1986).DOI
  15. [19]Fortuin, C. M. & Kasteleyn, P. W. On the random-cluster model: I. introduction and relation to other models. Physica 57, 536–564 (1972).
  16. [20]Grimmett, G. R. The Random-Cluster Model, vol. 333 of Grundlehren der mathematischen Wissenschaften (Springer, Berlin, Heidelberg, 2006).
  17. [21]Watrous, J. The Theory of Quantum Information (Cambridge University Press, 2018).DOI
  18. [22]Schumacher, B. & Nielsen, M. A. Quantum data processing and error correction. Physical Review A 54, 2629–2635 (1996). quant-ph/9604022.DOI
  19. [23]Schumacher, B. & Westmoreland, M. D. Approximate quantum error correction. Quantum Information Processing 1, 5–12 (2002). quant-ph/0112106.DOI
  20. [24]Kretschmann, D., Schlingemann, D. & Werner, R. F. The information-disturbance tradeoff and the continuity of Stinespring’s representation. IEEE Transactions on Information Theory 54, 1708–1717 (2008). quant-ph/0605009.DOI
  21. [25]Bény, C. & Oreshkov, O. General conditions for approximate quantum error correction and near-optimal recovery channels. Physical Review Letters 104, 120501 (2010). 0907.5391.pubmed.ncbi.nlm.nih.gov/20366520
  22. [26]Schumacher, B. Sending entanglement through noisy quantum channels. Physical Review A 54, 2614–2628 (1996). quant-ph/9604023.pubmed.ncbi.nlm.nih.gov/9913770
  23. [27]Yi, J., Ye, W., Gottesman, D. & Liu, Z.-W. Complexity and order in approximate quantum error-correcting codes. Nature Physics 20, 1798–1803 (2024). 2310.04710.DOI
  24. [28]Holevo, A. S. Bounds for the quantity of information transmitted by a quantum communication channel. Problems of Information Transmission 9, 177–183 (1973).
  25. [29]Fuchs, C. A. & van de Graaf, J. Cryptographic distinguishability measures for quantum-mechanical states. IEEE Transactions on Information Theory 45, 1216–1227 (1999). quant-ph/9712042.DOI
  26. [30]Uhlmann, A. The “transition probability” in the state space of a *-algebra. Reports on Mathematical Physics 9, 273–279 (1976).DOI
  27. [31]Winter, A. Tight uniform continuity bounds for quantum entropies: Conditional entropy, relative entropy distance and energy constraints. Communications in Mathematical Physics 347, 291–313 (2016). 1507.07775.DOI
  28. [32]Fawzi, O., Grospellier, A. & Leverrier, A. Efficient decoding of random errors for quantum expander codes. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 521–534 (Association for Computing Machinery, 2018). 1711.08351.
  29. [33]Leverrier, A., Tillich, J.-P. & Zémor, G. Quantum expander codes. In 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS), 810–824 (IEEE, 2015). 1504.00822.
  30. [34]Bombín, H. Single-shot fault-tolerant quantum error correction. Physical Review X 5, 031043 (2015). 1404.5504.DOI
  31. [35]Quintavalle, A. O., Vasmer, M., Roffe, J. & Campbell, E. T. Single-shot error correction of three-dimensional homological product codes. PRX Quantum 2, 020340 (2021). 2009.11790.
  32. [36]Hong, Y. Single-shot preparation of hypergraph product codes via dimension jump. Quantum 9, 1879 (2025). 2410.05171.DOI
  33. [37]Hong, Y., Guo, J. & Lucas, A. Quantum memory at nonzero temperature in a thermodynamically trivial system. Nature Communications 16, 316 (2025). 2403.10599.DOI
  34. [38]Yin, C., Nandkishore, R. & Lucas, A. Eigenstate localization in a many-body quantum system. Physical Review Letters 133, 137101 (2024). 2405.12279.DOI
  35. [39]Duminil-Copin, H., Raoufi, A. & Tassion, V. Sharp phase transition for the random-cluster and Potts models via decision trees. Annals of Mathematics 189, 75–99 (2019). 1705.03104.

Paper details

vlnc:W_62s7k7qs
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 5

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents