IP Library › Granted Patent US 12,393,864
Granted Patent B2
US 12,393,864 · App. 17/160,309 · Granted Aug 19, 2025

Reinforcement learning with quantum oracle

Inventors: Daochen Wang (College Park, MD); Aarthi Meenakshi Sundaram (Seattle, WA); Robin Ashok Kothari (Seattle, WA); Martin Henri Roetteler (Woodinville, WA); Ashish Kapoor (Kirkland, WA)
Assignee: Microsoft Technology Licensing, LLC
G06N20/00G06N7/01G06N10/00
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,393,864
App. No.
17/160,309
Granted
Aug 19, 2025
Kind
B2
Abstract

A computing device is provided, including a processor configured to transmit, to a quantum coprocessor, instructions to encode a Markov decision process (MDP) model as a quantum oracle. The processor may be further configured to train a reinforcement learning model at least in part by transmitting a plurality of superposition queries to the quantum oracle encoded at the quantum coprocessor. Training the reinforcement learning model may further include receiving, from the quantum coprocessor, one or more measurement results in response to the plurality of superposition queries. Training the reinforcement learning model may further include updating a policy function of the reinforcement learning model based at least in part on the one or more measurement results.

Claims (56)

1. A computing device comprising:

a processor configured to:

transmit, to a quantum coprocessor, instructions to encode a Markov decision process (MDP) model as a quantum oracle; and

train a reinforcement learning model at least in part by:

transmitting a plurality of superposition queries to the quantum oracle encoded at the quantum coprocessor, wherein:

a number of the superposition queries is proportional to an inverse of a target accuracy; and

the target accuracy is a predefined maximum distance between an optimal value estimate included in one or more measurement results and an optimal value approximated by the optimal value estimate;

performing one or more measurements at the quantum oracle as specified by the superposition queries;

receiving, from the quantum coprocessor, one or more measurement results of the one or more measurements in response to the plurality of superposition queries; and

updating a policy function of the reinforcement learning model based at least in part on the one or more measurement results.

2. The computing device of claim 1 , wherein the one or more measurement results include an estimated optimal Q-function, an estimated optimal value function, or an estimated optimal policy function for the reinforcement learning model.

3. The computing device of claim 2 , further comprising quantum random access memory (QRAM), wherein the quantum coprocessor is configured to compute the estimated optimal Q-function, the estimated optimal value function, or the estimated optimal policy function at least in part by making one or more memory calls to the QRAM.

4. The computing device of claim 2 , wherein the estimated optimal Q-function, the estimated optimal value function, or the estimated optimal policy function is computed at the quantum coprocessor via quantum amplitude estimation, quantum Monte Carlo mean estimation, or quantum minimum finding.

5. The computing device of claim 2 , wherein:

the one or more measurement results include the estimated optimal Q-function; and

the plurality of superposition queries includes a number of superposition queries proportional to a number of actions included in the MDP model.

6. The computing device of claim 2 , wherein:

the one or more measurement results include the estimated optimal value function or the estimated optimal policy function; and

the plurality of superposition queries includes a number of superposition queries proportional to a square root of a number of actions included in the MDP model.

7. The computing device of claim 1 , wherein the processor is configured to train the reinforcement learning model via Q-learning or approximate value iteration.

8. The computing device of claim 1 , wherein the one or more measurement results include, for the policy function of the reinforcement learning model:

an estimated value of a state distribution;

an estimated gradient of the estimated value of the state distribution; or

an estimated risk of obtaining a cumulative discounted reward below a reward threshold.

9. A method for use with a computing device, the method comprising:

transmitting, to a quantum coprocessor, instructions to encode a Markov decision process (MDP) model as a quantum oracle; and

training a reinforcement learning model at least in part by:

transmitting a plurality of superposition queries to the quantum oracle encoded at the quantum coprocessor, wherein:

a number of the superposition queries is proportional to an inverse of a target accuracy; and

