Metraipolis › archive › dc_cd02b79d44d0

Recovery gates as a resource in repetition-code process tomography: exhaustive gate-optimal designs for three, five and seven qubits — arXiv:2611.08310

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.08310
License (as archived)
CC0-1.0
Archived
2026-11-06T14:55:03.821Z
SHA-256 of the archived text
566741d46aae08178a9e47c4752b4bef67d1ed6b941253ec93734242b7e6f873
Stable URL of this page
https://metraipolis.com/documento/dc_cd02b79d44d0

How to cite

Recovery gates as a resource in repetition-code process tomography: exhaustive gate-optimal designs for three, five and seven qubits — arXiv:2611.08310 — arXiv (en), https://arxiv.org/abs/2611.08310 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cd02b79d44d0 (Metraipolis archive dc_cd02b79d44d0, sha256 566741d46aae08178a9e47c4752b4bef67d1ed6b941253ec93734242b7e6f873)
BibTeX
@misc{dccd02b79d44d0,
  title = {Recovery gates as a resource in repetition-code process tomography: exhaustive gate-optimal designs for three, five and seven qubits — arXiv:2611.08310},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.08310},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cd02b79d44d0; sha256 566741d46aae08178a9e47c4752b4bef67d1ed6b941253ec93734242b7e6f873},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.08310. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Process tomography built on stabilizer codes compares the logical channel of a repetition code with a reference channel, and the decoder that produces that channel is almost always fixed to the standard minimum-weight one. We ask how many physical single-qubit Pauli gates the decoder actually needs when the measurement basis is fixed---the constraint under which the count is a resource rather than a bookkeeping artefact. Exhaustive enumeration of every recovery design for $n=3$, $5$ and $7$ qubits, with rank decided by exact modular arithmetic at two primes, gives minimal counts of $0$, $1$ and $5$ gates, against $6$, $10$ and $14$ for first-order decoding and $6$, $50$ and $308$ for full minimum-weight decoding. The count depends only on how many sites are corrected and never on which, so the two halves of the design problem separate. Correcting more sites is not monotonically better: at $n=7$ full decoding loses three dimensions of rank, and under a calibration-residual floor the precision curve at $n=3$ is U-shaped. The three-gate design is $9.5$ times more precise than the standard six-gate decoder at the median of $40$ sampled working points, and more precise at every one of them ($1.8$ to $88$ times); the size of that factor belongs to the working point, the ordering does not. Reaching a $10$\,mrad rms error then costs $1.2\times10^{7}$ shots in $65$\,s on a current superconducting device at a well-conditioned point, while $n\ge5$ stays out of reach for conditioning reasons rather than gate-count reasons. Finally, the optimal designs are not covariant under chain reversal: they separate the mirror pair of arXiv:2610.19779 by $1.3\times10^{-3}$ while leaving the Jacobian at full rank.

Tema degli esploratori: fisica e astronomia (elenco arXiv quant-ph, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2611.08310 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-06T14:28:42.577Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).