Fetching the paper…

Reading the bibliography…

2025

Cultivating T states on the surface code with only two-qubit gates

Claes, Jahan

Original
PDF
Post on X

Understand

High-fidelity T magic states are a key requirement for fault-tolerant quantum computing in 2D.

It has generally been assumed that preparing high-fidelity T states requires noisy injection of T states followed by lengthy distillation routines.
This assumption has been recently challenged by the introduction of cultivation, in which careful state injection and postselection alone are used to prepare T states close to the fidelity required for quantum algorithms.
Cultivation was originally proposed for the color code, but can also be done on the $RP^2$ code, a code similar to the surface code.

Cultivating T states on the surface code with only two-qubit gates · Around

Built on

D. Litinski, Magic state distillation: Not as costly as you think, Quantum 3
Original
1905
Earlier work this paper cites.
C. Gidney and M. Ekerå, How to factor 2048 bit rsa integers in 8 hours using 20 million noisy qubits, Quantum 5
Original
1905
Earlier work this paper cites.
D. Gottesman and I. L. Chuang, Quantum teleportation is a universal computational primitive, Nature 402
1999
Earlier work this paper cites.
E. Dennis, Toward fault-tolerant quantum computation without concatenation, Physical Review A 63
2001
Earlier work this paper cites.
S. Bravyi and A. Kitaev, Universal quantum computation with ideal clifford gates and noisy ancillas, Physical Review A 71
2005
Earlier work this paper cites.
H. Bombin and M. A. Martin-Delgado, Topological quantum distillation, Physical Review Letters 97
2006
Earlier work this paper cites.
S. Bravyi and J. Haah, Magic state distillation with low overhead, Physical Review A 86
Original
2012
Earlier work this paper cites.
A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, Surface codes: Towards practical large-scale quantum computation, Physical Review A 86
2012
Earlier work this paper cites.
D. Horsman, A. G. Fowler, S. Devitt, and R. Van Meter, Surface code quantum computing by lattice surgery, New Journal of Physics 14
2012
Earlier work this paper cites.
S. Bravyi and R. König, Classification of topologically protected gates for local stabilizer codes, Physical Review Letters 110
2013
Earlier work this paper cites.
A. G. Fowler, Coping with qubit leakage in topological codes, Physical Review A 88
2013
Earlier work this paper cites.
F. Pastawski and B. Yoshida, Fault-tolerant logical gates in quantum error-correcting codes, Physical Review A 91
2015
Earlier work this paper cites.
Y. Li, A magic state’s fidelity can be superior to the operations that created it, New Journal of Physics 17
Original
2015
Earlier work this paper cites.
A. Kubica and M. E. Beverland, Universal transversal gates with color codes: A simplified approach, Physical Review A 91
2015
Earlier work this paper cites.

Similar

M. Suchara, A. W. Cross, and J. M. Gambetta, Leakage suppression in the toric code, Quantum Info. Comput. 15
2015
Cited alongside, same era.
A. G. Fowler and C. Gidney, Low overhead quantum computation using lattice surgery (2019), arXiv:1808.06709 [quant-ph]
Original
2019
Cited alongside, same era.
C. Chamberland and K. Noh, Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits, npj Quantum Information 6
2020
Cited alongside, same era.
C. Gidney, Stim: A fast stabilizer circuit simulator, Quantum 5
Original
2021
Cited alongside, same era.
O. Higgott, Pymatching: A python package for decoding quantum codes with minimum-weight perfect matching (2021), arXiv:2105.13082 [quant-ph]
Original

Then

Z.-H. Chen, M.-C. Chen, C.-Y. Lu, and J.-W. Pan, Transversal logical clifford gates on rotated surface codes with reconfigurable neutral atom arrays (2024), arXiv:2412.01391 [quant-ph]
Original
2024
Later among the works it cites.
C. Gidney, Answer to ”how to force pymatching into the opposite equivalence class” (2024)
2024
Later among the works it cites.
N. Meister, C. A. Pattison, and J. Preskill, Efficient soft-output decoders for the surface code (2024), arXiv:2405.07433 [quant-ph]
Original
2024
Later among the works it cites.
M. N. H. Chow, V. Buchemmavari, S. Omanakuttan, B. J. Little, S. Pandey, I. H. Deutsch, and Y.-Y. Jau, Circuit-based leakage-to-erasure conversion in a neutral-atom quantum processor, PRX Quantum 5
2024
Later among the works it cites.
Z.-H. Chen, M.-C. Chen, C.-Y. Lu, and J.-W. Pan, Efficient magic state cultivation on ℝ ℙ 2 \mathbb{RP}^{2} (2025), arXiv:2503.18657 [quant-ph]

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…

