- Introduced a learning-based graph shrinking technique to reduce instance size while preserving solution structure.
- Achieved substantial qubit reductions on benchmark combinatorial instances with minimal loss in quality.
Building hybrid quantum–classical algorithms for large-scale optimization in logistics and supply chains — benchmarking quantum approaches against state-of-the-art classical heuristics.
I am a Research Engineer at Singapore Management University, working at the boundary between near-term quantum hardware and real industrial applications. My research designs hybrid quantum–classical algorithms for large-scale optimization in logistics and supply chain management.
A non-technical walkthrough of maritime energy resilience, chokepoint disruptions, and stochastic optimization for national supply networks.
Read on Medium ↗ N° 02 · 2026India's 1,000 km quantum communication demonstration, what QKD changes, and why quantum security is becoming infrastructure.
Read on Medium ↗ N° 03 · 2026A look at ambitious new resource estimates for quantum factoring and what they imply for Shor's algorithm at cryptographic scale.
Read on Medium ↗ N° 04 · 2026What it would actually take to break RSA with a quantum computer, from hardware assumptions to fault-tolerant overheads.
Read on Medium ↗ N° 05 · 2026An honest-metrics tour through published Shor's algorithm results and the classical post-processing baselines behind them.
Read on Medium ↗ N° 06 · 2026A hands-on deep dive into running Shor's factoring algorithm on IBM quantum hardware and the limits visible today.
Read on Medium ↗ N° 07 · 2025Exploring the complexity of the MDKP and how quantum algorithms attempt to tackle this constrained optimization challenge.
Read on Medium ↗ N° 08 · 2025A deep dive into the MIS problem, its importance in network analysis, and the potential of quantum approaches.
Read on Medium ↗ N° 09 · 2025Analyzing the QAP, known for its extreme computational difficulty, and benchmarking quantum solvers against it.
Read on Medium ↗Open to research collaborations, talks, and the occasional hard combinatorial problem.