A few examples of existing algorithms that exhibit a speed up on quantum computers are \( k \)-nearest neighbors, support vector machines and \( k \)-means clustering.
Among algorithmic approaches that are specifically designed for quantum computers we find so-called parameterized quantum circuits. These are hybrid quantum-classical methods where the input-output relation is being produced by a quantum computer, while a classical computer is responsible for updating the model parameters during training.