Show an error-correcting code and certify its distance
qec_codeShow an error-correcting code and certify its distance: its checks (Z-type: they see X errors) and stabilizers (X-type), k counted by rank, a layout to draw it, the decoders it admits, and its distance certificate. In each sector the certificate gives the least weight of a logical found, a witness of that weight, and every lighter support ruled out by an exhaustive search over connected supports (a bivariate-bicycle code's translations checked as symmetries before use), re-checkable node for node. Give certificate to check one: its witnesses and the search run again. Sealed with the service's key. Quote the certificate's distance and its reading; a search stopped by bound settles nothing past it.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| code | Yes | A code by name: surface:D (the rotated surface code, odd D from 3 to 15), toric:L (2 to 12), steane, color:D (the triangular 6.6.6 colour code, odd D from 3 to 15), bb:72, bb:90, bb:108, bb:144 (or gross) or bb:288 (bivariate-bicycle codes); or {"family", "distance" | "size" | "n"}. | |
| bound | No | The heaviest support to search (default the code's nominal distance). | |
| certify | No | Certify the distance (default true). | |
| certificate | No | A certificate (wai.quantum.distance/1) to check against the code. |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||