Quantum Computing

Quantum computing simulations model the behaviour of quantum circuits built from qubits and unitary gates. Gate-circuit simulators track the 2ⁿ-dimensional complex state vector of n qubits as Hadamard, CNOT, Toffoli, and phase gates are applied, visualising amplitude and phase on Bloch spheres. Algorithm simulations show Grover's search algorithm achieving √N query complexity and Deutsch-Jozsa returning the global parity of a black-box function in one query.

Quantum error correction simulations demonstrate how the three-qubit bit-flip code and Shor's nine-qubit code detect and correct decoherence errors. These models are computationally exact for small qubit counts and run entirely in the browser using JavaScript complex-number arithmetic. They are ideal for developing an operational understanding of quantum speedup, entanglement, and measurement before working with real quantum hardware APIs.

Quantum computing simulations run on classical hardware by tracking the full 2ⁿ-dimensional state vector — which is why simulating more than ~30 qubits becomes infeasible classically. Real quantum computers from IBM, Google, and IonQ achieve quantum advantage by maintaining physical qubit coherence. These simulations let you build intuition for quantum circuits, interference, and algorithmic speedup without requiring a dilution refrigerator.