Monit Sharma
Research Engineer · Singapore

Monit
Sharma

Building hybrid quantum–classical algorithms for large-scale optimization in logistics and supply chains — benchmarking quantum approaches against state-of-the-art classical heuristics.

9
Publications
4+
Years in Quantum
18
Open Courses
2026
AAAI · IEEE QCE
01 About

Bridging near-term quantum hardware and industrial problems.

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.

AHybrid optimization — combining quantum, reinforcement learning, and classical solvers for routing and inventory.
BResource-efficient quantum — slack-free QUBO formulations and graph shrinking that cut qubit counts.
CHonest benchmarking — GPU/TPU-accelerated comparison of quantum methods against classical heuristics.
02 Recent News
Oct 2025🎉 Two papers accepted at the AAAI 2026 Workshop on Quantum Computing — Hybrid Learning for CVRP and Learning-Based Graph Shrinking.
Sep 2024📄 New papers accepted at IEEE QCE 2024 on Quantum Relaxation and Newsvendor Optimization.
Jan 2024🎤 Presented a poster on Quantum Newsvendor Optimization at QIP 2024.
03 Experience
2023 — PresentSchool of Computing & Information Systems, Singapore Management University

Research Engineer

Singapore
  • Lead hybrid optimization (quantum, RL, classical) for complex logistics problems including routing and inventory control.
  • Built benchmarking infrastructure comparing quantum vs. tensor-network solvers on enterprise-scale workloads.
  • Direct the Quantum Classroom initiative, delivering workshops and open-source tools to the community.
2022 — 2023TATA Consultancy Services

Research & Development Engineer

Mumbai, India
  • Deployed D-Wave quantum annealing workflows for large-scale vehicle routing (200 nodes), reducing fleet latency.
  • Engineered qubit-efficient mappings for supply chains, enabling execution on constrained hardware.
2021 — 2022IISER Mohali

M.S. Thesis Researcher

Mohali, India
  • Investigated High-Energy Physics simulations on NISQ devices (Advisor: Dr. Satyajit Jena).
  • Demonstrated superior accuracy using single-qubit data re-uploading strategies over multi-qubit baselines.
04 Selected Publications
2025
Learning-Based Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems
Learning-guided compression for hybrid solvers · arXiv:2510.14533
  • 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.
AAAI 2026 Workshop on Quantum Computing
2025
Hybrid Learning and Optimization Methods for Capacitated Vehicle Routing
with H. C. Lau · Hybrid RL + Quantum CVRP · arXiv:2509.15262
  • Soft Actor-Critic policies tune augmented Lagrangian penalties for both classical and quantum solvers, accelerating convergence and feasibility.
  • Benchmarks across synthetic and real CVRP instances quantify runtime and solution-quality trade-offs.
AAAI 2026 Workshop on Quantum Computing
2024
Quantum Enhanced Simulation-Based Optimization for Newsvendor Problems
with H. C. Lau & R. Raymond
  • Employed qGANs to learn demand distributions, reducing qubit requirements with a tailored comparator.
  • Expanded the newsvendor formulation to maximise profit and support broader decision scenarios.
IEEE QCE 2024 · Poster at QIP 2024
2024
Quantum Relaxation for Solving Multiple Knapsack Problems
with Y. Jin, H. C. Lau & R. Raymond
  • Combined Quantum Random Access Optimisation with linear relaxation to solve large-scale procurement problems.
  • Showed feasibility and optimality preservation on instances exceeding 100 decision variables.
IEEE QCE 2024
2025
Transferable Equivariant Quantum Circuits for TSP: Generalization Bounds and Empirical Validation
with H. C. Lau · Equivariant QRL for TSP · arXiv:2510.14533
  • Permutation-equivariant circuits transfer policies from small to larger TSP instances with strong zero-shot performance.
  • Derived generalization bounds tying structural dissimilarity to expected performance, validated empirically.
