IP Library › Granted Patent US 12,254,418
Granted Patent B2
US 12,254,418 · App. 18/126,566 · Granted Mar 18, 2025

Systems and methods for heuristic algorithms with variable effort parameters

Inventors: Pau Farré Pérez (Vancouver, CA); Jack R. Raymond (Vancouver, CA)
Assignee: D-WAVE SYSTEMS INC.
G06N5/01G06F9/44505G06N10/40
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,254,418
App. No.
18/126,566
Granted
Mar 18, 2025
Kind
B2
Abstract

A heuristic solver is wrapped in a meta algorithm that will perform multiple sub-runs within the desired time limit, and expand or reduce the effort based on the time it has taken so far and the time left. The goal is to use the largest effort possible as this typically increases the probability of success. In another implementation, the meta algorithm iterates the time-like parameter from a small value, and determine the next test-value so as to minimize time to target collecting data at large effort only as necessary. The meta algorithm evaluates the energy of the solutions obtained to determine whether to increase or decrease the value of the time-like parameter. The heuristic algorithm may be Simulated Annealing, the heuristic algorithm may run on a quantum processor, including a quantum annealing processor or a gate-model quantum processor.

Claims (24)

1. A method to improve operation of a computing system for solving a computational problem using a heuristic algorithm, the computing system comprising a digital processor communicatively coupled to a quantum processor that comprises a plurality of qubits, the heuristic algorithm performed by the quantum processor and an amount of computational effort and/or resources used therefor adaptively adjusted based on an amount of time left in a preset run-time of thereof, the heuristic algorithm having at least one effort parameter and a running time, wherein the effort parameter is determinant of an amount of computational work performed and contributes to a length of time used to solve the computational problem, the method comprising:

initializing, by the digital processor, parameters of a meta-algorithm, including at least initialization of a value of the at least one effort parameter of the heuristic algorithm to a first value;

running the meta-algorithm, wherein running the meta-algorithm comprises:

iteratively, until a running time of the heuristic algorithm reaches a time-limit value:

determining, by the digital processor, whether an evaluation criterion has been met, wherein the evaluation criterion is based on the running time and the time-limit value;

adaptively adjusting, by the digital processor, the effort parameter of the heuristic algorithm to an adjusted value, wherein a direction of the adjustment of the effort parameter is based on a result of the determination of whether the evaluation criterion has been met, and

running, by at least the quantum processor, the heuristic algorithm with the adjusted value of the at least one effort parameter to obtain a solution set of a plurality of solution sets to the computational problem, wherein the running the heuristic algorithm comprises application of at least one bias signal to the plurality of qubits of the quantum processor to cause performance of quantum computation, and wherein a current solution set of the plurality of solution sets is based on final states of the plurality of qubits as a result of the quantum computation;

and,

returning the plurality of solution sets to the computational problem once the running time of the heuristic algorithm reaches the time-limit value.

2. The method of claim 1 wherein:

the initializing parameters of a meta-algorithm further comprises: initializing the time-limit value, and initializing a value of an effort multiplier, wherein the value of the effort multiplier is greater than one; and,

determining whether an evaluation criterion has been met, wherein the evaluation criterion is based on the running time and the time-limit value comprises, includes: determining whether a value of the running time is less than a quotient of the time-limit value and the value of the effort multiplier.

3. The method of claim 2 , wherein, in response to a determination that the evaluation criterion has been met:

the adaptively adjusting the effort parameter of the heuristic algorithm to an adjusted value comprises: setting the value of the at least one effort parameter to a product of the value of the at least one effort parameter and the value of the effort multiplier; and,

the running, by at least the quantum processor, the heuristic algorithm with the adjusted value of the effort parameter comprises: running the heuristic algorithm with the adjusted value of the at least one effort parameter to increase the amount of computational effort and/or resources used therefor.

4. The method of claim 2 wherein, wherein, in response to a determination that the evaluation criterion has not been met:

the adaptively adjusting the effort parameter of the heuristic algorithm to an adjusted value comprises: setting the value of the at least one effort parameter to a quotient of the value of the at least one effort parameter and the effort multiplier; and,

the running, by at least the quantum processor, the heuristic algorithm with the adjusted value of the effort parameter comprises: running the heuristic algorithm with the adjusted value of the at least one effort parameter to decrease the amount of computational effort and/or resources used therefor.

5. The method of claim 2 , wherein:

the initializing parameters of a meta-algorithm further comprises: initializing a value of a time-per-effort factor; and,

