Q-01
Bell state
Two qubits, maximally entangled: only 00 and 11 appear, half each.
Quantum Research Lab · Varna, Bulgaria · Est. 23 March 2003
Quantum computing research,
built on 23 years of engineering.
Founded in Varna in 2003, Quanterall now works fully on quantum algorithms, quantum error correction and quantum-AI. What exists today: ten quantum circuits you can run on this page, simulated on the Erlang virtual machine; a simulation engine we built over the last two years for the EU research project TechUPGRADE, which we now use to prepare simulations in other fields — quantum computing among them; and an Erlang practice that goes back to 2009.
The name was coined in 2002 at the Joint Institute for Nuclear Research in Dubna. The company was incorporated on 23 March 2003 to pursue it once the technology allowed.
23yrs
Since 2003
17yrs
Erlang, since 2009
10
Live circuits
// What exists today
Three things you can
check for yourself.
01
Ten quantum circuits, on the BEAM
A state-vector simulator written in Elixir and Erlang, running on the Erlang virtual machine: a Bell pair, teleportation, Grover's search, a variational classifier, the register of Shor's algorithm, and five error-correcting codes in which you can inject an error and watch the syndrome find it. Every run is a real simulation, in its own process. Run them →
02
A simulation engine, built for TechUPGRADE
Over the last two years we built the simulation engine of TechUPGRADE, an EU Horizon Europe research project on thermochemical heat recovery: component models, scenario runs, physics-informed neural networks and 3D flow simulation of a real reactor. We now use the same engine to prepare simulations in other areas. For quantum computing it runs the ten circuits above, and noise sweeps of error-correcting codes in which the logical error rate is computed exactly. Watch the platform's films →
03
Erlang, since 2009
We have built on Erlang since 2009, and we teach it: in our own academy, and for years at three universities. The BEAM was made for systems of very many small processes that must not fail — which is why we use it to model quantum systems, and why the circuits above run on it.
23
March · 2026
⬤ Newsroom · 23 March 2026
Quanterall returns to its founding purpose
after 23 years.
after 23 years.
Today, 23 years to the day after incorporation, Quanterall converts from a distributed-systems engineering firm into a quantum computing research laboratory. The company will work on quantum algorithm design, error correction and fault tolerance, quantum machine learning, hybrid quantum-classical architectures, and post-quantum cryptography migration.
The name "Quanter-all" was chosen in 2002 at the Joint Institute for Nuclear Research in Dubna as a statement of intent toward quantum computing. The technology was not ready then. It is ready now.
// What we do
Quantum computing research.
Quantum-AI research.
Both, deliberately.
A research programme begun on 23 March 2026 — not a product company. It runs from quantum-native algorithms and error correction to quantum-classical hybrid architectures and AI acceleration. Its first public pieces are the circuits and the simulation work above.
Quantum computing research
We develop and benchmark algorithms that exploit superposition, entanglement and interference, and we study the codes that make them survive real hardware. Current threads: combinatorial optimisation, quantum simulation, stabiliser and surface codes, variational methods on NISQ devices.
AlgorithmsError correctionVariational methodsNISQFault tolerance
Quantum-AI research
We test where quantum hardware gives learning a genuine advantage and where it does not. Kernel methods, variational classifiers, quantum generative models, and optimisation landscapes — with classical baselines run alongside, because a speedup you cannot reproduce is not a speedup.
Quantum MLQNNsKernel methodsQuantum advantageOptimisation
Why now
Error-corrected logical qubits exist. Hybrid quantum-classical methods are showing measurable advantage on problems that matter. The threshold we could not cross in 2002 has been crossed.
That is the external reason. The internal one matters more to a reader deciding whether to trust us: fault tolerance is the central engineering problem in quantum computing, and it is the problem our previous twenty-three years were spent on. Distributed consensus, replication, failure recovery, correctness under adversarial conditions — these are the same abstractions, at a different substrate.
We did not pivot because quantum became fashionable. We waited because it became possible.
That is the external reason. The internal one matters more to a reader deciding whether to trust us: fault tolerance is the central engineering problem in quantum computing, and it is the problem our previous twenty-three years were spent on. Distributed consensus, replication, failure recovery, correctness under adversarial conditions — these are the same abstractions, at a different substrate.
We did not pivot because quantum became fashionable. We waited because it became possible.
// Research areas
Five core pillars,
two exploratory tracks
R-01
Quantum Algorithm Design
We design and analyse algorithms that achieve verifiable speedups — and we insist on the word verifiable. Focus: combinatorial optimisation, quantum simulation, sampling, and search.Today: Grover's search and the register of Shor's algorithm (N = 15) among the live circuits.
R-02
Quantum Error Correction and Fault Tolerance
Stabiliser and surface codes, fault-tolerant threshold theorems, and the decoders that make them practical. This is our strongest ground: it is the direct continuation of twenty-three years of building systems that must not fail, and it is the field's central unsolved engineering problem.Today: five codes among the live circuits (bit-flip, phase-flip, Shor-9, Steane-7, a distance-3 surface patch), and exact noise sweeps of repetition codes of distance 3 to 9 on our simulation engine.
R-03
Quantum Machine Learning
When does quantum hardware give learning a real advantage, and when is it a barren plateau with a press release attached? Kernel methods, variational classifiers, quantum generative models, and optimisation landscapes — always with a tuned classical baseline beside them.Today: a variational classifier circuit among the live circuits.
R-04
Quantum-Classical Hybrid Architectures
The orchestration layer where HPC and QPUs actually meet: VQE and QAOA implementations, workload scheduling, error-mitigation budgets, and the unglamorous plumbing that decides whether near-term hardware is useful or merely demoable. This is the pillar closest to our engineering history.
R-05
Post-Quantum Cryptography Migration
Cryptographic discovery, inventory, and migration to the NIST standards — ML-KEM (Kyber), ML-DSA (Dilithium), and SLH-DSA (SPHINCS+) — inside distributed systems where key rotation, latency budgets, and legacy protocols are the real constraints. Harvest-now-decrypt-later means data encrypted today is already exposed: migration is a multi-year programme, and the start date is the only variable you control.
// Exploratory tracks — speculative, and labelled as such
X-01 · Entanglement as linked processes
We model an entangled pair as two Erlang processes whose states are linked: measuring one fixes what the other will show, however far apart the processes run. For teaching and for demonstrating the concept — the process model makes visible what the mathematics says, that the correlation is set by the shared state, not by a message between the two. Not a simulation strategy at scale; an instrument for explaining one.
X-02 · Teleportation as process migration
We model teleportation as a process that migrates between two BEAM nodes: the state leaves one node and is rebuilt on the other, carried only by a Bell pair shared in advance and two classical bits sent over the network — as in the protocol, where nothing quantum travels after the pair is made. For teaching and for prototyping protocols. Experimental, and labelled so: these tracks are where we look for a contribution, not where we claim one.
Why we publish the speculative work: a lab that only shows finished results is telling you nothing about how it thinks.
// The substrate
The science of
superposition
A qubit holds all of its states at once until measured. This is not a metaphor for parallelism; it is the physical reason quantum computation scales the way it does — and the reason it is so fragile.
Superposition — a register of n qubits carries 2n amplitudes at once. The exponential is real; extracting it is the hard part.
Entanglement — correlated states that cannot be described independently: the resource behind quantum communication and most speedups. See it in the Bell pair.
Interference — amplitudes cancel wrong paths and reinforce right ones. Every quantum algorithm is, at bottom, an interference pattern. See it in the Grover circuit.
|ψ⟩ = α|0⟩ + β|1⟩, |α|² + |β|² = 1
// Run it yourself
Ten circuits,
simulated live on the BEAM.
Educational simulations and research primitives, written in Elixir and Erlang and running on the Erlang virtual machine. The charts below are not pictures: each card ran its circuit when this section came into view, and draws the outcomes it measured, shot by shot. Run any of them again, or open the full demo page for the circuits in OpenQASM and the error-correction details.
Q-02
Teleportation
A |1⟩ sent from one qubit to another through a Bell pair and two classical bits.
Q-03
Grover's search
Amplitude amplification: the marked state 11 is found every time.
Q-04
Variational classifier
Rx rotations and an entangling CNOT layer — the shape of a quantum ML model.
Q-05
Shor's algorithm, N = 15
The phase-estimation register put in uniform superposition.
E-01
Bit-flip code
Three qubits, two parity checks: an injected flip on qubit 1 is found and voted away.
E-02
Phase-flip code
The same in the X basis, against a phase flip (a teaching version).
E-03
Shor's 9-qubit code
Three blocks of three qubits: protection against bit and phase errors (simplified).
E-04
Steane [[7,1,3]] code
Seven data qubits and three checks (simplified).
E-05
Surface code, distance 3
A small patch and two of its checks (simplified).
// Process models on the BEAM
Entanglement as linked processes. Teleportation as a process that migrates.
Two quantum concepts modelled with what the Erlang virtual machine does best — isolated processes and nodes — for teaching and for demonstrating the concepts. Both run live below, on real BEAM processes; the numbers are measured, not drawn.
X-01 · Entanglement
Each round spawns three processes: a pair process holding the shared state |Φ⁺⟩, and Alice and Bob. They never message each other; each asks the pair to measure its own qubit at an angle. Whoever asks first collapses the shared state, and the other reads a correlated result.
The physical system: two photons with entangled polarization
A crystal makes the photon pair; neither photon has a polarization of its own until one meets a polarizer. A polarizer turns half as much as the qubit's measurement axis, so the settings are 0° or 45° for Alice and 22.5° or 67.5° for Bob, as in the Bell tests of Aspect (1982) and Weihs (1998). Played: this run's first 24 pairs.
running…
X-02 · Teleportation
Node A is this server's BEAM; node B is a second BEAM node, a separate operating-system process. Alice's process holds an unknown qubit, measures it against her half of a Bell pair and ends; only two classical bits go to node B, where a new process applies the correction and holds the same state.
The physical system: a photon's polarization
As in the first teleportation experiment (Bouwmeester et al., Innsbruck 1997) and from the ground to the Micius satellite over 1,400 km (2017): |0⟩ is horizontal and |1⟩ vertical polarization, ψ is drawn as its polarization ellipse. A Bell-state analyser built only from beam splitters tells apart two of the four outcomes; the model, like trapped-ion experiments, uses all four.
running…
// 2003 – 2026 · The foundation
23 years.
The work behind the move.
2002 ✦
Dubna
At the Joint Institute for Nuclear Research, our founder coins "Quanter-all" with two colleagues — an explicit statement of intent toward quantum computing.
23 March 2003
Varna
Quanterall is incorporated as the vehicle for that intent, with the understanding that it may take decades. It did.
2003–2016
Systems at scale
Enterprise and industrial platforms across European markets — distributed systems where downtime is measured in revenue, not minutes.
2009
Erlang
We start building on Erlang. Teaching follows: our own academy, and for years courses at three universities.
2016–2020
Correctness
A turn toward formal methods, functional programming, and provable behaviour. The era that made error correction a natural next step.
2020–2025
Breadth
Healthcare, logistics, finance, bioinformatics, communications, insurance.
2024–2026
A simulation engine
For the EU research project TechUPGRADE we build its simulation engine: physical models, scenarios, physics-informed neural networks and 3D flow simulation of a thermochemical reactor.
23 March 2026 ✦
Return
Full commitment to quantum computing and quantum-AI research. The circle closes on schedule, 23 years late and 23 years early.
We are not claiming we became a quantum laboratory overnight. We are claiming that the twenty-three years behind this move were not a detour: replication, consensus, failure recovery, and correctness under adverse conditions are the same problems quantum error correction poses, in a different substrate. What we lack is quantum-specific depth, and we are building it.
What we have is a habit of building things that are not allowed to fail. It is a transferable habit.