6 problems

Let $G$ and $H$ define a finite-support tiger code, and let the code's coherent-state logical constellations be the corresponding finite sets in phase space. Let the Euclidean dist…

Code-distance lower-bound conjecture. The code distance serves as a lower bound on the dephasing suppression, although some codes may exhibit greater suppression. The exact suppres…

Consider logical qudit tiger-code words $|\overline{\mu}\rangle$ and $|\overline{\nu}\rangle$, with dephasing matrix elements between distinct codewords and with the large-$\alpha$…

For qudit tiger codes, let $\mathbf{p}$ be a loss vector and let the codewords be $X$-type codewords. The dephasing matrix elements are the off-diagonal quantities…

Let $alpha^2$ denote the energy density of the code, and let dephasing errors be diagonal operators of the form $hat{\mathbf{a}}^{\dagger \mathbf{p}}hat{\mathbf{a}}^{\mathbf{p}}$.…

Projected coherent states with infinite Fock-state support are considered in the setting of dephasing noise, where coherent-state overlaps are suppressed by the Euclidean distance…