in response to a determination that the evaluation criterion has not been met, the adaptively adjusting the effort parameter of the heuristic algorithm to an adjusted value comprises: setting the value of the at least one effort parameter to a value of a remaining running time divided by the value of a time-per-effort factor and divided by the value of the effort multiplier, wherein the value of the remaining running time is a difference between the time-limit value and a current running time.

6. The method of claim 1 , wherein the running, by at least the quantum processor, the heuristic algorithm with the adjusted value of the effort parameter to obtain a solution set of a plurality of solution sets to the computational problem includes running, by at least the quantum processor, at least one of: a Quantum Annealing algorithm and a Quantum Approximate Optimization Algorithm.

7. The method of claim 1 , wherein the initializing, by the digital processor, parameters of a meta-algorithm, including at least initialization of a value of the at least one effort parameter of the heuristic algorithm to a first value comprises: initializing a value of at least one of: an annealing time, a circuit depth, and a number of gate operations.

8. The method of claim 1 , wherein the running, by at least the quantum processor, the heuristic algorithm with the adjusted value of the effort parameter to obtain a solution set of a plurality of solution sets to the computational problem comprises: causing the plurality of qubits in the quantum processor to undergo quantum evolution from a first set of states to the final set of states, the final set of states being the current solution set of the plurality of the solution sets to the computational problem.

