Magic state cultivation on a superconducting quantum processor

• URL: http://arxiv.org/abs/2512.13908v1
• Date: Mon, 15 Dec 2025 21:29:40 GMT
• Title: Magic state cultivation on a superconducting quantum processor
• Authors: Emma Rosenfeld, Craig Gidney, Gabrielle Roberts, Alexis Morvan, Nathan Lacroix, Dvir Kafri, Jeffrey Marshall, Ming Li, Volodymyr Sivak, Dmitry Abanin, Amira Abbas, Rajeev Acharya, Laleh Aghababaie Beni, Georg Aigeldinger, Ross Alcaraz, Sayra Alcaraz, Trond I. Andersen, Markus Ansmann, Frank Arute, Kunal Arya, Walt Askew, Nikita Astrakhantsev, Juan Atalaya, Ryan Babbush, Brian Ballard, Joseph C. Bardin, Hector Bates, Andreas Bengtsson, Majid Bigdeli Karimi, Alexander Bilmes, Simon Bilodeau, Felix Borjans, Jenna Bovaird, Dylan Bowers, Leon Brill, Peter Brooks, Michael Broughton, David A. Browne, Brett Buchea, Bob B. Buckley, Tim Burger, Brian Burkett, Nicholas Bushnell, Jamal Busnaina, Anthony Cabrera, Juan Campero, Hung-Shen Chang, Silas Chen, Zijun Chen, Ben Chiaro, Liang-Ying Chih, Agnetta Y. Cleland, Bryan Cochrane, Matt Cockrell, Josh Cogan, Paul Conner, Harold Cook, Rodrigo G. Cortiñas, William Courtney, Alexander L. Crook, Ben Curtin, Martin Damyanov, Sayan Das, Dripto M. Debroy, Sean Demura, Paul Donohoe, Ilya Drozdov, Andrew Dunsworth, Valerie Ehimhen, Alec Eickbusch, Aviv Moshe Elbag, Lior Ella, Mahmoud Elzouka, David Enriquez, Catherine Erickson, Lara Faoro, Vinicius S. Ferreira, Marcos Flores, Leslie Flores Burgos, Sam Fontes, Ebrahim Forati, Jeremiah Ford, Brooks Foxen, Masaya Fukami, Alan Wing Lun Fung, Lenny Fuste, Suhas Ganjam, Gonzalo Garcia, Christopher Garrick, Robert Gasca, Helge Gehring, Robert Geiger, Élie Genois, William Giang, Dar Gilboa, James E. Goeders, Edward C. Gonzales, Raja Gosula, Stijn J. de Graaf, Alejandro Grajales Dau, Dietrich Graumann, Joel Grebel, Alex Greene, Jonathan A. Gross, Jose Guerrero, Loïck Le Guevel, Tan Ha, Steve Habegger, Tanner Hadick, Ali Hadjikhani, Michael C. Hamilton, Monica Hansen, Matthew P. Harrigan, Sean D. Harrington, Jeanne Hartshorn, Stephen Heslin, Paula Heu, Oscar Higgott, Reno Hiltermann, Jeremy Hilton, Hsin-Yuan Huang, Mike Hucka, Christopher Hudspeth, Ashley Huff, William J. Huggins, Lev B. Ioffe, Evan Jeffrey, Shaun Jevons, Zhang Jiang, Xiaoxuan Jin, Chaitali Joshi, Pavol Juhas, Andreas Kabel, Hui Kang, Kiseo Kang, Amir H. Karamlou, Ryan Kaufman, Kostyantyn Kechedzhi, Tanuj Khattar, Mostafa Khezri, Seon Kim, Paul V. Klimov, Can M. Knaut, Bryce Kobrin, Alexander N. Korotkov, Fedor Kostritsa, John Mark Kreikebaum, Ryuho Kudo, Ben Kueffler, Arun Kumar, Vladislav D. Kurilovich, Vitali Kutsko, Tiano Lange-Dei, Brandon W. Langley, Pavel Laptev, Kim-Ming Lau, Emma Leavell, Justin Ledford, Joy Lee, Kenny Lee, Brian J. Lester, Wendy Leung, Lily Li, Wing Yan Li, Alexander T. Lill, William P. Livingston, Matthew T. Lloyd, Aditya Locharla, Laura De Lorenzo, Erik Lucero, Daniel Lundahl, Aaron Lunt, Sid Madhuk, Aniket Maiti, Ashley Maloney, Salvatore Mandrà, Leigh S. Martin, Orion Martin, Eric Mascot, Paul Masih Das, Dmitri Maslov, Melvin Mathews, Cameron Maxfield, Jarrod R. McClean, Matt McEwen, Seneca Meeks, Anthony Megrant, Kevin C. Miao, Zlatko K. Minev, Reza Molavi, Sebastian Molina, Shirin Montazeri, Charles Neill, Michael Newman, Anthony Nguyen, Murray Nguyen, Chia-Hung Ni, Murphy Yuezhen Niu, Nicholas Noll, Logan Oas, William D. Oliver, Raymond Orosco, Kristoffer Ottosson, Alice Pagano, Agustin Di Paolo, Sherman Peek, David Peterson, Alex Pizzuto, Elias Portoles, Rebecca Potter, Orion Pritchard, Michael Qian, Chris Quintana, Ganesh Ramachandran, Arpit Ranadive, Matthew J. Reagor, Rachel Resnick, David M. Rhodes, Daniel Riley, Roberto Rodriguez, Emma Ropes, Lucia B. De Rose, Eliott Rosenberg, Dario Rosenstock, Elizabeth Rossi, Pedram Roushan, David A. Rower, Robert Salazar, Kannan Sankaragomathi, Murat Can Sarihan, Max Schaefer, Sebastian Schroeder, Henry F. Schurkus, Aria Shahingohar, Michael J. Shearn, Aaron Shorter, Noah Shutty, Vladimir Shvarts, Spencer Small, W. Clarke Smith, David A. Sobel, Barrett Spells, Sofia Springer, George Sterling, Jordan Suchard, Aaron Szasz, Alexander Sztein, Madeline Taylor, Jothi Priyanka Thiruraman, Douglas Thor, Dogan Timucin, Eifu Tomita, Alfredo Torres, M. Mert Torunbalci, Hao Tran, Abeer Vaishnav, Justin Vargas, Sergey Vdovichev, Guifre Vidal, Benjamin Villalonga, Catherine Vollgraff Heidweiller, Meghan Voorhees, Steven Waltman, Jonathan Waltz, Shannon X. Wang, Danni Wang, Brayden Ware, James D. Watson, Yonghua Wei, Travis Weidel, Theodore White, Kristi Wong, Bryan W. K. Woo, Christopher J. Wood, Maddy Woodson, Cheng Xing, Z. Jamie Yao, Ping Yeh, Bicheng Ying, Juhwan Yoo, Noureldin Yosri, Elliot Young, Grayson Young, Adam Zalcman, Ran Zhang, Yaxing Zhang, Ningfeng Zhu, Nicholas Zobrist, Zhenjie Zou, Hartmut Neven, Sergio Boixo, Cody Jones, Julian Kelly, Alexandre Bourassa, Kevin J. Satzinger,
• Abstract summary: We present an experimental study of magic state cultivation on a superconducting quantum processor.<n>Cultivation reduces the error by a factor of 40, with a state fidelity of 0.9999(1).
• Score: 108.15404500422814
• License: http://creativecommons.org/licenses/by/4.0/
• 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 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 significant challenges.

