Quantum Walk — Technology Wiki

Overview

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

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 search algorithm that provides quadratic speedup for searching unsorted databases.

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.

A basic quantum circuit operation that manipulates one or more qubits, analogous to logic gates in classical computing.

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

The practical ability of a quantum computer to solve real-world problems faster or better than classical computers.

A qubit implementation using individual ions confined by electromagnetic fields and manipulated by laser beams.

A sequence of quantum gates applied to qubits to perform a quantum computation.

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

A quantum computing approach that uses the complex dynamics of quantum systems as a computational resource.

Quantum computing using photons as qubits, manipulated through optical components.