🔬

quantum-circuit-builder

A visual drag-and-drop quantum circuit designer that lets you build, simulate, and export quantum algorithms. Place quantum gates like Hadamard, CNOT, and Pauli on qubit wires to create circuits, then run simulations to see probability distributions, Bloch sphere representations, and state vectors in real time.

🔬 Try it now

What is this?

🎯 Simulator Tips

📚 Glossary

Qubit
The quantum analog of a classical bit, capable of existing in a superposition of |0> and |1> states simultaneously.
Quantum Gate
A basic quantum operation that changes the state of one or more qubits, analogous to classical logic gates but operating on quantum superpositions.
Hadamard Gate
A single-qubit gate that creates an equal superposition state, transforming |0> to (|0>+|1>)/sqrt(2).
CNOT Gate
A two-qubit gate where the control qubit determines whether a NOT operation is applied to the target qubit.
Bloch Sphere
A geometrical representation of the state space of a single qubit, where any pure qubit state can be represented as a point on the sphere's surface.
State Vector
A mathematical description of a quantum system's complete state, represented as a complex vector in Hilbert space.
Measurement
The process of extracting classical information from a quantum system, which collapses the superposition into a definite state.
Superposition
The ability of a quantum system to exist in multiple states simultaneously until measured.
Entanglement
A quantum correlation where the states of two or more qubits are fundamentally linked, regardless of spatial separation.
Circuit Depth
The number of time steps (layers of gates) in a quantum circuit, with deeper circuits generally being more error-prone on noisy hardware.
OpenQASM
Open Quantum Assembly Language, a standard text-based format for describing quantum circuits developed by IBM.
Unitary Operation
A reversible quantum operation represented by a unitary matrix, preserving the total probability of quantum states.
Quantum Register
A collection of qubits that together form the input and output of a quantum circuit.
Phase
The complex angle associated with a quantum state's amplitude, which affects interference patterns but not measurement probabilities directly.
Quantum Parallelism
The ability of quantum computers to evaluate a function on many inputs simultaneously by exploiting superposition.
Decoherence
The loss of quantum coherence due to unwanted interaction with the environment, causing qubits to lose their superposition and entanglement.
Bell State
A maximally entangled two-qubit state created by applying a Hadamard gate followed by a CNOT gate, one of four possible maximally entangled states.
Toffoli Gate
A three-qubit controlled-controlled-NOT gate that is universal for classical computation and useful in quantum error correction.
Quantum Interference
The phenomenon where quantum probability amplitudes combine constructively or destructively, used to amplify correct answers in quantum algorithms.
Ancilla Qubit
An auxiliary qubit used in quantum circuits as a helper for implementing complex operations or error correction.

🏆 Key Figures

David Deutsch (1985)

Formalized the concept of the universal quantum computer and quantum circuit model, proving that a quantum computer could simulate any physical process

Peter Shor (1994)

Developed Shor's algorithm for factoring large numbers exponentially faster than any known classical algorithm, demonstrating the potential power of quantum circuits

John Preskill (2012)

Coined the term 'quantum supremacy' (now often called 'quantum advantage') and developed the theory of fault-tolerant quantum computation with quantum error correction

Richard Feynman (1982)

Proposed the idea of using quantum mechanical systems for computation, inspiring the entire field of quantum computing

Lov Grover (1996)

Invented Grover's search algorithm, which provides a quadratic speedup for unstructured search problems using quantum circuits

Charles Bennett (1993)

Co-invented quantum teleportation and superdense coding protocols, demonstrating the power of entanglement-based quantum circuits for communication

Adriano Barenco (1995)

Proved that any quantum circuit can be decomposed into single-qubit gates and CNOT gates, establishing the universality of common gate sets used in circuit builders

💬 Message to Learners

{'encouragement': 'Every quantum computing expert started exactly where you are now - curious but uncertain. By dragging your first gate onto a qubit wire, you have already taken a step that most people never take. Quantum computing is not magic reserved for geniuses; it is a skill you can build one gate at a time.', 'reminder': 'Remember that quantum computing is still a young and rapidly evolving field. Even researchers at the top labs are still learning and discovering new things. Your fresh perspective and questions are valuable contributions to this growing community.', 'action': 'Start by building a simple Bell state circuit: place a Hadamard gate on the first qubit, then a CNOT gate connecting the first and second qubits. Run the simulation and observe the entanglement. You have just created one of the most fundamental quantum phenomena!', 'dream': 'We dream of a world where a student in rural Bangladesh, a teenager in the mountains of Peru, or a self-taught programmer in sub-Saharan Africa can all design quantum circuits that push the boundaries of human knowledge. Quantum computing belongs to all of humanity, and tools like this exist to make that dream real.', 'wiaVision': 'WIA Book envisions a future where world-class science education is universally accessible, free, and engaging. Through interactive simulators like the Quantum Circuit Builder, we are building bridges between complex quantum physics and everyday understanding, one learner at a time.'}

Get Started

Free, no signup required

Get Started →