| Document Date: 2014-10-27 20:33:15
Open Document File Size: 299,82 KBShare Result on Facebook
Company G. / / / Facility Complexity Zoo / University of California / / IndustryTerm semisimple groups / approximate numerical algorithms / semidirect product / polynomial time algorithms / algebraic / polynomial quantum algorithm / direct product / inner product / universal algorithm / real algebraic / quantum algorithm / inner products / positive definite inner product / polynomial-time quantum decision algorithm / polynomial-time algorithm / finite perfect / semisimple algebraic / numerical algorithms / inductive algorithm / real analytic group law / tractable algorithm / algorithms / finite simple groups / quantum algorithms / / OperatingSystem L3 / / Organization National Park Service / National Science Foundation / University of California / Davis / Greg Kuperberg∗ Department of Mathematics / / Person Leslie Ann Goldberg / Bob / Alice / Dorit Aharonov / Eric Rowell / Greg Kuperberg / Scott Aaronson / / Position author / model for Bob / representative / ACKNOWLEDGMENTS The author / / Product Kauffman / Lie / / ProgrammingLanguage L / FP / / ProvinceOrState California / / Technology RAM / randomized algorithm / quantum algorithm / a+b An algorithm / quantum algorithms / one universal algorithm / polynomial-time quantum decision algorithm / PostBQP algorithm / A0 PP algorithm / polynomial-time algorithm / approximate numerical algorithms / one postselecting algorithm / tractable algorithm / inductive algorithm / polynomial time algorithms / SBQP algorithm / polynomial quantum algorithm / /
SocialTag |
How hard is it to approximate the Jones polynomial? Greg Kuperberg∗ Department of Mathematics, University of California, Davis, CAarXiv:0908.0512v2 [quant-ph] 27 Oct 2014