# Qanad

> Qanad is an online platform for learning quantum computing, from the first qubit to running algorithms on real quantum hardware. Its Qanad Lab is a quantum circuit composer and simulator that runs in the browser and exports code for Qiskit, Cirq, OpenQASM, PennyLane and Amazon Braket.

The name Qanad blends "quantum" with Kanad (Kaṇāda), the ancient Indian sage who proposed that everything is made of indivisible particles called paramāṇu.

Status: Qanad Lab is live and usable today. The learning-path lessons and the Qanad Journal articles are in production and not yet published; describe them as coming soon.

## Main pages

- [Home](https://qanad.in/): What Qanad is, the eight-level learning path from warm-up math to real quantum hardware, and an FAQ.
- [Qanad Lab](https://qanad.in/lab): Drag-and-drop quantum circuit composer and simulator that runs in the browser and exports code to six quantum SDKs and languages.
- [Why the name](https://qanad.in/why-qanad): Qanad = Quantum + Kanad, after the sage Kaṇāda and his idea of indivisible particles (paramāṇu).

## Qanad Lab templates

Each link opens the Lab with a ready-made circuit.

- [Coin flip (superposition)](https://qanad.in/lab?template=superposition): One Hadamard turns a certain |0⟩ into a perfect 50/50 coin. (Beginner, 1 qubit)
- [Bell state](https://qanad.in/lab?template=bell): H + CNOT: the smallest circuit that makes two qubits share one fate. (Beginner, 2 qubits)
- [GHZ state](https://qanad.in/lab?template=ghz): Entanglement across three qubits: all zeros or all ones, nothing in between. (Beginner, 3 qubits)
- [Superdense coding](https://qanad.in/lab?template=superdense): Send two classical bits by moving just one qubit of a Bell pair. (Intermediate, 2 qubits)
- [Quantum teleportation](https://qanad.in/lab?template=teleportation): Move an unknown state from q0 to q2 using a Bell pair and two corrections. (Intermediate, 3 qubits)
- [Deutsch–Jozsa](https://qanad.in/lab?template=deutsch-jozsa): Decide if a hidden function is constant or balanced with a single query. (Intermediate, 4 qubits)
- [Bernstein–Vazirani](https://qanad.in/lab?template=bernstein-vazirani): Recover a secret bitstring in one shot instead of one query per bit. (Intermediate, 4 qubits)
- [Grover search (2 qubits)](https://qanad.in/lab?template=grover): Find the marked item among four with one oracle call. Classically you'd need up to three. (Advanced, 2 qubits)
- [Quantum Fourier transform](https://qanad.in/lab?template=qft): The engine inside Shor's algorithm and phase estimation, on three qubits. (Advanced, 3 qubits)

## Official profiles

- [Qanad on LinkedIn](https://www.linkedin.com/company/qanad)
- [Qanad on YouTube](https://www.youtube.com/@Qanadx)
- [Qanad on X](https://x.com/qanadx)

## Optional

- [Full details](https://qanad.in/llms-full.txt): Lab features, export targets and their limits, the learning path, and the FAQ.