76 citations · 605 across the 40 of their papers we have counts for
5 papers · 1 filter
A Multilevel Approach For Solving Large-Scale QUBO Problems With Noisy Hybrid Quantum Approximate Optimization
Filip B. Maciejewski, Bao Gia Bach, Maxime Dupont +5
Quantum approximate optimization is one of the promising candidates for useful quantum computation, particularly in the context of finding approximate solutions to Quadratic Uncons…
Qubit-efficient quantum combinatorial optimization solver
Bhuvanesh Sundar, Maxime Dupont
Quantum optimization solvers typically rely on one-variable-to-one-qubit mapping. However, the low qubit count on current quantum computers is a major obstacle in competing against…
Generating Einstein$\unicode{x2013}$Podolsky$\unicode{x2013}$Rosen correlations for teleporting collective spin states in a two dimensional trapped ion crystal
Muhammad Miskeen Khan, Edwin Chaparro, Bhuvanesh Sundar +4
We propose the use of phonon$\unicode{x2013}$mediated interactions as an entanglement resource to engineer Einstein$\unicode{x2013}$Podolsky$\unicode{x2013}$Rosen (EPR) correlation…
Benchmarking Quantum Optimization for the Maximum-Cut Problem on a Superconducting Quantum Computer
Maxime Dupont, Bhuvanesh Sundar, Bram Evert +4
Achieving high-quality solutions faster than classical solvers on computationally hard problems is a challenge for quantum optimization to deliver utility. Using a superconducting…
Grover-QAOA for 3-SAT: Quadratic Speedup, Fair-Sampling, and Parameter Clustering
Zewen Zhang, Roger Paredes, Bhuvanesh Sundar +5
The SAT problem is a prototypical NP-complete problem of fundamental importance in computational complexity theory with many applications in science and engineering; as such, it ha…