Quantum
The universe is more connected than we have words for. Quantum is the first grammar for it.
Most “quantum wins” today are quantum-inspired classical methods that run on ordinary hardware, and real quantum advantage is narrow and years from routine. So we frame hard problems the quantum way, solve them with what runs today, and benchmark every result against a strong classical baseline.
- Problem classes
- Routing, scheduling, allocation, sampling
- Formulation
- QUBO / Ising, constraint encoding
- Benchmark
- Every result against a strong classical baseline
- Lab record
- EXP-06 Quantum × AI, frontier research
Frame first. Win today.
Frame first
We teach the problem to speak quantum before asking the hardware to solve it. Most quantum value lives in the formulation, not the machine. Cast your hard optimisation or modelling problem in quantum-ready form and the insight arrives now, on today’s hardware.
Win classically today
Many of the so-called quantum wins in production are quantum-inspired classical solvers: annealing-style and tensor-network techniques running on ordinary hardware. Real results this quarter, without waiting for the hardware.
Honest horizon
We will not sell you a timeline that does not exist. True quantum advantage is narrow and years from routine. We tell you plainly where the hardware is, what it can and cannot do today, and how to prepare rather than how to pretend.
Prepare now
Post-quantum cryptography is a today decision. Harvest-now-decrypt-later risk is real: encrypted data stored today can be decrypted when large quantum machines arrive. We assess exposure and plan the migration before the threat is immediate.
SETHPost-quantum cryptography is a today decision.
ReadoutEncrypted data stored today can be decrypted when large quantum machines arrive. Hover or tap a part to read it.
Quantum vs the honest alternatives.
Pick a problem class to read where practical advantage sits today: classical, quantum-inspired, or true quantum. This is our directional read of the field, not a benchmark suite, and it will change as hardware matures.
| Problem class | Classical | Quantum-inspired | Quantum today |
|---|---|---|---|
Today’s winner: quantum-inspired. Digital annealers and modern metaheuristics already beat naive classical and match or exceed real quantum hardware at useful sizes. True quantum advantage here is unproven at scale. | Good fit | Good fit | Not yet |
Quantum’s most credible edge, long term. Simulating quantum systems is what these machines are naturally good at. Still early and hardware-limited, but this is where the real promise lives. | Sometimes | Sometimes | Sometimes |
Mostly classical. Quantum machine learning is an active research area, not a source of return today. Classical and quantum-inspired methods dominate in practice. | Good fit | Good fit | Not yet |
Here quantum is the threat, not the tool. A future fault-tolerant machine could break today’s encryption, so the move now is post-quantum readiness, not deployment. | Good fit | Good fit | Not yet |
From bottleneck to solution.
A disciplined pipeline, not a science experiment. We only reach for quantum once the problem is framed and a classical baseline exists to beat. If classical wins, we tell you, and ship the classical solution.
- FrameFind the real optimisation buried in your operation
- FormulateObjectives and constraints as a QUBO / Ising model
- SolveAnnealing, gate-based and quantum-inspired solvers
- Hybrid loopClassical and quantum stages working together
- ValidateBeat the best classical method, or stop
- DeployWire the winning approach into your workflow
Where this research stands.
Quantum is the Lab’s most experimental frontier, housed in REKA’s Heuristik division and run as applied research and advisory. It is also the least isolated: the same optimisation that quantum methods sharpen sits inside our autonomous fleet routing work.

| ID | Experiment | The question | Where it stands |
|---|---|---|---|
| EXP-06 | Quantum × AIQuantum · OptimisationFrontier | Can quantum-inspired optimisation methods outperform classical solvers on the routing, allocation and scheduling problems already present in our product domains, before quantum hardware is required? | The method is reformulating known hard problems as QUBO or Ising models and solving with quantum-inspired classical solvers, proving value on our existing baselines. The hardware question comes after the formulation question. |
Quantum-inspired wins
Reformulate and solve hard optimisation and modelling problems with quantum-inspired classical methods. Begin post-quantum cryptography planning. Results this quarter, not next decade.
Narrow hybrid advantage
Specific structured problems in simulation and optimisation begin to favour hybrid quantum-classical approaches. This is the most credible early-advantage window.
Fault-tolerant scale
When error-corrected machines arrive, the organisations that framed their problems early will move first. We are getting clients ready for that moment, not selling it as imminent.
Fleet routing and scheduling are exactly the kind of combinatorial problems where quantum-inspired methods are worth testing against the best classical solvers.
Verified milestones.
What we can point to today, each with its source or the person who confirms it. Quantum is the Lab’s youngest frontier, so the honest list is short.
- 2022Confirmed by REKA
Quantum study with MIT xPRO
REKA’s co-founder completed two MIT xPRO online courses: Introduction to Quantum Computing (January to February 2022) and Quantum Algorithms for Cybersecurity, Chemistry and Optimization (March 2022).
- Apr 2023Confirmed by REKA
Quantum.Tech APAC 2023, Singapore
The co-founder attended the conference on 4 and 5 April 2023 at the Equarius Hotel, Sentosa, and recalls being among the only attendees from Malaysia. He also attended a workshop on dual-use quantum IP, including defence applications, as a participant only: REKA has no defence partnership.
- Lab recordDocumented
EXP-06, Quantum × AI
A frontier experiment asking whether quantum-inspired optimisation can beat classical solvers on routing, allocation and scheduling, before quantum hardware is needed.
Source: the Lab’s experiment record
- MethodDocumented
Formulation first, a classical baseline always
Problems are cast as QUBO or Ising models and every result is measured against the best classical method. If classical wins, that is the answer.
Source: the method on this page
- AdvisoryDocumented
An honest quantum assessment
Offered as an add-on to consulting work: whether quantum, quantum-inspired or plain classical methods fit the problem in front of you.
Source: Consulting
What we do not claim
REKA has not built a quantum computer, has not deployed a quantum solution for a client and has not measured a quantum advantage. Our work here is research, readiness and advice.
Documented: a source you can open. Confirmed by REKA: stated by REKA’s co-founder, who took part; supporting documents to follow.
Methods & tooling.
This work runs on classical hardware. REKA has no quantum hardware of its own.

- Problem classes
- Combinatorial optimisation · scheduling · routing · allocation · sampling
- Formulations
- QUBO · Ising · constraint encoding · penalty tuning
- Quantum solvers
- Quantum annealing · gate-based (QAOA / VQE) on simulators
- Quantum-inspired
- Simulated / digital annealing · tensor networks · classical metaheuristics
- Frameworks
- Qiskit · Ocean-style toolchains · hybrid orchestration
- Validation
- Benchmarked against strong classical baselines, time-to-solution & quality
- Engagement
- Applied research & advisory, scoped as a paid discovery sprint