the target accuracy is a predefined maximum distance between an optimal value estimate included in one or more measurement results and an optimal value approximated by the optimal value estimate;

performing one or more measurements at the quantum oracle as specified by the superposition queries;

receiving, from the quantum coprocessor, one or more measurement results of the one or more measurements in response to the plurality of superposition queries; and

updating a policy function of the reinforcement learning model based at least in part on the one or more measurement results.

10. The method of claim 9 , wherein the one or more measurement results include an estimated optimal Q-function, an estimated optimal value function, or an estimated optimal policy function for the reinforcement learning model.

11. The method of claim 10 , wherein the estimated optimal Q-function, the estimated optimal value function, or the estimated optimal policy function is computed at the quantum coprocessor at least in part by making one or more memory calls to quantum random access memory (QRAM).

12. The method of claim 10 , wherein the estimated optimal Q-function, the estimated optimal value function, or the estimated optimal policy function is computed at the quantum coprocessor via quantum amplitude estimation, quantum Monte Carlo mean estimation, or quantum minimum finding.

13. The method of claim 9 , wherein the reinforcement learning model is trained via Q-learning or approximate value iteration.

14. The method of claim 9 , wherein the one or more measurement results include, for the policy function of the reinforcement learning model:

an estimated value of a state distribution;

an estimated gradient of the estimated value of the state distribution; or

an estimated risk of obtaining a cumulative discounted reward below a reward threshold.

15. A quantum computing device comprising:

quantum random access memory (QRAM); and

a quantum processor configured to:

encode a Markov decision process (MDP) model as a quantum oracle, wherein the quantum oracle is a quantum analogue of the MDP model;

retrieve one or more vectors stored in the QRAM;

receive a plurality of superposition queries from a classical computing device, wherein:

a number of the superposition queries is proportional to an inverse of a target accuracy; and

the target accuracy is a predefined maximum distance between an optimal value estimate included in one or more measurement results and an optimal value approximated by the optimal value estimate;

at the quantum oracle, based at least in part on the one or more vectors and the plurality of superposition queries, compute an estimated optimal Q-function, an estimated optimal value function, or an estimated optimal policy for the MDP model; and

perform, by the classical computing device, one or more measurements at the quantum oracle to receive the estimated optimal Q-function, the estimated optimal value function, or the estimated optimal policy function,

wherein the classical computing device is configured to train a reinforcement learning model based at least in part on the estimated optimal Q-function, the estimated optimal value function, or the estimated optimal policy function.

16. The quantum computing device of claim 15 , wherein the one or more vectors stored in the QRAM include a reward vector of rewards included in the MDP model.

17. The quantum computing device of claim 15 , wherein the one or more vectors stored in the QRAM include a value function vector of respective values corresponding to states included in the MDP model.

18. The quantum computing device of claim 15 , wherein the quantum processor is configured to compute the estimated optimal Q-function, the estimated optimal value function, or the estimated optimal policy function via quantum amplitude estimation, quantum Monte Carlo mean estimation, or quantum minimum finding.

