Celebratio Mathematica — Freedman

Complete Bibliography

Works connected to László Lovász

Filter the Bibliography List

year	title	people

			clear

article M. Bordewich, M. Freedman, L. Lovász, and D. Welsh: “Approximate counting and quantum computation,” Combin. Probab. Comput. 14 : 5–6 (2005), pp. 737–754. MR 2174653 Zbl 1089.68040

Motivated by the result that an ‘approximate’ evaluation of the Jones polynomial of a braid at a 5th root of unity can be used to simulate the quantum part of any algorithm in the quantum complexity class BQP, and results relating BQP to the counting class GapP, we introduce a form of additive approximation which can be used to simulate a function in BQP. We show that all functions in the classes \( \# \)P and GapP have such an approximation scheme under certain natural normalizations. However, we are unable to determine whether the particular functions we are motivated by, such as the above evaluation of the Jones polynomial, can be approximated in this way. We close with some open problems motivated by this work.

D. Welsh	Related
Magnus Bordewich	Related
László Lovász	Related

article M. Freedman, L. Lovász, and A. Schrijver: “Reflection positivity, rank connectivity, and homomorphism of graphs,” J. Amer. Math. Soc. 20 : 1 (2007), pp. 37–51. MR 2257396 Zbl 1107.05089 ArXiv math/0404468

Alexander Schrijver	Related
László Lovász	Related