2025
Cutting Slack: Quantum Optimization with Slack-Free Methods for Combinatorial Benchmarks
with H. C. Lau · Slack-free QUBO formulations · arXiv:2507.12159
  • Dual ascent, bundle, and augmented Lagrangian updates enforce constraints without auxiliary slack variables, reducing qubit counts.
  • Validated on TSP, MDKP, and MIS using both simulators and hardware executions.
2025
Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems
with H. C. Lau · Constraint-aware graph compression · arXiv:2506.14250
  • Adaptive graph coarsening with verification shrinks QUBO instances while preserving feasibility.
  • Delivered 40–80% qubit reductions for MDKP, MIS, and QAP, with minimal quality loss.
2025
A Comparative Study of Quantum Optimization Techniques for Combinatorial Benchmark Problems
with H. C. Lau · Standardised benchmarking suite · arXiv:2503.12121
  • Evaluated VQE, CVaR-VQE, QAOA variants, and compression techniques such as PCE and QRAO across NP-hard benchmarks.
  • Delivered actionable guidance on feasibility gaps, scaling behaviour, and resource allocation.
2024
Quantum Monte Carlo Methods for Newsvendor Problem with Multiple Unreliable Suppliers
with H. C. Lau · Risk-aware inventory analytics · arXiv:2409.07183
  • Integrated decision-maker risk profiles into a quantum Monte Carlo framework for multi-supplier newsvendor problems.
  • Secured near-quadratic speed-ups in expectation estimation via Quantum Amplitude Estimation.
05 Writing
N° 01 · 2026

When Cooking Gas Becomes a National Security Problem

A non-technical walkthrough of maritime energy resilience, chokepoint disruptions, and stochastic optimization for national supply networks.

Energy SecurityMaritimeOptimization
Read on Medium ↗
N° 02 · 2026

The Key to the Quantum Garden

India's 1,000 km quantum communication demonstration, what QKD changes, and why quantum security is becoming infrastructure.

QKDQuantum SecurityIndia
Read on Medium ↗
N° 03 · 2026

To You, 10,000 Qubits From Now

A look at ambitious new resource estimates for quantum factoring and what they imply for Shor's algorithm at cryptographic scale.

FactoringCryptographyQubits
Read on Medium ↗
N° 04 · 2026

The Fault in Our Qubits

What it would actually take to break RSA with a quantum computer, from hardware assumptions to fault-tolerant overheads.

Quantum HardwareRSAShor
Read on Medium ↗
N° 05 · 2026

The Emperor Has No Factors

An honest-metrics tour through published Shor's algorithm results and the classical post-processing baselines behind them.

ShorFactoringBenchmarks
Read on Medium ↗
N° 06 · 2026

Sometimes It's Too Slow... for Shor!!

A hands-on deep dive into running Shor's factoring algorithm on IBM quantum hardware and the limits visible today.

ShorHardwareQPE
Read on Medium ↗
N° 07 · 2025

Solving the Multi-Dimensional Knapsack Problem

Exploring the complexity of the MDKP and how quantum algorithms attempt to tackle this constrained optimization challenge.

QuantumKnapsackOptimization
Read on Medium ↗
N° 08 · 2025

Solving the Maximum Independent Set Problem

A deep dive into the MIS problem, its importance in network analysis, and the potential of quantum approaches.

QuantumGraph TheoryOptimization
Read on Medium ↗
N° 09 · 2025

Solving the Quadratic Assignment Problem

Analyzing the QAP, known for its extreme computational difficulty, and benchmarking quantum solvers against it.

QuantumQAPOptimization
Read on Medium ↗
06 Education
June 2022

M.S., Physics & Data Science

Indian Institute of Science Education and Research, Mohali
June 2020

B.S., Physics & Data Science

Indian Institute of Science Education and Research, Mohali
07 Contact

Let's talk quantum
optimization. Say hello ↗

Open to research collaborations, talks, and the occasional hard combinatorial problem.