Harmonic maps on amenable groups and a diffusive lower bound for random walks

We prove diffusive lower bounds on the rate of escape of the random walk on infinite transitive graphs. Similar estimates hold for finite graphs, up to the relaxation time of the walk. Our approach uses nonconstant equivariant harmonic mappings taking values in a Hilbert space. For the special case of discrete, amenable groups, we present a more explicit proof of the Mok-Korevaar-Schoen theorem on the existence of such harmonic maps by constructing them from the heat flow on a F{\o}lner set.Comment: Published in at http://dx.doi.org/10.1214/12-AOP779 the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org

Trees and Markov convexity

We show that an infinite weighted tree admits a bi-Lipschitz embedding into Hilbert space if and only if it does not contain arbitrarily large complete binary trees with uniformly bounded distortion. We also introduce a new metric invariant called Markov convexity, and show how it can be used to compute the Euclidean distortion of any metric tree up to universal factors

Grothendieck's theorem on non-abelian H^2 and local-global principles

A theorem of Grothendieck asserts that over a perfect field k of cohomological dimension one, all non-abelian H^2-cohomology sets of algebraic groups are trivial. The purpose of this paper is to establish a formally real generalization of this theorem. The generalization -- to the context of perfect fields of virtual cohomological dimension one -- takes the form of a local-global principle for the H^2-sets with respect to the orderings of the field. This principle asserts in particular that an element in H^2 is neutral precisely when it is neutral in the real closure with respect to every ordering in a dense subset of the real spectrum of k. Our techniques provide a new proof of Grothendieck's original theorem. An application to homogeneous spaces over k is also given.Comment: 22 pages, AMS-TeX; accepted for publication by the Journal of the AM

Bounding quantum gate error rate based on reported average fidelity

Remarkable experimental advances in quantum computing are exemplified by recent announcements of impressive average gate fidelities exceeding 99.9% for single-qubit gates and 99% for two-qubit gates. Although these high numbers engender optimism that fault-tolerant quantum computing is within reach, the connection of average gate fidelity with fault-tolerance requirements is not direct. Here we use reported average gate fidelity to determine an upper bound on the quantum-gate error rate, which is the appropriate metric for assessing progress towards fault-tolerant quantum computation, and we demonstrate that this bound is asymptotically tight for general noise. Although this bound is unlikely to be saturated by experimental noise, we demonstrate using explicit examples that the bound indicates a realistic deviation between the true error rate and the reported average fidelity. We introduce the Pauli distance as a measure of this deviation, and we show that knowledge of the Pauli distance enables tighter estimates of the error rate of quantum gates.Comment: New Journal of Physics Fast Track Communication. Gold open access journa