Minor-embedding heuristics for large-scale annealing processors with sparse hardware graphs of up to 102,400 nodes
- 16 January 2021
- journal article
- research article
- Published by Springer Science and Business Media LLC in Soft Computing
- Vol. 25 (3), 1731-1749
- https://doi.org/10.1007/s00500-020-05502-6
Abstract
No abstract availableKeywords
This publication has 40 references indexed in Scilit:
- Faster parameterized algorithms for minor containmentTheoretical Computer Science, 2011
- Quantum annealing with manufactured spinsNature, 2011
- Treewidth Lower Bounds with BramblesAlgorithmica, 2007
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete ProblemScience, 2001
- Quantum annealing in the transverse Ising modelPhysical Review E, 1998
- Introduction to AlgorithmsJournal of the Operational Research Society, 1991
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- Optimization by Simulated AnnealingScience, 1983
- S-functions for graphsJournal of Geometry, 1976