Quantum computation, quantum theory and AI

Artificial Intelligence

Volumn 174, Issue 2, 2010, Pages 162-176

  Ying, Mingsheng ^a,b  

^a UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

^b TSINGHUA NATIONAL LABORATORY FOR INFORMATION SCIENCE AND TECHNOLOGY   (China)

Author keywords

Bayesian network; Communication; Discrimination and recognition; Learning; Quantum computation; Quantum theory; Search; Semantic analysis

Indexed keywords

DISCRIMINATION AND RECOGNITION; QUANTUM ALGORITHMS; QUANTUM COMPUTATION; SEARCH SEMANTICS;

BAYESIAN NETWORKS; COMPUTATIONAL LINGUISTICS; DISTRIBUTED PARAMETER NETWORKS; INFERENCE ENGINES; INTELLIGENT NETWORKS; QUANTUM COMPUTERS; SEMANTICS;

QUANTUM THEORY;

EID: 73949137194     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2009.11.009     Document Type: Review

References (113)

1. S. Abramsky, High-level methods for quantum computation and information, in: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, pp. 410-414
2. S. Abramsky, B. Coecke, A categorical semantics of quantum protocols, in: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, pp. 415-425
3. Abramsky S., and Duncan R. A categorical quantum logic. Mathematical Structures in Computer Science 16 (2006) 469-489
4. Acín A. Statistical distinguishability between unitary operations. Physical Review Letters 87 (2001) art. no. 177901
5. Aerts D., and Czachor M. Quantum aspects of semantic analysis and symbolic artificial intelligence. Journal of Physics A: Mathematical and General 37 (2004) L123-L132
6. Aïmeur E., Brassard G., and Gambs S. Machine learning in a quantum world. In: Lamontagne L., and Marchand M. (Eds). Proceedings of Canadian AI 2006. LNAI vol. 4013 (2006), Springer 431-442
7. T. Altenkirch, J. Grattage, A functional quantum programming language, in: Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (LICS), 2005, pp. 249-258
8. Andresen S.L. John McCarthy: Father of AI. IEEE Intelligent Systems (September/October 2002) 84-85
9. Baltag A., and Smets S. LQP: The dynamic logic of quantum information. Mathematical Structures in Computer Science 16 (2006) 491-525
10. Barenco A., Bennet C., Cleve R., DiVincenzo D.P., Margolus N., Shor P., Sleator T., Smolin J.A., and Weinfurter H. Elementary gates for quantum computation. Physical Review A 52 (1995) 3457-3467
11. Benioff P.A. The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines. Journal of Statistical Physics 22 (1980) 563-591
12. Benjamin S.C., and Hayden P.M. Multiplayer quantum games. Physical Review A 64 (2001) art. no. 030301
13. Bennet C.H. Logical reversibility of computation. IBM Journal of Research and Development 17 (1973) 525-532
14. Bernstein E., and Vazirani U. Quantum complexity theory. SIAM Journal on Computing 26 (1997) 1411-1473
15. Bertoni A., Mereghetti C., and Palano B. Quantum computing: 1-way quantum automata. In: Esik Z., and Fulop Z. (Eds). Proceedings of 7th International Conference on Developments in Language Theory. LNCS vol. 2710 (2003), Springer 1-20
16. Bettelli S., Calarco T., and Serafini L. Toward an architecture for quantum programming. The European Physical Journal D 25 (2003) 181-200
17. Birkhoff G., and von Neumann J. The logic of quantum mechanics. Annals of Mathematics 37 (1936) 823-843
18. R. Bonner, R. Freivalds, A survey of quantum learning, in: R. Bonner, R. Freivalds (Eds.), Proceedings of the 3rd Workshop on Quantum Computation and Learning, 2002, pp. 106-119
19. Brunet O., and Jorrand P. Dynamic quantum logic for quantum programs. International Journal of Quantum Information 2 (2004) 45-54
20. Bruza P., Kitto K., Nelson D., and McEvoy C. Extracting spooky-activation-at-a-distance from considerations of entanglement. In: Bruza P., et al. (Ed). Proceedings of Third International Symposium on Quantum Interaction. LNCS vol. 5494 (2009), Springer-Verlag 71-83
21. Cattaneo G., Dalla Chiara M.L., Giuntini R., and Leporini R. An unsharp logic from quantum computation. International Journal of Theoretical Physics 43 (2004) 1803-1817
22. Chadha R., Mateus P., and Sernadas A. Reasoning about imperative quantum programs. Electronic Notes in Theoretical Computer Science 158 (2006) 19-39
23. Chefles A. Unambiguous discrimination between linearly independent quantum states. Physical Letters A 239 (1998) 339-347
24. Chuang I.L., and Nielsen M.A. Prescription for experimental determination of the dynamics of a quantum black box. Journal of Modern Optics 44 (1997) 2455-2467
25. Ciamarra M.P. Quantum reversibility and a new model of quantum automaton. In: Freivalds R. (Ed). Proceedings of the 13th International Symposium Fundamentals of Computation Theory. LNCS vol. 2138 (2001), Springer 376-379
26. Cleve R., and Buhrman H. Substituting quantum entanglement for communication. Physical Review A 56 (1997) 1201-1204
27. Copsey D., Oskin M., Impens F., Metodiev T., Cross A., Chong F.T., Chuang I.L., and Kubiatowicz J. Toward a scalable, silicon-based quantum computing architecture. IEEE Journal of Selected Topics in Quantum Electronics 9 (2003) 1552-1569
28. Danos V., Kashefi E., and Panangaden P. The measurement calculus. Journal of the ACM 54 (2007) art. no. 8
29. D'Ariano G.M., Presti P.L., and Paris M.G.A. Using entanglement improves the precision of quantum measurements. Physical Review Letters 87 (2001) art. no. 270404
30. Deutsch D. Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of The Royal Society of London A 400 (1985) 97-117
31. Deutsch D. Quantum computational networks. Proceedings of The Royal Society of London A 425 (1989) 73-90
32. Deutsch D., and Jozsa R. Rapid solution of problems by quantum computation. Proceedings of The Royal Society of London A 439 (1992) 553
33. Duan R.Y., Feng Y., and Ying M.S. Entanglement is not necessary for perfect discrimination between unitary operations. Physical Review Letters 98 (2007) art. no. 100503
34. Duan R.Y., Feng Y., and Ying M.S. Local distinguishability of multipartite unitary operations. Physical Review Letters 100 (2008) art. no. 020503
35. Duan R.Y., Feng Y., Ji Z.F., and Ying M.S. Distinguishing arbitrary multipartite basis unambiguously using local operations and classical communication. Physical Review Letters 98 (2007) art. no. 230502
36. Duan R.Y., Feng Y., and Ying M.S. Perfect distinguishability of quantum operations. arXiv:0908.0119 [quant-ph]
37. D'Hondt E., and Panangaden P. Quantum weakest preconditions. Mathematical Structures in Computer Science 16 (2006) 429-451
38. D'Hondt E., and Panangaden P. The computational power of the W and GHZ states. Quantum Information and Computation 6 (2006) 173-183
39. Eisert J., Wilkens M., and Lewenstein M. Quantum games and quantum strategies. Physical Review Letters 83 (1999) 3077
40. Ezhov A., and Ventura D. Quantum neural networks. In: Kasabov N. (Ed). Future Directions for Intelligent Systems and Information Science (2000), Physica-Verlag
41. Farhi E., Goldstone J., Gutmann S., and Sipser M. Quantum computation by adiabatic evolution. arXiv:quant-ph/0001106
42. Farhi E., and Gutmann S. Quantum computation and decision trees. Physical Review A 58 (1998) 915-928
43. Feng Y., Duan R.Y., Ji Z.F., and Ying M.S. Proof rules for the correctness of quantum programs. Theoretical Computer Science 386 (2007) 151-166
44. Feng Y., Duan R.Y., Ji Z.F., and Ying M.S. Probabilistic bisimulations for quantum processes. Information and Computation 205 (2007) 1608-1639
45. Feng Y., Duan R.Y., and Ying M.S. Unambiguous discrimination between mixed quantum states. Physical Review A 70 1 (2004) art. no. 012308
46. Feng Y., Zhang S.Y., Duan R.Y., and Ying M.S. Lower bound on inconclusive probability of unambiguous discrimination. Physical Review A 66 (2002) art. no. 062313
47. Feynman R.P. Simulating physics with computers. International Journal of Theoretical Physics 21 (1982) 467-488
48. Gay S. Quantum programming languages: Survey and bibliography. Mathematical Structures in Computer Science 16 (2006) 581-600
49. S.J. Gay, R. Nagarajan, Communicating quantum processes, in: Proceedings of the 32nd ACM Symposium on Principles of Programming Languages, 2005
50. Gleason A.M. Measures on the closed subspaces of a Hilbert space. Journal of Mathematics and Mechanics 6 (1957) 885-893
51. Gottesman D., and Chuang I. Quantum teleportation as a universal computational primitive. Nature 402 (1999) 390-393
52. L.K. Grover, A fast quantum mechanical algorithm for database search, in: Proceedings of 28th Annual ACM Symposium on the Theory of Computing, 1996, p. 212
53. Grover L.K. Quantum telecomputation. arXiv:quant-ph/9704012
54. Gudder S. Quantum automata: An overview. International Journal of Theoretical Physics 38 (1999) 2261-2282
55. C. Heunen, B. Jacobs, Quantum logic in dagger kernel categories, in: Proceedings of Quantum Physics and Logic, 2009
56. Hirsh H. A quantum leap for AI. IEEE Intelligent Systems (July/August 1999) 9
57. Hogg T. Quantum search heuristics. IEEE Intelligent Systems (July/August 1999) 12-14
58. Ivanovic I.D. How to differentiate between nonorthonormal states. Physical Letters A 123 (1987) 257-259
59. Ji Z.F., Feng Y., Duan R.Y., and Ying M.S. Identification and distance measures of measurement apparatus. Physical Review Letters 96 (2006) art. no. 200401
60. Jorrand P., and Lalire M. Toward a quantum process algebra. Proceedings of the 1st ACM Conference on Computing Frontier (2004), ACM Press
61. Kitaev A. Fault-tolerant quantum computation by anyons. quant-ph/9707021
62. E.H. Knill, Conventions for quantum pseudocode, Technical Report LAUR-96-2724, Los Alamos National Laboratory, 1996
63. A. Kondacs, J. Watrous, On the power of quantum finite state automata, in: Proceedings of 38th IEEE Conference on Foundations of Computer Science, 1997, pp. 66-75
64. Laskey K.B. Quantum causal networks. In: Bruza P.D., Lawless W., van Rijsbergen C.J., and Sofge D. (Eds). Proceedings of the AAAI Spring Symposium on Quantum Interaction (2007), AAAI Press, Menlo Park
65. Leung D.W. Quantum computation by measurements. International Journal of Quantum Information 2 (2004) 33-43
66. Maslov D., Dueck G.W., Miller M., and Negrevergne C. Quantum circuit simplification and level compaction. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 27 (2008) 436-444
67. Meter R.V., and Itoh K.M. Fast quantum modular exponentiation. Physical Review A 71 (2005) art. no. 052320
68. Miakisza K., Piotrowski E.W., and Sładkowskic J. Quantization of games: Towards quantum artificial intelligence. Theoretical Computer Science 358 (2006) 15-22
69. Moore C., and Crutchfield J.P. Quantum automata and quantum grammars. Theoretical Computer Science 237 (2000) 275-306
70. S.-C. Mu, R. Bird, Functional quantum programming, in: Proceedings of the 2nd Asian Workshop on Programming Languages and Systems, 2001
71. A. Narayanan, M. Moore, Quantum inspired genetic algorithms, in: Proceedings of IEEE International Conference on Evolutionary Computing, 1996, pp. 61-66
72. Nelson D., McEvoy C.L., and Pointer L. Spreading activation or spooky action at a distance?. Journal of Experimental Psychology: Learning, Memory and Cognition 29 (2003) 42-52
73. Nielsen M.A. Quantum computation by measurement and quantum memory. Physical Letters A 308 (2003) 96-100
74. Nielsen M.A., and Chuang I.L. Quantum Computation and Quantum Information (2000), Cambridge University Press, Cambridge
75. Nilsson N.J. Artificial Intelligence: A New Synthesis (1998), Morgan Kaufmann
76. Nishimura H., and Yamakami T. An application of quantum finite automata to interactive proof systems. In: Domaratzki M., Okhotin A., Salomaa K., and Yu S. (Eds). The 9th International Conference on Implementation and Application of Automata, Revised Selected Papers. LNCS vol. 3317 (2005), Springer 225-236
77. B. Ömer, Structural quantum programming, Ph.D. thesis, Technical University of Vienna, 2003
78. Pearl J. Causality: Models, Reasoning, and Inference (2000), Cambridge University Press
79. Penrose R. The Emperor's New Mind: Concerning Computers, Minds, and the Laws of Physics (1990), Oxford University Press
80. A. Petersen, M. Oskin, A new algebraic foundation for quantum programming languages, in: Proceedings of the 2nd Workshop on Non-Silicon Computing, 2003
81. Poyatos J.F., Cirac J.I., and Zoller P. Complete characterization of a quantum process: The two-bit quantum gate. Physical Review Letters 78 (1997) 390-393
82. Preskill J. Topological quantum computation. Quantum Computation. Lecture Notes for Physics vol. 219 (2004), California Institute of Technology. http://www.theory.caltech.edu/people/preskill/ph229 Chapter 9
83. Raussendorf R., and Briegel H.J. A one-way quantum computer. Physical Review Letters 82 (2001) 5188-5191
84. Sanders J.W., and Zuliani P. Quantum programming. Proceedings, Mathematics of Program Construction. LNCS vol. 1837 (2000), Springer-Verlag 88-99
85. Sasaki M., and Carlini A. Quantum learning and universal quantum matching machine. Physical Review A 66 (2002) 022303
86. Schack R., Brun T.A., and Caves C.M. Quantum Bayes rule. Physical Review A 64 (2001) 014305
87. Selinger P. Towards a quantum programming language. Mathematical Structures in Computer Science 14 (2004) 527-586
88. Selinger P., and Valiron B. A lambda calculus for quantum computation with classical control. Mathematical Structures in Computer Science 16 (2006) 527-552
89. Selinger P., and Valiron B. On a fully abstract model for a quantum linear functional language. Electronic Notes in Theoretical Computer Science 210 (2008) 123-137
90. Shende V.V., Bullock A.S., and Markov I.L. Synthesis of quantum-logic circuits. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 25 (2006) 1000-1010
91. Shor P.W. Algorithms for quantum computation: Discrete logarithms and factoring. Proceedings of 35th Annual Symposium on Foundations of Computer Science (1994), IEEE Press, Los Alamitos, CA 124-134
92. Shor P.W. Why haven't more quantum algorithms been found?. Journal of the ACM 50 (2003) 87-90
93. Sun X.M., Zhang S.Y., Feng Y., and Ying M.S. Mathematical nature of and a family of lower bounds for the success probability of unambiguous discrimination. Physical Review A 65 (2002) art. no. 044306
94. Svore K.M., Aho A.V., Cross A.W., Chuang I.L., and Markov I.L. A layered software architecture for quantum computing design tools. IEEE Computer 39 (2006) 74-83
95. Takeuti G. Quantum set theory. In: Beltrametti E., and van Fraassen B.C. (Eds). Current Issues in Quantum Logics (1981), Plenum, New York 303-322
96. Tani S., Kobayashi H., and Matsumoto K. Exact quantum algorithms for the leader election problem. In: Diekert V., and Durand B. (Eds). Proc. STACS 2005. LNCS vol. 3404 (2005), Springer-Verlag 581-592
97. Tonder A.V. A lambda calculus for quantum computation. SIAM Journal on Computing 33 (2004) 1109-1135
98. Tucci R.R. Quantum Bayesian nets. International Journal of Modern Physics B 9 (1995) 295-337
99. Varadarajan V.S. Geometry of Quantum Theory (1985), Springer-Verlag, New York
100. Vogel K., and Risken H. Determination of quasiprobability distributions in terms of probability distributions for the rotated quadrature phase. Physical Review A 40 (1989) 7113-7120
101. Wang G.M., and Ying M.S. Unambiguous discrimination among quantum operations. Physical Review A 73 4 (2006) art. no. 042301
102. A.C. Yao, Quantum circuit complexity, in: Proc. of the 34th Ann. IEEE Symp. on Foundations of Computer Science, 1993, pp. 352-361
103. Yimsiriwattana A., and Lomonaco S.J. Distributed quantum computing: A distributed Shor algorithm. In: Donkor E., Pirich A.R., and Brandt H.E. (Eds). Quantum Information and Computation II. Proceedings of SPIE vol. 5436 (2004) 360-372
104. Ying M.S. A theory of computation based on quantum logic. Theoretical Computer Science 344 (2005) 134-207
105. Ying M.S. Quantum logic and automata theory. In: Engesser K., Gabbay D., and Lehmann D. (Eds). Handbook of Quantum Logic and Quantum Structures (2007), Elsevier, Amsterdam 619-754
106. Ying M.S. Hoare logic for quantum programs. arXiv:0906.4986 [quant-ph]
107. Ying M.S., Chen J.X., Feng Y., and Duan R.Y. Commutativity of quantum weakest preconditions. Information Processing Letters 104 (2007) 152-158
108. Ying M.S., Duan R.Y., Feng Y., and Ji Z.F. Predicate transformer semantics of quantum programs. In: Mackie I., and Gay S. (Eds). Semantic Techniques in Quantum Computation (2009), Cambridge University Press
109. Ying M.S., and Feng Y. An algebraic language for distributed quantum computing. IEEE Transactions on Computers 58 (2009) 728-743
110. M.S. Ying, Y. Feng, Algebra of controlled circuits and quantum multiplexors, submitted for publication
111. M.S. Ying, Y. Feng, Quantum loop programs, submitted for publication
112. Ying M.S., Feng Y., Duan R.Y., and Ji Z.F. An algebra of quantum processes. ACM Transactions on Computational Logic 10 (2009) art. no. 19
113. Zhang S.Y., Feng Y., Sun X.M., and Ying M.S. Upper bound for the success probability of unambiguous discrimination among quantum states. Physical Review A 64 (2001) art. no. 062103