QUBIT ALFTECH / STUDIES ↗
◌ Quantum computing / working demo 02

A quantum computer,
simulated exactly.

Place gates, watch the state vector change, run a thousand shots. Sixteen qubits, sixty-five thousand amplitudes — all on this phone, nothing sent anywhere.

Build a circuit ↓ A working demo for DeepTech Ventures Luxembourg · September 2026

Place a gate. Watch the state.

Six textbook circuits are ready. Or start blank: pick a gate below, tap a cell. Two-qubit gates take the control first, then the target in the same column.

2 qubits

Every amplitude, exactly.

A real device gives you only a histogram of measurements. A simulation gives you the whole vector — every amplitude with its phase. Both views are here.

−π+π
01

State vector

An n-qubit state is 2ⁿ complex numbers. A gate does not multiply a 2ⁿ×2ⁿ matrix — it walks pairs of amplitudes that differ in one bit. Sixteen qubits is 65 536 amplitudes; this phone does a gate in a millisecond. Twenty is a million; thirty would not fit in memory. That gap is the whole point of building the real thing.

⟩
02

Checked

Every preset matches the textbook to the last digit: Grover at sin²(5·asin(1/√8)) = 0.9453, teleportation preserving sin²(0.5), Fourier phases going exactly once around. Twelve random circuits of up to six qubits match a NumPy reference — built the slow way, by Kronecker products — to 10⁻¹⁵.

◫
03

What this is not

A simulation, not a quantum computer. Amplitudes here are exact and there is no noise; a real device gives you only the histogram, and a noisy one. The simulation is what you use to know what the real machine should have said.

↗

Qubit 0 is the least significant bit, as in Qiskit, so outcomes read right to left: |101⟩ means qubit 2 = 1, qubit 1 = 0, qubit 0 = 1.

No server, no request after the page is open. The state vector lives in your browser and dies with the tab.

Exact, not approximate

The state dies
with this tab.

Start a conversation ↗
Aleksandr Fedorov
github.com/alexff91