Magic state cultivation prepares high-fidelity magic states at low expected space-time costs; however, the exact performance of some schemes is unsettled due to the difficulty in simulating non-Clifford circuits. Here, we use matrix-product states (MPS) based methods to compute the exact performance of two types of fold-transversal cultivation schemes: (i) the Sahay et al method based on the regular surface code S gate, and (ii) a method we propose based on a partially fault-tolerant fold-transversal S gate. We show that for the former protocol at $d=5$, the $|T\rangle$ output reaches similar logical error rates to the $|S\rangle$ output, traditionally used as a cheap full Clifford proxy. This contrasts with the $\sim10\times$ discrepancy reported for the $d=5$ colour-code scheme of Gidney et al. We also find that our new $d=5$ scheme has $\sim1.3\times$ lower expected space-time cost while still reaching $10^{-9}$ logical error rate. We show that MPS and Clifford-augmented MPS (CAMPS) perform on par with or even better than the recently introduced near-Clifford simulator Clifft on the hardest $d=5$ regular surface code scheme. Additionally, to speed up simulation, we propose a new pre-screening method based on simple Pauli propagation, lowering by up to three orders of magnitude the required number of exact simulations, and use several simulator-agnostic sampling methods such as subset sampling.
AI Summary
The paper asks how accurately Clifford-only proxies predict magic-state cultivation performance, and whether tensor-network methods can simulate fold-transversal surface-code protocols efficiently. It evaluates the existing regular-surface-code scheme at $d=5$ and introduces variants using a partially fault-tolerant fold-transversal $S$ gate on the rotated surface code.
Under circuit-level depolarising noise, untruncated MPS and Clifford-augmented MPS (CAMPS) simulations are combined with fault-weight subset sampling and early rejection. A new simulator-independent pre-screening method propagates surviving stabilisers through non-Clifford gates to determine 91 of 133 measurements in advance, rejecting up to $99.8\%$ of sampled trajectories without full simulation. For the regular $d=5$ circuit, noiseless peak bond dimensions are 96 for MPS and 5 for CAMPS; CAMPS takes $90.5$ ms per noiseless shot, approximately $13\times$ faster than Clifft on this circuit, though Clifft is substantially faster on the other tested protocols.
At physical error rate $p=10^{-3}$, the regular protocol gives logical error rate $1.3\times10^{-10}$, with $T/S=0.72$ and a reported 95% credible interval $[0.41,1.21]$, unlike the previously reported colour-code discrepancy. The new rotated $d=5$ protocol gives $8.1\times10^{-10}$ at roughly $1.3\times$ lower expected space-time cost.
These logical-error estimates include ideal final syndrome post-selection and exclude escape; end-to-end performance remains uncomputed. “Exact” refers to trajectory simulation up to machine precision, not statistical certainty. Sampling assumes structurally established detection distances, whose overestimation would miss low-weight failures. Larger-distance scaling and non-Pauli-noise performance are not established.
No sign of AI-generated text
Central claim may not hold: The abstract combines cultivation-stage costs with error rates conditioned on an additional ideal final syndrome post-selection, without establishing the corresponding cost and fidelity for physically delivered magic states after escape.
The noise-model appendix reverses the usual placements of measurement and reset errors, leaving unresolved whether this is merely a textual mistake or also affects the simulated circuits.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
Magic state cultivation prepares high-fidelity magic states at low expected space-time costs; however, the exact performance of some schemes is unsettled due to the difficulty in simulating non-Clifford circuits. Here, we use matrix-product states (MPS) based methods to compute the exact performance of two types of fold-transversal cultivation schemes: (i) the Sahay et al method based on the regular surface code S gate, and (ii) a method we propose based on a partially fault-tolerant fold-transversal S gate. We show that for the former protocol at d=5, the ∣T⟩ output reaches similar logical error rates to the ∣S⟩ output, traditionally used as a cheap full Clifford proxy. This contrasts with the ∼10× discrepancy reported for the d=5 colour-code scheme of Gidney et al. We also find that our new d=5 scheme has ∼1.3× lower expected space-time cost while still reaching 10−9 logical error rate. We show that MPS and Clifford-augmented MPS (CAMPS) perform on par with or even better than the recently introduced near-Clifford simulator Clifft on the hardest d=5 regular surface code scheme. Additionally, to speed up simulation, we propose a new pre-screening method based on simple Pauli propagation, lowering by up to three orders of magnitude the required number of exact simulations, and use several simulator-agnostic sampling methods such as subset sampling.
The paper asks how accurately Clifford-only proxies predict magic-state cultivation performance, and whether tensor-network methods can simulate fold-transversal surface-code protocols efficiently. It evaluates the existing regular-surface-code scheme at d=5 and introduces variants using a partially fault-tolerant fold-transversal S gate on the rotated surface code.
Under circuit-level depolarising noise, untruncated MPS and Clifford-augmented MPS (CAMPS) simulations are combined with fault-weight subset sampling and early rejection. A new simulator-independent pre-screening method propagates surviving stabilisers through non-Clifford gates to determine 91 of 133 measurements in advance, rejecting up to 99.8% of sampled trajectories without full simulation. For the regular d=5 circuit, noiseless peak bond dimensions are 96 for MPS and 5 for CAMPS; CAMPS takes 90.5 ms per noiseless shot, approximately 13× faster than Clifft on this circuit, though Clifft is substantially faster on the other tested protocols.
At physical error rate p=10−3, the regular protocol gives logical error rate 1.3×10−10, with T/S=0.72 and a reported 95% credible interval [0.41,1.21], unlike the previously reported colour-code discrepancy. The new rotated d=5 protocol gives 8.1×10−10 at roughly 1.3× lower expected space-time cost.
These logical-error estimates include ideal final syndrome post-selection and exclude escape; end-to-end performance remains uncomputed. “Exact” refers to trajectory simulation up to machine precision, not statistical certainty. Sampling assumes structurally established detection distances, whose overestimation would miss low-weight failures. Larger-distance scaling and non-Pauli-noise performance are not established.
Magic states are a scarce resource for two-dimensional qubit stabilizer codes. Magic state cultivation was recently proposed to reduce the cost of magic state preparation by measuring the transversal Clifford operator of the color code. Cultivation achieves ∼10−9 logical error rates for the d=5 color code, with substantially lower space-time overhead than magic state distillation. However, due to the O(d) depth of the Clifford measurement circuit, magic state cultivation becomes impractical for d>5. Here, we perform logical XS† measurements on the color code by gauging a transversal Clifford gate, resulting in a constant-depth logical measurement circuit. We employ repeated gauging measurements with post-selection rather than performing error correction on the Clifford stabilizer code that emerges during the gauging protocol, thus gaining simplicity at the cost of scalability. Our protocol requires a regular square grid connectivity and yields logical error rates comparable to magic state cultivation. The d=7 version of our protocol gives access to the 10−12 logical error rate regime at 0.05% physical error rate while retaining more than 1% of the shots after the equivalent of the cultivation stage.
Preparation of high-fidelity logical magic states is crucial for fault-tolerant quantum computation. Among previous attempts to reduce the substantial cost of magic state preparation, magic state cultivation (MSC) [Gidney , Magic state cultivation: growing T states as cheap as CNOT gates, arXiv:2409.17595], a recently proposed protocol for logical T state preparation without magic state distillation, achieves state-of-the-art efficiency. Inspired by this work [Gidney , Magic state cultivation: growing T states as cheap as CNOT gates, arXiv:2409.17595], we propose a MSC procedure that can produce logical T states on the rotated surface code at a further reduced cost. To maintain high efficiency throughout our protocol, we design structured codes along with compact circuits bridging between them. More specifically, we construct a code family, the RP code, by putting the rotated surface code on R P 2 (a two-dimensional manifold), as well as two self-dual Calderbank-Shor-Steane codes, named SRP-3 and SRP-5, respectively. In our MSC protocol, we start with a cultivation process, in which a high-fidelity T state is prepared on a small RP code with distance 3 or 5. Then, to preserve the logical T state, we use an efficient and easy-to-decode expansion stage to grow a small RP code to a larger rotated surface code in one syndrome extraction (SE) round. The RP code serves as an efficient transfer station with efficient SE circuits and compact interfaces between the SRP-3 (or SRP-5) code—used in the cultivation process to efficiently verify the correctness of the logical T state—and larger rotated surface codes for preserving the prepared logical T state. Our MSC protocol utilizes nonlocal connectivity, available on both neutral atom array and ion trap platforms. According to our Monte Carlo sampling results, our MSC protocol requires about an order of magnitude smaller space-time volume to reach a target logical error rate of around 10 − 9 compared to the original MSC protocol.
Magic-state preparation is a central component of fault-tolerant quantum computing. Recent theoretical and experimental successes in code-switch-based magic-state preparation have underscored the promise of these methods for quantum error correction. Similarly, magic-state cultivation has likewise been demonstrated in both numerical and experimental settings. However, a thorough comparison between magic-state cultivation and code-switch-based magic-state factories is still missing. In this work, we carry out end-to-end simulations of magic-state preparation using code switching and compare its resource requirements and performance against magic-state cultivation. As part of this analysis, we develop a lattice-surgery protocol for transfer between the doubled color code and the rotated surface code. We extend the complete code-switching protocol to the d=5 doubled color code and perform the corresponding end-to-end simulations. Finally, we propose two fault-tolerant magic-state preparation protocols that combine phase-kickback checks with a transversal non-Clifford gate.
We compute exactly the acceptance and logical error rates for the distance d=3 and d=5 magic state cultivation circuits from Clifft [arXiv:2604.27058] and SOFT [arXiv:2512.23037] using Pauli propagation and binary tensor contraction. Actual T-gates are studied, not the S-gate proxy used for sampling. The calculation includes every fault order at several circuit-level noise strengths (p). We provide a series expansion form to the logical error rates, through order (p/(1−p))10. The analytical results recover the numerical values from Clifft and SOFT at both d=3 and d=5 to within their sampling uncertainty. Then, we show that the d=3 and d=5 circuits actually have fault distances of dfault=2 and dfault=3 respectively, explaining the similar distance degrading effects from the companion code of [Quantum 10, 2134 (2026)].
Magic state cultivation is a promising method for preparing high-fidelity non-Clifford resource states - a central component of fault-tolerant quantum computing - with low spacetime overhead. In benchmarking cultivation, existing resource estimates assume access to noiseless transversal measurement of the output magic state to allow for postselection during the final escape stage of the cultivation process. However, such measurements would destroy the magic state and are therefore unavailable during computation. We develop an open-boundary postselection method, Caliper, that uses only nondestructive mid-circuit syndrome information and substantially outperforms existing methods operating under these constraints. In some regimes, our postselection method uniquely recovers the resource efficiency of prior estimates. However, in other cases, we observe a tradeoff. At spacetime costs reported in previous works, the achievable logical error rates can be orders of magnitude higher, and recovering the reported logical error rate requires substantially larger codes and longer escape stages. Our results highlight how practical considerations involving mid-circuit postselection can impact the design and performance of magic state cultivation protocols.
We introduce STAR-magic mutation, an efficient protocol for implementing logical rotation gates on early fault-tolerant quantum computers. This protocol judiciously combines two of the latest state preparation protocols: transversal multi-rotation protocol and magic state cultivation. It achieves a logical rotation gate with a favorable error scaling of O(θL2(1−Θ(1/d))pph), while requiring only the ancillary space of a single surface code patch. Here, θL is the logical rotation angle, pph is the physical error rate, and d is the code distance. This scaling marks a significant improvement over the previous state-of-the-art, O(θLpph), making our protocol particularly powerful for implementing a sequence of small-angle rotation gates, like Trotter-based circuits. Notably, for θL≲10−5, our protocol achieves a two-order-of-magnitude reduction in both the execution time and the error rate of analog rotation gates compared to the standard T-gate synthesis using cultivated magic states. Building upon this protocol, we also propose a novel quantum computing architecture designed for early fault-tolerant quantum computers, dubbed ``STAR ver.~3". It employs a refined circuit compilation strategy based on Clifford+T+φ gate set, rather than the conventional Clifford+T or Clifford+φ gate sets. We establish a theoretical bound on the feasible circuit size on this architecture and illustrate its capabilities by analyzing the spacetime costs for simulating the dynamics of quantum many-body systems. Specifically, we demonstrate that our architecture can simulate biologically-relevant molecules or lattice models at scales beyond the reach of exact classical simulation, with only a few hundred thousand physical qubits, even assuming a realistic error rate of pph=10−3.