With quantum computers still under heavy development, already numerous quantum machine learning algorithms have been proposed for both gate-based quantum computers and quantum annealers. Recently, a quantum annealing version of a reinforcement learning algorithm for grid-traversal using one agent was published. We extend this work based on quantum Boltzmann machines, by allowing for any number of agents. We show that the use of quantum annealing can improve the learning compared to classical methods. We do this both by means of actual quantum hardware and by simulated quantum annealing
Understanding the power and limitations of quantum access to data in machine learning tasks is primo...
© 2021, The Author(s), under exclusive licence to Springer Nature Limited. As the field of artificia...
Inspired by the success of Boltzmann machines based on classical Boltzmann distribution, we propose ...
With quantum computers still under heavy development, already numerous quantum machine learning algo...
In this paper, we present implementations of an annealing-based and a gate-based quantum computing a...
In this paper, we present implementations of an annealing-based and a gate-based quantum computing a...
In this paper, we present implementations of an annealing-based and a gate-based quantum computing a...
In this paper, we present implementations of an annealing-based and a gate-based quantum computing a...
In this paper, we present implementations of an annealing-based and a gate-based quantum computing a...
For NP-hard optimisation problems no polynomial-time algorithms exist for finding a solution. Theref...
This paper presents a comprehensive survey of Quantum Multi-Agent Reinforcement Learning (QMARL), a ...
Quantum machine learning (QML) has been identified as one of the key fields that could reap advantag...
We propose a protocol to perform quantum reinforcement learning with quantum technologies. At varian...
Although quantum supremacy is yet to come, there has recently been an increasing interest in identif...
Quantum annealing algorithms belong to the class of metaheuristic tools, applicable for solving bina...
Understanding the power and limitations of quantum access to data in machine learning tasks is primo...
© 2021, The Author(s), under exclusive licence to Springer Nature Limited. As the field of artificia...
Inspired by the success of Boltzmann machines based on classical Boltzmann distribution, we propose ...
With quantum computers still under heavy development, already numerous quantum machine learning algo...
In this paper, we present implementations of an annealing-based and a gate-based quantum computing a...
In this paper, we present implementations of an annealing-based and a gate-based quantum computing a...
In this paper, we present implementations of an annealing-based and a gate-based quantum computing a...
In this paper, we present implementations of an annealing-based and a gate-based quantum computing a...
In this paper, we present implementations of an annealing-based and a gate-based quantum computing a...
For NP-hard optimisation problems no polynomial-time algorithms exist for finding a solution. Theref...
This paper presents a comprehensive survey of Quantum Multi-Agent Reinforcement Learning (QMARL), a ...
Quantum machine learning (QML) has been identified as one of the key fields that could reap advantag...
We propose a protocol to perform quantum reinforcement learning with quantum technologies. At varian...
Although quantum supremacy is yet to come, there has recently been an increasing interest in identif...
Quantum annealing algorithms belong to the class of metaheuristic tools, applicable for solving bina...
Understanding the power and limitations of quantum access to data in machine learning tasks is primo...
© 2021, The Author(s), under exclusive licence to Springer Nature Limited. As the field of artificia...
Inspired by the success of Boltzmann machines based on classical Boltzmann distribution, we propose ...