Related papers

• Experimental demonstration of non-local magic in a superconducting quantum processor [29.640121847893187]
  We perform the first experimental demonstration of non-local magic in a superconducting Quantum Processing Unit (QPU)<n>We observe excellent agreement between theory and experiment without the need for any free parameter in the noise modeling of our system.<n>The methods and tools developed in this work are conducive to the experimental realization of efficient purity estimation and the decoding of Hawking radiation from a toy-model of a Black Hole.
  arXiv  Detail & Related papers  (2025-11-19T16:08:03Z)
• Reinforcement Learning Control of Quantum Error Correction [108.70420561323692]
  Quantum computer learns to self-improve directly from its errors and never stops computing.<n>This work enables a new paradigm: a quantum computer that learns to self-improve directly from its errors and never stops computing.
  arXiv  Detail & Related papers  (2025-11-11T17:32:25Z)
• Experimental Demonstration of High-Fidelity Logical Magic States from Code Switching [0.0]
  We prepare a logical magic state encoded in an error-correcting code with state-of-the-art logical fidelity.<n>We create two copies of the magic state in the same quantum processor and perform a logical Bell basis measurement for a sample-efficient certification of the encoded magic state.<n>The high-fidelity magic state can be combined with the already-demonstrated fault-tolerant Clifford gates, state preparation, and measurement of the 2D color code.
  arXiv  Detail & Related papers  (2025-06-17T04:08:41Z)
