Fetching the paper…
Reading the bibliography…
In recent years, surface codes have become a leading method for quantum error correction in theoretical large scale computational and communications architecture designs.
Paths, trees and flowers
J. Edmonds · 1965
Earlier work this paper cites.
Maximum matching and a polyhedron with 0,1-vertices
J. Edmonds · 1965
Earlier work this paper cites.
Reliable quantum computers
John Preskill · 1998
Earlier work this paper cites.
Why should anyone care about computing with anyons?
Gavin K. Brennen and Jiannis K. Pachos · 1998
Earlier work this paper cites.
An Introduction to Algebraic Topology
Joseph Rotman · 1998
Earlier work this paper cites.
Quantum codes on a lattice with boundary
S. B. Bravyi and A. Y. Kitaev · 2001
Earlier work this paper cites.
Projective plane and planar quantum codes
Michael H. Freedman and David A. Meyer · 2001
Earlier work this paper cites.
Topological quantum memory
Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill · 2002
Earlier work this paper cites.
Algebraic and Geometric Surgery
Andrew Ranicki · 2002
Earlier work this paper cites.
Fault-tolerant quantum computation by anyons
A. Y. Kitaev · 2003
Earlier work this paper cites.
Universal quantum computation with ideal Clifford gates and noisy ancillas
Sergey Bravyi and Alexei Kitaev · 2005
Earlier work this paper cites.
Fault-tolerant quantum computation with high threshold in two dimensions
R. Raussendorf and J. Harrington · 2007
Cited alongside, same era.
Topological fault-tolerance in cluster state quantum computation
R. Raussendorf, J. Harrington, and K. Goyal · 2007
Cited alongside, same era.
Topological computation without braiding
H. Bombin and M.A. Martin-Delgado · 2007
Cited alongside, same era.
High threshold universal quantum computation on the surface code
Austin G. Fowler, Ashley M. Stephens, and Peter Groszkowski · 2009
Cited alongside, same era.
Quantum measurements and gates by code deformation
H. Bombin and M.A. Martin-Delgado · 2009
Cited alongside, same era.
Fault-tolerant architectures for superconducting qubits
David P DiVincenzo · 2009
Cited alongside, same era.
Reconfigurable, site-selective manipulation of atomic quantum systems in two-dimensional arrays of dipole traps
Jens Kruse, Christian Gierl, Malte Schlosser, and Gerhard Birkl · 2010
Later among the works it cites.
Scalable architecture for a room temperature solid-state quantum information processor
Norman Y. Yao, Liang Jiang, Alexey V. Gorshkov, Peter C. Maurer, Geza Giedke, J. Ignacio Cirac, and Mikhail D. Lukin · 2010
Later among the works it cites.
Two-dimensional arrays of RF ion traps with addressable interactions
Muir Kumph, Michael Brownnutt, and Rainer Blatt · 2010
Later among the works it cites.
Fast shuttling of ions in a scalable Penning trap array
D. R. Crick, S. Donnellan, S. Ananthamurthy, R. C. Thompson, and D. M. Segal · 2010
Later among the works it cites.
Topological order with a twist: Ising anyons from an abelian model
H. Bombin · 2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Blossom V: a new implementation of a minimum cost perfect matching algorithm
V. Kolmogorov · 2009
Cited alongside, same era.
Architectural design for a topological cluster state quantum computer
Simon J. Devitt, Austin G. Fowler, Ashley M. Stephens, Andrew D. Greentree, Lloyd C.L. Hollenberg, William J. Munro, and Kae Nemoto · 2009
Cited alongside, same era.
A layered architecture for quantum computing using quantum dots
N. Cody Jones, Rodney Van Meter, Austin G. Fowler, Peter L. McMahon, Jungsang Kim, Thaddeus D. Ladd, and Yoshihisa Yamamoto · 2010
Cited alongside, same era.
Photonic implementation for the topological cluster-state quantum computer
David A. Herrera-Martí, Austin G. Fowler, David Jennings, and Terry Rudolph · 2010
Cited alongside, same era.
Quantum computing with nearest neighbor interactions and error rates over 1%
D. S. Wang, A. G. Fowler, and L. C. L. Hollenberg · 2011
Closest in time.
Towards practical classical processing for the surface code
Austin G. Fowler, Adam C. Whiteside, and Lloyd C. L. Hollenberg · 2011
Closest in time.
Clifford gates by code deformation
H. Bombin · 2011
Closest in time.
Tunable coupling between three qubits as a building block for a superconducting quantum computer
Peter Groszkowski, Austin G. Fowler, Felix Motzoi, and Frank K. Wilhelm · 2011
Closest in time.
Low-overhead surface code logical h
Austin G. Fowler · 2012
Closest in time.