Algorithm engineering for a quantum annealing platform
Not on the map. Why?
Abstract (arXiv)
Recent advances bring within reach the viability of solving combinatorial problems using a quantum annealing algorithm implemented on a purpose-built platform that exploits quantum properties. However, the question of how to tune the algorithm for most effective use in this framework is not well understood. In this paper we describe some operational parameters that drive performance, discuss approaches for mitigating sources of error, and present experimental results from a D-Wave Two quantum annealing processor.
Key facts. Cited by 3 papers in the map (data through 13 Oct 2026). First posted on arXiv 9 Oct 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 0; 2025: 1.
3 papers.
- 2021Adiabatic Quantum Graph Matching with Permutation Matrix Constraintscited by 20
- 2023Skipper: Improving the Reach and Fidelity of Quantum Annealers by Skipping Long Chainscited by 0
- 2025Addressing the Minor-Embedding Problem in Quantum Annealing and Evaluating State-of-the-Art Algorithm Performancecited by 0
- 2025Addressing the Minor-Embedding Problem in Quantum Annealing and Evaluating State-of-the-Art Algorithm Performance17 Apr 2025
- 2023Skipper: Improving the Reach and Fidelity of Quantum Annealers by Skipping Long Chains1 Dec 2023
- 2021Adiabatic Quantum Graph Matching with Permutation Matrix Constraints8 Jul 2021