Eric Bourreau

Dr. Eric Bourreau


Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 May 2024 in Physical Review A
Verified
Journal Article
Closed access
PDF file
YCYagnik Chatterjee
Yagnik Chatterjee
EBEric Bourreau
Eric Bourreau
MRMarko J. Rančić
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 been of great interest in the past few years. Such algorithms are heuristic in nature and aim to obtain an approximate solution. Significant improvements in computational time and/or the ability to treat large problems are some of the principal promises of quantum computing in this regard. The hardware, however, is still in its infancy and the current noisy intermediate-scale quantum (NISQ) computers are not able to optimize industrially relevant problems. Moreover, the storage of qubits and introduction of entanglement require extreme physical conditions. An issue with quantum optimization algorithms such as the quantum approximate optimization algorithm is that they scale linearly with problem size. In this paper, we build upon a proprietary methodology which scales logarithmically with problem size—opening an avenue for treating optimization problems of unprecedented scale on gate-based quantum computers. To test the performance of the algorithm, we first find a way to apply it to a handful of NP-hard problems: Maximum Cut, Minimum Partition, Maximum Clique, Maximum Weighted Independent Set. Subsequently, these algorithms are tested on a quantum simulator with graph sizes of over a hundred nodes and on a real quantum computer up to graph sizes of 256. To our knowledge, these constitute the largest realistic combinatorial optimization problems ever run on a NISQ device, overcoming previous problem sizes by almost tenfold.


1 February 2007 in European Journal of Operational Research
Verified
Journal Article
Closed access
TBThierry Benoist
Thierry Benoist
EBEric Bourreau
Eric Bourreau
BRBenoît Rottembourg
Benoît Rottembourg

6 September 2024 in European Journal of Operational Research
Verified
Journal Article
Closed access
CGCamille Grange
Camille Grange
MPMichael Poss
Michael Poss
EBEric Bourreau
Eric Bourreau
VTVincent T’kIndt
Vincent T’kIndt
OPOlivier Ploton
Olivier Ploton

1 January 2025 in Quantum Engineering
Verified
Journal Article
Open access
YCYagnik Chatterjee
Yagnik Chatterjee
ZAZaid Allybokus
Zaid Allybokus
MRMarko Rancic
Marko Rancic
EBEric Bourreau
Eric Bourreau
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 modeled as a column generation scheme with the maximum weighted independent set (MWIS) problem as the sub‐problem or worker problem. Quantum variational algorithms have gained significant interest in the past several years. Recently, a method to represent quadratic unconstrained binary optimization (QUBO) problems using logarithmically fewer qubits was proposed. Here we use this method to solve the MWIS Workers and demonstrate how quantum and classical solvers can be used together to approach an industrial‐sized use case (up to 64 tours).

2 November 2013 in Journal of Scheduling
Verified
Journal Article
Closed access
PDF file
Ender ÖzcanEnder Özcan
Ender Özcan
CAChristian Artigues
Christian Artigues
EBEric Bourreau
Eric Bourreau
HAH. Murat Afsar
H. Murat Afsar