Recent developments

From the centre

The centre’s own work and appearances.

• 7 September 2026

  Guest lecture at Kasetsart UniversityCentre

  Assoc. Prof. Dr. Sanpawat Kantabutra gave the distinguished guest lecture “Quantum Computing and Quantum Research at CEQT” to the Department of Computer Science at Kasetsart University, setting out what the centre works on and how its quantum computing research is organised.

• September 2026

  A chained partial-sum formulation for knapsack QUBOsCentre

  Woratham Khangtragool and Assoc. Prof. Dr. Sanpawat Kantabutra, in the Theory of Computation Group, replace the single dense budget constraint of a knapsack QUBO with a chain of smaller equalities linked by intermediate registers. The formulation is exact: a sufficient penalty condition is derived so that every QUBO minimiser corresponds to an optimal knapsack solution. What it buys is density. The standard slack formulation couples every item variable to one global slack register, and that clique is what makes a large instance impossible to minor-embed on sparse annealing hardware; a chain of small cliques is not. Benchmarked against the dense slack formulation on D-Wave Pegasus and Zephyr working graphs, the chained form embeds successfully more often, embeds faster, and produces shorter chains, with a greedy grouping heuristic and adaptive register sizing choosing the blocks. The work is in preparation.

• September 2026

  A Nash equilibrium in cybersecurity, found by annealingCentre

  A student project in the Theory of Computation Group formulates an N-player attack–defence game on a defence-in-depth tree as a QUBO and solves it for a Nash equilibrium on a D-Wave annealer. Payoffs come from an ISO/IEC 27001 asset-based risk assessment; each attacker works to a fixed budget and picks a strategy at each node in a turn-based order. The team proved the formulation correct and found the annealer’s results consistent with the proofs, and used a hybrid quantum–classical arrangement to keep the qubit count down. It continues the line of the centre’s published work on layered cybersecurity models.

Recent results

Five from the past three years, chosen for reach rather than for volume. The full record is on the publications page, where it can be searched, sorted and filtered.

• 2026

  Fractional action Hamiltonian neural networksResearch

  Long-term memory and sequential learning in a Hamiltonian neural network with a fractional action principle — machine learning built on the centre's own mathematics.

  Neurocomputing 681, 133389 · doi:10.1016/j.neucom.2026.133389

• 2026

  A fractal electrochemical porous model for lithium-ion batteriesResearch

  Fractional and fractal methods applied to battery modelling, in the highest-impact venue the centre publishes in.

  Journal of Energy Storage 141, 118960 · doi:10.1016/j.est.2025.118960

• 2025

  Hybrid classical–quantum computation for cybersecurity strategiesResearch

  The follow-on to the centre's adiabatic-computation work on cyber attack and defence: a hybrid treatment of a layered cybersecurity model.

  The Journal of Supercomputing 81, 1179 · doi:10.1007/s11227-025-07662-4

• 2025

  Qualitative financial modelling in fractal dimensionsResearch

  Fractal methods in quantitative finance — the pillar-4 mathematics reaching the econometrics side of the centre.

  Financial Innovation 11, 42 · doi:10.1186/s40854-024-00723-2

• 2024

  Probability-boosting technique for combinatorial optimizationResearch

  A method for raising the probability that a heuristic search lands on a good solution — directly relevant to how the centre formulates annealing problems.

  PeerJ Computer Science 10:e2499 · doi:10.7717/peerj-cs.2499

The whole evidence base →

Resources: the world of quantum computing

A curated set of external references, kept deliberately short. These are other people’s work and are linked rather than reproduced.

External links are checked quarterly. If one is dead, please tell us.

Last updated 14 September 2026.