Algorithms

A quantum search algorithm that significantly accelerates the process of finding a specific item within an unsorted database. For knapsack problems, it provides a quadratic speedup in identifying optimal solutions, making it highly efficient for large datasets.

Provides quadratic speed-up for unstructured database search.

Solves sparse linear systems exponentially faster than classical solvers.

Approximates solutions to combinatorial optimization problems on near-term devices.

Estimates integrals and probabilities with quadratic speed-up over classical sampling.

Implements machine-learning models using parametrized quantum circuits.

Extracts eigenvalues of unitary operators with high precision.

Factors large integers and computes discrete logarithms exponentially faster than classical methods.

Finds ground-state energies via hybrid quantum-classical optimization.