Models of quantum computation and quantum programming languages
The goal of the presented paper is to provide an introduction to the basic computational models used in quantum information theory. We review various models of quantum Turing machine, quantum circuits and quantum random access machine (QRAM) along with their classical counterparts. We also provide an introduction to quantum programming languages, which are developed using the QRAM model. We review the syntax of several existing quantum programming languages and discuss their features and limitations.
R.P. Feynman, "Simulating physics with computers", Int. J. Theor. Phys. 21 (6/7), 467-488 (1982).
C.H. Bennett and G. Brassard, "Quantum cryptography: public key distribution and coin tossing", Proc. IEEE Int. Conf. on Computers, Systems, and Signal Processing 1, 175-179 (1984).
A. Ekert, "Quantum cryptography based on Bell's theorem", Phys. Rev. Lett. 67, 661-663 (1991).
A. Einstein, B. Podolsky, and N. Rosen, "Can quantummechanical description of physical reality be considered complete?", Phys. Rev. 47 (10), 777-780 (1935).
J. Bouda, "Encryption of quantum information and quantum cryptographic protocols", Ph.D. Thesis, Faculty of Informatics, Masaryk University, Brno, 2004.
R. Ursin, F. Tiefenbacher, T. Schmitt-Manderbach, H. Weier, T. Scheidl, M. Lindenthal, B. Blauensteiner, T. Jennewein, J. Perdigues, P. Trojek, B. Ömer, M. Fürst, M. Meyenburg, J. Rarity, Z. Sodnik, C. Barbieri, H. Weinfurter, and A. Zeilinger, "Entanglement-based quantum communication over 144 km", Nature Physics 3, 481-486 (2007).
M. Peev, C. Pacher, R. Alléaume, C. Barreiro, J. Bouda, W. Boxleitner, T. Debuisschert, E. Diamanti, M. Dianati, J.F. Dynes, S. Fasel, S. Fossier, M. Fürst, J.D. Gautier, O. Gay, N. Gisin, P. Grangier, A. Happe, Y. Hasani, M. Hentschel, H. Hübel, G. Humer, T. Länger, M. Legré, R. Lieger, J. Lodewyck, T. Lorünser, N. Lütkenhaus, A. Marhold, T. Matyus, O. Maurhart, L. Monat, S. Nauerth, J.B. Page, A. Poppe, E. Querasser, G. Ribordy, S. Robyr, L. Salvail, A.W. Sharpe, A.J. Shields, D. Stucki, M. Suda, C. Tamas, T. Themel, R.T. Thew, Y. Thoma, A. Treiber, P. Trinkler, R. Tualle-Brouri, F. Vannel, N. Walenta, H. Weier, H. Weinfurter, I. Wimberger, Z.L. Yuan, H. Zbinden, and A. Zeilinger, "The SECOQC quantum key distribution network in Vienna", New J. Physics 11 (7), 075001 (2009).
P.W. Shor, "Algorithms for quantum computation: discrete logarithms and factoring", Proc. 35th Annual Symposium on Foundations of Computer Science 1, 124-134 (1994).
P. Shor, "Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computers", SIAM J. Computing 26, 1484-1509 (1997).
L.K. Grover, "Quantum mechanics helps in searching for a needle in a haystack", Phys. Rev. Lett. 79, 325-328 (1997).
J. Eisert, M. Wilkens, and M. Lewenstein, "Quantum games and quantum strategies", Phys. Rev. Lett. 83, 3077-3080 (1999).
D. Meyer, AMS Contemporary Mathematics: Quantum Computation and Quantum Information Science, vol. 305, American Mathematical Society, Rhode Island, 2000.
J. Kempe, "Quantum random walks: an introductory overview", Contemp. Phys. 44 (4), 307-327 (2003).
J. Koŝík, "Two models of quantum random walk", Cent. Eur. J. Phys. 4, 556-573 (2003).
P. W. Shor, "Progress in quantum algorithms", Quantum Information Processing 3, 1-5 (2004).