Assignments (3)
RELEASE OF SECURITY INTEREST Recorded Mar 11, 2025
From: PSPIB UNITAS INVESTMENTS II INC.
To: D-WAVE SYSTEMS INC.; 1372934 B.C. LTD.
Reel/Frame 070470/0098 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 12, 2025
From: FARRÉ PÉREZ, PAU; RAYMOND, JACK R.
To: D-WAVE SYSTEMS INC.
Reel/Frame 070192/0142 →
INTELLECTUAL PROPERTY SECURITY AGREEMENT (PROJECT INTELLECTUAL PROPERTY) Recorded Jul 7, 2023
From: D-WAVE SYSTEMS INC
To: PSPIB UNITAS INVESTMENTS II INC., AS COLLATERAL AGENT
Reel/Frame 064235/0051 →
Continuity (2)
Provisional Application 63324721 · Mar 29, 2022
Related Publication 20230316094A1 · Oct 5, 2023
References Cited (224)
US 5134685A · Rosenbluth · 1992 [cited by examiner]
US 5308931A · Griffen · 1994 [cited by examiner]
US 5416851A · Huttenlocher · 1995 [cited by examiner]
US 5510995A · Oliver · 1996 [cited by examiner]
US 5548697A · Zortea · 1996 [cited by examiner]
US 6389374B1 · Jain · 2002 [cited by examiner]
US 6487310B1 · Bishop · 2002 [cited by examiner]
US 6490572B2 · Akkiraju et al. · 2002 [cited by applicant]
US 6578018B1 · Ulyanov · 2003 [cited by applicant]
US 6597660B1 · Rueda · 2003 [cited by examiner]
US 6838694B2 · Esteve et al. · 2005 [cited by applicant]
US 6904421B2 · Shetty · 2005 [cited by applicant]
US 6922713B2 · Walster et al. · 2005 [cited by applicant]
US 7003739B2 · Gasanov et al. · 2006 [cited by applicant]
US 7335909B2 · Amin et al. · 2008 [cited by applicant]
US 7533068B2 · Maassen et al. · 2009 [cited by applicant]
US 7619437B2 · Thom et al. · 2009 [cited by applicant]
US 7624088B2 · Johnson et al. · 2009 [cited by applicant]
US 7800395B2 · Johnson et al. · 2010 [cited by applicant]
US 7843209B2 · Berkley · 2010 [cited by applicant]
US 7844656B2 · Macready et al. · 2010 [cited by applicant]
US 7870087B2 · Macready et al. · 2011 [cited by applicant]
US 7876248B2 · Berkley et al. · 2011 [cited by applicant]
US 7877333B2 · Macready · 2011 [cited by applicant]
US 7898282B2 · Harris et al. · 2011 [cited by applicant]
US 7899852B2 · Amin · 2011 [cited by applicant]
US 8098179B2 · Bunyk et al. · 2012 [cited by applicant]
US 8139656B2 · Shental et al. · 2012 [cited by applicant]
US 8169231B2 · Berkley · 2012 [cited by applicant]
US 8175995B2 · Amin · 2012 [cited by applicant]
US 8190548B2 · Choi · 2012 [cited by applicant]
US 8195596B2 · Rose et al. · 2012 [cited by applicant]
US 8195726B2 · Macready et al. · 2012 [cited by applicant]
US 8229863B2 · Amin et al. · 2012 [cited by applicant]
US 8244650B2 · Rose · 2012 [cited by applicant]
US 8244662B2 · Coury et al. · 2012 [cited by applicant]
US 8446842B2 · Cao et al. · 2013 [cited by applicant]
US 8494993B2 · Harris et al. · 2013 [cited by applicant]
US 8536566B2 · Johansson et al. · 2013 [cited by applicant]
US 8560282B2 · Love et al. · 2013 [cited by applicant]
US 8611974B2 · Maibaum et al. · 2013 [cited by applicant]
US 8700689B2 · Macready et al. · 2014 [cited by applicant]
US 8892857B2 · Ozols et al. · 2014 [cited by applicant]
US 8977576B2 · Macready · 2015 [cited by applicant]
US 8996846B2 · Laine · 2015 [cited by examiner]
US 9015215B2 · Berkley et al. · 2015 [cited by applicant]
US 9026574B2 · Macready et al. · 2015 [cited by applicant]
US 9037598B1 · Morton · 2015 [cited by examiner]
US 9178154B2 · Bunyk · 2015 [cited by applicant]
US 9218567B2 · Macready et al. · 2015 [cited by applicant]
US 9396440B2 · Macready et al. · 2016 [cited by applicant]
US 9501747B2 · Roy · 2016 [cited by applicant]
US 9647662B1 · Abutaleb et al. · 2017 [cited by applicant]
US 10275422B2 · Israel et al. · 2019 [cited by applicant]
US 10769545B2 · Amin et al. · 2020 [cited by applicant]
US 11138511B2 · Yarkoni et al. · 2021 [cited by applicant]
US 20010034588A1 · Agrawals · 2001 [cited by examiner]
US 20020152057A1 · Wang · 2002 [cited by examiner]
US 20020157009A1 · Yamamoto et al. · 2002 [cited by applicant]
US 20020188438A1 · Knight et al. · 2002 [cited by applicant]
US 20030140019A1 · Gutta et al. · 2003 [cited by applicant]
US 20050021583A1 · Andrzejak et al. · 2005 [cited by applicant]
US 20050066301A1 · Lorenz et al. · 2005 [cited by applicant]
US 20050096884A1 · Fishkin · 2005 [cited by examiner]
US 20050097286A1 · Karlsson · 2005 [cited by examiner]
US 20050273306A1 · Hilton et al. · 2005 [cited by applicant]
US 20060075365A1 · Hershenson et al. · 2006 [cited by applicant]
US 20060101236A1 · Han · 2006 [cited by applicant]
US 20060123363A1 · Williams et al. · 2006 [cited by applicant]
US 20060151775A1 · Hollenberg et al. · 2006 [cited by applicant]
US 20060259283A1 · Brughmans et al. · 2006 [cited by applicant]
US 20070179760A1 · Smith · 2007 [cited by applicant]
US 20080052055A1 · Rose et al. · 2008 [cited by applicant]
US 20080085043A1 · Watanabe · 2008 [cited by examiner]
US 20080238531A1 · Harris · 2008 [cited by applicant]
US 20080243735A1 · Rish · 2008 [cited by examiner]
US 20080306903A1 · Larson · 2008 [cited by examiner]
US 20080313430A1 · Bunyk · 2008 [cited by applicant]
US 20080319964A1 · Coury et al. · 2008 [cited by applicant]
US 20090070402A1 · Rose et al. · 2009 [cited by applicant]
US 20090118970A1 · Daum et al. · 2009 [cited by applicant]
US 20110153254A1 · Hartov · 2011 [cited by examiner]
US 20130067181A1 · Boldyrev et al. · 2013 [cited by applicant]
US 20140223224A1 · Berkley · 2014 [cited by examiner]
US 20140297247A1 · Troyer et al. · 2014 [cited by applicant]
US 20150040107A1 · Iyer · 2015 [cited by examiner]
US 20150269489A1 · Buhler · 2015 [cited by examiner]
US 20160019267A1 · Kala · 2016 [cited by examiner]
US 20190095799A1 · Lidar · 2019 [cited by examiner]
US 20190124530A1 · McKibben · 2019 [cited by applicant]
US 20190312800A1 · Schibler · 2019 [cited by examiner]
US 20200393798A1 · Kushibe · 2020 [cited by examiner]
US 20210241866A1 · Bhattacharya · 2021 [cited by examiner]
WO 0167186A1 · 2001 [cited by applicant]
WO 2005093649A1 · 2005 [cited by applicant]
WO 2007085074A1 · 2007 [cited by applicant]
WO 2008138100A1 · 2008 [cited by applicant]
WO 2009120638A2 · 2009 [cited by applicant]
Aonishi, et al., “Statistical mechanics of CDMA multiuser detector implemented in coherent lssing machine”, Journal of Applied Physics, 124, 233102 (2008), 10 pages. [cited by applicant]
Kadin, et al., “Effects of Superconducting Return Currents on RSFQ Circuit Performance”, IEEE Transactions on Applied Superconductivity, vol. 15 No. Jun. 2, 2005, 4 pages. [cited by applicant]
Otsubo, et al., “Code-division multiple-access multiuser demodulator by using quantum fluctuations”, Physical Review E 90, 012126 (2014), 16 pages. [cited by applicant]
Pinheiro, et al., “Magnetic flux avalanches in Nb/NbN thin films”, Low Temp. Phys. 46, 365 (2020), 8 pages. [cited by applicant]
Raymond, et al., “Sparsely-Spread CDMA—a statistical mechanics based analysis.”, PACS Nos. 64.60.cu, 75.10 Nr, 84.40.Ua, 89.70.+c. [cited by applicant]
Zhang, et al., “Quantum internet using code division multiple access”, Scientific Reports, 3:2211, DOI: 10.1038/srep02211, 2013, 7 pages. [cited by applicant]
Baranwal, et al., “Distributed Optimization in Fixed-Time”, arXiv:1905.10472vcs.SY] May 24, 2019, 14 pages. [cited by applicant]
Juan, et al., “Using Mutli-Start Randomized Heuristics to solve Non-Smooth and Non-Convex Optimization Problems”, Conference on Numerical Optimization and Applications in Engineering, Oct. 12-15, 2010, 278 pages. [cited by applicant]
Mitra, et al., “Convergence and Finite-Time Behavior of Simulated Annealing”, Memorandum No. UCB/ERL M85/23, Mar. 20, 1985. [cited by applicant]
Non-Final Office Action Issued in U.S. Appl. No. 16/936,742, mailed Oct. 25, 2023, 13 pages. [cited by applicant]
Strauss, “Forward and backward time observables for quantum evolution and quantum stochastic processes—I: The time observables”, arXiv:0706.0268v1 [math-ph] Jun. 2, 2007, 26 pages. [cited by applicant]
Zeeshan, et al., “Meta-heuristic approach for the conceptual design and optimization of multistage interceptor”, 18th World IMACS / MODSIM Congress, Cairns, Australia Jul. 13-17, 2009 http://mssanz.org.au/modsim09, 7 pa… [cited by applicant]
Mulligan, et al., “Designing Peptides on a Quantum Computer”, bioRxiv preprint first posted online Sep. 2, 2019; doi: http://dx.doi.org/10.1101/752485, 20 pages. [cited by applicant]
Kasi, et al., “A Cost and Power Feasibility Analysis of Quantum Annealing for NextG Cellular Wireless Networks”, arXiv:2109.01465v3 [cs.NI] Jan. 14, 2022, 14 pages. [cited by applicant]
Kasi, et al., “Towards Quantum Belief Propagation for LDPC Decoding in Wireless Networks”, arXiv:2007.11069v2 [cs.NI] Sep. 19, 2020, 14 pages. [cited by applicant]
Kim, et al., “Physics-Inspired Heuristics for Soft MIMO Detection in 5G New Radio and Beyond”, arXiv:2103.10561v1 [cs.NI] Mar. 18, 2021. [cited by applicant]
Raymond, et al., “Improving performance of logical qubits by parameter tuning and topology compensation”, arXiv:2006.04913v2 [quant-ph] Aug. 6, 2020, 11 pages. [cited by applicant]
“Simulated Annealing” Microsoft Documents, https://docs.microsoft.com/en-us/azure/quantum/optimization-simulated-annealing#parameter-free-simulated-annealing-cpu, Feb. 1, 2021 (retrieved Jun. 22, 2021). [cited by applicant]
Bass, G. et al., “Heterogeneous Quantum Computing for Satellite Constellation Optimization: Solving the Weighted K-Clique Problem”, arXiv:1709.05381v3, May 20, 2018. 17 pages. [cited by applicant]
Burton et al., “Event-Dependent Control of Noise Enhances Learning in Neural Networks,” Neural Networks 5:627-637, 1992. [cited by applicant]
Castro, “Tightening Pieewise McCormick Relaxations for Bilinear Problems”, Computers and Chemical Engineering 72 (2015) 300-311, Apr. 5, 2014. [cited by applicant]
Choi, Vicky. “Minor-embedding in adiabatic quantum computation: I. The parameter setting problem.” arXiv:0804.4884v1. Apr. 30, 2008. [cited by applicant]
Cordella et al., “A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs,” IEEE Transactions on Pattern Analysis and Machine Intelligence 26(10):1367-1372, 2004. [cited by applicant]
Crainic et al., “Extreme Point-Based Heuristics for Three-Dimensional Bin Packing”, CIRRELT, Oct. 2007. [Online]. Available: https://www.cirrelt.ca/documentstravail/cirrelt-2007-41.pdf. [cited by applicant]
Das et al., “Quantum Annealing and Analog Quantum Computation,” arXiv:0801.2193v3, Mar. 24, 2008, 22 pages. [cited by applicant]
Dickson et al., “Thermally Assisted Quantum Annealing of a 16-Qubit Problem,” Nature Communications, 2013, 6 pages. [cited by applicant]
Douglas et al., “Classical approach to the graph isomorphism problem using quantum walks,” arXiv:0705.2531v2, Mar. 26, 2008, 22 pages. [cited by applicant]
Farhi et al., “Quantum Adiabatic Evolution Algorithms with Different Paths,” arXiv:quant-ph/0208135v1, Aug. 21, 2002, 10 pages. [cited by applicant]
Finnila et al., “Quantum Annealing: A New Method for Minimizing Multidimensional Functions,” arXiv:chem-ph/9404003v2, Jun. 3, 1994, 14 pages. [cited by applicant]
Fowler et al., “A Survey of Scheduling With Parallel Batch (p-batch) Processing”, Eurpoean Journal of Operational Research 298 (2022) 1-24, Jun. 19, 2021. [cited by applicant]
Gaitan et al., “Graph isomorphism and adiabatic quantum computing,” arXiv:1304.5773v2, Feb. 12, 2014, 22 pages. [cited by applicant]
Gonacalves et al., “A Biased Random Key Genetic Algorithm for 2D and 3D Bin Packing Problems”, Int. J. Production Economics 145 (2013) 500-510, Apr. 18, 2013. [cited by applicant]
Harris et al., “A Compound Josephson Junction Coupler for Flux Qubits with Minimal Crosstalk,” arXiv:0904.37841 [cond-mat.supr-con] Apr. 24, 2009, 4 pages. [cited by applicant]
Harris et al., “Sign and Magnitude Tunable Coupler for Superconducting Flux Qubits,” arXiv:cond-mat/0608253v1 [cond-mat.supr-con], Aug. 11, 2006. 5 pages. [cited by applicant]
Hen et al., “Probing for Quantum Speedup In Spin Glass Problems with Planted Solutions”, arXiv:1502.01663v3, Nov. 2, 2015. [cited by applicant]
Hen et al., “Solving the Graph Isomorphism Problem with a Quantum Annealer,” arXiv:1207.1712v2, Aug. 8, 2012, 9 pages. [cited by applicant]
Johnson et al., “Quantum annealing with manufactured spins,” Nature 473:194-198, May 12, 2011. [cited by applicant]
Johnson et al., “Supplementary Information: Quantum annealing with manufactured spins,” Nature 473:s1-s20, May 12, 2011. [cited by applicant]
Kadowaki et al., “Quantum Annealing in the Transverse Ising Model,” arXiv:cond-mat/9804280v1, Apr. 25, 1998, 23 pages. [cited by applicant]
Lu et al., “Imbalance in the Cloud: an Analysis on Alibaba Cluster Tree”, 2017 IEEE International Conference on Big Data, 2017. [cited by applicant]
Lucas, “Ising formulations of many NP problems,” Frontiers in Physics 2:Article 5, Feb. 12, 2014, 15 pages. [cited by applicant]
Maasen van den Brink et al., “Mediated Tunable Coupling of Flux Qubits,” New Journal of Physics 7(230) 2005, 19 pages. [cited by applicant]
Makhlin et al., “Quantum-state engineering with Josephson-junction devices,” arXlv:cond-mat/0011269v1, Nov. 15, 2000 Reviews of Modern Physics 73(2):357-400, Apr. 2001. [cited by applicant]
Maryak et al., “Efficient Global Optimization Using SPSA,” Proceedings of the American Control Conference, San Diego, California, Jun. 1999, 5 pages. [cited by applicant]
Morita, “Faster Annealing Schedules for Quantum Annealing,” Journal of the Physical Society of Japan 76(10): Article 104001, Oct. 2007, 4 pages. [cited by applicant]
Nielsen et al., “7.8 Other implementation schemes,” in Quantum Computation and Quantum Information, 1st ed., Cambridge University Press, Cambridge, 2000, pp. 343-345. [cited by applicant]
Paquay, “A Mixed Integer Programming Formulation for the Three Dimensional Bin Packing Problem Deriving from an Air Cargo Application”, Jun. 3, 2014. [cited by applicant]
Pfau et al., “Connecting Generative Adversarial Networks and Actor-Critic Methods”, arXiv:1610.01945v3, Jan. 18, 2017. [cited by applicant]
Rujan, P., “Searching for Optimal Configurations by Simulated Tunneling,” Z. Phys. B—Condensed Matter, 73:391-416, 1988. [cited by applicant]
Ullman, “An Algorithm for Subgraph Isomorphism,” Journal of the Association for Computing Machinery 23(1):31-42, Jan. 1976. [cited by applicant]
Van Dongen et al., “Metric Distances Derived from Cosine Similarity and Pearson and Spearman Correlations”, arXiv:1208.3145v1, Aug. 14, 2012. [cited by applicant]
Venturelli et al., “Quantum Annealing Implementation of Job-Shop Scheduling,” arXiv:1506.08479v1 [quant-ph] Jun. 29, 2015, 16 pages. [cited by applicant]
Vinci et al., “Hearing the Shape of the Ising Model with a Programmable Superconducting-Flux Annealer,” arXiv:1307.1114v2, Sep. 17, 2014, 13 pages. [cited by applicant]
Wang et al., “Research and Implementation of Scheduling Strategy in Kubernetes for Computer Science Laboratory in Universities”, Information 2021. [Online]. Available: https://doi.org/10.3390/info12010016. [cited by applicant]
Wikipedia, “K-d tree”, Oct. 13, 2022. [cited by applicant]
Gallop , et al., “SQUIDs and their applications,” Journal of Physics E: Scientific Instruments 9(6):417-429, 1976. [cited by applicant]
Ibrahim, Zuwairie , “Solving Unconstraint Assignment Problem by a Molecular-Based Computing Algorithm”, IEEE, 2004 (Year: 2004). [cited by applicant]
Kleiner , et al., “Superconducting Quantum Interference Devices: State of the Art and Applications,” Proceedings of the IEEE 92(10): 1534-1548, 2004. [cited by applicant]
Teller, Carston , “Functional nucleic acid nanostructures and DNA machines”, Science Direct, 2010 (Year: 2010). [cited by applicant]
Zhu, Zheng , et al., “Efficient Cluster Algorithm for Spin Glasses in Any Space Dimension”, arXiv:1501.05630v2 [cond-mat.dis-nn] Aug. 15, 2015, 5 pages. [cited by applicant]
Feld., “A Hybrid Solution Method for the Capacitated Vehicle Routing Problem Using a Quantum Annealer”, Frontiers in ICT, Jun. 2019, vol. 6 Article 13, 13 pages. [cited by applicant]
Goodfellow et al., “Generative Adversarial Nets”, arXiv:1406.2661v1 [stat.ML], 9 pages, Jun. 10, 2014. [cited by applicant]
Syrichas, et al.., “Large-scale vehicle routing problems: Quantum Annealing, tunings and results”, Computers and Operations Research 87 (2017) 52-62. [cited by applicant]
Amin et al., “Thermally assisted adiabatic quantum computation,” arXiv:cond-mat/0609332v2, pp. 1-5, (Mar. 2, 2007) Feb. 1, 2008. [cited by applicant]
Bian et al., “Discrete optimization using quantum annealing on sparse lsing models”, Frontiers in Physics, Sep. 18, 2014. [cited by applicant]
“A High-Level Look at Optimization: Past, Present and Future,” e-Optimization.Community, May 2000, pp. 1-5. [cited by applicant]
Aghael, “A Hybrid Algorithm For Finding Shortest Path in Network Routing” (2005). [cited by applicant]
Ahmad, “5G Technology: Towards Dynamic Spectrum Sharing Using Cognitive Radio Networks” (2020). [cited by applicant]
Aji, “The Generalized Distributive Law and Free Energy Minimization” 2000. [cited by applicant]
Amin et al., “First Order Quantum Phase Transition in Adiabatic Quantum Computation”, arXiv:0904.1387v3, Dec. 15, 2009, 5 pages. [cited by applicant]
Amin et al., “Thermally assisted adiabatic quantum computation,” arXiv:cond-mat/0609332v2, pp. 1-5, (Mar. 2, 2007) Feb. 1, 2006. [cited by applicant]
Amin, “Effect of Local Minima on Adiabatic Quantum Optimization,” arXiv:0709.0528v2, Apr. 4, 2008. [cited by applicant]
Bian, et al., “Discrete optimization using quantum annealing on sparse Ising models”, Frontiers in Physics, Sep. 18, 2014. [cited by applicant]
Bian, et al., “Mapping constrained optimization problems to quantum annealing with application to fault diagnosis”, arXiv:1603.03111v1 [quant-ph] Mar. 10, 2016, 22 pages. [cited by applicant]
Booth, M. et al., “Partitioning Optimization Problems for Hybrid Classical/Quantum Execution,” D-Wave Technical Report, Jan. 9, 2017, 13 pages. [cited by applicant]
Boros, et al., “Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)”, Rutcor Research Report, Feb. 2005. [cited by applicant]
Boros, et al., “Pseudo-Boolean optimization”, Elsevier, Discrete Applied Mathematics, 123 (2002) 155-225. [cited by applicant]
Borzsonyi, et al., “The Skyline Operator” 2001. [cited by applicant]
Burges, “Factoring as Optimization”, 2002. [cited by applicant]
Codato, et al., “Combinatorial Benders' Cuts for Mixed-Integer Linear Programming”, Operations Research, 54(4): 756-766, 2006. [cited by applicant]
Crowley, et al., “Quantum and Classical in Adiabatic Computation”, rXiv:1405.5185v1 [quant-ph] May 20, 2014, 9 pages. [cited by applicant]
DelaFuente Ruiz, “Quantum annealing”, http://www.linkedin.com/in/alfonsofr, 2014, 21 pages. [cited by applicant]
Dolan , et al., “Optimization on the NEOS Server,” from SIAM News 35(6): 1-5, Jul./Aug. 2002. [cited by applicant]
Douglass, et al., “Constructing SAT Filters with a Quantum Annealer, Theory and Applications of Satisfiability Testing—SAT 2015: 18th International Conference”, Austin, TX, Sep. 24-27, 2015, Proceedings, pp. 104-120. Sp… [cited by applicant]
Duchi, “Using Combinatorial Optimization Within Max-Producet Belief Propagation” 2007. [cited by applicant]
D-Wave Network Maximum Independent Set 2020. [cited by applicant]
Farhi et al., “A quantum adiabatic evolution algorithm applied to random instances of an NP-Complete problem”, arXiv: quant-ph/0104129v1 Apr. 26, 2001. [cited by applicant]
Farhi et al., “Quantum Adiabatic Evolution Algorithms versus Simulated Annealing,” MIT-CTP #3228, arXiv:quant-ph/0201031 v1, pp. 1-16, Jan. 8, 2002. [cited by applicant]
Fourer, et al., “Optimization as an Internet Resource,” Interfaces 31(2): 130-150, Mar.-Apr. 2001. [cited by applicant]
Hafenrichter, et al., “Optimization of Relational Preference Queries” 2005. [cited by applicant]
Hao, et al, “Multiple Simulated Annealing-Molecular Dynamics for Conformational Space Search of Peptide and Miniprotein”, Nature.com/scientific reports, DOI: 10.1038/srep15568, 2015, 10 pages. [cited by applicant]
Harris, et al., “Sign and Magnitude Tunable Coupler for Superconducting Flux Qubits”, arXiv:cond-mat/0608253v1, Aug. 11, 2006 2006. [cited by applicant]
Bian , et al., “The Ising Model: teaching an old problem new tricks”, D-wave systems. 2 (year 2010), 32 pages. [cited by applicant]
Dickson, Neil G, et al., “Algorithmic approach to adiabitic quantum optimization”, Physical Review A, arXiv:1108.3303v1 [puant-ph] Aug. 16, 2011, 7 pages. [cited by applicant]
Farhi, Edward , et al., “Quantum Adiabatic Algorithms, Small Gaps, and Different Paths”, Physical Review E, arXiv:0909.4766v2 [quant-ph], Jun. 4, 2010, 45 pages. [cited by applicant]
Hooker et al., “Logic-based Benders Decomposition. Mathematical Programing”, 96:33-60, Apr. 2003. [cited by applicant]
Huang, “Cooperative Optimization for Energy Minimization: A Case Study of Stereo Matching” 2007. [cited by applicant]
Huang, “Deriving the Normalized Min-Sum Algorithm From Cooperative Optimization” 2006. [cited by applicant]
King, Benchmarking a Quantum Annealing Processor With the Time-to-Target Metric 2015. [cited by applicant]
King, et al., “Quantum Annealing Amid Local Ruggedness and Global Frustration” 2017. [cited by applicant]
Knysh, et al., “Quantum Adiabatic Evolution Algorithm and Quantum Phase Transition in 3-Satisfiability Problem” 2006. [cited by applicant]
Kochenberger, et al., “A Unified Modeling and Solution Framework for Combinatorial Optimization Problems” 2004. [cited by applicant]
Kowowski, et al., “Classical Coloring of Graphs” 2004. [cited by applicant]
Kubalik, “Solving the Sorting Network Problem Using Iterative Optimization with Evolved Hypermutations” 2009. [cited by applicant]
Laskari, et al. “Problems of Cryptography as Discrete Optimization Tasks” 2005. [cited by applicant]
Maischberger, “COIN-OR METSlib a Metaheuristics Framework in Modern C++” 2011. [cited by applicant]
Morita, et al., “Quantum-thermal annealing with cluster-flip algorithm”, arXiv:0903.2206v2 [cond-mat.dis-nn] Jun. 8, 2009, 4 pages. [cited by applicant]
Muller, et al., “Faster Min-Max Resource Sharing in Theory and Practice”, Mathematical Programming Computation, 3(1):1-35, 2011. [cited by applicant]
Nesterov, “Primal-dual Subgradient Method for Convex Problems” 2009. [cited by applicant]
Pakzad, et al., “Estimation and Marginalization Using Kikuchi Approximation Methods” 2003. [cited by applicant]
Preisinger, et al., “The BNL++ Algorithm for Evaluation Pareto Preference Queries” 2006. [cited by applicant]
Rei, et al., “Accelerating Benders Decomposition by Local Branching”. Informs Journal on Computing, 21(2):333-345, Spring 2009. [cited by applicant]
Steffen, et al., “Experimental Implementation of an Adiabatic Quantum Optimization”, Physical Review Letters, vol. 90, No. 6. Feb. 14, 2003, 4 pages. [cited by applicant]
Suzuki et al., “Quantum Ferromagnetic Annealing,” Physica E: Low-Dimensional Systems and Nanostructures, 40(2):367-370, Dec. 2007. [cited by applicant]
Tanaka, et al., “Hybrid Quantum Anneal for Clustering Problems”, arXiv:1104.3246v1 [cond-mat.dis-nn] Apr. 16, 2011, 24 pages. [cited by applicant]
VanDenBrink, “Mediated Tunable Coupling of Flux Qubits”, New Journal of Physics 7 (2005) 230, Nov. 7, 2005. [cited by applicant]
Vinci, et al., “Distinguishing Classical and Quantum Models for the D-Wave Device”, arXiv:1403.4228v1 [quant-ph] Mar. 17, 2014, 29 pages. [cited by applicant]
Wu, The Theory and Applications of Discrete Constrained Optimization Using Lagrance Multipliers 2000. [cited by applicant]
Xu, et al., “Multicanonical Jump Walk Annealing: An Efficient Method for Geometric Optimization”, Journal of Chemical Physics, vol. 112, No. 6, Feb. 8, 2000. [cited by applicant]
Yedida, et al., “Message-Passing Algorithms for Inference and Optimization”, Journal of Statistical Physics, 145(4):860-890, 2011. [cited by applicant]
Yedidia, et al., “Constructing Free Energy Approximations and Generalized Belief Propagation Algorithms” 2002. [cited by applicant]
Zhang, “Discovering Strong Skyline Points in High Dimensional Spaces” 2005. [cited by applicant]
Zhu, et al., “Efficient Cluster Algorithms For Spin Glasses in Any Space Dimension”, arXiv:1501.05630v2 [cond-mat. dis-nn] Aug. 15, 2015. [cited by applicant]
Zick et al., “Experimental Quantum Annealing: Case Study Involving the Graph Isomorphism Problem” 2015. [cited by applicant]
Kurihara, et al. “Quantum Annealing for Clustering”, arXiv:0905.3527v2 [cond-mat.dis-nn], May 28, 2009, pp. 1-9. [cited by applicant]
Ronnow, et al., “Defining and detecting quantum speedup”, arXiv:1401.2910v1 [quant-ph] Jan. 13, 2014, 15 pages. [cited by applicant]