On The Power of Exact Quantum Polynomial Time
暂无分享,去创建一个
[1] Charles H. Bennett,et al. Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..
[2] Peter W. Shor,et al. Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[3] Daniel R. Simon,et al. On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[4] Umesh V. Vazirani,et al. Quantum complexity theory , 1993, STOC.
[5] G. Brassard,et al. Oracle Quantum Computing , 1992, Workshop on Physics and Computation.
[6] D. Deutsch,et al. Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.
[7] Gilles Brassard,et al. The quantum challenge to structural complexity theory , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.
[8] P. Benioff. Quantum mechanical hamiltonian models of turing machines , 1982 .
[9] John T. Gill,et al. Computational complexity of probabilistic Turing machines , 1974, STOC '74.
[10] Charles H. Bennett,et al. Logical reversibility of computation , 1973 .
[11] Gilles Brassard,et al. A Quantum Jump in Computer Science , 1995, Computer Science Today.