Some Publications by Sergey Bravyi

S. Bravyi and A. Kitaev, Phys. Rev. A 71, 022316 (2005), "Universal Quantum Computation with ideal Clifford gates and noisy" ancillas"}, Proves a lower bound 17\% on the threshold error rate for the asymmetric noise model in which all Clifford group operations are ideal.

S. Bravyi, D. Fattal, D. Gottesman, J. Math. Phys. 47 062106 (2006), "GHZ extraction yield for multipartite stabilizer states" Shows that any three-partite stabilizer state can be mapped by local unitary operations to a collection of GHZ states, Bell pairs, and unentangled qubits.

S. Bravyi, Phys. Rev. A 73, 042313 (2006), "Universal Quantum Computation with the nu=5/2 Fractional Quantum Hall State" It is shown that topological quantum computation with anyons in the Read-Moore Pfaffian state can be made universal using tunneling/interferometric operations if their error rate is below 14%.

S. Bravyi, M. B. Hastings, F. Verstraete, Phys. Rev. Lett. 97, 050401 (2006), "Lieb-Robinson bounds and the generation of correlations and topological quantum order" Proves that the minimal time required to create topologically ordered states via a local unitary dynamics grows linearly with the size of the system.

S. Bravyi, A. J. Bessen, B. M. Terhal, quant-ph/0611021, "Merlin-Arthur Games and Stoquastic Complexity" Provides example of a promise-MA complete problem --- satisfiability of a quantum 6-CNF formula in which clauses are projectors with non-negative matrix elements.