Quantum-enhanced deliberation of learning agents using trapped ions

A scheme that successfully employs quantum mechanics in the design of autonomous learning agents has recently been reported in the context of the projective simulation (PS) model for artificial intelligence. In that approach, the key feature of a PS agent, a specific type of memory which is explored via random walks, was shown to be amenable to quantization, allowing for a speed-up. In this work we propose an implementation of such classical and quantum agents in systems of trapped ions. We employ a generic construction by which the classical agents are ‘upgraded’ to their quantum counterparts by a nested process of adding coherent control, and we outline how this construction can be realized in ion traps. Our results provide a flexible modular architecture for the design of PS agents. Furthermore, we present numerical simulations of simple PS agents which analyze the robustness of our proposal under certain noise models.

[1]  Lov K. Grover A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[2]  R. Stephenson A and V , 1962, The British journal of ophthalmology.

[3]  Daniel Nigg,et al.  A quantum information processor with trapped ions , 2013, 1308.3096.

[4]  V. Dunjko,et al.  Implementing quantum control for unknown subroutines , 2014, 1401.8128.

[5]  Daniel A. Lidar,et al.  Quantum adiabatic machine learning , 2011, Quantum Inf. Process..

[6]  vCaslav Brukner,et al.  Quantum circuits cannot control unknown operations , 2013, 1309.7976.

[7]  Hans J. Briegel,et al.  Projective simulation for artificial intelligence , 2011, Scientific Reports.

[8]  Alexei Y. Kitaev,et al.  Quantum measurements and the Abelian Stabilizer Problem , 1995, Electron. Colloquium Comput. Complex..

[9]  T. Monz,et al.  An open-system quantum simulator with trapped ions , 2011, Nature.

[10]  Hans-J. Briegel,et al.  Projective Simulation for Classical Learning Agents: A Comprehensive Investigation , 2015, New Generation Computing.

[11]  Hans-J. Briegel,et al.  Projective simulation applied to the grid-world and the mountain-car problem , 2014, Artif. Intell. Res..

[12]  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.

[13]  Gilles Brassard,et al.  Quantum speed-up for unsupervised learning , 2012, Machine Learning.

[14]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[15]  K. K. Nambiar,et al.  Foundations of Computer Science , 2001, Lecture Notes in Computer Science.

[16]  J. Cirac,et al.  Quantum Computations with Cold Trapped Ions. , 1995, Physical review letters.

[17]  M. Szegedy,et al.  Quantum Walk Based Search Algorithms , 2008, TAMC.

[18]  Vedran Dunjko,et al.  Quantum speedup for active learning agents , 2014, 1401.4997.

[19]  D. Deutsch Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[20]  S. Lloyd,et al.  Quantum algorithms for supervised and unsupervised machine learning , 2013, 1307.0411.

[21]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[22]  Vasil S. Denchev,et al.  Training a Binary Classifier with the Quantum Adiabatic Algorithm , 2008, 0811.0416.

[23]  F. Schmidt-Kaler,et al.  Realization of the Cirac–Zoller controlled-NOT quantum gate , 2003, Nature.

[24]  Klaus Molmer,et al.  Multiparticle Entanglement of Hot Trapped Ions , 1998, quant-ph/9810040.

[25]  Caslav Brukner,et al.  The speed of quantum and classical learning for performing the kth root of NOT , 2009, 0904.4571.