OpenAlex ·

Direct Cultivation of Entangled $|CS\rangle$ Magic States

Gunsik Min and Jun Heo

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2609.09993
Original
Read it at the publisher
Topics
Artificial IntelligenceAtomic PhysicsOptics

Abstract

Magic-state cultivation has largely targeted single-qubit non-Clifford resources. We show that the entangled state $|CS\rangle=CS|++\rangle$ can be cultivated directly rather than synthesized from three $T$-type resources. Two commuting Hermitian Clifford involutions project onto four Pauli-frame branches, so no ideal branch is discarded, while a minimal six-bit $[6,2,4]$ record protects their history. The small-code state cannot itself be certified: late two-fault patterns evade its record, placing the certified boundary after surface-code growth. Under a fixed decoder that sees 136 operational detector bits per patch and withholds 168, exact audits find no accepted closed-boundary logical failure through fault order two, while order-three mechanisms exist. Escaping from the small code directly into a distance-3 patch and growing it to distance 13 in a single round keeps this certificate. Compared with a re-decoded three-$T$ comparator matched to the same binary logical-error target, the direct route uses $2\%$ fewer active locations at $p=5\times10^{-4}$ and $16$--$28\%$ more at $8\times10^{-4}$--$10^{-3}$, without charging the comparator for $T$-state storage. Counted in qubit-ticks under one rule for both routes, it uses $21$--$39\%$ less spacetime. Adding idle-memory noise to both routes under one rule and one optimized schedule raises the direct route's cost more, to $8\%$ and $46\%$ above the comparator at $5\times10^{-4}$ and $10^{-3}$, because that cost is limited by acceptance. The result is architectural: an entangled non-Clifford state can itself be cultivated with a certified output interface.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Artificial Intelligence

Get the few papers worth your time in Artificial Intelligence every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics