Pith. sign in

REVIEW 4 cited by

Efficient Magic State Cultivation on $\mathbb{RP}^2$

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

classification quant-ph
keywords codestatelogicalmathbbmagicprotocolmathrmrotated
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Quantum Codes with Arbitrary Z-Rotation logical Gates and Applications to Fault-Tolerant Code Switching

    quant-ph 2026-08 conditional novelty 6.0 of 10

    A systematic family of quantum codes realizes arbitrary fine Z-rotation gates transversally, generalizes code switching to rotated-surface-code geometries, and is piloted in a 45-qubit simulation of a Clifford proxy f...

  2. Efficient simulation of logical magic state preparation protocols

    quant-ph 2025-12 conditional novelty 6.0 of 10

    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.

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

    quant-ph 2025-09 conditional novelty 6.0 of 10

    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.

  4. Simulating magic state cultivation with few Clifford terms

    quant-ph 2025-09 conditional novelty 5.0 of 10

    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.

Pith tools