[Jump to code hierarchy]

Symplectic cone code[1]

Description

Qubit stabilizer code obtained by attaching a CSS ancilla code to an input stabilizer code represented as a symplectic complex, with the output logical operators determined by an embedded column complex [1]. Gluing maps extend the ancilla \(X\)-type checks onto the input qubits and the input checks onto the ancilla qubits. A defect map then adds \(Z\)-type support on the ancilla’s own qubits to the ancilla \(X\)-type checks so that all extended checks commute. The construction generalizes the mapping cone framework of quantum code embedding from CSS codes to arbitrary stabilizer codes [1].

The generalization extends fault-tolerant logical measurement, geometrically local embedding, and weight reduction to codes and logical operators that admit no CSS structure [1]. Formally, a symplectic cone is a height-two cone whose middle level is the input-code symplectic complex \(D\). Its top and bottom levels are the cochain complex and the chain complex of the ancilla code \(A\), respectively. Its stabilizer map is block lower triangular, with the level maps on the diagonal, the gluing maps below the diagonal, and the defect map in the corner [1; Eq. (10)]. The gluing maps form a chain map compatible with the defect map, and this compatibility is what makes the cone a symplectic complex, i.e., keeps the extended checks commuting [1]. If \(H_1(A)=0\), the logical space \(H_1(C)\) is naturally isomorphic to that of the embedded column complex \(H^0(A)\to H_1(D)\to H_0(A)\) [1; Thm. 2]. This column-complex homology need not equal the logical space of the input code \(D\). The Layer code and weight-reduction applications choose the column complex to preserve the input logical space. For measurement of one logical operator \(\ell^{\star}\), it instead gives \(H_1(C)\cong[\ell^{\star}]^{\perp}/[\ell^{\star}]\), so the deformed code has one fewer logical qubit [1; Thm. 32]. The ancilla is CSS in isolation, but once glued its \(X\)-type checks are generically dressed with \(Z\)-type support by the defect map. The output code is therefore generally non-CSS even when the input code is CSS [1].

Protection

The distance of a symplectic cone code can be lower bounded in terms of the distance of its embedded code via the cleaning lemma of the mapping cone framework [1,2].

Fault Tolerance

A single weight-\(W\) non-CSS logical operator of a QLDPC code can be measured fault-tolerantly using an \(O(W\log W)\)-qubit ancilla [1; Thm. 32]. When the measurement graph has constant expansion, the deformed code retains distance \(\Omega(d)\). A spacetime fault complex establishes a threshold for the procedure. Native parallel measurement of general commuting non-CSS logical operators remains open [1]. The fast-surgery framework [3] extends conditionally to non-CSS logical measurement when a suitable CSS ancilla with meta-syndromes and relative expansion is available [1; Appx. D].

Cousins

  • Mapping cone code— The symplectic cone framework generalizes height-two CSS mapping cones to arbitrary stabilizer codes. The full mapping-cone family also contains cones of other heights, so neither family contains the other [1,2].
  • Qubit QLDPC code— For a QLDPC input and a bounded-degree expanding measurement graph, the symplectic-cone construction remains QLDPC [1]. It measures a single non-CSS logical operator without first converting it to a CSS representative by a local Clifford circuit [1].
  • Kitaev surface code— Measurement of a logical \(Y\) operator of the surface code is an example of non-CSS surgery [1; Fig. 1]. The defect map dresses the attached CSS ancilla such that the deformed code is non-CSS [1; Fig. 1].
  • Distance-balanced code— Symplectic cones extend weight reduction to non-CSS input codes [1; Thm. 53]. For an \(n\)-qubit input of check weight \(w\) and total qubit degree \(q\), the output has block length \(O(w^4q^4)n\). Its maximum stabilizer-generator weight is nine and its total qubit degree is at most eight [1; Thm. 53].

Primary Hierarchy

Parents
A symplectic cone code is a qubit stabilizer code whose symplectic complex has an ancillary cochain level, an input-code level, and an ancillary chain level. Its stabilizer map is lower triangular, and a mixed symplectic form pairs the two ancillary sectors. When \(H_1(A)=0\), the output logical space is naturally isomorphic to the homology of the embedded column complex [1; Thm. 2].
Symplectic cone code
Children
Layer codes are height-2 symplectic cones whose embedded column complex is the input QLDPC code; CSS Layer codes reduce to ordinary mapping cones, while the non-CSS construction uses a defect map to preserve symplectic commutation [1,2].

References

[1]
A. C. Yuan and N. Baspin, “Non-CSS Quantum Code Embedding”, (2026) arXiv:2608.16995
[2]
A. C. Yuan, “Unified framework for quantum code embedding”, Physical Review A 113, (2026) arXiv:2507.05361 DOI
[3]
N. Baspin, L. Berent, and L. Z. Cohen, “Fast surgery for quantum LDPC codes”, (2025) arXiv:2510.04521
Page edit log

Your contribution is welcome!

on github.com (edit & pull request)

— see instructions

Zoo Code ID: symplectic_cone

Cite as:
“Symplectic cone code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/symplectic_cone, arXiv:2606.11484
BibTeX:
@incollection{eczoo_symplectic_cone,
title={Symplectic cone code},
booktitle={The Error Correction Zoo},
year={2026},
editor={Albert, Victor V. and Faist, Philippe},
eprint={2606.11484},
doi={10.48550/arXiv.2606.11484},
url={https://errorcorrectionzoo.org/c/symplectic_cone}
}
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/symplectic_cone

Cite as:

“Symplectic cone code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/symplectic_cone, arXiv:2606.11484

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/quantum/qubits/stabilizer/symplectic_cone.yml.