4 citations · 4 across the 5 of their papers we have counts for
3 papers · 1 filter
Towards solving large QUBO problems using quantum algorithms: improving the LogQ scheme
Yagnik Chatterjee, Jérémie Messud
The LogQ algorithm encodes Quadratic Unconstrained Binary Optimization (QUBO) problems with exponentially fewer qubits than the Quantum Approximate Optimization Algorithm (QAOA). T…
A Hybrid Quantum-assisted Column Generation Algorithm for the Fleet Conversion Problem
Yagnik Chatterjee, Zaid Allybokus, Marko J. Rančić +1
The problem of Fleet Conversion aims to reduce the carbon emissions and cost of operating a fleet of vehicles for a given set of tours. It can be modelled as a column generation sc…
Solving various NP-Hard problems using exponentially fewer qubits on a Quantum Computer
Yagnik Chatterjee, Eric Bourreau, Marko J. Rančić
NP-hard problems are not believed to be exactly solvable through general polynomial time algorithms. Hybrid quantum-classical algorithms to address such combinatorial problems have…