5 papers · 1 filter
A Unified Local Light-shifts Encoding For Solving Optimization Problems on a Rydberg Annealer
Kapil Goswami, Peter Schmelcher
Combinatorial optimization problems play a central role in computer science with many real world applications. A number of relevant problems remain computationally difficult to sol…
High-fidelity non-adiabatic dark state gates for neutral atoms
Nader Mostaan, Kapil Goswami, Peter Schmelcher +1
Rydberg blockade gates are the most experimentally mature entangling operations in neutral-atom quantum processors, combining fast gate times with simple control, but their perform…
Qudit-based scalable quantum algorithm for solving the integer programming problem
Kapil Goswami, Peter Schmelcher, Rick Mukherjee
Integer programming (IP) is an NP-hard combinatorial optimization problem that is widely used to represent a diverse set of real-world problems spanning multiple fields, such as fi…
Solving The Travelling Salesman Problem Using A Single Qubit
Kapil Goswami, Gagan Anekonda Veereshi, Peter Schmelcher +1
The travelling salesman problem (TSP) is a popular NP-hard-combinatorial optimization problem that requires finding the optimal way for a salesman to travel through different citie…
Integer Programming Using A Single Atom
Kapil Goswami, Peter Schmelcher, Rick Mukherjee
Integer programming (IP), as the name suggests is an integer-variable-based approach commonly used to formulate real-world optimization problems with constraints. Currently, quantu…