• Unlocking early fault-tolerant quantum computing with mitigated magic dilution [41.95227943686519]
  We introduce mitigated magic dilution (MMD) as an approach to synthesise small-angle rotations.<n>This work paves the way for early fault-tolerant demonstrations on devices supporting millions of quantum operations.
  arXiv  Detail & Related papers  (2025-05-15T17:19:19Z)
• Experimental Demonstration of Logical Magic State Distillation [62.77974948443222]
  We present the experimental realization of magic state distillation with logical qubits on a neutral-atom quantum computer.<n>Our approach makes use of a dynamically reconfigurable architecture to encode and perform quantum operations on many logical qubits in parallel.
  arXiv  Detail & Related papers  (2024-12-19T18:38:46Z)
• High-Fidelity Detection on $^{171} \mathrm{Yb}^+$ Qubit via $^2D_{3/2}$ Shelving [3.914024989674914]
  We propose an efficient approach to enhance the fidelity of detecting trapped ion qubits through $2D_3/2$ state shelving techniques. We experimentally realize a fidelity of 99.88(2)%, while over 99.99% fidelity is predicted by utilizing state-of-the-art hardwares.
  arXiv  Detail & Related papers  (2024-02-29T05:38:35Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Encoding a magic state with beyond break-even fidelity [1.449788466039287]
  We propose and implement a scheme to prepare a magic state on a superconducting qubit array using error correction. We find that our scheme produces better magic states than those we can prepare using the individual qubits of the device. Our prototype will be invaluable in the future as it can reduce the number of physical qubits needed to produce high-fidelity magic states.
  arXiv  Detail & Related papers  (2023-05-23T01:19:53Z)
• Transversal Injection: A method for direct encoding of ancilla states for non-Clifford gates using stabiliser codes [55.90903601048249]
  We introduce a protocol to potentially reduce this overhead for non-Clifford gates. Preliminary results hint at high quality fidelities at larger distances.
  arXiv  Detail & Related papers  (2022-11-18T06:03:10Z)
• Scalable measures of magic resource for quantum computers [0.0]
  We introduce efficient measures of magic resource for pure quantum states with a sampling cost independent of the number of qubits. We show the transition of classically simulable stabilizer states into intractable quantum states on the IonQ quantum computer.
  arXiv  Detail & Related papers  (2022-04-21T12:50:47Z)
• Efficient Experimental Verification of Quantum Gates with Local Operations [0.0]
  We propose a variant of quantum gate verification (QGV) which is robust to practical gate imperfections. We experimentally realize efficient QGV on a two-qubit controlled-not gate and a three-qubit Toffoli gate. Our work promises a solution to the dimensionality curse in verifying large quantum devices in the quantum era.
  arXiv  Detail & Related papers  (2021-07-06T02:56:55Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Building a fault-tolerant quantum computer using concatenated cat codes [44.03171880260564]
  We present a proposed fault-tolerant quantum computer based on cat codes with outer quantum error-correcting codes. We numerically simulate quantum error correction when the outer code is either a repetition code or a thin rectangular surface code. We find that with around 1,000 superconducting circuit components, one could construct a fault-tolerant quantum computer.
  arXiv  Detail & Related papers  (2020-12-07T23:22:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.