Research areas,
and where each stands.
Quantum computing is our central research direction. Around it, PQCF's scientific engine now covers quantum optics, quantum field theory, QCD and Feynman integrals. Each area below says what is done, how it is checked, and what is next.
Eight areas,
one framework under most of them.
- Tested
- checked by our own tests against an independent reference
- Benchmarked
- timed against an established tool on the same machine
- Reproduced
- rerun by us from a fresh clone, with a step-by-step page
- Prototype
- working, but not yet in its final place or form
- In development
- implementation underway; not yet complete
- Planned
- intended work that has not started
- Independently reviewed
- evaluated by a reviewer outside the development team: nothing yet
Quantum algorithms and error correction
- Circuits and codes on QxSim, our state-vector simulator, checked against Qiskit
- The surface code under circuit noise on QxStab, checked against Stim
- Benchmarks against Qiskit Aer and Stim, including where we lose
- Our research question: its first hypothesis falsified
Photonic quantum computing
- PQCF against five photonic simulators, every week
- The KLM gates, fusion, detectors and loss, GKP and cat states
- Erasure decoding with heralded losses
Quantum optics
- Master equations, steady states and spectra at any precision
- Four problems with closed-form solutions: PQCF agrees to 36 digits; QuTiP to 5–16 digits under the tested default and tightest tolerances
- QuTiP is faster at time evolution: 12 to 280 times on the driven Jaynes–Cummings model
Mathematical physics
- Quantum field theory, QCD, Feynman integrals
- High-precision mathematics: series, spectra, geometry
- Holographic QCD: seven computations against their papers
QED and QCD
- Feynman diagrams and rules from a Lagrangian
- The running of QCD to five loops
- The one-loop box D0; the three-loop β-function
Feynman integrals
- Reduction by finite-field reconstruction
- Against FIRE on its double box, and Forcer on four loops
Symbolic computation
- PQCF's symbolic engine against FORM 5, every week
- Dense products 3 to 5 times faster; sparse products and powers 1.5 to 2.8 times slower
- Compiled programs with fewer operations than FORM's O4 on its resultant benchmarks
Genomics
- Can a photonic simulator help genome research?
- Five routes measured against the best classical methods
- Mostly no, and why
Quantum algorithms.
Error correction.
Simulated on the BEAM.
A research programme begun on 23 March 2026, not a product company. We keep it to what we can show: quantum algorithms and error-correcting codes, implemented and tested in a state-vector simulator in our demo service. Its first public pieces are the circuits and the simulation work above.
Where our past work carries over: we already test systems by injecting faults, and supervision trees and parallel Monte Carlo are how the BEAM runs many noisy shots with each failure isolated. The BEAM suits offline, parallel simulation and the orchestration around it; it is soft real-time, so it is not a decoder for real hardware, which needs microsecond latency from FPGAs or ASICs. Our track record in simulation is the two years building TechUPGRADE's simulation engine.
Where it does not: a quantum state cannot be copied (no-cloning), so redundancy cannot mean replication; and errors are found indirectly, by measuring syndromes without reading the data. Those are the parts we are learning.
Three core pillars, three planned,
two exploratory tracks
We model an entangled pair as two Erlang processes whose states are linked: measuring one fixes what the other will show. This is a classical simulation: a third process holds the shared state centrally and both sides ask it, so the model reproduces the statistics of entanglement, not nonlocality. The demo below measures S live and shows it with its standard error (about ±0.06 over 2000 rounds), against 2 for any classical model and 2√2 ≈ 2.83 in theory. For teaching: it makes visible that the correlation comes from the shared state, not from a message between the two.
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. The simulator knows ψ — it draws it at random and checks the result — so the demo shows the protocol's structure, not a physical transmission. For teaching and for prototyping protocols.
Why we publish the speculative work: a lab that only shows finished results is telling you nothing about how it thinks.