Practical research and working code
Practical AI, quantum computing and optimisation
Clear, reproducible guides covering Qiskit, developer workflows, algorithms, simulation and practical computing.
Explore the work
AI & developer workflows
Applied notes on AI tools, local models, automation and reliable publishing workflows.
Quantum computing
Qubits, gates and algorithms explained with diagrams and executable Qiskit examples.
Algorithms & optimisation
Heuristics, modelling and simulation methods presented through practical experiments.
Practical computing
Concise guides for macOS, Homebrew, hardware and everyday technical work.
Featured guides
Quantum learning path
Quantum Computing: A Complete Learning Path
A structured route from qubits and gates to circuits, algorithms and Qiskit experiments.
AI workflow
Publish to WordPress with Claude and MCP
A practical workflow for drafting, publishing and troubleshooting WordPress content.
Optimisation
Solving the Traveling Salesman Problem
Nearest neighbor, 2-opt, 3-opt and tabu search explained as a practical progression.
Latest writing
-
Pocket Data Science VI: Store Sales Time Series Baselines on Android Termux
Yes, non-ML baselines dominate. Premature XGBoost tuning hides dead catalog shifts and calendar spikes. See the 5-step heuristic ladder &…
-
Pocket Data Science V: Kaggle NLP on Android Guide
Yes, train NLP transformers on Android. Sloppy subword tokenization causes vocabulary out-of-bounds errors on Kaggle. See our 5-model ensemble guide…
-
Superdense Coding Explained: 2 Bits in 1 Qubit Qiskit Guide
Yes, 1 qubit sends 2 bits with shared entanglement. Without it, the Holevo bound caps one qubit at 1 classical…
-
Pocket Data Science IV: Kaggle MNIST Subspace SVM Guide
Yes, run MNIST SVMs on mobile. Training full 784-D kernels on phone exhausts RAM and crashes Termux. See the 50-D…
-
Two-Qubit Entanglement: The 4 Bell States & Qiskit Guide
Yes, Bell states cannot factor. Ignoring tensor product non-separability creates invalid state vectors in circuits. See the 4 EPR states…
-
Deutsch-Jozsa Algorithm Explained: Proof & Qiskit Code
Yes, solves in 1 query. Evaluating deterministic oracles classically requires 2^(n-1)+1 queries to avoid errors. Check the full proof &…
Research, publications and teaching
Explore the academic work behind the practical guides.
Follow the next experiment
Receive new practical guides on AI, quantum computing, optimisation and useful technical workflows.
You must be logged in to post a comment.