REVIEW 2 major objections 5 minor 22 references
Symplectic Barnes-Wall GKP Codes: Deterministic $O(N \log^2 N)$ Decoding and Logarithmic Rate Scaling
T0 review · 2 major / 5 minor · reviewed 2026-08-15 · deepseek-v4-flash
Pith's one-line read A recursive symplectic construction turns Barnes-Wall lattices into GKP codes that pack a half-log rate of qubits per mode and decode deterministically in near-linear time.
desk verdict The construction is clever and mostly sound, but the decoder-inheritance proof has a real scaling error that must be fixed before the radius claim is trusted. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing object is the recursive block generator $G_{m+1}$ together with the scaled symplectic rotation $R_m = I + \Omega$, where $\Omega$ is the interleaved symplectic form. The identity $R_m^T R_m = 2I$ makes $R_m/\sqrt{2}$ simultaneously orthogonal and symplectic, which keeps the overlap matrix $G_m^T\Omega G_m$ integral and antisymmetric. The second key mechanism is the coordinate map $\Phi(q_j,p_j)=q_j+ip_j$, which converts real symplectic multiplication by $\Omega$ into complex multiplication by $-i$; under this map $R_m$ becomes the Gaussian scalar $1-i$, so the real recursion becomes the Gaussian-integer Barnes-Wall recursion. The scaled-isoduality of the Barnes-Wall lattice then fixes the dual distance, and a composite decoder built from the primal bounded-distance decoder plus six isometric transformations gives the $O(N\log^2 N)$ decoding guarantee.
What would settle it
For a small level, say $m=3$ or $m=4$, directly compute $G_m$ from the recursion and check whether $G_m^T\Omega G_m$ is integer-valued and antisymmetric, and whether the lattice generated by $G_m$ equals the Gaussian-integer Barnes-Wall lattice up to a unimodular factor; a single counterexample would overturn the distance and decoder claims. Alternatively, enumerate the shortest nonzero vector of the symplectic dual for $N=8$ and verify that its squared norm is exactly $1$ in units of $2\pi$.
Extended reading notes
Core claim
The central claim is that the recursion $G_{m+1} = \begin{pmatrix} G_m & 0 \\ G_m & R_m G_m \end{pmatrix}$ with $R_m = I + \Omega$ generates, for every $m$, a valid GKP stabilizer lattice with symplectic overlap matrix $K_m = G_m^T\Omega G_m$ that is integer-valued and antisymmetric. The same recursion, after a change of coordinates that turns $\Omega$ into multiplication by $-i$, reproduces the Gaussian-integer Barnes-Wall lattice up to a unimodular transformation. As a result, the code encodes $k_m = (m-1)2^{m-2}$ logical qubits into $N = 2^{m-1}$ modes, giving rate $R = \frac{1}{2}\log_2 N$. Using the scaled-isoduality of the Barnes-Wall lattice, the symplectic dual distance evaluates exactly to $\Delta^2 = 1$, and the known $O(N\log^2 N)$ bounded-distance decoder for the primal lattice carries over through a chain of isometries to the symplectic dual. The paper positions this as the first explicit infinite GKP family combining logarithmic rate with a deterministic near-linear-time decoder, at the cost of distance that does not scale with $N$.
Load-bearing premise
The argument that the real recursive generator produces exactly the classical Barnes-Wall lattice depends on the unproved step that the generator commutes with the symplectic form $\Omega$, so that the real recursion can be rewritten as the Gaussian-integer recursion; if that equivalence fails, the distance calculation and the decoder inheritance collapse.
Editorial extensions
If this is right
- For $N\ge 8$ modes, the encoding rate exceeds one logical qubit per physical mode; for instance, the $m=4$ level encodes 12 logical qubits into 8 modes.
- The deterministic decoder succeeds whenever the total displacement error has norm below the constant decoding radius $\rho\sim\Delta/2=1/2$, which for i.i.d. Gaussian noise requires single-mode variance $\sigma^2\lesssim 1/(8N)$.
- The construction abandons geometric locality: a global symplectic scrambling circuit scatters localized burst errors into diffuse syndrome patterns that the global decoder can correct, in contrast to surface-GKP codes where adjacent-mode bursts form fatal logical strings.
- The constant distance $\Delta^2=1$ sits well below the asymptotic Minkowski bound $\Delta^2_{\max}\sim O(\sqrt{N})$ for this rate, making the code an explicit operating point where logarithmic rate is bought with non-scaling protection.
- For small $N$ (up to 64 modes), the code inherits the optimal sphere-packing properties of exceptional Barnes-Wall relatives such as the Gosset and laminated lattices, giving deterministic decoding without the tail risk of random lattice instances.
Reading between the lines
- Beyond the paper: if the symplectic-commutation gap flagged in the supplement is closed, a natural next test is Monte Carlo benchmarking against Gaussian and burst noise; the constant-distance tradeoff suggests concatenation with a classical outer code as the practical route to fault tolerance.
- Beyond the paper: the same recursive pattern might be adapted to other scaled-isodual lattices with fast decoders, potentially yielding GKP families with the same logarithmic rate but a different distance-versus-$N$ curve.
- Beyond the paper: one could numerically test small instances ($m=3,4$) by exact enumeration of the symplectic dual's shortest vector, which would directly verify the $\Delta^2=1$ claim without relying on the unimodular equivalence proof.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. This paper constructs an explicit infinite family of multimode GKP codes from a symplectic realization of the Barnes-Wall lattice. The generator recursion G_{m+1} = [[G_m, 0], [G_m, R_m G_m]] with R_m = I + Omega is claimed to satisfy symplectic integrality (Theorem 1), to encode k_m = (m-1)2^{m-2} logical qubits into N = 2^{m-1} modes, and to have constant squared distance Delta^2 = 1 via an identification with the Gaussian-integer Barnes-Wall lattice (Appendix A). The principal algorithmic claim is an O(N log^2 N) deterministic bounded-distance decoder inherited from the Barnes-Wall decoder (Theorem 4, Appendix B), which yields logarithmic rate at constant BDD radius. The paper also derives a Minkowski-type rate-distance bound and compares the construction with NTRU/M-SIS and surface-GKP codes.
Significance. If the decoder-radius claim is repaired, this is a valuable explicit data point: the code family is concrete, has no fitted parameters, and makes the rate-distance tradeoff transparent. Theorem 1 and the rate calculation in Corollary 1 are sound and easy to verify, and the use of established Barnes-Wall facts is appropriate. The claimed deterministic O(N log^2 N) decoder with a nontrivial radius would be a genuine contribution to multimode GKP decoding, and the comparison with heuristic or shrinking-radius decoders is useful. The main weakness is not the overall strategy but a specific scaling error in the decoder-inheritance proof, plus one omitted commutation argument in the lattice identification.
major comments (2)
- [Supplemental Material, Appendix B, Eqs. (S10)-(S14)] The proof of Theorem 4 contains a norm-scaling error. For a = Phi(Omega^T tau), the step from (S13) to (S14) is min_{x in Lambda_BW} ||a - cQ x|| = c min_{x in Lambda_BW} ||(1/c)Q^dagger a - x||, so the map feeding D_BW scales error vectors by 1/c, not by 1. The assertions immediately after (S14) that (S10)-(S14) are strictly distance-preserving and that D_SBW_perp has the same decoding radius rho as D_BW are therefore false; the inherited radius is c rho. Since c = 2^{-(m-1)/2} < 1 for m > 1, the advertised radius Delta/2 = 1/2 (main text after Eq. (S8)) requires D_BW to have radius 1/(2c) = 2^{(m-3)/2}, which is exactly the packing radius of the primal Barnes-Wall lattice. The manuscript neither states nor proves that the decoder of Ref. [15] achieves this optimal radius. The theorem statement and proof should be corrected, and the required radius of the primal decoder should be made explicit.
- [Supplemental Material, Appendix A, paragraph before Eq. (S3)] The claim that 'the real recursion for G_m translates to a complexified matrix tilde G_m over Z[i]' implicitly assumes that Phi G_m Phi^{-1} is C-linear, which is equivalent to G_m Omega = Omega G_m. This commutation is not proved anywhere, yet the lattice identification in Theorem 3 and the distance computation in Remark 1 rest on it. The commutation is in fact true by induction from Eq. (2) because R_m = I + Omega commutes with Omega and the induction hypothesis gives [G_m, Omega] = 0, but a short proof should be supplied before Theorem 3.
minor comments (5)
- [Main text, after Eq. (2)] The determinant of R_m is stated as 2^{2m-1}; for the 2^m x 2^m matrix R_m = I + Omega, the determinant is 2^{2^{m-1}}. Please correct the exponent or clarify the notation.
- [Corollary 1] The statement D_m = det(G_m) should read D_m = |det(G_m)|, or should note that all determinants in this construction are positive.
- [Appendix B, Eq. (S9)] In the composition defining D_SBW_perp, the matrix Q is the isoduality unitary from Lambda*_BW = cQ Lambda_BW, but this is not restated at Eq. (S9); adding this clarification would help readability.
- [Figure 3(b) and Table I] The vertical axis 'Normalized BDD radius' is not defined; please specify the normalization, for example by Delta/2. Also, Table I lists the actual distance of SBW-GKP as O(1), whereas the text says it is exactly 1; use '1' for precision.
- [References, [15]] Since Theorem 4's corrected statement requires a specific decoding-radius guarantee for the primal Barnes-Wall decoder, the citation to Ref. [15] should explicitly state which radius is available (ideally the full packing radius).
Circularity Check
No significant circularity: the recursive construction is explicit, exact, and supported by external Barnes-Wall lattice facts rather than by self-citation or fitted parameters.
full rationale
The paper's central derivation is self-contained and non-circular. The symplectic integrality proof (Theorem 1) is an explicit induction using exact matrix algebra; no parameter is fitted to the claimed result. The lattice equivalence in Supplemental Appendix A is proven directly by exhibiting a unimodular transformation U_m with exact algebraic identities (1-i) = -i(1+i), not by assuming the conclusion. The constant code distance (S8) follows from the known scaled-isoduality of the Barnes-Wall lattice (Conway–Sloane) combined with the explicitly computed scale factor c; this is an external mathematical fact, not a step that defines the distance into the construction. The decoder inheritance in Appendix B is a reduction of CVP on one lattice to CVP on another via isometries, with the primal decoder taken from external work [15]; even if the radius accounting in Theorem 4 raises a correctness concern about the factor c, that concern is not a circularity because the decoder's existence and properties are not assumed from the paper's own conclusions. There are no load-bearing self-citations, no fitted inputs renamed as predictions, and no uniqueness theorem imported from the authors' prior work to forbid alternatives. The construction is explicit and the claimed properties are derived, so a circularity score of 0 is appropriate.
Assumptions & free parameters
assumptions (4)
- domain assumption The real generator G_m commutes with the symplectic form Omega, so the real recursion (2) maps under Phi to the complex recursion (S3) over Z[i].
- standard math The Barnes-Wall lattice is scaled-isodual with scaling factor c = 2^(-(m-1)/2) and the squared minimum norm of Lambda_BW is 2^(m-1) (Conway and Sloane [21]).
- standard math There exists an O(N log^2 N)-time bounded-distance decoder D_BW for the primal Barnes-Wall lattice with some decoding radius rho (Micciancio-Nicolosi [15]).
- standard math A lattice with M^T Omega M = 2 pi K, K integral and antisymmetric, defines an abelian GKP stabilizer group (Conrad et al. [7]).
Cite this review
Pith. "Pith review of Symplectic Barnes-Wall GKP Codes: Deterministic $O(N \log^2 N)$ Decoding and Logarithmic Rate Scaling." pith.science (2026). https://pith.science/paper/GXBGCOBW
@misc{pith2026260800601,
author = {Pith},
title = {Pith review of: Symplectic Barnes-Wall GKP Codes: Deterministic $O(N \log^2 N)$ Decoding and Logarithmic Rate Scaling},
year = {2026},
howpublished = {\url{https://pith.science/paper/GXBGCOBW}},
note = {Machine review of arXiv:2608.00601}
}
abstract
We construct an explicit symplectic realization of the Barnes-Wall lattice that yields a family of multimode Gottesman-Kitaev-Preskill (GKP) codes with encoding rate $R = \frac{1}{2}\log_2 N$ and a deterministic $O(N\log^2 N)$ bounded-distance decoder. The recursive generator $G_{m+1} = \bigl(\begin{smallmatrix} G_m & 0 \\ G_m & R_m G_m \end{smallmatrix}\bigr)$ with $R_m = I + \Omega$ simultaneously guarantees symplectic integrality for valid quantum stabilizers and preserves the exact Barnes-Wall decoding structure through a chain of isometric isomorphisms. The code distance is constant at $\Delta^2 = 1$ (in units of $2\pi$), representing an explicit distance--rate tradeoff in which logarithmic encoding efficiency is achieved at the cost of non-scaling protection. This construction provides a deterministic, space-efficient paradigm for GKP error correction in platforms supporting non-local modular connectivity.
Figures
Reference graph
Works this paper leans on
-
[15]
D. Micciancio and A. Nicolosi, inProc. ISIT 2008(IEEE, 2008), pp. 2484–2488
work page 2008
-
[1]
Gottesman, A
D. Gottesman, A. Kitaev, and J. Preskill, Phys. Rev. A 64, 012310 (2001)
2001
-
[2]
B. M. Terhal and D. Weigand, Phys. Rev. A93, 012315 (2016)
2016
-
[3]
V. V. Albertet al., Phys. Rev. A101, 032346 (2020)
work page 2020
-
[4]
Campagne-Ibarcqet al., Nature584, 368 (2020)
P. Campagne-Ibarcqet al., Nature584, 368 (2020)
work page 2020
- [5]
-
[6]
J. Bl¨ omer, Y. Xiao, Z. Raissi, and S. Soltan,Symplectic Lattices and GKP Codes – Simple Randomized Construc- tions from Cryptographic Lattices, arXiv:2509.10183v2 [quant-ph] (2026)
-
[7]
Conrad, J
J. Conrad, J. Eisert, and F. Arzani, Quantum6, 648 (2022)
2022
Show all 22 references
-
[8]
Agrell, T
E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, IEEE Trans. Inf. Theory48, 2201 (2002)
2002
-
[9]
Micciancio and S
D. Micciancio and S. Goldwasser,Complexity of Lattice Problems(Kluwer, 2001)
2001
-
[10]
K. Noh, S. M. Girvin, and L. Jiang, Phys. Rev. Lett. 125, 080503 (2020)
2020
-
[11]
Royer, S
B. Royer, S. Singh, and S. M. Girvin, PRX Quantum3, 010335 (2022)
2022
-
[12]
M. Lin, C. Chamberland, and K. Noh, PRX Quantum4, 040334 (2023)
2023
-
[13]
Conrad, A
J. Conrad, A. G. Burchards, and S. T. Flammia, arXiv:2407.03270 [quant-ph] (2024)
2024 arXiv
-
[14]
E. S. Barnes and G. E. Wall, J. Aust. Math. Soc.1, 47 (1959)
1959
-
[16]
Banaszczyk, Math
W. Banaszczyk, Math. Ann.296, 625 (1993)
1993
-
[17]
Harrington and J
J. Harrington and J. Preskill, Phys. Rev. A64, 062301 (2001)
2001
-
[18]
Vuillotet al., Phys
C. Vuillotet al., Phys. Rev. A99, 032344 (2019)
2019
-
[19]
Fukui, A
K. Fukui, A. Tomita, A. Okamoto, and K. Fujii, Phys. Rev. X8, 021054 (2018)
2018
-
[20]
Yamasaki, T
H. Yamasaki, T. Matsuura, and M. Koashi, Phys. Rev. Res.2, 023270 (2020)
2020
-
[21]
J. H. Conway and N. J. A. Sloane,Sphere Packings, Lat- tices and Groups, 3rd ed. (Springer, 1999)
1999
-
[22]
See Supplemental Material below for detailed proofs of the unimodular lattice equivalence (Appendix A) and the exact bounded-distance decoder on the symplectic dual lattice (Appendix B). 1 SUPPLEMENTAL MATERIAL: SYMPLECTIC BARNES-WALL GKP CODES Appendix A: Unimodular Lattice E...
Reviewed August 15, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.