Fetching the paper…
Reading the bibliography…
Lattice surgery protocols allow for the efficient implementation of universal gate sets with two-dimensional topological codes where qubits are constrained to interact with one another locally.
J. Edmonds, Paths, trees, and flowers, Canadian Journal of mathematics 17
1965
Earlier work this paper cites.
P. W. Shor, Fault-tolerant quantum computation, in Proceedings of the 37th Annual Symposium on Foundations of Computer Science (IEEE, 1996) pp. 56–65
1996
Earlier work this paper cites.
J. Preskill, Reliable quantum computers, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 454
1998
Earlier work this paper cites.
D. Gottesman and I. L. Chuang, Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations, Nature 402
1999
Earlier work this paper cites.
X. Zhou, D. W. Leung, and I. L. Chuang, Methodology for quantum logic gate construction, Phys. Rev. A 62
2000
Earlier work this paper cites.
A. Y. Kitaev, Fault-tolerant quantum computation by anyons, Annals of Physics 303
2003
Earlier work this paper cites.
S. Bravyi and A. Kitaev, Universal quantum computation with ideal clifford gates and noisy ancillas, Phys. Rev. A 71
2005
Earlier work this paper cites.
H. Bombin and M. A. Martin-Delgado, Topological quantum distillation, Phys. Rev. Lett. 97
2006
Earlier work this paper cites.
R. Raussendorf, J. Harrington, and K. Goyal, Topological fault-tolerance in cluster state quantum computation, New Journal of Physics 9
2007
Earlier work this paper cites.
R. Raussendorf and J. Harrington, Fault-tolerant quantum computation with high threshold in two dimensions, Phys. Rev. Lett. 98
2007
Earlier work this paper cites.
A. G. Fowler, A. M. Stephens, and P. Groszkowski, High-threshold universal quantum computation on the surface code, Phys. Rev. A 80
2009
Earlier work this paper cites.
H. Bombin, Topological order with a twist: Ising anyons from an abelian model, Phys. Rev. Lett. 105
2010
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, Phys. Rev. A 86
2012
Earlier work this paper cites.
C. Horsman, A. G. Fowler, S. Devitt, and R. Van Meter, Surface code quantum computing by lattice surgery, New J. Phys. 14
2012
Earlier work this paper cites.
S. Bravyi and J. Haah, Magic-state distillation with low overhead, Phys. Rev. A 86
2012
Earlier work this paper cites.
2012
Earlier work this paper cites.
A. G. Fowler, Time-optimal quantum computation, arXiv preprint arXiv:1509.03239 (2012)
2012
Earlier work this paper cites.
A. M. Meier, B. Eastin, and E. Knill, Magic-state distillation with the four-qubit code, Quant. Inf. and Comp. 13
2013
Earlier work this paper cites.
B. Eastin, Distilling one-qubit magic states into toffoli states, Phys. Rev. A 87
2013
Earlier work this paper cites.
T. Jochym-O’Connor and R. Laflamme, Using concatenated quantum codes for universal fault-tolerant quantum gates, Phys. Rev. Lett. 112
2014
Earlier work this paper cites.
Y. Tomita and K. M. Svore, Low-distance surface codes under realistic quantum noise, Phys. Rev. A 90
2014
Earlier work this paper cites.
B. M. Terhal, Quantum error correction for quantum memories, Rev. Mod. Phys. 87
2015
Earlier work this paper cites.
H. Bombín, Dimensional jump in quantum error correction, New Journal of Physics 18
2016
Cited alongside, same era.
T. J. Yoder, R. Takagi, and I. L. Chuang, Universal fault-tolerant gates on concatenated stabilizer codes, Phys. Rev. X 6
2016
Cited alongside, same era.
C. Chamberland, T. Jochym-O’Connor, and R. Laflamme, Thresholds for universal concatenated quantum codes, Phys. Rev. Lett. 117
2016
Cited alongside, same era.
S. Bravyi, G. Smith, and J. A. Smolin, Trading classical and quantum computational resources, Phys. Rev. X 6
2016
Cited alongside, same era.
E. T. Campbell, B. M. Terhal, and C. Vuillot, Roads towards fault-tolerant universal quantum computation, Nature 549
2017
Cited alongside, same era.
Y. Shi, C. Chamberland, and A. Cross, New J. Phys. 21
2019
Later among the works it cites.
E. T. Campbell, A theory of single-shot error correction for adversarial noise, Quantum Science and Technology 4
2019
Later among the works it cites.
D. K. Tuckett, A. S. Darmawan, C. T. Chubb, S. Bravyi, S. D. Bartlett, and S. T. Flammia, Tailoring surface codes for highly biased noise, Phys. Rev. X 9
2019
Later among the works it cites.
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
Later among the works it cites.
I. D. Kivlichan, C. Gidney, D. W. Berry, N. Wiebe, J. McClean, W. Sun, Z. Jiang, N. Rubin, A. Fowler, A. Aspuru-Guzik, H. Neven, and R. Babbush, Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization, Quantum 4
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
B. J. Brown, K. Laubscher, M. S. Kesselring, and J. R. Wootton, Poking holes and cutting corners to achieve clifford gates with the surface code, Phys. Rev. X 7
2017
Cited alongside, same era.
C. Chamberland, T. Jochym-O’Connor, and R. Laflamme, Overhead analysis of universal concatenated quantum codes, Phys. Rev. A 95
2017
Cited alongside, same era.
J. O’Gorman and E. T. Campbell, Quantum computation with realistic magic-state factories, Phys. Rev. A 95
2017
Cited alongside, same era.
T. J. Yoder and I. H. Kim, The surface code with a twist, Quantum 1
2017
Cited alongside, same era.
N. P. Breuckmann, C. Vuillot, E. Campbell, A. Krishna, and B. M. Terhal, Hyperbolic and semi-hyperbolic surface codes for quantum storage, Quantum Science and Technology 2
2017
Cited alongside, same era.
2018
Cited alongside, same era.
D. Litinski and F. v. Oppen, Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes, Quantum 2
2018
Cited alongside, same era.
2020
Later among the works it cites.
T. Tansuwannont, C. Chamberland, and D. Leung, Flag fault-tolerant error correction, measurement, and quantum computation for cyclic calderbank-shor-steane codes, Phys. Rev. A 101
2020
Later among the works it cites.
R. Chao and B. W. Reichardt, Flag fault-tolerant error correction for any stabilizer code, PRX Quantum 1
2020
Later among the works it cites.
B. W. Reichardt, Quantum Sci. Technol. 6
2020
Later among the works it cites.
S. Puri, L. St-Jean, J. A. Gross, A. Grimm, N. E. Frattini, P. S. Iyer, A. Krishna, S. Touzard, L. Jiang, A. Blais, et al. , Bias-preserving gates with stabilized cat qubits, Science advances 6
2020
Later among the works it cites.
D. K. Tuckett, S. D. Bartlett, S. T. Flammia, and B. J. Brown, Fault-tolerant thresholds for the surface code in excess of 5 % 5\% under biased noise, Phys. Rev. Lett. 124
2020
Later among the works it cites.
A. Ashikhmin, C.-Y. Lai, and T. A. Brun, Quantum data-syndrome codes, IEEE Journal on Selected Areas in Communications 38
2020
Later among the works it cites.
E. T. Campbell, Early fault-tolerant simulations of the Hubbard model, arXiv , 2012.09238 (2020)
2020
Later among the works it cites.
M. E. Beverland, A. Kubica, and K. M. Svore, Cost of universality: A comparative study of the overhead of state distillation and code switching with color codes, PRX Quantum 2
2021
Closest in time.
J. Lee, D. W. Berry, C. Gidney, W. J. Huggins, J. R. McClean, N. Wiebe, and R. Babbush, Even more efficient quantum computations of chemistry through tensor hypercontraction, PRX Quantum 2
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
A. O. Quintavalle, M. Vasmer, J. Roffe, and E. T. Campbell, Single-shot error correction of three-dimensional homological product codes, PRX Quantum 2
2021
Closest in time.
J. P. Bonilla Ataides, D. K. Tuckett, S. D. Bartlett, S. T. Flammia, and B. J. Brown, The XZZX surface code, Nature Communications 12
2021
Closest in time.
2021
Closest in time.
O. Higgott and N. P. Breuckmann, Subsystem codes with high thresholds by gauge fixing and reduced qubit overhead, Phys. Rev. X 11
2021
Closest in time.
R. Chao and B. W. Reichardt, ault-tolerant quantum computation with few qubits, npj Quantum Information 4
2056
Closest in time.