most citedAn Upper Bound on the Threshold Quantum Decoherence Rate

2 citations · 2 across the 2 of their papers we have counts for

collaborators

2 papers

math.MG2007

Almost Euclidean subspaces of \ell_1^N via expander codes

Venkatesan Guruswami, James R. Lee, Alexander Razborov

We give an explicit (in particular, deterministic polynomial time) construction of subspaces X of R^N of dimension (1-o(1))N such that for every element x in X, |x|_1 and N^{1/2} |…

quant-ph2003★ 2 cited

An Upper Bound on the Threshold Quantum Decoherence Rate

Alexander A. Razborov

Let be the supremum of those for which every poly-size quantum circuit can be simulated by another poly-size quantum circuit with gates of fan-in that tolerates…