Variational Quantum Eigensolver — Technology Wiki

Overview

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

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.

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.

Noisy Intermediate-Scale Quantum — the current era of quantum computing with limited, error-prone qubits.

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

A collection of qubits that together store quantum information for processing in a quantum circuit.

A quantum mechanical property where a qubit exists in multiple states simultaneously until measured.

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

Google's open-source framework for writing, manipulating, and running quantum circuits on quantum hardware and simulators.

Random fluctuations in quantum systems that introduce errors and limit the accuracy of quantum computations.

Using quantum computers to model and simulate quantum systems that are intractable for classical computers.