このページは恐神貴行が個人の見解として、量子計算関係の重要だと思われる論文をリストしたものです。 特に計算量、アルゴリズム関係の論文があげられています。

量子計算関係最重要論文リスト

  1. P. W. Shor, "Algorithms for quantum computation: Discrete logarithms and factoring," FOCS, pp. 124--134 (1994); SIAM Journal on Computing, Vol. 26, No.5, pp. 1484--1509 (1997).
  2. D. Deutsch, "Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer," Proc. R. Soc. Lond. A, Vol. 400, pp. 97--117 (1985).
  3. D. R. Simon, "On the Power of Quantum Computation," FOCS, pp.116--123 (1994); SIAM Journal on Computing, Vol. 26, No.5, pp. 1474--1483 (1997).
  4. E. Bernstein and U. Vazirani, "Quantum complexity theory (preliminary abstract)," STOC, pp. 11-20 (1993); SIAM Journal on Computing, Vol. 26, No.5, pp. 1411--1473 (1997).
  5. L. K. Grover, "A fast quantum mechanical algorithm for database search," STOC, pp. 212--219 (1996).
  6. P. W. Shor, "Fault-tolerant Quantum Computation," FOCS, pp. 56--65 (1996).

重要論文リスト

  1. A. C. Yao, "Quantum Circuit Complexity," FOCS, pp. 352--361 (1993).
  2. L. K. Grover, "A Framework for Fast Quantum Mechanical Algorithms," STOC, pp. 53--62 (1998).
  3. R. Feynman, "Simulating Physics with Computers," International Journal of Theoretical Physics, Vol. 21, No. 6/7, pp. 467--488 (1982).
  4. P. Benioff, "The Computer as a Physical System: A Microscopic Quantum Mechanical Hamiltonian," Journal of Statistical Physics, Vol. 22, No. 5, pp. 563--591 (1980).

その他のアルゴリズムの解析に関する論文

  1. M. Boyer, G. Brassard, P. Hoyer, and A. Tapp, "Tight Bounds on Quantum Searching," 4th Wrokshop on Physics and Computation (1996).
  2. L. K. Grover, "Quantum Search on Structured Problems," QCQC'98, LNCS 1509, pp. 126--139 (1999).
  3. T. Mihara and S. C. Sung, "A Quantum Polynomial Time Algorithm in Worst Case for Simon's Problem (Extended Abstract)," ISSAC, pp. 229--236 (1998).

osogami@jp.ibm.com
Last modified: Tue Jan 4 16:58:30 JST 2000