q1 - An o1 Based Autonomous Quantum Algorithm Generator

This quantum circuit demonstrates Shor's 9-qubit quantum error correction code by introducing and detecting bit-flip and phase-flip errors.

This circuit creates a superposition of a qubit, applies a phase shift, and then measures the state.

A quantum circuit that simulates a basic Quantum Key Distribution protocol between two parties, Alice and Bob.

This algorithm performs binary addition on two qubits and outputs the sum and carry bits.

This circuit demonstrates the quantum phase kickback phenomenon by applying controlled-Z operation between two qubits prepared in superposition states.

This circuit performs a quantum walk on a line with three positions, using one coin qubit and two position qubits.

This circuit applies the Quantum Approximate Optimization Algorithm for the MaxCut problem on a triangle graph and requires parameter input to execute.

This quantum circuit produces a superposition of 6 qubits, entangles them in a ring topology, and measures the results.

The circuit applies Hadamard gates to create superposition in all qubits, and Controlled-Z gates to entangle them in a 3x3 grid topology.

This circuit prepares an arbitrary state, encodes it into 3 qubits, introduces a bit-flip error, measures the syndrome, applies error correction,...

This circuit performs superdense coding, sending two classical bits of information with only one qubit.

This circuit prepares a qubit in an arbitrary state, encodes it into a 5-qubit error-detecting code, introduces a bit-flip error, detects the...

This circuit uses quantum entanglement to encode and then decode a two-bit message ('10') from Alice to Bob.

This circuit creates two entangled pairs, performs a Bell-state measurement on the middle two qubits, and measures the result.

This circuit applies Hadamard gates to all qubits, then Controlled-Z gates between qubit 0 and qubits 1-4, and finally measures all qubits.

This circuit prepares a Dicke state with 2 excitations among 4 qubits and measures the state.

This circuit applies Hadamard gates to all qubits, then applies controlled-Z gates in a ring topology, and finally measures all qubits.

This circuit generates a superposition of states over 4 qubits and applies CZ gates in a square topology before measuring the results.

This circuit performs quantum teleportation by entangling two pairs of qubits, and then measuring two of them to entangle the remaining two.

This circuit prepares a three-qubit W state and measures the outcomes.

This circuit prepares a four-qubit linear cluster state using Hadamard and Controlled-Z gates, then measures each qubit.

This circuit performs a swap test to estimate the inner product of two quantum states.

This quantum circuit implements the Bernstein-Vazirani algorithm to identify a hidden binary string, specifically '1011', in a single query.

This circuit implements Simon's Algorithm for a secret string '11', identifying that two inputs produce the same output if they are bit-wise XOR is '11'.

This circuit implements Grover's algorithm to find the |11⟩ state in a 2-qubit system.

This circuit performs quantum teleportation of the state of one qubit to another.

This circuit demonstrates the use of a Toffoli gate with two initialized qubits as control and measuring the result on the target qubit.

This circuit performs quantum teleportation from a source qubit to a target qubit.

This circuit applies the Quantum Fourier Transform to 3 qubits, reverses their order, and then records the result.

This circuit prepares a GHZ (Greenberger–Horne–Zeilinger) entangled state across three qubits, then measures each qubit.

This circuit implements the Deutsch-Jozsa algorithm for a balanced function and measures the first three qubits of a four-qubit system.