Author:
Krovi Hari,Russell Alexander
Publisher
Springer Science and Business Media LLC
Subject
Mathematical Physics,Statistical and Nonlinear Physics
Reference40 articles.
1. Aaronson, S.: Quantum computing, postselection, and probabilistic polynomial-time. In: Proceedings of the Royal Society A, p. 0412187 (2005)
2. Aharonov, D., Arad, I.: The BQP-hardness of approximating the Jones polynomial. Technical Report quant-ph/0605181v1 , Quant-ph e-print archive (2006). http://arxiv.org/abs/quant-ph/0605181
3. Aharonov, D., Jones, V., Landau, Z.: A polynomial quantum algorithm for approximating the Jones polynomial. In: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, STOC ’06, pp. 427–436, New York, NY, USA (2006). ACM. doi: 10.1145/1132516.1132579
4. Alagic, G., Jordan, S.P., König, R., Reichardt, B.W.: Estimating Turaev–Viro three-manifold invariants is universal for quantum computation. Phys. Rev. A 82, 040302 (2010). doi: 10.1103/PhysRevA.82.040302
5. Alexander J.W.: A lemma on systems of knotted curves. Proc. Natl. Acad. Sci. (USA) 9, 93–95 (1923)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献