Magic state cultivation on a superconducting quantum processor

Fault-tolerant quantum computing requires a universal gate set, but the necessary non-Clifford gates represent a significant resource cost for most quantum error correction architectures. Magic state cultivation offers an efficient alternative to resource-intensive distillation protocols; however, testing the proposal's assumptions represents a challenging departure from quantum memory experiments. We present an experimental study of magic state cultivation on a superconducting quantum processor. We implement cultivation, including code-switching into a surface code, and develop a fault-tolerant measurement protocol to bound the magic state fidelity. Cultivation reduces the error by a factor of 40, with a state fidelity of at least 0.9999(1) (retaining 8% of attempts). Our results experimentally establish magic state cultivation as a viable solution to one of quantum computing's most important challenges.

Authors

Institutions

Publication Details

Journal
Science
Published
2026-10-15
DOI
https://doi.org/10.1126/science.aee7961
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Magic state cultivation on a superconducting quantum processor

Ming Li, Robert Geiger, Rajeev Acharya, Juan Campero et al.
Science
Quantum Computing Algorithms and Architecture
article

Magic state cultivation on a superconducting quantum processor

Ming Li, Robert Geiger, Rajeev Acharya, Juan Campero, Brooks Foxen, Frank Arute, Michael Broughton, Anthony Cabrera, Dar Gilboa, Sean Demura, Ben Curtin, Leslie Flores Burgos, Dmitry A. Abanin, Bob B. Buckley, Jamal Busnaina, E. Gonzales, Lior Ella, James E. Goeders, Simon Bilodeau, Agnetta Y. Cleland, Alec Eickbusch, Paul Conner, L. Brill, Rodrigo G. Cortiñas, Vinicius S. Ferreira, Emma Rosenfeld, Tim Burger, Liang-Ying Chih, Amira Abbas, Marcos Flores-Álamo, Stijn J. de Graaf, Raja Gosula, Andreas Bengtsson, Masaya Fukami, Ilya Drozdov, Nathan Lacroix, B. Chiaro, Nicholas Bushnell, M. Ansmann, Ebrahim Forati, Nikita Astrakhantsev, Ryan Babbush, Jenna Bovaird, Georg Aigeldinger, Felix Borjans, Élie Genois, Dvir Kafri, Alexander L. Crook, Alexander Bilmes, Volodymyr Sivak, Alexis Morvan, Suhas Ganjam, Joseph C. Bardin, Juan Atalaya, Helge Gehring, Gabrielle Roberts, Kunal Arya, Brian Burkett, Hung-Shen Chang, Jeffrey Marshall, Trond I. Andersen, Alejandro Grajales Dau, Robert Gasca, Laleh Aghababaie Beni, Brett Buchea, Aviv Moshe Elbag, Mahmoud Elzouka, Andrew Dunsworth, Sayan Das, Catherine Erickson, J. G. Cogan, Craig Gidney, Lara Faoro, Zijun Chen, Silas Chen, Paul Donohoe, Brian Ballard, David A. Browne, William Courtney, Dripto M. Debroy, Ross Alcaraz, Martin Damyanov, Lenny Fuste, Christopher Garrick, Valerie Ehimhen, Walt Askew, D. Bowers, S. Fontes, W. Giang, J. Ford, A. Wing Lun Fung, G. Garcia, H. Bates, B. Cochrane, M. Bigdeli Karimi, P. Brooks, M. Cockrell, H. Cook, S. Alcaraz, D. Enriquez
article en

Abstract

Fault-tolerant quantum computing requires a universal gate set, but the necessary non-Clifford gates represent a significant resource cost for most quantum error correction architectures. Magic state cultivation offers an efficient alternative to resource-intensive distillation protocols; however, testing the proposal's assumptions represents a challenging departure from quantum memory experiments. We present an experimental study of magic state cultivation on a superconducting quantum processor. We implement cultivation, including code-switching into a surface code, and develop a fault-tolerant measurement protocol to bound the magic state fidelity. Cultivation reduces the error by a factor of 40, with a state fidelity of at least 0.9999(1) (retaining 8% of attempts). Our results experimentally establish magic state cultivation as a viable solution to one of quantum computing's most important challenges.

Science
Ames Research Center (US), Google (United States) (US), University of Connecticut (US), Research Institute for Advanced Computer Science (US), University of Massachusetts Amherst (US)
Openalex Percentile: Top 98%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.