🔬

quantum-state-simulator

An interactive educational simulator for visualizing and manipulating quantum states on the Bloch sphere. Users can apply quantum gates, create superposition and entanglement, and observe how quantum state vectors evolve in real-time, building intuition for the mathematics of quantum computing.

🔬 Try it now

What is this?

🎯 Simulator Tips

📚 Glossary

Qubit
The fundamental unit of quantum information, a two-level quantum system that can exist in a superposition of |0> and |1> with complex probability amplitudes.
Bloch Sphere
A unit sphere in three dimensions used to geometrically represent the pure state of a single qubit, where the north and south poles correspond to |0> and |1> respectively.
Superposition
The quantum mechanical principle that a quantum system can exist in a linear combination of multiple basis states simultaneously, collapsing to a definite state only upon measurement.
Entanglement
A quantum correlation between two or more qubits where the quantum state of the composite system cannot be described independently for each qubit, famously called 'spooky action at a distance' by Einstein.
Hadamard Gate
A single-qubit quantum gate that creates an equal superposition: H|0> = (|0>+|1>)/sqrt(2) and H|1> = (|0>-|1>)/sqrt(2). Geometrically, it is a 180-degree rotation about the X+Z axis on the Bloch sphere.
Pauli X Gate
The quantum NOT gate that flips |0> to |1> and vice versa. On the Bloch sphere, it is a 180-degree rotation about the X-axis.
Pauli Y Gate
A single-qubit gate that performs a 180-degree rotation about the Y-axis on the Bloch sphere, combining bit-flip and phase-flip operations.
Pauli Z Gate
A single-qubit gate that applies a phase flip: Z|0> = |0> and Z|1> = -|1>. On the Bloch sphere, it is a 180-degree rotation about the Z-axis.
CNOT Gate
Controlled-NOT gate, a two-qubit gate that flips the target qubit if and only if the control qubit is |1>. Essential for creating entanglement and implementing quantum algorithms.
Probability Amplitude
A complex number whose squared modulus gives the probability of measuring a particular outcome. Unlike classical probabilities, amplitudes can interfere constructively or destructively.
Measurement
The process of observing a quantum system, which causes the state to collapse from a superposition to a definite basis state with probability determined by the squared amplitude.
Quantum Gate
A unitary operation applied to qubits that transforms the quantum state in a reversible way, analogous to logic gates in classical computing but operating on continuous state spaces.
Fidelity
A measure of how close two quantum states are, ranging from 0 (orthogonal) to 1 (identical). Used to benchmark quantum operations and characterize noise in quantum devices.
Hilbert Space
The mathematical space of all possible quantum states, a complex vector space with an inner product. For n qubits, it is a 2^n-dimensional complex Hilbert space.
Unitary Matrix
A complex matrix U satisfying U*U_dagger = I (identity), representing reversible quantum operations. All quantum gates and time evolution are described by unitary matrices.
Bell State
One of four maximally entangled two-qubit states that form a basis for two-qubit Hilbert space, fundamental to quantum teleportation, superdense coding, and entanglement-based quantum protocols.
Quantum Circuit
A sequence of quantum gates applied to qubits, representing a quantum computation as a diagram that flows from left to right, analogous to classical logic circuit diagrams.
Quantum Teleportation
A protocol that transfers a quantum state from one qubit to another using shared entanglement and classical communication, without physically transmitting the qubit.
No-Cloning Theorem
A fundamental result in quantum mechanics proving that it is impossible to create an identical copy of an arbitrary unknown quantum state, a cornerstone of quantum cryptography.
Born Rule
The rule that the probability of measuring a particular outcome is the squared modulus of the corresponding probability amplitude, connecting the mathematical formalism of quantum states to observable predictions.
Quantum Register
A collection of qubits that together form a multi-qubit quantum state, used to encode the input and output of quantum algorithms. An n-qubit register exists in a 2^n-dimensional Hilbert space.
Phase
The argument (angle) of a complex probability amplitude, which influences interference effects but does not affect the measurement probability of a single qubit. Global phases are unobservable; relative phases are physically meaningful.
T Gate
A single-qubit gate that applies a phase of pi/4 to the |1> state, essential for achieving universal quantum computation when combined with Hadamard and CNOT gates.
Quantum Error Correction
Techniques for protecting quantum information from noise and decoherence by encoding logical qubits in multiple physical qubits, detecting and correcting errors without measuring the quantum state directly.
Toffoli Gate
A three-qubit gate (controlled-controlled-NOT) that flips the target qubit only when both control qubits are |1>. Universal for classical reversible computation and useful in quantum error correction.
Quantum Process Tomography
The experimental characterization of a quantum operation (gate or channel) by applying it to a set of known input states and performing state tomography on the outputs, reconstructing the full process matrix.
Schmidt Decomposition
A way to express any pure bipartite quantum state as a sum of products of orthonormal states, revealing the entanglement structure. The number of non-zero Schmidt coefficients measures the entanglement dimension.
Quantum Fidelity
The overlap between two quantum states, F(rho, sigma) = (Tr sqrt(sqrt(rho) sigma sqrt(rho)))^2, measuring how close an experimentally prepared state is to the target state. A fidelity of 1 means perfect agreement.

