Randomness conductors and constant-degree lossless expanders
M. R. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson · 2002
Cited alongside, same era.
Topological quantum memory
E. Dennis, A. Kitaev, A. Landahl, J. Preskill · 2002
Cited alongside, same era.
Classical and quantum computation, volume 47 of Graduate Studies in Mathematics. AMS, 2002
A. Yu. Kitaev, A. H. Shen, and M. N. Vyalyi · 2002
Cited alongside, same era.
Fault-tolerant quantum computation by anyons
A. Yu. Kitaev · 2003
Cited alongside, same era.
N. Alon, T. Kaufman, M. Krivelevich, S. Litsyn, D. Ron Testing Reed-Muller codes IEEE Transactions on Information Theory (Volume:51 , Issue: 11 ) , Nov. 2005
2005
Cited alongside, same era.
Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories
D. Bacon · 2005
Cited alongside, same era.
Short PCPs with polylog query complexity
E. Ben-Sasson and M. Sudan · 2005
Cited alongside, same era.
Sound PCPs of Proximity, Shorter PCPs, and Applications to Coding
E. Ben-Sasson, O. Goldreich, P. Harsha, M. Sudan, S. P. Vadhan: · 2006
Cited alongside, same era.
The PCP theorem by gap amplification
I. Dinur · 2006
Cited alongside, same era.
Locally testable codes and PCPs of almost-linear length
O. Goldreich, M. Sudan · 2006
Cited alongside, same era.
Computational Complexity: A Modern Approach
S. Arora and B. Barak · 2009
Cited alongside, same era.
A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
S. Bravyi, B. Terhal · 2009
Cited alongside, same era.