Algorithm Library
Quantum Algorithm Library
Explore twelve quantum circuit examples in five frameworks, three practical learning tutorials and four distinct research replication overviews.
Learning examples and tutorials
Start with a small editor circuit, then build a longer local workflow with parameter search or time-evolution analysis.
Follow a Learning Tutorial →Research Replications
A deeper scientific experiment. Explore a paper, its implementation, and the evidence behind its reported results.
Explore Research Replications →Twelve circuits to explore
Start with state preparation, learn interference and phase-sensitive building blocks, or inspect a fixed algorithm instance. Every entry includes five framework variants, an ideal expected answer, references, and explicit limitations.
Beginner
Bell State
Prepare a two-qubit Bell state.
Beginner
Superposition
Prepare three independent qubits in equal superposition.
Beginner
GHZ State
Prepare a three-qubit GHZ state.
Beginner
Quantum Coin Flip
Sample a balanced one-qubit distribution in a simulator.
Intermediate
Quantum Teleportation
Explore coherent state transfer with deferred measurement.
Intermediate
Deutsch-Jozsa
Identify the fixed balanced oracle f(x)=x.
Intermediate
Bernstein-Vazirani
Recover the fixed hidden string 101.
Intermediate
Quantum Fourier Transform
Apply a three-qubit Fourier transform to the fixed input |101>.
Advanced
Grover's Search
Explore one amplitude-amplification round on two qubits.
Advanced
Fixed-Angle Ansatz
Prepare a two-qubit ansatz at fixed angles.
Advanced
Phase Estimation
Estimate the T-gate eigenphase 1/8 with three counting wires.
Advanced
Fixed Mixed-Gate Circuit
Inspect one fixed five-qubit circuit containing mixed gates.
Continue with a learning tutorial
Go beyond a fixed circuit: tune QAOA parameters, run a complete small VQE loop, or compare Trotter steps with exact time evolution. These local learning workflows are separate from paper-specific research replications.
Learning Tutorial
QAOA MaxCut: Tune a Four-Qubit Circuit
Search a small parameter grid and score the resulting graph partitions.
4 qubits · 81 ideal parameter evaluations · 4,096 final samples
Follow the tutorial →Learning Tutorial
H₂ VQE: Measure Energy and Optimize a Parameter
Move beyond a fixed ansatz with a Hamiltonian, measured energy and bounded optimization.
2 qubits · 25 search evaluations + 1 fresh final evaluation
Follow the tutorial →Learning Tutorial
Hamiltonian Simulation: Exact Evolution and Trotter Steps
Separate circuit sampling error from the approximation made by Trotterization.
1 qubit · 6 step counts · 4,096 samples per circuit
Follow the tutorial →Choose your starting point
Scroll the table horizontally to compare both experiences.
| Choose by | Quick Example | Research Replication |
|---|---|---|
| Purpose | Understand a concept and get a first successful run | Reproduce a specific published result |
| Scope | Small, fixed circuit with a clear expected answer | Documented experiment, parameters, analysis, and comparison |
| Experience | Pick a framework, run, inspect results | Read the report, run the experiment, vary parameters, compare findings |
| Evidence | References and correctness tests | Paper attribution, explicit adaptations, scientific criteria, provenance, and execution evidence |
| Packaging | Editor snippet | Project/report and Capsule where verified |
The table compares Quick Examples with Research Replications. Learning Tutorials extend the learning side with a small local workflow and fixed editor circuits; they do not add a claim of reproducing a paper. All formats need correct implementations and clear limitations.
From a concept to an experiment
Start with Grover's search over four candidates to understand amplitude amplification. Then read the separate three-qubit Grover research overview for its oracle, search space, iteration count, and comparison with theory. The algorithm connects the two experiences; their scope and evidence distinguish them.
Research reports and source packages are being prepared for public access. See Research Replications for current availability. One algorithm can have several replications of different papers or claims.