activity
20232026
most citedSolving various NP-Hard problems using exponentially fewer qubits on a Quantum Computer

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

collaborators
Showing 2025 · quant-phShow all

1 paper · 2 filters

quant-ph2025

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…