19. The quantum computing device of claim 15 , wherein the classical computing device is configured to train the reinforcement learning model via Q-learning or approximate value iteration.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 18, 2021
From: WANG, DAOCHEN; MEENAKSHI SUNDARAM, AARTHI; KOTHARI, ROBIN ASHOK; ROETTELER, MARTIN HENRI; KAPOOR, ASHISH
To: MICROSOFT TECHNOLOGY LICENSING, LLC
Reel/Frame 055324/0885 →
Continuity (1)
Related Publication 20220253743A1 · Aug 11, 2022
References Cited (22)
US 20200349453A1 · Ronagh · 2020 [cited by applicant]
Dunjko et al., Exponential Improvements for Quantum-Accessible Reinforcement Learning, Aug. 2018. (Year: 2018). [cited by examiner]
Dunjko et al., Quantum-Enhanced Machine Learning, Oct. 2016. (Year: 2016). [cited by examiner]
Sidford et al., Near-Optimal Time and Sample Complexities for Solving Discounted Markov Decision Process with a Generative Model, Jun. 2019. (Year: 2019). [cited by examiner]
“International Search Report and Written Opinion Issued in PCT Application No. PCT/US21/064485”, Mailed Date: Apr. 12, 2022, 14 Pages. [cited by applicant]
Sidford, et al., “Near-Optimal Time and Sample Complexities for Solving Discounted Markov Decision Process with a Generative Model”, In Repository of arXiv:1806.01492v3, Jun. 5, 2019, pp. 1-31. [cited by applicant]
Wang, et al., “Quantum Algorithms for Reinforcement Learning with a Generative Model”, In Repository of arXiv:2112.08451v1, Dec. 15, 2021, pp. 1-26. [cited by applicant]
Wang, et al., “Quantum Algorithms for Reinforcement Learning with a Generative Model”, Retrieved From: https://wdaochen.com/slides/quantumrl_qtml_nopause.pdf, Nov. 8, 2021, 12 pages. [cited by applicant]
Agarwal, et al., “Reinforcement Learning: Theory and Algorithms”, Retrieved from: https://rltheorybook.github.io/rltheorybook_AJKS.pdf, Dec. 9, 2020, 172 Pages. [cited by applicant]
Ambainis, et al., “Quantum Speedups for Exponential-Time Dynamic Programming Algorithms”, In the Repository of arXiv:1807.05209v1, Jul. 13, 2018, 17 Pages. [cited by applicant]
Azar, et al., “On the Sample Complexity of Reinforcement Learning with a Generative Model”, In Proceedings of 29th International Conference on Machine Learning, Jun. 27, 2012, 8 Pages. [cited by applicant]
Bertsekas, Dimitri P., “Abstract Dynamic Programming”, In Thesis of Massachusetts Institute of Technology, Jan. 2013, 14 Pages. [cited by applicant]
Brassard, et al., “Quantum Amplitude Amplication and Estimation”, In Contemporary Mathematics, vol. 305, May 2, 2000, 32 Pages. [cited by applicant]
Childs, et al., “Exponential Algorithmic Speedup by a Quantum Walk”, In Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, Jun. 9, 2003, pp. 59-68. [cited by applicant]
Cornelissen, A.J., “Quantum Gradient Estimation and its Application to Quantum Reinforcement Learning”, In Master Thesis Submitted to Delft University of Technology, Aug. 21, 2018, 178 Pages. [cited by applicant]
Durr, et al., “A Quantum Algorithm for Finding the Minimum”, In the Repository of arXiv.quant-ph/9607014v1, Jul. 18, 1996, 2 Pages. [cited by applicant]
Kearns, et al., “Finite-Sample Convergence Rates for Q-Learning and Indirect Algorithms”, In Proceedings of Advances in Neural Information Processing Systems, Nov. 1999, pp. 996-1002. [cited by applicant]
Montanaro, Ashley, “Quantum Speedup of Monte Carlo Methods”, In the Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, Sep. 8, 2015, 20 Pages. [cited by applicant]
Ronagh, Pooya, “Quantum Algorithms for Solving Dynamic Programming Problems”, In the Repository of arXiv:1906.02229v2, Oct. 18, 2019, 25 Pages. [cited by applicant]
Sidford, et al., “Near-Optimal Time and Sample Complexities for Solving Markov Decision Processes with a Generative Model”, In Proceedings of the 32nd International Conference on Neural Information Processing Systems, D… [cited by applicant]
Sidford, et al., “Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes”, In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, Jan. 2018, pp. 770-78… [cited by applicant]
Azar, et al., “Minimax PAC Bounds on the Sample Complexity of Reinforcement Learning with a Generative Model”, In Journal of Machine Learning, vol. 91, Issue 3, May 14, 2013, pp. 325-349. [cited by applicant]