Schedule Logo
Poster Session

Poster Session I (4pm-6pm CDT)

4:00 pm – 6:00 pm, Tuesday June 4 Session D00
Topics:
PrevNext

Solving optimization problems with local light shift encoding on Rydberg quantum annealers

Poster 75
Presenter: KAPIL GOSWAMI (Zentrum für Optische Quantentechnologien, University of Hamburg, Hamburg, Germany.)
Authors: Rick Mukherjee (Zentrum für Optische Quantentechnologien, University of Hamburg, Hamburg, Germany.), Herwig Ott (Department of Physics and Research Center OPTIMAS, Rheinland-Pfaelzische Technische University of Kaiserslautern-Landau, Kaiserslautern, Germany), Peter Schmelcher (Zentrum für Optische Quantentechnologien, University of Hamburg, Hamburg, Germany.)
Collaboration: RYMAX

The current era of quantum computers is characterized by a limited number of qubits, high levels of noise, and imperfect quantum gates. Despite these limitations, neutral atom analog quantum computers offer opportunities to explore potential advantages. Combinatorial optimization problems that are NP-hard, for example, Maximum Cut (Max-Cut) and Maximum Independent Set (MIS), are interesting to tackle on a quantum computer. In contrast to the well-known schemes such as unit disk encoding and quantum wires, we provide a novel framework to solve the MIS/Max-Cut problems on Rydberg platforms. It involves taking advantage of locally controlled light shifts on Rydberg atoms to establish a one-to-one mapping from the graph problems (MIS/Max-Cut) to a many-body interacting setup. This approach has the advantage of linear scaling of the number of atoms required with the problem size. 

Optimal control methods are used in our numerical simulations to shape the laser pulses for driving the Rydberg annealer to the desired many-body ground state, which solves the optimization problem. The solutions are obtained for prototype graphs with varying sizes at time scales well within the system lifetime and with approximation ratios close to one. A comparative analysis with classical simulated annealing is made which highlights the advantages of our scheme in terms of system size, hardness of the graph, and the number of iterations required to converge to the solution.

Funding acknowledgement

This work is funded by the German Federal Ministry of Education and Research within the funding program "Quantum Technologies - from basic research to market" under Contract No. 13N16138.

POSTERS (157)