computer-science

Quantum Computing & Qubits

The science of quantum computation — Bloch sphere qubit visualization, quantum gate operations, entanglement correlations, Shor's factoring algorithm, and quantum error correction codes.

quantum computingqubitsBloch spherequantum gatesentanglementShor algorithmerror correction

Quantum computing harnesses superposition, entanglement, and interference to process information in ways fundamentally impossible for classical computers. A qubit can exist in a continuum of states between |0> and |1>, and quantum gates manipulate these states with unitary transformations on the Bloch sphere. When multiple qubits become entangled, their joint state space grows exponentially, enabling algorithms that outperform any classical counterpart for specific problems.

These simulations let you rotate qubits on the Bloch sphere, apply quantum gates, observe entanglement correlations, run Shor's factoring algorithm step by step, and design quantum error correction codes — all with real-time interactive controls and physically accurate quantum mechanics.

5 interactive simulations

simulator

Quantum Entanglement & Bell States

Simulate quantum entanglement between two qubits — explore Bell states, CHSH inequality violations, and spooky action at a distance with real-time correlation analysis

simulator

Quantum Error Correction Codes

Simulate quantum error correction — explore how surface codes, Shor codes, and Steane codes detect and fix bit-flip and phase-flip errors on encoded logical qubits

simulator

Quantum Gates & Circuit Operations

Simulate quantum gate operations on a qubit — apply Hadamard, Pauli, and phase gates and watch the state vector rotate on the Bloch sphere in real time

simulator

Qubit Bloch Sphere Visualization

Visualize a single qubit state on the Bloch sphere — explore how polar and azimuthal angles map to superposition amplitudes and measurement probabilities

simulator

Shor's Algorithm & Integer Factoring

Simulate Shor's quantum factoring algorithm — explore how quantum Fourier transforms find the period of modular exponentiation to factor integers exponentially faster than classical methods