Abstract
Apprenticeship learning is a method commonly used to train artificial intelligence systems to perform tasks that are challenging to specify directly using traditional methods. Based on the work of Abbeel and Ng (ICML’04), we present a quantum algorithm for apprenticeship learning via inverse reinforcement learning. As an intermediate step, we give a classical approximate apprenticeship learning algorithm to demonstrate the speedup obtained by our quantum algorithm. We prove convergence guarantees on our classical approximate apprenticeship learning algorithm, which also extends to our quantum apprenticeship learning algorithm. We also show that, as compared to its classical counterpart, our quantum algorithm achieves an improvement in the per-iteration time complexity by a quadratic factor in the dimension of the feature vectors k and the size of the action space A.
| Original language | English |
|---|---|
| Article number | 16 |
| Journal | Quantum Machine Intelligence |
| Volume | 8 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2026 |
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 4 Quality Education
OECD Field of Science
- 1.2 Computer and Information Sciences
- 2.2 Electrical Engineering, Electronic Engineering, Information Engineering
- 1.1 Mathematics
Keywords
- Apprenticeship learning
- Inverse reinforcement learning
- Quantum algorithms
Fingerprint
Dive into the research topics of 'Quantum algorithm for apprenticeship learning'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver