REVIEW 2 cited by
Code switching revisited: Low-overhead magic state preparation using color codes
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
abstract
We propose a protocol to prepare a high-fidelity magic state on a two-dimensional (2D) color code using a three-dimensional (3D) color code. Our method modifies the known code switching protocol with (i) a recently discovered transversal gate between the 2D and the 3D code and (ii) a judicious use of flag-based postselection. We numerically demonstrate that these modifications lead to a significant improvement in the fidelity of the magic state. For instance, subjected to a uniform circuit-level noise of $10^{-3}$ (excluding idling noise), our code switching protocol yields a magic state encoded in the distance-$3$ 2D color code with a logical infidelity of $4.6\times 10^{-5}\pm 1.6 \times 10^{-5}$ (quantified by an error-corrected logical state tomography) with an $84\%$ of acceptance rate. Used in conjunction with a postselection approach, extrapolation from a polynomial fit suggests a fidelity improvement to $5.1 \times 10^{-7}$ for the same code. Our protocol is aimed for architectures that allow nonlocal connectivity and should be readily implementable in near-term devices. Finally, we also present a simulation technique akin to an extended stabilizer simulator which effectively incorporates the non-Clifford $T$-gate, that permits to simulate the protocol without resorting to a resource intensive state-vector simulation.
Forward citations
Cited by 2 Pith papers
-
Efficient simulation of logical magic state preparation protocols
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.
-
Synchronization for Fault-Tolerant Quantum Computers
Active and Hybrid synchronization policies cut logical error rates by up to 2.4x and 3.4x compared to passive waiting, by distributing idle time across syndrome generation rounds.
Discussion (0). Continue with ORCID to comment.