IP Library Granted Patent US 12,423,374
Granted Patent B2
US 12,423,374 · App. 16/888,419 · Granted Sep 23, 2025

Systems and methods for stochastic optimization of a robust inference problem

Inventors: Michael Paul Friedlander (Vancouver, CA); Pooya Ronagh (Vancouver, CA); Behrooz Sepehry (Vancouver, CA)
Assignee: 1QB INFORMATION TECHNOLOGIES INC.
G06F17/11G06F17/18G06F18/211G06F18/213G06N3/02G06N7/08G06N20/10
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,423,374
App. No.
16/888,419
Granted
Sep 23, 2025
Kind
B2
Abstract

The present disclosure provides methods and systems for stochastic optimization of a robust inference problem using a sampling device.

Claims (48)

1. A method for training a machine learning model based at least in part on solving an optimization problem using a digital computer and a sampling device, said method comprising:

(a) receiving, by said digital computer, data corresponding to said optimization problem, said data comprising one or more objective functions, wherein an objective function of said one or more objective functions is configured to accept at least an outer optimization argument of said objective function and an inner optimization argument of said objective function, wherein said outer optimization argument is representative of model trainable parameters of said machine learning model; and

(b) training, by said digital computer, said machine learning model at least in part by:

(i) providing values of said inner optimization argument of said objective function to said sampling device, wherein said sampling device comprises at least one non-classical computer, and wherein said sampling device is configured to generate one or more samples based at least in part on said inner optimization argument;

(ii) receiving said one or more samples from said sampling device;

(iii) using said one or more samples to perform an inner optimization over said inner optimization argument of said objective function to generate an inner optimization result;

(iv) determining one or more gradients or sub-gradients of said objective function based at least in part on said inner optimization result;

(v) performing one or more classical optimization protocols based at least in part on said one or more gradients or sub-gradients to thereby obtain an outer optimization over said outer optimization argument;

(vi) outputting an outer optimization result for said machine learning model; and

(vii) updating said model trainable parameters based at least in part on said outer optimization result to train said machine learning model.

2. The method of claim 1 , further comprising repeating (b) in an iterative manner until a stopping criterion is met.

3. The method of claim 1 , wherein said one or more objective functions comprise a loss function.

4. The method of claim 1 , wherein said objective function comprises one or more composite functions of said outer optimization argument and said inner optimization argument.

5. The method of claim 1 , wherein (b)(iv) is performed by one or more applications of a chain rule.

6. The method of claim 5 , wherein said one or more applications comprise one or more iterative applications of said chain rule.

7. The method of claim 6 , wherein said one or more applications are performed using auto-differentiation.

8. The method of claim 4 , wherein one or more argument functions of said one or more composite functions comprises one or more differentiable feature extractors.

9. The method of claim 8 , wherein said one or more differential feature extractors comprise one or more deep neural networks.

10. The method of claim 1 , wherein said data further comprises a set of permissible values for said inner optimization argument.

11. The method of claim 10 , wherein (b) comprises using said sampling device to generate said one or more samples from said set of permissible values.

12. The method of claim 10 , further comprising generating said one or more samples based at least in part on a probability distribution.

13. The method of claim 12 , wherein said probability distribution is determined at least in part by said objective function and a set of scaling parameters.

14. The method of claim 1 , wherein (b)(v) comprises applying one or more members selected from the group consisting of a stochastic gradient descent (SGD) method, a stochastic average gradient (SAG or SAGA) method, a stochastic variance-reduced gradient descent (SVRG) method, a stochastic dual coordinate ascent (SDCA) method, an adaptive moment estimation (Adam) method, a reduced mean square (RMS) method, a root mean square propagation (RMSProp) method, and an adaptive gradient algorithm (AdaGrad).

15. The method of claim 1 , wherein said at least one non-classical computer comprises at least one quantum computer.

16. The method of claim 1 , wherein said at least one non-classical computer comprises at least one quantum annealer.

17. The method of claim 1 , wherein said digital computer is remotely-located with respect to said sampling device.

18. The method of claim 1 , wherein said sampling device comprises one or more optical parametric oscillators.

19. The method of claim 1 , wherein said optimization problem comprises a non-convex problem.

20. The method of claim 1 , wherein said sampling device comprises reconfigurable digital hardware configured to perform a Markov chain Monte Carlo procedure.

21. The method of claim 20 , wherein said Markov chain Monte Carlo procedure comprises one or more members selected from the group consisting of a simulated annealing procedure, a simulated quantum annealing procedure, and a Gibbs sampling procedure.

22. The method of claim 1 , wherein said optimization problem is associated with training a structured support vector machine (SVM).

23. The method of claim 1 , wherein said data corresponding to said optimization problem is associated with one or more members selected from the group consisting of an image segmentation problem, a compressed sensing problem, a basis pursuit problem from a compressed sensing problem, a dual of a basis pursuit problem from a compressed sensing problem, a semi-supervised learning problem, a noun phrase co-reference resolution problem, an active learning problem, an image tagging problem, and a recommender system.

24. The method of claim 1 , wherein said sampling device further comprises at least one digital computer, field-programmable gate array, graphics processing unit, or application-specific integrated circuit.

25. The method of claim 1 , further comprising using said outer optimization result of said outer optimization for performing one or more operations in an iterative optimization process in machine learning.

26. A system for training a machine learning model based at least in part on solving an optimization problem, comprising a digital computer and a sampling device, wherein said digital computer is configured to at least:

(a) receive data corresponding to said optimization problem, said data comprising one or more objective functions, wherein an objective function of said one or more objective functions is configured to accept at least an inner optimization argument and an outer optimization argument, wherein said outer optimization argument is representative of model trainable parameters of said machine learning model; and

(b) train said machine learning model at least in part by:

(i) providing values of said inner optimization argument of said objective function to said sampling device, wherein said sampling device comprises at least one non-classical computer, and wherein said sampling device is configured to generate one or more samples based at least in part on said inner optimization argument,

