Efficient magic state cultivation with lattice surgery

• URL: http://arxiv.org/abs/2510.24615v1
• Date: Tue, 28 Oct 2025 16:44:34 GMT
• Title: Efficient magic state cultivation with lattice surgery
• Authors: Yutaka Hirano, Riki Toshio, Tomohiro Itogawa, Keisuke Fujii,
• Abstract summary: Magic state distillation plays a crucial role in fault-tolerant quantum computation.<n>Traditional logical-level distillation offers significant overhead reduction by enabling direct implementation with physical gates.<n>Magic state cultivation is a state-of-the-art physical-level distillation protocol that is compatible with the square-grid connectivity.
• Score: 2.6945797019995363
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Magic state distillation plays a crucial role in fault-tolerant quantum computation and represents a major bottleneck. In contrast to traditional logical-level distillation, physical-level distillation offers significant overhead reduction by enabling direct implementation with physical gates. Magic state cultivation is a state-of-the-art physical-level distillation protocol that is compatible with the square-grid connectivity and yields high-fidelity magic states. However, it relies on the complex grafted code, which incurs substantial spacetime overhead and complicates practical implementation. In this work, we propose an efficient cultivation-based protocol compatible with the square-grid connectivity. We reduce the spatial overhead by avoiding the grafted code and further reduce the average spacetime overhead by utilizing code expansion and enabling early rejection. Numerical simulations show that, with a color code distance of 3 and a physical error probability of $10^{-3}$, our protocol achieves a logical error probability for the resulting magic state comparable to that of magic state cultivation ($\approx 3 \times 10^{-6}$), while requiring about half the spacetime overhead. Our work provides an efficient and simple distillation protocol suitable for megaquop use cases and early fault-tolerant devices.

Related papers

• 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)
• Fold-transversal surface code cultivation [0.5488290895559226]
  Magic state cultivation is a protocol to prepare ultra-high fidelity non-Clifford resource states for universal quantum computation.<n>We present a new cultivation scheme in which we measure the fold-transversal Hadamard of unrotated surface code.<n>We find that this approach achieves the lowest known spacetime overhead for magic state cultivation.
  arXiv  Detail & Related papers  (2025-09-05T16:14:46Z)
• Fast correlated decoding of transversal logical algorithms [67.01652927671279]
  Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead.<n>Recent advances have shown that by jointly decoding logical qubits in algorithms composed of logical gates, the number of syndrome extraction rounds can be reduced.<n>Here, we reform the problem of decoding circuits by directly decoding relevant logical operator products as they propagate through the circuit.
  arXiv  Detail & Related papers  (2025-05-19T18:00:00Z)
• Efficient Magic State Cultivation on the Surface Code [0.0]
  We introduce three new cultivation protocols, each yielding a different magic state.<n>We demonstrate that our protocol achieves state-of-the-art infidelities and acceptance rates for magic state generation.<n>In platforms such as cold atoms and trapped ions, where idle error rates are lower than two-qubit gate errors, we demonstrate that cultivation exhibits an even greater advantage.
  arXiv  Detail & Related papers  (2025-02-03T19:00:03Z)
• 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)
• Low-overhead magic state distillation with color codes [1.3980986259786223]
  Fault-tolerant implementation of non-Clifford gates is a major challenge for achieving universal fault-tolerant quantum computing.<n>We propose two distillation schemes based on the 15-to-1 distillation circuit and lattice surgery, differing in their methods for handling faulty rotations.<n>To reach a given target infidelity, our schemes require approximately two orders of magnitude fewer resources than the previous best magic state distillation schemes for color codes.
  arXiv  Detail & Related papers  (2024-09-12T02:20:17Z)
• Constant-Overhead Magic State Distillation [10.97201040724828]
  Magic state distillation is a crucial yet resource-intensive process in fault-tolerant quantum computation. Existing protocols require polylogarithmically growing overheads with some $gamma > 0$. We develop protocols that achieve an $mathcalO(1)$ overhead, meaning the optimal $gamma = 0$.
  arXiv  Detail & Related papers  (2024-08-14T18:31:22Z)
• Efficient Magic State Distillation by Zero-Level Distillation [0.7332146059733189]
  We propose zero-level distillation, which prepares a high-fidelity logical magic state at the physical level.<n>We show that distillation can be made even more efficient than the conventional sophisticated approaches with logical level distillations.<n>We find that the error rate of the logical magic state scales as approximately $100 times p2$ in terms of the physical error rate $p$.
  arXiv  Detail & Related papers  (2024-03-06T19:01:28Z)
• 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)
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes [63.62764375279861]
  We compare two leading FT implementations of the T gate in 2D color codes under circuit noise. We find a circuit noise threshold of 0.07(1)% for the T gate via code switching, almost an order of magnitude below that achievable by state distillation in the same setting.
  arXiv  Detail & Related papers  (2021-01-06T19:00:01Z)
• 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.