← Back to papers
Searching and Sorting Algorithms for Quantum Annealing Computers
R. A. Dunn·April 28, 2022
Physics
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
Algorithms for searching and sorting data sets on quantum annealing systems are presented. Search algorithms for unordered data sets are developed. A sorting algorithm for data sets is provided, with a consideration of sort stability. Scalability of the algorithms, considering both the number of qubits required and the qubit connectivity, is characterized as a function of problem size.