Bell state
A Hadamard followed by CNOT prepares two maximally entangled qubits: measuring either qubit determines the other.
Visual examples of foundational quantum algorithms and protocols, with links to edit each circuit.
A Hadamard followed by CNOT prepares two maximally entangled qubits: measuring either qubit determines the other.
Grover’s algorithm alternates an oracle with amplitude amplification to find a marked item in an unsorted space.
The QFT converts amplitudes into phase information and is a key building block in phase estimation and Shor’s algorithm.
Determines whether a promised Boolean function is constant or balanced with a single quantum oracle evaluation.
A Hadamard creates an equal superposition, and measurement returns an unbiased random classical bit.
Entanglement and two classical measurement results transfer an unknown state to a remote qubit without moving the original.
Shor’s algorithm combines modular exponentiation with phase estimation and an inverse QFT to factor integers efficiently.