56 citations · 449 across the 44 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
quant-ph2011★ 51 cited
Efficient Decoding of Topological Color Codes
Pradeep Sarvepalli, Robert Raussendorf
Color codes are a class of topological quantum codes with a high error threshold and large set of transversal encoded gates, and are thus suitable for fault tolerant quantum comput…
quant-ph2011★ 3 cited
Quantum Algorithms for One-Dimensional Infrastructures
Pradeep Sarvepalli, Pawel Wocjan
Infrastructures are group-like objects that make their appearance in arithmetic geometry in the study of computational problems related to number fields and function fields over fi…
quant-ph2011
Quantum Codes and Symplectic Matroids
Pradeep Sarvepalli
The correspondence between linear codes and representable matroids is well known. But a similar correspondence between quantum codes and matroids is not known. We show that represe…