monitsharma / portfolio Goto Github PK

• M.S. Physics and Data Science | Indian Institute of Science Education and Research Mohali (June 2022)

• B.S. Physics and Data Science | Indian Institute of Science Education and Research Mohali (June 2020)

Research Engineer @ School of Computing and Information Systems, Singapore Management University (January 2023 - present)

• QSBO for NP-hard Newsvendor variant
• Quantum Relaxation for Multiple Knapsack

Researcher @ Tata Consultancy Services (October 2021 - June 2022)

• Quantum Powered Employee Transport and Agri-Logistics Optimization

Publication

• We utilize the maximum profit formulation for the Newsvendor Problem, which has broader applicability compared to the minimal loss formulation commonly found in the literature.
• Our approach involves an unknown demand distribution, where a function may not precisely capture the demand in such settings, to address this, we employ Quantum Generative Adversarial Networks (qGANs) to load the unknown demand distribution, thereby creating a more realistic scenario.
• We improve the simulation-based optimization method in by introducing a new comparison operator, thereby reducing the number of qubits needed in the circuit.

Publication

• Explored the effectiveness of QRAO in addressing the inherent complexities of constrained supply chain problems, by solving a Multiple Knapsack Problem (MKP) and comparing it with the well-studied QAOA approach.
• Scaled up a real-world multiple knapsack-based Risk-Aware Procurement Optimization problem involving ≥ 100 variables and demonstrating the prospect of combining QRAO with a classical method in operations research, namely Linear Relaxation (LR)

• Solved the logistics Vehicle Routing Problem for an enormous 200 customers with 25 vehicles on DWAVE’s quantum annealer hardware using a quantum algorithm.
• Solved the supply-chain problem and devised a new method to reducethe requirements of qubits while solving MILP.

Made a website that contains free resources to learn quantum computing, some written by me, and some by the vast quantum computing community. For more details, please Visit Website.

I write about recent quantum papers that I read, and try to code them out. Also explain some coding tutorials and exercises. View Blogs

• Yan Jin, Monit Sharma, Hoong Chuin Lau and Rudy Raymond. Quantum Relaxation for Solving Multiple Knapsack Problems, e-Print: 2404.19474 [quant-ph]

• Monit Sharma, Hoong Chuin Lau and Rudy Raymond. Quantum-Enhanced Simulation-Based Optimization for Newsvendor Problems, e-Print: 2403.17389 [quant-ph] [QIP2024 Taiwan Poster presented]