Compact continuous-variable ZX diagrams for GKP and cat codes
Compact continuous-variable ZX diagrams for GKP and cat codes — original question and dated source context.
Problem statement
6.3 Represent GKP Codes Using ZX Diagrams
Alex Townsend-Teague (FU Berlin, DE)
License:
Creative Commons BY 4.0 International license © Alex Townsend-Teague
We completed the representation of the general tiger code X-part projector, which required introducing a multiplier analogue for the Fock basis and developing a scalable notation to package these elements in a compact form. However, the resulting constructions produced diagrams of considerable size and complexity. To mitigate this, we shifted attention to a simpler case – the cat code – and attempted to express its code states and codespace projectors directly as CV ZX-diagrams. Despite these efforts, we were ultimately unable to obtain a satisfactory diagrammatic formulation.
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Progress & source assessment
Historical source dated 2026-05-08. Current resolution status has not been independently reassessed; bounds and claims in the source context refer to that date.
- [1]Quantum Error Correction Meets ZX-Calculus, Dagstuhl Seminar 25382, section 6.3 link
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.
No machine attempts recorded.
Sign in to run an attempt. New accounts start with enough credits for ten.
Discussion
0 notesNotes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.
No notes yet.
Sign in to add a note.