Pith. sign in

REVIEW 13 cited by

Efficient Magic State Cultivation on mathbb{RP}²

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2503.18657 v1 pith:N3E5AB2E submitted 2025-03-24 quant-ph

Efficient Magic State Cultivation on mathbb{RP}²

classification quant-ph
keywords codestatelogicalmathbbmagicprotocolmathrmrotated
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Preparing high-fidelity logical magic states is crucial for fault-tolerant quantum computation. Among prior attempts to reduce the substantial cost of magic state preparation, magic state cultivation (MSC), a recently proposed protocol for preparing $\mathrm{T}$ states without magic state distillation, achieves state-of-the-art efficiency. Inspired by this work, we propose a new MSC procedure that would produce a logical $\mathrm{T}$ state on a rotated surface code at a further reduced cost. For our MSC protocol, we define a new code family, the $\mathbb {RP}^2$ code, by putting the rotated surface code on $\mathbb{RP}^2$ (a two-dimensional manifold), as well as two self-dual CSS codes named SRP-3 and SRP-5 respectively. Small $\mathbb{RP}^2$ codes are used to hold logical information and checked by syndrome extraction (SE) circuits. We design fast morphing circuits that enable switching between a distance 3 (5) $\mathbb{RP}^2$ code and an SRP-3 (SRP-5) code on which we can efficiently check the correctness of the logical state. To preserve the high accuracy of the cultivated logical $\mathrm{T}$ state, we design an efficient and easy-to-decode expansion stage that grows a small $\mathbb{RP}^2$ code to a large rotated surface code in one round. Our MSC protocol utilizes non-local 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 around $10^{-9}$ compared to the original MSC protocol.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 13 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Asymptotic magic state distillation with almost linear rate

    quant-ph 2026-05 unverdicted novelty 8.0

    A new family of magic state distillation protocols based on logical Clifford error checking achieves near-linear asymptotic rate despite overhead exponent exceeding one, showing the quantities are not tightly coupled ...

  2. In-Situ Simultaneous Magic State Injection on Arbitrary CSS qLDPC Codes

    quant-ph 2026-04 unverdicted novelty 8.0

    A new in-situ scheme prepares logical magic states inside arbitrary CSS qLDPC codes using only syndrome-extraction ancillas, with simulations on the [[144,12,12]] BB code and [[225,9,4]] hypergraph-product code showin...

  3. Cultivating logical catalysts for fault-tolerant dyadic phase rotations

    quant-ph 2026-06 unverdicted novelty 7.0

    A new cultivation protocol prepares reusable logical catalysts as eigenstates of high-period Clifford circuits to implement exact Z^{2^{-b}} phase gates with constant online depth in surface codes.

  4. Efficient Magic State Cultivation for $\sqrt{T}$ Gates

    quant-ph 2026-06 unverdicted novelty 7.0

    Generalizes phase kickback checks for √T magic state cultivation in doubled color code, reports simulation consistency with S state performance, and outlines lattice surgery escape strategy.

  5. Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits

    quant-ph 2026-04 unverdicted novelty 7.0

    Clifft introduces a factored-state simulator that shifts exponential cost to a dynamic active subspace, generalizing Stim's compile-once model to near-Clifford circuits and enabling the first exact end-to-end simulati...

  6. Towards Deploying Optimistic Quantum Fourier Transforms: An Architecture-Algorithm Co-Design Study

    quant-ph 2026-05 unverdicted novelty 6.0

    A hot-zone architecture for OQFT on reconfigurable neutral-atom hardware yields tunable latency via 2-4 zones, converging to roughly 500 extra logical ancillae and 128-qubit peak parallelism for half-time performance ...

  7. Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits

    quant-ph 2026-04 unverdicted novelty 6.0

    Clifft achieves fast exact simulation of near-Clifford quantum circuits via dynamic active subspaces, delivering orders-of-magnitude speedups and the first full end-to-end simulations of magic state cultivation over h...

  8. Constant depth magic state cultivation with Clifford measurements by gauging

    quant-ph 2026-03 unverdicted novelty 6.0

    Gauging enables constant-depth logical XS dagger measurements for color-code magic state cultivation, achieving 10^{-12} logical error rates at 0.05% physical error for distance-7 codes while retaining over 1% of shot...

  9. Efficient simulation of logical magic state preparation protocols

    quant-ph 2025-12 conditional novelty 6.0

    A classical simulation method that propagates circuit-level Pauli noise to a Clifford error makes logical magic-state preparation protocols simulable in time polynomial in qubits and the target state's stabilizer rank.

  10. Entanglement boosting: Low-volume logical Bell pair preparation for distributed fault-tolerant quantum computation

    quant-ph 2025-11 unverdicted novelty 6.0

    Entanglement boosting protocol prepares logical Bell pairs in rotated surface codes with orders-of-magnitude lower link-limited volume, reaching 10^{-10} logical error from 86 physical pairs at 1% error using soft dec...

  11. Transversal architecture for megaquop-scale quantum simulation with neutral atoms

    quant-ph 2025-09 conditional novelty 6.0

    A neutral-atom co-designed 'transversal STAR' architecture could reach megaquop-scale Hamiltonian simulation with about 10,000 physical qubits at 1e-3 error rates, corresponding to over 1e6 to 1e7 T gates.

  12. Hardware-Tailored Resource Estimation for Magic-State Distillation on Silicon Spin Qubits

    quant-ph 2026-05 unverdicted novelty 5.0

    Resource estimation for magic-state distillation on silicon spin qubits finds 42% overhead reduction via optimized pulses and ~3x physical footprint reduction with biased codes versus surface code.

  13. Simulating magic state cultivation with few Clifford terms

    quant-ph 2025-09 conditional novelty 5.0

    A d=5 magic state cultivation circuit with 53 non-Clifford gates can be represented, with 0.1% edge noise, as about 8 Clifford diagrams on average instead of 6,377,292.