Published October 20, 2026 | Version v1

Data for "Bounded decoding complexity in transversal circuits with magic-state injection"

  • 1. PlanQC GmbH, Münchener Straße 34, 85748 Garching, Germany

Description

This record contains the code and data supporting the paper “Bounded decoding complexity in transversal circuits with magic-state injection” by Lukas M. Sieberer and Giacomo Giudice, arXiv:2611.05502.

The deposit includes Python implementations for sampling decoding graph sizes in random ciruits and finding reliable measurement products using linear, belief-propagation, and MaxSAT methods. It contains raw simulation datasets, the corresponding processed datasets, the analysis notebook, and four publication figures.

The archived raw data allow the processed results and figures to be reproduced without rerunning the computationally expensive stochastic sampling stage. Instructions, data formats, software requirements, and exact reproduction commands are provided in the included README.

Files

correlated-decoding-zenodo.zip

Files (6.6 GB)

Name Size
md5:9e2c53cf82ddca32f90543601a4562ee
6.6 GB Preview Download

Additional details

Related works

Is supplement to
Preprint: arXiv:2611.05502 (arXiv)

Funding

Bundesministerium für Forschung, Technologie und Raumfahrt
ALMANAQC 13N17236

Dates

Available
2026-11-05