Discover Circuits

Simple amplitude estimation circuit estimating the probability of a marked state.

5-qubit GHZ state (|00000⟩ + |11111⟩)/√2. Tests entanglement across all qubits of a small processor.

Combines Grover's oracle with QPE to count the number of solutions without knowing them.

Simon's algorithm for a 2-bit input. Finds hidden period s of f(x) = f(x ⊕ s) exponentially faster than classical.

Discrete-time quantum walk on 4 positions using a coin qubit and position register.

Estimates ⟨ψ|U|ψ⟩ using an ancilla qubit, controlled-U, and measurement. Fundamental for many quantum algorithms.

Entangles two qubits that never directly interact by performing a Bell measurement on intermediary qubits.

QAOA circuit for the MaxCut problem on a 2-node graph. Uses alternating problem and mixer layers.

A simple VQE ansatz for finding the ground state energy of H₂. Uses parameterized Ry and CNOT gates.

A quantum half adder that computes sum and carry of two input qubits using CNOT and Toffoli gates.

The Toffoli gate (CCNOT) flips the target qubit only when both control qubits are |1⟩. Fundamental for reversible computing.

Generates a truly random 4-bit number using quantum superposition. Each qubit is placed in superposition via Hadamard.

Creates the 3-qubit W state |W⟩ = (|001⟩ + |010⟩ + |100⟩)/√3. Robust to single-qubit loss.

Determines the overlap between two quantum states without measuring them. Ancilla qubit reads |0⟩ if states are identical.

The 3-qubit bit flip code. Encodes 1 logical qubit into 3 physical qubits to correct a single X error.

Sends 2 classical bits using 1 qubit by leveraging a shared Bell pair.

Estimates the phase θ in U|ψ⟩ = e^{2πiθ}|ψ⟩ using 2 counting qubits and inverse QFT.

Grover's algorithm on 2 qubits searching for |11⟩. Achieves quadratic speedup over classical search.

The 3-qubit Quantum Fourier Transform (QFT), a key subroutine in Shor's algorithm and quantum phase estimation.

Finds a hidden binary string s in a single query to f(x) = s·x mod 2.

The simplest Deutsch-Jozsa algorithm on a 2-qubit oracle. Determines if a function is constant or balanced in one query.

Teleports the state of qubit 0 to qubit 2 using an entangled Bell pair and classical communication.

Creates a 3-qubit GHZ state |GHZ⟩ = (|000⟩ + |111⟩)/√2, extending entanglement across three qubits.

Creates a maximally entangled Bell state |Φ+⟩ = (|00⟩ + |11⟩)/√2 using a Hadamard gate followed by a CNOT.