activity
20242026
most citedQuantum Relaxation for Solving Multiple Knapsack Problems

5 citations · 8 across the 12 of their papers we have counts for

collaborators
Showing 2025Show all

5 papers · 1 filter

quant-ph2025

Diagnosing Simulation and Hardware Barriers to Cross-Size Transfer in Equivariant Quantum Reinforcement Learning

Monit Sharma, Hoong Chuin Lau

Equivariant quantum circuits (EQCs) parameterise reinforcement-learning policies for combinatorial optimisation with a size-independent parameter count, suggesting policies trained…

physics.soc-ph2025

Hybrid Learning and Optimization methods for solving Capacitated Vehicle Routing Problem

Monit Sharma, Hoong Chuin Lau

The Capacitated Vehicle Routing Problem (CVRP) is a fundamental NP-hard problem in logistics. Augmented Lagrangian Methods (ALM) for solving CVRP performance depends heavily on wel…

quant-ph2025

Cutting Slack: Quantum Optimization with Slack-Free Methods for Combinatorial Benchmarks

Monit Sharma, Hoong Chuin Lau

Constraint handling remains a key bottleneck in quantum combinatorial optimization. While slack-variable-based encodings are straightforward, they significantly increase qubit coun…

quant-ph2025

Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems

Monit Sharma, Hoong Chuin Lau

A range of quantum algorithms, especially those leveraging variational parameterization and circuit-based optimization, are being studied as alternatives for solving classically in…

quant-ph2025

A Comparative Study of Quantum Optimization Techniques for Solving Combinatorial Optimization Benchmark Problems

Monit Sharma, Hoong Chuin Lau

Quantum optimization holds promise for addressing classically intractable combinatorial problems, yet a standardized framework for benchmarking its performance, particularly in ter…