Grover's Algorithm — Technology Wiki

Overview

A quantum search algorithm that provides quadratic speedup for searching unsorted databases.

An algorithm designed to run on a quantum computer, potentially solving certain problems faster than classical algorithms.

A quantum algorithm for integer factorisation that runs exponentially faster than the best known classical algorithms.

A quantum computing approach that finds the lowest energy state of a system, useful for optimisation problems.

A hybrid quantum-classical algorithm for finding the ground state energy of molecular systems.

Software that translates high-level quantum algorithms into sequences of quantum gates executable on specific hardware.

The phenomenon where quantum probability amplitudes combine, allowing quantum algorithms to amplify correct answers and cancel wrong ones.

The factor by which a quantum algorithm outperforms the best known classical algorithm for the same problem.

The quantum mechanical analogue of a classical random walk, used as a building block for quantum algorithms.

A metric for measuring the overall capability and error rates of a quantum computer.

The transfer of quantum states between qubits using entanglement and classical communication.

A qubit design that encodes information in the topological properties of matter, offering inherent error protection.

A device that generates truly random numbers using quantum mechanical processes.

A qubit implementation using superconducting circuits that exhibit quantum behaviour at extremely low temperatures.

A phenomenon where two or more qubits become correlated such that the quantum state of one instantly influences the other regardless of distance.

A form of quantum computing based on the adiabatic theorem, gradually evolving a system from an initial to a problem-encoding Hamiltonian.

A geometrical representation of the state space of a single qubit as a point on the surface of a sphere.