(ii) obtaining, via an inner optimization, an inner optimization result over said inner optimization argument of said objective function from said sampling device,

(iii) determining one or more gradients or sub-gradients of said objective function based at least in part on said inner optimization,

(iv) performing one or more classical optimization protocols based at least in part on said one or more gradients or sub-gradients to thereby obtain an outer optimization result over said outer optimization argument,

(v) output said outer optimization result for said machine learning model, and

(vi) updating said model trainable parameters based at least in part on said outer optimization result to train said machine learning model.

27. The method of claim 1 , wherein said one or more samples comprise samples of discrete vectors distributed according to a Boltzmann distribution.

28. The method of claim 1 , wherein performing said inner optimization in (b) (iii) uses a smoothed maximum function.

29. The system of claim 26 , wherein said digital computer is further configured to use said outer optimization result of said outer optimization for performing one or more operations in an iterative optimization process in machine learning.

30. The system of claim 29 , wherein said sampling device further comprises at least one digital computer, field-programmable gate array, graphics processing unit, or application-specific integrated circuit.

31. The system of claim 29 , wherein said non-classical computer comprises at least one quantum computer or at least one quantum annealer.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 18, 2022
From: FRIEDLANDER, MICHAEL PAUL; RONAGH, POOYA; SEPEHRY, BEHROOZ
To: 1QB INFORMATION TECHNOLOGIES INC.
Reel/Frame 059945/0302 →
Continuity (4)
Continuation PCTCA2018051534 · Nov 30, 2018
Provisional Application 62716041 · Aug 8, 2018
Provisional Application 62593563 · Dec 1, 2017
Related Publication 20200364597A1 · Nov 19, 2020
References Cited (400)
US 6221592B1 · Schwartz et al. · 2001 [cited by applicant]
US 7113967B2 · Cleve et al. · 2006 [cited by applicant]
US 7135701B2 · Amin et al. · 2006 [cited by applicant]
US 7234144B2 · Wilt et al. · 2007 [cited by applicant]
US 7418283B2 · Amin et al. · 2008 [cited by applicant]
US 7533068B2 · Maassen van den Brink et al. · 2009 [cited by applicant]
US 7619437B2 · Thom et al. · 2009 [cited by applicant]
US 7639035B2 · Berkley · 2009 [cited by applicant]
US 7660533B1 · Meyers et al. · 2010 [cited by applicant]
US 7805079B1 · Meyers et al. · 2010 [cited by applicant]
US 7877333B2 · Macready · 2011 [cited by applicant]
US 7898282B2 · Harris et al. · 2011 [cited by applicant]
US 7984012B2 · Coury et al. · 2011 [cited by applicant]
US 8008942B2 · van den Brink et al. · 2011 [cited by applicant]
US 8126649B2 · Frasch et al. · 2012 [cited by applicant]
US 8175995B2 · Amin · 2012 [cited by applicant]
US 8195596B2 · Rose et al. · 2012 [cited by applicant]
US 8195726B2 · Macready et al. · 2012 [cited by applicant]
US 8219605B2 · Cowlishaw et al. · 2012 [cited by applicant]
US 8230432B2 · Bryant et al. · 2012 [cited by applicant]
US 8244504B1 · Jacobs · 2012 [cited by applicant]
US 8244662B2 · Coury et al. · 2012 [cited by applicant]
US 8283943B2 · van den Brink et al. · 2012 [cited by applicant]
US 8374828B1 · Jacobs et al. · 2013 [cited by applicant]
US 8421053B2 · Bunyk et al. · 2013 [cited by applicant]
US 8503885B2 · Meyers et al. · 2013 [cited by applicant]
US 8655828B2 · Rose · 2014 [cited by applicant]
US 8832165B2 · Allen et al. · 2014 [cited by applicant]
US 9537953B1 · Dadashikelayeh et al. · 2017 [cited by applicant]
US 9660859B1 · Dadashikelayeh et al. · 2017 [cited by applicant]
US 9727824B2 · Rose et al. · 2017 [cited by applicant]
US 9870273B2 · Dadashikelayeh et al. · 2018 [cited by applicant]
US 9881256B2 · Hamze et al. · 2018 [cited by applicant]
US 10044638B2 · Dadashikelayeh et al. · 2018 [cited by applicant]
US 10152358B2 · Dadashikelayeh et al. · 2018 [cited by applicant]
US 10223084B1 · Dunn · 2019 [cited by applicant]
US 10325218B1 · Zeng et al. · 2019 [cited by applicant]
US 10339466B1 · Ding et al. · 2019 [cited by applicant]
US 10346748B2 · Aspuru-Guzik et al. · 2019 [cited by applicant]
US 10469087B1 · Granade et al. · 2019 [cited by applicant]
US 10484479B2 · Johnson et al. · 2019 [cited by applicant]
US 10558932B1 · Neven et al. · 2020 [cited by applicant]
US 10614370B2 · Johnson et al. · 2020 [cited by applicant]
US 10713582B2 · Dadashikelayeh · 2020 [cited by applicant]
US 10929294B2 · Brahm et al. · 2021 [cited by applicant]
US 11017289B2 · Crawford et al. · 2021 [cited by applicant]
US 11196775B1 · Badawy et al. · 2021 [cited by applicant]
US 11205275B2 · Oami et al. · 2021 [cited by applicant]
US 11514134B2 · Ronagh et al. · 2022 [cited by applicant]
US 20030005068A1 · Nickel et al. · 2003 [cited by applicant]
US 20030023707A1 · Ryan · 2003 [cited by applicant]
US 20030121028A1 · Coury et al. · 2003 [cited by applicant]
US 20040254735A1 · Horn et al. · 2004 [cited by applicant]
US 20040267916A1 · Chambliss et al. · 2004 [cited by applicant]
US 20050027458A1 · Merz et al. · 2005 [cited by applicant]
US 20050182614A1 · Meredith · 2005 [cited by applicant]
US 20050187844A1 · Chalermkraivuth et al. · 2005 [cited by applicant]
US 20050250651A1 · Amin et al. · 2005 [cited by applicant]
US 20050273306A1 · Hilton et al. · 2005 [cited by applicant]
US 20060221978A1 · Venkatachalam · 2006 [cited by applicant]
US 20060225165A1 · Maassen Van Den Brink et al. · 2006 [cited by applicant]
US 20070177634A1 · Beausoleil et al. · 2007 [cited by applicant]
US 20070180586A1 · Amin · 2007 [cited by applicant]
US 20070215862A1 · Beausoleil et al. · 2007 [cited by applicant]
US 20070239366A1 · Hilton et al. · 2007 [cited by applicant]
US 20080059547A1 · Taylor · 2008 [cited by applicant]
US 20080065573A1 · Macready · 2008 [cited by applicant]
US 20080186918A1 · Tinnakornsrisuphap et al. · 2008 [cited by applicant]
US 20080215850A1 · Berkley et al. · 2008 [cited by applicant]
US 20080218519A1 · Coury et al. · 2008 [cited by applicant]
US 20080262990A1 · Kapoor et al. · 2008 [cited by applicant]
US 20080313430A1 · Bunyk · 2008 [cited by applicant]
US 20090050357A1 · Suzuki · 2009 [cited by applicant]
US 20090070402A1 · Rose et al. · 2009 [cited by applicant]
US 20090078932A1 · Amin · 2009 [cited by applicant]
US 20090164435A1 · Routt · 2009 [cited by applicant]
US 20090182542A9 · Hilton et al. · 2009 [cited by applicant]
US 20090203449A1 · Douceur et al. · 2009 [cited by applicant]
US 20090306902A1 · Lemmen et al. · 2009 [cited by applicant]
US 20090325694A1 · Beckman et al. · 2009 [cited by applicant]
US 20100076913A1 · Yang et al. · 2010 [cited by applicant]
US 20100261481A1 · Resende et al. · 2010 [cited by applicant]
US 20100306142A1 · Amin · 2010 [cited by applicant]
US 20110047201A1 · Macready et al. · 2011 [cited by applicant]
US 20110231462A1 · Macready et al. · 2011 [cited by applicant]
US 20110238378A1 · Allen et al. · 2011 [cited by applicant]
US 20110238855A1 · Korsunsky et al. · 2011 [cited by applicant]
US 20110296229A1 · Cowlishaw et al. · 2011 [cited by applicant]
US 20120072579A1 · Teather · 2012 [cited by applicant]
US 20120084242A1 · Levin · 2012 [cited by applicant]
US 20120159506A1 · Barham et al. · 2012 [cited by applicant]
US 20120215821A1 · Macready et al. · 2012 [cited by applicant]
US 20120240185A1 · Kapoor et al. · 2012 [cited by applicant]
US 20120253926A1 · Chen et al. · 2012 [cited by applicant]
US 20120254586A1 · Amin et al. · 2012 [cited by applicant]
US 20120278374A1 · Cowlishaw et al. · 2012 [cited by applicant]
US 20120326720A1 · Gambetta et al. · 2012 [cited by applicant]
US 20130026183A1 · Foster · 2013 [cited by applicant]
US 20130144925A1 · Macready et al. · 2013 [cited by applicant]
US 20130263131A1 · Beda, III et al. · 2013 [cited by applicant]
US 20130308956A1 · Meyers et al. · 2013 [cited by applicant]
US 20130336472A1 · Fahlgren et al. · 2013 [cited by applicant]
US 20140025606A1 · Macready · 2014 [cited by applicant]
US 20140067342A1 · Calderon · 2014 [cited by applicant]
US 20140067808A1 · Narang et al. · 2014 [cited by applicant]
US 20140122702A1 · Jung et al. · 2014 [cited by applicant]
US 20140123325A1 · Jung et al. · 2014 [cited by applicant]
US 20140187427A1 · Macready · 2014 [cited by examiner]
US 20140214257A1 · Williams et al. · 2014 [cited by applicant]
US 20140237276A1 · Machnicki et al. · 2014 [cited by applicant]
US 20140250288A1 · Roy · 2014 [cited by applicant]
US 20140258730A1 · Stecher · 2014 [cited by applicant]
US 20140324933A1 · Macready et al. · 2014 [cited by applicant]
US 20140337612A1 · Williams · 2014 [cited by applicant]
US 20140344322A1 · Ranjbar · 2014 [cited by applicant]
US 20140365843A1 · Ashikhmin · 2014 [cited by applicant]
US 20140379924A1 · Das et al. · 2014 [cited by applicant]
US 20150006443A1 · Rose et al. · 2015 [cited by applicant]
US 20150032991A1 · Lanting et al. · 2015 [cited by applicant]
US 20150032993A1 · Amin et al. · 2015 [cited by applicant]
US 20150055961A1 · Meyers et al. · 2015 [cited by applicant]
US 20150106413A1 · Ronagh · 2015 [cited by applicant]
US 20150111754A1 · Harris et al. · 2015 [cited by applicant]
US 20150120551A1 · Jung et al. · 2015 [cited by applicant]
US 20150120555A1 · Jung et al. · 2015 [cited by applicant]
US 20150142398A1 · Miller, III et al. · 2015 [cited by applicant]
US 20150169746A1 · Hatami-Hanza · 2015 [cited by applicant]
US 20150178349A1 · Niewodniczanski et al. · 2015 [cited by applicant]
US 20150193692A1 · Israel · 2015 [cited by applicant]
US 20150205759A1 · Israel et al. · 2015 [cited by applicant]
US 20150220852A1 · Hatami-Hanza · 2015 [cited by applicant]
US 20150227559A1 · Hatami-Hanza · 2015 [cited by applicant]
US 20150262074A1 · Bruestle et al. · 2015 [cited by applicant]
US 20150269124A1 · Hamze et al. · 2015 [cited by applicant]
US 20150269243A1 · Kobayashi · 2015 [cited by applicant]
US 20150332994A1 · Mallik et al. · 2015 [cited by applicant]
US 20150349960A1 · Bagley · 2015 [cited by applicant]
US 20150358251A1 · Varga et al. · 2015 [cited by applicant]
US 20150363358A1 · Ronagh · 2015 [cited by examiner]
US 20150363708A1 · Amin et al. · 2015 [cited by applicant]
US 20160026183A1 · Williams et al. · 2016 [cited by applicant]
US 20160071021A1 · Raymond · 2016 [cited by applicant]
US 20160112066A1 · Ashikhmin · 2016 [cited by applicant]
US 20160132785A1 · Amin et al. · 2016 [cited by applicant]
US 20160162798A1 · Marandi et al. · 2016 [cited by applicant]
US 20160171368A1 · Aspuru-Guzik et al. · 2016 [cited by applicant]
US 20160217759A1 · Morita · 2016 [cited by applicant]
US 20160224515A1 · Ronagh et al. · 2016 [cited by applicant]
US 20160321559A1 · Rose et al. · 2016 [cited by applicant]
US 20160328253A1 · Majumdar · 2016 [cited by applicant]
US 20160328659A1 · Mohseni et al. · 2016 [cited by applicant]
US 20160338075A1 · Mckibben · 2016 [cited by applicant]
US 20160342891A1 · Ross et al. · 2016 [cited by applicant]
US 20170011305A1 · Williams · 2017 [cited by applicant]
US 20170017894A1 · Lanting et al. · 2017 [cited by applicant]
US 20170060642A1 · Castellano et al. · 2017 [cited by applicant]
US 20170109605A1 · Ahn · 2017 [cited by applicant]
US 20170147303A1 · Amy et al. · 2017 [cited by applicant]
US 20170147695A1 · Shih · 2017 [cited by applicant]
US 20170214701A1 · Hasan · 2017 [cited by applicant]
US 20170223143A1 · Johnson et al. · 2017 [cited by applicant]
US 20170242824A1 · Karimi et al. · 2017 [cited by applicant]
US 20170255592A1 · Karimi et al. · 2017 [cited by applicant]
US 20170255629A1 · Thom et al. · 2017 [cited by applicant]
US 20170255872A1 · Hamze et al. · 2017 [cited by applicant]
US 20170286852A1 · Rezaie et al. · 2017 [cited by applicant]
US 20170286858A1 · La et al. · 2017 [cited by applicant]
US 20170300808A1 · Ronagh et al. · 2017 [cited by applicant]
US 20170323195A1 · Crawford et al. · 2017 [cited by applicant]
US 20170344898A1 · Karimi et al. · 2017 [cited by applicant]
US 20170351974A1 · Rose et al. · 2017 [cited by applicant]
US 20170372427A1 · Johnson et al. · 2017 [cited by applicant]
US 20170373940A1 · Shahab et al. · 2017 [cited by applicant]
US 20180014970A1 · Conde De Paiva et al. · 2018 [cited by applicant]
US 20180039903A1 · Mosca et al. · 2018 [cited by applicant]
US 20180091440A1 · Dadashikelayeh et al. · 2018 [cited by applicant]
US 20180096085A1 · Rubin · 2018 [cited by applicant]
US 20180107526A1 · Dadashikelayeh et al. · 2018 [cited by applicant]
US 20180114138A1 · Monroe et al. · 2018 [cited by applicant]
US 20180204126A1 · Galle · 2018 [cited by applicant]
US 20180218279A1 · Lechner et al. · 2018 [cited by applicant]
US 20180218281A1 · Reinhardt et al. · 2018 [cited by applicant]
US 20180232649A1 · Wiebe et al. · 2018 [cited by applicant]
US 20180246851A1 · Zaribafiyan et al. · 2018 [cited by applicant]
US 20180260730A1 · Reagor et al. · 2018 [cited by applicant]
US 20180267937A1 · Pelc et al. · 2018 [cited by applicant]
US 20180308000A1 · Dukatz et al. · 2018 [cited by applicant]
US 20180308007A1 · Amin et al. · 2018 [cited by applicant]
US 20180314970A1 · Harris et al. · 2018 [cited by applicant]
US 20180375790A1 · Dadashikelayeh et al. · 2018 [cited by applicant]
US 20190009581A1 · Schalk et al. · 2019 [cited by applicant]
US 20190087237A1 · Dadashikelayeh et al. · 2019 [cited by applicant]
US 20190095811A1 · Antonio et al. · 2019 [cited by applicant]
US 20190179871A1 · Granade et al. · 2019 [cited by applicant]
US 20190205790A1 · Dukatz et al. · 2019 [cited by applicant]
US 20190251213A1 · Bishop et al. · 2019 [cited by applicant]
US 20190370680A1 · Novotny · 2019 [cited by applicant]
US 20190378047A1 · Pistoia et al. · 2019 [cited by applicant]
US 20200005186A1 · Romero et al. · 2020 [cited by applicant]
US 20200057957A1 · Johnson et al. · 2020 [cited by applicant]
US 20200090072A1 · Troyer et al. · 2020 [cited by applicant]
US 20200104740A1 · Cao · 2020 [cited by applicant]
US 20200125568A1 · Idicula et al. · 2020 [cited by applicant]
US 20200143910A1 · Noori et al. · 2020 [cited by applicant]
US 20200191943A1 · Wu et al. · 2020 [cited by applicant]
US 20200279187A1 · Huang et al. · 2020 [cited by applicant]
US 20200394537A1 · Wang et al. · 2020 [cited by applicant]
US 20200401920A1 · Killoran et al. · 2020 [cited by applicant]
US 20200410343A1 · Niu et al. · 2020 [cited by applicant]
US 20210103847A1 · Akzam · 2021 [cited by applicant]
US 20210125094A1 · Chamberland et al. · 2021 [cited by applicant]
US 20210166133A1 · Ronagh et al. · 2021 [cited by applicant]
US 20210166148A1 · Matsuura et al. · 2021 [cited by applicant]
US 20210279260A1 · Oberoi et al. · 2021 [cited by applicant]
US 20210287124A1 · Ronagh et al. · 2021 [cited by applicant]
US 20210289020A1 · Rolfe · 2021 [cited by examiner]
US 20210304052A1 · Pant · 2021 [cited by applicant]
US 20210374611A1 · Ronagh et al. · 2021 [cited by applicant]
US 20220101172A1 · Lee et al. · 2022 [cited by applicant]
US 20220107927A1 · Vedaie et al. · 2022 [cited by applicant]
US 20220366314A1 · Vall-Llosera et al. · 2022 [cited by applicant]
US 20230067878A1 · Ronagh et al. · 2023 [cited by applicant]
US 20230077665A1 · Kuttimalai et al. · 2023 [cited by applicant]
US 20230104058A1 · Hopfmueller et al. · 2023 [cited by applicant]
US 20230222173A1 · Ronagh et al. · 2023 [cited by applicant]
CA 2840958A1 · 2013 [cited by applicant]
CA 2881033A1 · 2015 [cited by applicant]
CA 2902015A1 · 2016 [cited by applicant]
CA 2921711A1 · 2017 [cited by applicant]
CA 3026824A1 · 2017 [cited by applicant]
CN 106874506A · 2017 [cited by applicant]
CN 110069348A · 2019 [cited by applicant]
CN 112034842A · 2020 [cited by applicant]
EP 3113084A1 · 2017 [cited by applicant]
JP 2004503011A · 2004 [cited by applicant]
JP 2006061926A · 2006 [cited by applicant]
JP 2008525873A · 2008 [cited by applicant]
JP 2013114366A · 2013 [cited by applicant]
JP 2016206795A · 2016 [cited by applicant]
WO WO2005122052A1 · 2005 [cited by applicant]
WO WO2006026985A2 · 2006 [cited by applicant]
WO WO2007089674A2 · 2007 [cited by applicant]
WO WO2007147243A1 · 2007 [cited by applicant]
WO WO2010148120A2 · 2010 [cited by applicant]
WO WO2013006836A1 · 2013 [cited by applicant]
WO WO2014210368A1 · 2014 [cited by applicant]
WO WO2015006494A1 · 2015 [cited by applicant]
WO WO2015060915A2 · 2015 [cited by applicant]
WO WO2015121619A2 · 2015 [cited by applicant]
WO WO2016029172A1 · 2016 [cited by applicant]
WO WO2017033326A1 · 2017 [cited by applicant]
WO WO2017068228A1 · 2017 [cited by applicant]
WO WO2017111937A1 · 2017 [cited by applicant]
WO WO2017131081A1 · 2017 [cited by applicant]
WO WO2017145086A1 · 2017 [cited by applicant]
WO WO2017149491A1 · 2017 [cited by applicant]
WO WO2017152289A1 · 2017 [cited by applicant]
WO WO2017168865A1 · 2017 [cited by applicant]
WO WO2017201626A1 · 2017 [cited by applicant]
WO WO2017214717A1 · 2017 [cited by applicant]
WO WO2018058061A1 · 2018 [cited by applicant]
WO WO2018119522A1 · 2018 [cited by applicant]
WO WO2018160599A1 · 2018 [cited by applicant]
WO WO2019104440A1 · 2019 [cited by applicant]
WO WO2019104443A1 · 2019 [cited by applicant]
WO WO2019152020A1 · 2019 [cited by applicant]
WO WO2019157228A1 · 2019 [cited by applicant]
WO WO2019222748A1 · 2019 [cited by applicant]
WO WO2019241879A1 · 2019 [cited by applicant]
WO WO2019244105A1 · 2019 [cited by applicant]
WO WO2020113339A1 · 2020 [cited by applicant]
WO WO2020223718A1 · 2020 [cited by applicant]
WO WO2020227825A1 · 2020 [cited by applicant]
WO WO2020255076A1 · 2020 [cited by applicant]
WO WO2021055000A1 · 2021 [cited by applicant]
WO WO2021111368A1 · 2021 [cited by applicant]
WO WO2021181281A1 · 2021 [cited by applicant]
WO WO2021207847A1 · 2021 [cited by applicant]
WO WO2021237350A1 · 2021 [cited by applicant]
WO WO2021243454A1 · 2021 [cited by applicant]
WO WO2022079640A1 · 2022 [cited by applicant]
WO WO2022123494A1 · 2022 [cited by applicant]
WO WO2022224143A1 · 2022 [cited by applicant]
WO WO2023275825A1 · 2023 [cited by applicant]
WO WO2023053035A1 · 2023 [cited by applicant]
WO WO2023242744A1 · 2023 [cited by applicant]
Pedregosa, Fabian. “Hyperparameter optimization with approximate gradient.” International conference on machine learning. PMLR, 2016. (Year: 2016). [cited by examiner]
Wikipedia. Automatic Differentiation. Article from Nov. 23, 2016. https://en.wikipedia.org/w/index.php?title=Automatic_differentiation&oldid=751071969. Accessed Jan. 29, 2023. (Year: 2016). [cited by examiner]
Mao, Jianchang, and Anil K. Jain. “Artificial neural networks for feature extraction and multivariate data projection.” IEEE transactions on neural networks 6.2 (1995): 296-317. (Year: 1995). [cited by examiner]
Sakaguchi, Hiromasa, et al. “Boltzmann sampling by degenerate optical parametric oscillator network for structure-based virtual screening.” Entropy 18.10 (2016): 365. (Year: 2016). [cited by examiner]
Wikipedia. “Softmax function”. Article version as accessed from Wayback Machine on Aug. 31, 2017. (Year: 2017). [cited by examiner]
Amin et al.: Quantum Boltzmann Machine. Phys. Rev. X8, 021050 [arXiv:1601.02036 1-11] (2018). [cited by applicant]
European Patent Application No. 18884196.9 Extended European Search Report dated Jul. 16, 2021. [cited by applicant]
Gwennap: Groq Rocks Neural Networks. The Linley Group Microprocessor Report www.groq.com/groq-tsp-leads-in-inference-performance/ [1-5] (2020). [cited by applicant]
Izmaylov et al.: Revising the measurement process in the variational quantum eigensolver: is it possible to reduce the No. of separately measured operators? Chem Sci. 10(13):3746-3755 (2019). [cited by applicant]
Kaminsky et al.: Scalable architecture for adiabatic quantum computing of NP-hard problems. Quantum Computing & Quantum Bits in Mesoscopic Systems, pp. 229-236 DOI:10.1007/978-1-4419-9092-1_25 [arXiv:quant-ph/0211152 1-… [cited by applicant]
Kempe et al.: The Complexity of the Local Hamiltonian Problem. SIAM Journal of Computing. 35(5):1070-1097 Rev.2008 DOI: arXiv:quant-ph/0406180v2 [1-30] (2005). [cited by applicant]
Lemieux et al.: Efficient Quantum Walk Circuits for Metropolis-Hastings Algorithm. Quantum 4:287 [1-15] (2020). [cited by applicant]
Lemieux et al.: Resource estimate for quantum many-body ground-state preparation on a quantum computer. Physical Review A 103(5)052408 DOI:10.1103/PhysRevA.103.052408 [1-9] (2021). [cited by applicant]
Moll et al.: Quantum optimization using variational algorithms on near-term quantum devices. Quantum Sci. Technol. 3 030503 [1-17] (2018). [cited by applicant]
Nishikawa et al. Quantum Chemistry Grid/Gaussian Portal, Journal of the twenty second Annual Research Society, Japan Simulation Society, Jun. 18, 2003, pp. 369 to 372 (English Abstract). [cited by applicant]
Papamakarios: Comparison of Modern Stochastic Optimization Algorithms. Scholar article. [1-13] (2014) www.richtarik.org/papers/Papamakarios.pdf. [cited by applicant]
PCT/CA2021/050513 International Search Report and Written Opinion dated Jul. 14, 2021. [cited by applicant]
Temme et al.: Quantum metropolis sampling. Nature 471(7336):87-90 (2011). [cited by applicant]
Vartiainen: Unitary Transformations for Quantum Computing. Doctoral Dissertation. Helsinki University of Technology TKK dissertations. DOI: aaltodoc.aalto.fi/handle/123456789/2551 [1- 56] (2005). [cited by applicant]
Akama et al. Implementation of divide-and-conquer method including Hartree-Fock exchange interaction. J Comput Chem 28(12):2003-2012 (2007). [cited by applicant]
Alidaee et al. Solving the maximum edge weight clique problem via unconstrained quadratic programming. European Journal of Operational Research 181(2):592-597 (2007). [cited by applicant]
Anthony et al. Quadratization of symmetric pseudo-Boolean functions. Discrete Appl. Math. 203:1-12 (2016). [cited by applicant]
Aspuru-Guzik et al. Simulated Quantum Computation of Molecular Energies. Science 309:1704 (2005). [cited by applicant]
Assad et al. The quadratic minimum spanning tree problem. Naval Research Logistics 39:399-417 (1992). [cited by applicant]
Babbush et al. Resource Efficient Gadgets for Compiling Adiabatic Quantum Optimization Problems. arXiv:1307.8041v1 [quant-ph] (pp. 1-11) (Jul. 2013) Retrieved from the Internet: (https://arxiv.org/pdf/1307.8041.pdf5). [cited by applicant]
Babbush. Towards Viable Quantum Computation for Chemistry, 2015, [Retrieved on Feb. 27, 2020]. Retrieved from the internet: < url: < a=““href=”https://pdfs.sennanticscholar.org/aff0/5ecf5f58c2206c923b767d76bed7f43b2a66.… [cited by applicant]
Barends et al. Digitized adiabatic quantum computing with a superconducting circuit. Nature 534(7606):222-226 (2016). [cited by applicant]
Bartak et al. Constraint Satisfaction Techniques for Planning and Scheduling Problems (Coplas-15), Jul. 6, 2015. Retrieved on Nov. 17, 2019 at https://www.cs.bgu.ac.il/-icapsl5/workshops/Proceedings%2000PLAS%202015.pdf … [cited by applicant]
Beasley. Integer programming solution methods. Available at URL: http://people.brunel.ac.uk/-mastjb/jeb/natcor_ip_rest.pdf (20 pgs.) (2011). [cited by applicant]
Berry et al. Simulating Hamiltonian dynamics with a truncated Taylor series. Phys Rev Lett 114(9):090502 (2015). [cited by applicant]
Bertoni et al. Quantum logic gates based on coherent electron transport in quantum wires. Physical Review Letters 84(25):5912 (2000). [cited by applicant]
Bian et al. The Ising model: teaching an old problem new tricks. D-Wave Systems 2 (32 pgs.) (2010). [cited by applicant]
Boros et al. On quadratization of pseudo-Boolean functions. arXiv:1404.6538v1 [math.OC] (11 pgs.) (2014). [cited by applicant]
Boros et al. Pseudo-boolean optimization. Discrete Applied Mathematics 123(1):155-225 (2002). [cited by applicant]
Bravyi et al. Fermionic quantum computation. arXiv:quant-ph/0003137 (2000). [cited by applicant]
Buren. An Introduction to Quantum Computing using Cavity QED concepts. arXiv preprint arXiv:1210.6512 (2012). [cited by applicant]
Byrnes et al. Macroscopic quantum computation using Bose-Einstein condensates. arXiv preprint quantum-ph/1103.5512 (2011). [cited by applicant]
Cai et al. A practical heuristic for finding graph minors.arXiv:1406.2741 [quant-ph] (16 pgs) (2014). [cited by applicant]
Carrasquilla. Machine learning for quantum matter. https://arxiv.org/pdf/2003.11040.pdf (2020). [cited by applicant]
Choi. Minor-embedding in adiabatic quantum computation: I. The parameter setting problem. Quantum Information Processing 7(5):193-209 (2008). [cited by applicant]
Clarke et al. Superconducting quantum bits. Nature 453(7198):1031 (2008). [cited by applicant]
Conway et al. An FPGA-based instrumentation platform for use at deep cryogenic temperatures. arxiv.org/abs/1509.06809 (2015). [cited by applicant]
Co-pending U.S. Appl. No. 16/809,473, filed Mar. 4, 2020. [cited by applicant]
Co-pending U.S. Appl. No. 16/811,479, filed Mar. 6, 2020. [cited by applicant]
Co-pending U.S. Appl. No. 16/888,446, filed May 29, 2020. [cited by applicant]
Co-pending U.S. Appl. No. 16/896,032, filed Jun. 8, 2020. [cited by applicant]
Cory et al. Nuclear magnetic resonance spectroscopy: an experimentally accessible paradigm for quantum computing. arXiv preprint quant-ph/97090 01(1997). [cited by applicant]
Cramer et al. Efficient quantum state tomography, Nature Communications 1:149 (2010). [cited by applicant]
Deutsch et al. Quantum computing with neutral atoms in an optical lattice. arXiv preprint quant-ph/0003022 (2000). [cited by applicant]
Durr et al. A Quantum Algorithm for Finding the Minimum. arXiv:quant-ph/9607014 (1996). [cited by applicant]
Dwave, Reverse Quantum Annealing for Local Refinement of Solutions, D-Wave Whitepaper Series, Nov. 9, 2017. Retrieved online on Aug. 14, 2019 from https://www.dwavesys.com/sites/default/files/14-1018A-A_Reverse_Quantum_… [cited by applicant]
Farhi et al. A Quantum Approximate Optimization Algorithm. arXiv:1411.4028 (2014). [cited by applicant]
Farhi et al. Quantum Adiabatic Evolution Algorithms versus Simulated Annealing.arXiv.org:quant ph/0201031 pp. 1-16 (2002). [cited by applicant]
Farhi et al. Quantum computation by adiabatic evolution. arXiv preprint quant-ph/0001106 (24 pgs) (2000). [cited by applicant]
Fedichkin et al. Novel coherent quantum bit using spatial quantization levels in semiconductor quantum dot. arXiv preprint quant-ph/0006097 (2000). [cited by applicant]
Fedorov et al. Exploring chemistry with the fragment molecular orbital method. Physical Chemistry Chemical Physics 14:7562-7577 (2012). [cited by applicant]
Freund. Applied Lagrange Duality for Constrained Optimization. Massachusetts Institute of Technology (pp. 1-35) (2004). [cited by applicant]
Geoffrion. Lagrangean relaxation for integer programming. Mathematics Programming Study 2, North-Holland Publishing Company (pp. 1-34) (1974). [cited by applicant]
Glover et al. Polynomial unconstrained binary optimisation Part 1, 2011, [Retrieved on Feb. 27, 2020]. Retrieved from the internet: < url: < a=““href=”http://leedsfaculty.colorado.edu/glover/fred%20pubs/424%20%20%20Poly… [cited by applicant]
Greene et al. Simulated annealing without rejected moves. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 5(1):221-228 (1986). [cited by applicant]
Grover. A fast quantum mechanical algorithm for database search. Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (pp. 212-219) (1996). [cited by applicant]
Harneit. Spin Quantum Computing with Endohedral Fullerenes. arXiv preprint arXiv:1708.092 98 (2017). [cited by applicant]
Hukushima et al. Exchange Monte Carlo Method and Application to Spin Glass Simulations. Journal of the Physical Society of Japan 65:1604 (1996). [cited by applicant]
Imamog et al. Quantum information processing using quantum dot spins and cavity QED. arXiv preprint quant-ph/9904096 (1999). [cited by applicant]
Ishikawa. Transformation of General Binary MRF Minimization to the First-Order Case. IEEE Transactions on Pattern Analysis and Machine Intelligence. 33(6):1234-1249 (2011). [cited by applicant]
Johnson et al. Quantum annealing with manufactured spins. Nature 473(7346):194-198 (2011). [cited by applicant]
Jordan. Fast Quantum Algorithm for Numerical Gradient Estimation. Physical Review Letters 95:050501 (2015). [cited by applicant]
Kane. A silicon-based nuclear spin quantum computer. Nature 393(6681):133 (1998). [cited by applicant]
Karimi et al. A subgradient approach for constrained binary programming via quantum adiabatic evolution. arXiv preprint arXiv:1605.09462 (16 pgs.) (2016). [cited by applicant]
Karimi et al. Boosting quantum annealer performance via quantum persistence. Online publication eprint arXiv:1606.07797 (6/27/ 27 and updated Aug. 30, 2016). Accessed May 17, 2017 and available from https://www.arxiv.or… [cited by applicant]
Katzgraber et al. Seeking quantum speedup through spin glasses: the good, the bad, and the ugly. Physical Review 5(3):031026 (2015). [cited by applicant]
Kellerer et al. Knapsack Problems. Springer (15 pgs.) (2004). [cited by applicant]
Kielpinski et al. Architecture for a large-scale ion-trap quantum computer. Nature 417(6890):709 (2002). [cited by applicant]
Kirkpatrick et al. Optimization by simulated annealing. Science 220:671-680 (1983). [cited by applicant]
Kitaura et al. Fragment molecular orbital method: an approximate computational method for large molecules. Chemical Physics Letters 313(3-4):701-706 (1999). [cited by applicant]
Knill et al. Efficient linear optics quantum computation. arXiv preprint quant-ph/0006088 (2000). [cited by applicant]
Knizia et al. Density Matrix Embedding: a Simple Alternative to Dynamical Mean-Field Theory. Phys Rev Lett 109:186404 (2012). [cited by applicant]
Kobayashi et al. Chapter 5: Divide-and-conquer approaches to quantum chemistry: Theory and implementation, in Linear-Scaling Techniques in Computational Chemistry and Physics: Methods and Applications, edited by Zalesny… [cited by applicant]
Kokail et al. Self-verifying variational quantum simulation of lattice models. Nature 569(7756):355-360 (2019). [cited by applicant]
Konda et al. Actor-Critic Algorithms. Advances in Neural Information Processing Systems. pp. 1008-1014 (2000). [cited by applicant]
Leuenberger et al. Quantum computing in molecular magnets. arXiv preprint cond-mat/0011415 (2001). [cited by applicant]
Levit et al. Free energy-based reinforcement learning using a quantum processor. Available at https://arxiv.org/pdf/1706.00074.pdf (May 2017) (8 pgs.). [cited by applicant]
Leyffer. Deterministic Methods for Mixed Integer Nonlinear Programming. University of Dundee (pp. 1-60 and pp. 1-58) (1993). [cited by applicant]
Li et al. Nonlinear Integer Programming. New York, NY (pp. 1-452) (2006). [cited by applicant]
Lyon. Spin-based quantum computing using electrons on liquid helium. arXiv preprint cond-mat/030158 1 (2006). [cited by applicant]
Martinis et al. Rabi oscillations in a large Josephson-junction qubit. Physical Review Letters 89:117901 (2002). [cited by applicant]
Marx et al. Chapter 1. Setting the stage: why ab initio molecular dynamics? In Ab Initio Molecular Dynamics: Basic Theory and Advanced Methods. Cambridge, UK Cambridge University Press (pp. 1-8) (2009). [cited by applicant]
Matsuura et al. VanQver: The Variational and Adiabatically Navigated Quantum Eigensolver. New Journal of Physics 22:053023 (2020). [cited by applicant]
McClean et al. The Theory of Variational Hybrid Quantum-Classical Algorithms, Institute of Physics. New Journal of Physics 18:023023. Retrieved online on Aug. 14, 2019 from https://iopscience.iop.org/article/10.1088/136… [cited by applicant]
McGeoch et al. Experimental Evaluation of an Adiabatic Quantum System for Combinatorial Optimization. Computing Frontiers. Proceeding CF '13 Proceedings of the ACM International Conference on Computing Frontiers. Articl… [cited by applicant]
McKiernan et al. Automated quantum programming via reinforcement learning for combinatorial optimization. Quantum Physics. arXiv.org quant-ph arXiv:1908.08054 (2019). [cited by applicant]
Metz. IBM Is Now Letting Anyone Play With Its Quantum Computer. WIRED. (5 pgs.) (May 2016). [cited by applicant]
Mnih et al. Asynchronous Methods for Deep Reinforcement Learning, in International Conference on Machine Learning, pp. 1928-1937 (2016). [cited by applicant]
Mnih et al. Playing Atari with Deep Reinforcement Learning. arXiv:1312.5602 (2013). [cited by applicant]
Montanaro. Quantum walk speedup of backtracking algorithms. arXiv:1509.02374v2 [quant-ph] (23 pgs) (2015). [cited by applicant]
Nafradi et al. Room temperature manipulation of long lifetime spins in metallic-like carbon nanospheres. Nat Commun 7:12232 (2016). [cited by applicant]
Nizovtsev et al. A quantum computer based on NV centers in diamond: optically detected nutations of single electron and nuclear spins. Optics and spectroscopy 99(2):233-244 (2005). [cited by applicant]
O'Gorman et al. Compiling planning into quantum optimization problems: a comparative study. Proc. of the Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAS-15) (pp. 11-20) (Jun. … [cited by applicant]
Ohlsson et al. Quantum computer hardware based on rare-earth-ion-doped inorganic crystals. Optics Communications 201(1-3):71-77 (2002). [cited by applicant]
O'Malley et al. Scalable Quantum Simulation of Molecular Energies. Phys. Rev. X 6:031007 (2016). [cited by applicant]
Orus. Tensor networks for complex quantum systems. Nature Reviews Physics 1:538 (2019). [cited by applicant]
PCT/CA2017/050320 International Search Report and Written Opinion dated Jun. 27, 2017. [cited by applicant]
PCT/CA2017/050637 International Search Report and Written Opinion dated Aug. 25, 2017. [cited by applicant]
PCT/CA2017/050709 International Search Report and Written Opinion dated Sep. 19, 2017. [cited by applicant]
PCT/CA2017/051610 International Search Report and Written Opinion dated Mar. 21, 2018. [cited by applicant]
PCT/CA2018/051531 International Search Report and Written Opinion dated Feb. 20, 2019. [cited by applicant]
PCT/CA2018/051534 International Search Report and Written Opinion dated Feb. 21, 2019. [cited by applicant]
PCT/CA2019/050852 International Search Report and Written Opinion dated Aug. 15, 2019. [cited by applicant]
PCT/CA2019/051752 International Search Report and Written Opinion dated Mar. 17, 2020. [cited by applicant]
PCT/CA2020/050641 International Search Report and Written Opinion dated Jul. 21, 2020. [cited by applicant]
PCT/IB2017/051038 International Search Report dated May 16, 2017. [cited by applicant]
PCT/IB2017/051224 International Search Report dated May 18, 2017. [cited by applicant]
Peruzzo et al. A variational eigenvalue solver on a quantum processor. arXiv:1304.3061 (2013). [cited by applicant]
Preskill. Quantum Computing in the NISQ era and beyond. Quantum 2:79 arXiv:1801.00862 (2018). [cited by applicant]