2021

Cited alongside, same era.

Y. Wu, S. Kolkowitz, S. Puri, and J. D. Thompson, Erasure conversion for fault-tolerant quantum computing in alkaline earth rydberg atom arrays, Nature Communications 13

2022

Cited alongside, same era.

M. McEwen, D. Bacon, and C. Gidney, Relaxing hardware requirements for surface code circuits using time-dynamics, Quantum 7

2023

Cited alongside, same era.

C. Gidney, M. Newman, P. Brooks, and C. Jones, Yoked surface codes (2023), arXiv:2312.04522 [quant-ph]

2023

Cited alongside, same era.

K. Sahay, J. Jin, J. Claes, J. D. Thompson, and S. Puri, High-threshold codes for neutral-atom qubits with biased erasure errors, Physical Review X 13

2023

Cited alongside, same era.

S. Ma, G. Liu, P. Peng, B. Zhang, S. Jandura, J. Claes, A. P. Burgers, G. Pupillo, S. Puri, and J. D. Thompson, High-fidelity gates and mid-circuit erasure conversion in an atomic qubit, Nature 622

2023

Cited alongside, same era.

C. Gidney, N. Shutty, and C. Jones, Magic state cultivation: Growing T states as cheap as CNOT gates (2024), arXiv:2409.17595 [quant-ph]

2024

Cited alongside, same era.

T. Itogawa, Y. Takada, Y. Hirano, and K. Fujii, Even more efficient magic state distillation by zero-level distillation (2024), arXiv:2403.03991 [quant-ph]

2024

Cited alongside, same era.

2025

Closest in time.

Y. Vaknin, S. Jacoby, A. Grimsmo, and A. Retzker, Magic state cultivation on the surface code (2025), arXiv:2502.01743 [quant-ph]

2025

Closest in time.

A. Senoo, A. BaumgÃĪrtner, J. W. Lis, G. M. Vaidya, Z. Zeng, G. Giudici, H. Pichler, and A. M. Kaufman, High-fidelity entanglement and coherent multi-qubit mapping in an atom array, arXiv preprint arXiv:2506.13632 (2025)

2025

Closest in time.

J. Muniz, M. Stone, D. Stack, M. Jaffe, J. Kindem, L. Wadleigh, E. Zalys-Geller, X. Zhang, C.-A. Chen, M. Norcia, et al. , High-fidelity universal gates in the 171 yb ground-state nuclear-spin qubit, PRX Quantum 6

2025

Closest in time.

B. Zhang, G. Liu, G. Bornet, S. P. Horvath, P. Peng, S. Ma, S. Huang, S. Puri, and J. D. Thompson, Leveraging erasure errors in logical qubits with metastable $^{171}$yb atoms (2025), arXiv:2506.13724 [quant-ph]

2025

Closest in time.

S. Jacoby, Y. Vaknin, A. Retzker, and A. L. Grimsmo, Magic state injection with erasure qubits (2025), arXiv:2504.02935 [quant-ph]

2025

Closest in time.

J. Claes, Lower-depth local encoding circuits for the surface code, arXiv preprint arXiv:2509.09779 (2025)

2025

Closest in time.

G. Baranes, M. Cain, J. P. B. Ataides, D. Bluvstein, J. Sinclair, V. Vuletic, H. Zhou, and M. D. Lukin, Leveraging atom loss errors in fault tolerant quantum algorithms (2025), arXiv:2502.20558 [quant-ph]

2025

Closest in time.

K. Sahay, P.-K. Tsai, K. Chang, Q. Su, T. B. Smith, S. Singh, and S. Puri, Fold-transversal surface code cultivation, arXiv preprint arXiv:2509.05212 (2025)

2025

Closest in time.