Efficient Magic State Factory Via Transversal Non-Clifford Gate

• URL: http://arxiv.org/abs/2606.16199v1
• Date: Mon, 15 Jun 2026 04:15:03 GMT
• Title: Efficient Magic State Factory Via Transversal Non-Clifford Gate
• Abstract summary: Magic-state preparation is a central component of fault-tolerant quantum computing.<n>We carry out end-to-end simulations of magic-state preparation using code switching.<n>We propose two fault-tolerant magic-state preparation protocols.
• Score: 1.9038688902168008
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Magic-state preparation is a central component of fault-tolerant quantum computing. Recent theoretical and experimental successes in code-switch-based magic-state preparation have underscored the promise of these methods for quantum error correction. Similarly, magic-state cultivation has likewise been demonstrated in both numerical and experimental settings. However, a thorough comparison between magic-state cultivation and code-switch-based magic-state factories is still missing. In this work, we carry out end-to-end simulations of magic-state preparation using code switching and compare its resource requirements and performance against magic-state cultivation. As part of this analysis, we develop a lattice-surgery protocol for transfer between the doubled color code and the rotated surface code. We extend the complete code-switching protocol to the $d=5$ doubled color code and perform the corresponding end-to-end simulations. Finally, we propose two fault-tolerant magic-state preparation protocols that combine phase-kickback checks with a transversal non-Clifford gate.

Related papers

• Surface code logical operations on a superconducting quantum processor [66.1042398805403]
  We experimentally realize key elements of patch-based surface-code logical processing on a 107-qubit superconducting quantum processor.<n>Our results advance superconducting surface-code experiments from protected logical memory to active, patch-based fault-tolerant logical operations.
  arXiv  Detail & Related papers  (2026-07-01T21:07:02Z)
• Magic state distillation with permutation-invariant codes and a two-qubit example [3.437656066916039]
  Magic state distillation protocols aim to create clean copies of magic states from many noisier copies.<n>We present a protocol based on permutation-invariant gnu codes, as small as two qubits.<n>The protocol achieves a 0.5 error threshold and 1/2 distillation rate, surpassing prior schemes for comparable codes.
  arXiv  Detail & Related papers  (2026-03-04T17:27:43Z)
• Efficient simulation of logical magic state preparation protocols [0.0]
  We introduce a method for simulating logical magic state preparation protocols under the standard circuit-level noise model.<n>We provide a proof-of-principle numerical simulation that prepares a magic state using such logical Clifford measurements.
  arXiv  Detail & Related papers  (2025-12-29T19:00:05Z)
• Magic state cultivation on a superconducting quantum processor [108.15404500422814]
  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).
  arXiv  Detail & Related papers  (2025-12-15T21:29:40Z)
• 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)
• Scaling and logic in the color code on a superconducting quantum processor [109.61104855764401]
  We present a demonstration of the color code on a superconducting processor, achieving logical error suppression and performing logical operations.<n>We inject magic states, a key resource for universal computation, achieving fidelities exceeding 99% with post-selection.<n>This work establishes the color code as a compelling research direction to realize fault-tolerant quantum computation on superconducting processors.
  arXiv  Detail & Related papers  (2024-12-18T19:00:05Z)
• 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)
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
  We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
  arXiv  Detail & Related papers  (2021-09-26T07:29:54Z)
• Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits [1.2891210250935146]
  We introduce a new concept which we call redundant ancilla encoding. We show that our scheme can produce magic states using an order of magnitude fewer qubits and space-time overhead.
  arXiv  Detail & Related papers  (2020-03-06T06:24:02Z)

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.