🏆 Key Figures

Felix Bloch (1946 (Bloch sphere), 1952 (Nobel Prize))

Introduced the Bloch sphere representation of spin-1/2 quantum states and developed nuclear magnetic resonance (NMR) techniques. Awarded the Nobel Prize in Physics for precision measurements of nuclear magnetic moments.

Paul Dirac (1928-1933)

Developed the mathematical formalism of quantum mechanics including bra-ket notation, the Dirac equation for relativistic quantum mechanics, and foundational work on quantum field theory. His notation remains the standard language of quantum computing.

John von Neumann (1927-1932)

Provided the rigorous mathematical foundation for quantum mechanics using Hilbert spaces, introduced the density matrix formalism for mixed states, and established the mathematical theory of quantum measurement.

Richard Feynman (1982)

Proposed the idea of quantum computers in 1982, arguing that simulating quantum systems requires quantum hardware, directly motivating the field of quantum computing and the need to understand quantum states computationally.

David Deutsch (1985)

Formalized the concept of the universal quantum computer and developed the first quantum algorithm (Deutsch's algorithm), demonstrating that quantum states can be harnessed for computational advantage.

Peter Shor (1994)

Developed Shor's algorithm for factoring large numbers exponentially faster on a quantum computer, providing the most compelling early evidence of quantum computational advantage and motivating massive investment in quantum computing.

Werner Heisenberg (1925-1927)

Formulated matrix mechanics, the first complete mathematical formulation of quantum mechanics, and the uncertainty principle that fundamentally limits simultaneous knowledge of conjugate quantum observables.

💬 Message to Learners

{'encouragement': 'Quantum states might seem abstract at first, but the Bloch sphere turns complex mathematics into something you can see and touch. Every time you apply a gate and watch the state vector rotate, you are building the intuition that quantum physicists develop over years of study.', 'reminder': 'The quantum computing industry is growing exponentially, and understanding quantum states is the foundation of everything from quantum algorithms to quantum error correction. The skills you build here will be increasingly valuable in the decades ahead.', 'action': 'Start by putting a qubit in the |0> state and applying a Hadamard gate to see superposition in action. Then try different gate combinations and observe how the Bloch vector moves. Challenge yourself to predict where the state will end up before you apply each gate.', 'dream': 'We dream of a future where a student in a rural school anywhere in the world can learn quantum computing with the same quality tools available at MIT or Stanford, and where the quantum workforce reflects the diversity of all humanity.', 'wiaVision': 'WIA Book envisions a world where quantum literacy is universal. Through free, interactive simulators available in 206 languages, we are building bridges between the quantum frontier and every curious mind on Earth.'}

Get Started

Free, no signup required

Get Started →