CyberIntel ⬡ News
★ Saved ◆ Cyber Reads
← Back ◌ Quantum Computing May 29, 2026

Carrying out Magic State Cultivation using d=3 color code and d=5 surface code

Quantum Computing SE Archived May 31, 2026 ✓ Full text saved

I am trying to simulate MSC (Magic State Cultivation) using an initial color code with distance 3 and the escape stage being carried out to a distance 5 surface code (why?). In Gidney's original MSC paper: "Magic state cultivation: growing T states as cheap as CNOT gates", there is code for constructing the circuits end-to-end (the full injection, cultivation and escaping to matchable code stages). Yet there is a constraint in there that dsurface >= 2 * dcolor . However, in Google's experimental

Full text archived locally
✦ AI Summary · Claude Sonnet


    Carrying out Magic State Cultivation using d=3 color code and d=5 surface code Ask Question Asked yesterday Modified yesterday Viewed 42 times 0 I am trying to simulate MSC (Magic State Cultivation) using an initial color code with distance 3 and the escape stage being carried out to a distance 5 surface code (why?). In Gidney's original MSC paper: "Magic state cultivation: growing T states as cheap as CNOT gates", there is code for constructing the circuits end-to-end (the full injection, cultivation and escaping to matchable code stages). Yet there is a constraint in there that dsurface >= 2 * dcolor. However, in Google's experimental paper: "Magic state cultivation on a superconducting quantum processor" on MSC they escape to a grafted code where the surface code had d=5. Yet they did not convert into a matchable code as it was "out of scope". My question is: is there a way to construct MSC where you start with dcolor=3 and then escape to dsurface=5 AND convert it into a matchable code? Is there a straightforward way to come up with the circuits that do this? If not, what prevents this? Final matchable code from Gidney's original paper (different shades of gray correspond to X and Z stabilizers): Grafted code in Google's experimental paper from Figure. 4 (colors correspond to color code stabilizers and gray as before): error-correctioncircuit-constructionmagic-states Share Improve this question Follow edited yesterday asked yesterday PrimeSoup 334 4 bronze badges Add a comment 1 Answer Sorted by: Highest score (default) Date modified (newest first) Date created (oldest first) 0 My question is: is there a way to construct MSC where you start with dcolor=3 and then escape to dsurface=5 AND convert it into a matchable code? Yes, see figure 11 of the magic state cultivation paper. All you have to do is drop some of the stabilizers and split some of them into pieces: Is there a straightforward way to come up with the circuits that do this? The straightforward way to do it would be to skip grafting in the first place by making a better color code decoder that supported soft information, and then just grow the color code directly. If not, what prevents this? For scale, most injection papers (experiment and theory) don't include growing the code at all. It's a lot more work to do. For cultivation, the difficulty peaks during the grafted code bit so we wanted to make sure we at least did that. The matcheable code is less scary, so we didn't bother. Just think of it as a token gesture towards the escape stage. By the way, stopping at the high distance matcheable code in the cultivation theory paper was also an effort-vs-benefit compromise. The truly end-to-end test would also consumes the state in order to rotate a logical qubit. Preparation and consumption can have funny ways of interacting where they can't get too close to each other (e.g. figure 14 of https://arxiv.org/pdf/2302.07395 ), so that end-to-end test could in fact reveal things you need to know in order to get the cost and fidelity right. So I wish people would start doing end-to-end rotation sims, and hopefully in the future we can also do end-to-end rotation experiments. Share Improve this answer Follow answered yesterday Craig Gidney 51.7k1 1 gold badge 54 54 silver badges 135 135 bronze badges Ok I see so it wasn't that producing the matchable code was difficult but rather easy enough to ignore. Follow up question: if it is easy to make the matchable code at dsurface=5 why can't you perform this in the code associated with the paper? It prevents this with the dsurface < dcolor * 2 condition and if I try to take it out I get errors with dcolor=3 and dsurface=5 –  PrimeSoup Commented yesterday @PrimeSoup for the theory paper I was focused on large distance escapes so I didn't put effort into making sure the barely-larger cases worked, and asserted those cases away in case they didn't work –  Craig Gidney Commented yesterday Thanks, do you know or have a feel of what would need to be changed? Do you see any reason why the dropped and split stabilizer decompositions of the color code portion would have to be changed? Still a bit confused as to how those decompositions are found, is it trial and error with the stabilizer flows? –  PrimeSoup Commented yesterday @primeSoup one solution is, within the color code area, switch to the instantaneous stabilizer group of a honeycomb code. There's lots of solutions. –  Craig Gidney Commented 21 hours ago Add a comment Your Answer Sign up or log in Sign up using Google Sign up using Email and Password Post as a guest Name Email Required, but never shown Post Your Answer By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy. Start asking to get answers Find the answer to your question by asking. Ask question Explore related questions error-correctioncircuit-constructionmagic-states See similar questions with these tags. The Overflow Blog The find out stage of AI is just supply chain and password... Best of the Heap: First post of the... Featured on Meta Native Ads Coming To Comments Related 1 Is there a proof in the literature of magic state injection for surface codes? 4 Cultivation with higher injection distance 4 Simulating the d=5 𝑑 = 5 colour code magic state cultivation results with | cat n ⟩ | cat 𝑛 ⟩ states stabiliser decomposition 7 Understanding the growth step of the magic state cultivation protocol 1 Why does the distance-15 grafted matchable code in Magic State Cultivation idle like only a distance-11 surface code? 3 Classical feedback during the growth stage in magic state cultivation 2 Motivation for physical magic state distillation using 15 qubit RM code over logical distillation 0 Magic state cultivation: order of logical error and a T state being "too good" Hot Network Questions Cross-compilers targeting the C64 (other than cc65)? Has anyone seen this mirrored entropy functional before? Why, how, and how often to grease a bicycle chain? Hunting a SF collection with two stories: a "trapped in a tiger's mind" story and a "God looks for a replacement" story \wideoverbar is raised oddly high over narrow contents. How can I avoid this behavior? Is "Does the external world exist” a question of fact? Are rules from the 2014 DMG that do not re-appear still legal in D&D 5.5e? How does James 4:3 reconcile with Mt. 5:45? Tips for safely transporting bike(velo) with another bike Automatically shift arrow heads in TikZ for piecewise defined functions or gaps What verb is ἀτύξη at the end of Sappho Edmonds 84? Relativistic Doppler effect do not match How does Danny assume Rusty’s agreement without a verbal reply? Relation between Enthalpy and Heat Has the 1978 Gurari paper on eigenvalue location and perturbation theory been superseded, or is it overlooked? Why does Windows show high Hard Faults/sec when there is still plenty of free RAM available? Is there any gameplay reason to reminisce? Can you defeat the Nether Kraken at the start of the game? What part of speech is 'que' in this sentence? How to convert an animated svg to gif in Ubuntu? Is there a philosophical tradition that treats personal honor as a social duty rather than a private virtue? How can I see the original integration subregions used internally by `NIntegrate`? Why is pulling a heavy object with a rope usually easier than carrying it by hand? When was it established that Mario was a plumber? Question feed By continuing to use this website, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy. By exiting this window, default cookies will be accepted. To reject cookies, select an option from below. Customize settings Cookie consent preference center When you visit any of our websites, it may store or retrieve information on your browser, mostly in the form of cookies. This information might be about you, your preferences, or your device and is mostly used to make the site work as you expect it to. The information does not usually directly identify you, but it can give you a more personalized experience. Because we respect your right to privacy, you can choose not to allow some types of cookies. Click on the different category headings to find out more and manage your preferences. Please note, blocking some types of cookies may impact your experience of the site and the services we are able to offer. Cookie policy Accept all cookies Manage consent preferences Strictly Necessary Cookies Always Active These cookies are necessary for the website to function and cannot be switched off in our systems. They are usually only set in response to actions made by you which amount to a request for services, such as setting your privacy preferences, logging in or filling in forms. You can set your browser to block or alert you about these cookies, but some parts of the site will not then work. These cookies do not store any personally identifiable information. Targeting Cookies Targeting Cookies These cookies are used to make advertising messages more relevant to you and may be set through our site by us or by our advertising partners. They may be used to build a profile of your interests and show you relevant advertising on our site or on other sites. They do not store directly personal information, but are based on uniquely identifying your browser and internet device. Performance Cookies Performance Cookies These cookies allow us to count visits and traffic sources so we can measure and improve the performance of our site. They help us to know which pages are the most and least popular and see how visitors move around the site. All information these cookies collect is aggregated and therefore anonymous. If you do not allow these cookies we will not know when you have visited our site, and will not be able to monitor its performance. Functional Cookies Functional Cookies These cookies enable the website to provide enhanced functionality and personalisation. They may be set by us or by third party providers whose services we have added to our pages. If you do not allow these cookies then some or all of these services may not function properly. Cookie List Clear checkbox label label Apply Cancel Consent Leg.Interest checkbox label label checkbox label label checkbox label label Necessary cookies only Confirm my choices
    💬 Team Notes
    Article Info
    Source
    Quantum Computing SE
    Category
    ◌ Quantum Computing
    Published
    May 29, 2026
    Archived
    May 31, 2026
    Full Text
    ✓ Saved locally
    Open Original ↗