Searching and Sorting Algorithms for Quantum Annealing Computers

TL;DR

This paper introduces quantum annealing algorithms for searching and sorting data, analyzing their scalability and implementation considerations on quantum hardware.

Contribution

It presents new quantum annealing algorithms for search and sort, including stability considerations and scalability analysis based on qubit requirements and connectivity.

Findings

Algorithms for unordered data search are developed.

A sorting algorithm with stability considerations is provided.

Scalability depends on qubit count and connectivity.

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.