Fetching the paper…
Reading the bibliography…
We show that a quantum architecture with an error correction procedure limited to geometrically local operations incurs an overhead that grows with the system size, even if arbitrary error-free classical computation is allowed.
A unified geometric approach to graph separators
S. Teng, G. Miller, and S. Vavasis · 1991
Earlier work this paper cites.
Limitations of noisy reversible computation, 1996
D. Aharonov, M. Ben-Or, R. Impagliazzo, and N. Nisan · 1996
Earlier work this paper cites.
Fault-tolerant quantum computation with constant error
Dorit Aharonov and Michael Ben-Or · 1997
Earlier work this paper cites.
Stabilizer Codes and Quantum Error Correction
Daniel Eric Gottesman · 1997
Earlier work this paper cites.
Faster shortest-path algorithms for planar graphs
Monika R Henzinger, Philip Klein, Satish Rao, and Sairam Subramanian · 1997
Earlier work this paper cites.
Quantifying entanglement
V. Vedral, M. B. Plenio, M. A. Rippin, and P. L. Knight · 1997
Earlier work this paper cites.
On quantum fidelities and channel capacities
H. Barnum, E. Knill, and M.A. Nielsen · 2000
Earlier work this paper cites.
Lieb-robinson bounds and the generation of correlations and topological quantum order
S. Bravyi, M. B. Hastings, and F. Verstraete · 2006
Earlier work this paper cites.
An area law for one-dimensional quantum systems
M B Hastings · 2007
Earlier work this paper cites.
A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
Sergey Bravyi and Barbara Terhal · 2009
Earlier work this paper cites.
Tradeoffs for reliable quantum information storage in 2D systems
Sergey Bravyi, David Poulin, and Barbara Terhal · 2010
Earlier work this paper cites.
Tradeoffs for reliable quantum information storage in surface codes and color codes
Nicolas Delfosse · 2013
Cited alongside, same era.
Everything you always wanted to know about LOCC (but were afraid to ask)
Eric Chitambar, Debbie Leung, Laura Mančinska, Maris Ozols, and Andreas Winter · 2014
Cited alongside, same era.
Fault-tolerant quantum computation with constant overhead
Daniel Gottesman · 2014
Cited alongside, same era.
Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength
Jean-Pierre Tillich and Gilles Zémor · 2014
Cited alongside, same era.
Sparse quantum codes from quantum circuits
Dave Bacon, Steven T Flammia, Aram W Harrow, and Jonathan Shi · 2015
Cited alongside, same era.
Quantum conditional mutual information and approximate markov chains
Omar Fawzi and Renato Renner · 2015
Superadditivity of quantum relative entropy for general states
Angela Capel, Angelo Lucia, and David Perez-Garcia · 2018
Later among the works it cites.
Constant overhead quantum fault-tolerance with quantum expander codes
Omar Fawzi, Antoine Grospellier, and Anthony Leverrier · 2018
Later among the works it cites.
The theory of quantum information
John Watrous · 2018
Later among the works it cites.
Quantifying nonlocality: how outperforming local quantum codes is expensive, 2021
Nouédyn Baspin and Anirudh Krishna · 2021
Later among the works it cites.
Bounds on stabilizer measurement circuits and obstructions to local implementations of quantum ldpc codes, 2021
Nicolas Delfosse, Michael E. Beverland, and Maxime A. Tremblay · 2021
Later among the works it cites.
Random quantum circuits transform local noise into global white noise, 2021
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Relative entropy convergence for depolarizing channels
Alexander Müller-Hermes, Daniel Stilck França, and Michael M. Wolf · 2016
Cited alongside, same era.
Tight uniform continuity bounds for quantum entropies: Conditional entropy, relative entropy distance and energy constraints
Andreas Winter · 2016
Cited alongside, same era.
Limits on the storage of quantum information in a volume of space
Steven T Flammia, Jeongwan Haah, Michael J Kastoryano, and Isaac H Kim · 2017
Cited alongside, same era.
Quantum Information Theory
Mark M Wilde · 2017
Cited alongside, same era.
Quantum circuit depth lower bounds for homological codes, 2018
Dorit Aharonov and Yonathan Touati · 2018
Cited alongside, same era.
Alexander M. Dalzell, Nicholas Hunter-Jones, and Fernando G. S. L. Brandão · 2021
Later among the works it cites.
Asymptotically good quantum and locally testable classical ldpc codes, 2021
Pavel Panteleev and Gleb Kalachev · 2021
Later among the works it cites.
Connectivity constrains quantum codes
Nouédyn Baspin and Anirudh Krishna · 2022
Later among the works it cites.
A lower bound on the space overhead of fault-tolerant quantum computation
Omar Fawzi, Alexander Müller-Hermes, and Ala Shayeghi · 2022
Later among the works it cites.
Quantum tanner codes
Anthony Leverrier and Gilles Zémor · 2022
Later among the works it cites.
Multivariate trace estimation in constant quantum depth
Yihui Quek, Mark M Wilde, and Eneet Kaur · 2022
Later among the works it cites.