Papers
Topics
Authors
Recent
Search
2000 character limit reached

Demonstration of quantum projective simulation on a single-photon-based quantum computer

Published 19 Apr 2024 in quant-ph | (2404.12729v2)

Abstract: Variational quantum algorithms show potential in effectively operating on noisy intermediate-scale quantum devices. A novel variational approach to reinforcement learning has been recently proposed, incorporating linear-optical interferometers and a classical learning model known as projective simulation (PS). PS is a decision-making tool for reinforcement learning and can be classically represented as a random walk on a graph that describes the agent's memory. In its optical quantum version, this approach utilizes quantum walks of single photons on a mesh of tunable beamsplitters and phase shifters to select actions. In this work, we present the implementation of this algorithm on Ascella, a single-photon-based quantum computer from Quandela. The focus is drawn on solving a test bed task to showcase the potential of the quantum agent with respect to the classical agent.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (13)
  1. J. Bowles, S. Ahmed, and M. Schuld, Better than classical? The subtle art of benchmarking quantum machine learning models (2024), arXiv:2403.07059 .
  2. H. J. Briegel and G. De las Cuevas, Projective simulation for artificial intelligence, Scientific Reports 2, 400 (2012).
  3. A. A. Melnikov, A. Makmal, and H. J. Briegel, Projective simulation applied to the grid-world and the mountain-car problem, Artificial Intelligence Research 3, 24 (2014).
  4. V. Dunjko, N. Friis, and H. J. Briegel, Quantum-enhanced deliberation of learning agents using trapped ions, New Journal of Physics 17, 023006 (2015).
  5. R. S. Sutton and A. G. Barto, Reinforcement learning: an introduction, second edition ed., Adaptive computation and machine learning series (The MIT Press, 2018).
  6. R. M. Annasamy and K. Sycara, Towards better interpretability in deep q-networks, Proceedings of the AAAI Conference on Artificial Intelligence 33, 4561 (2019).
  7. S. Kullback and R. A. Leibler, On information and sufficiency, The Annals of Mathematical Statistics 22, 79 (1951).
  8. C. E. Shannon, A mathematical theory of communication, The Bell System Technical Journal 27, 623 (1948).
  9. J. C. Spall, An overview of the simultaneous perturbation method for efficient optimization, Johns Hopkins apl technical digest 19 (1998).
  10. S. Aaronson and A. Arkhipov, The computational complexity of linear optics (2010), arXiv:1011.3245 .
  11. H. J. Ryser, Combinatorial Mathematics (American Mathematical Soc., 1963).
  12. D. G. Glynn, The permanent of a square matrix, European Journal of Combinatorics 31, 1887 (2010).
  13. R. García-Patrón, J. J. Renema, and V. Shchesnovich, Simulating boson sampling in lossy architectures, Quantum 3, 169 (2019).

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 3 tweets with 18 likes about this paper.