English
Related papers

Related papers: Exploring the impact of graph locality for the res…

200 papers

In the past years, many quantum algorithms have been proposed to tackle hard combinatorial problems. These algorithms, which have been studied in depth in complexity theory, are at the heart of many industrial applications. In particular,…

Quantum Physics · Physics 2022-09-13 Constantin Dalyac , Loic Henriet

Rydberg atom arrays are a powerful platform for solving combinatorial optimization problems, owing to the Rydberg blockade mechanism, which imposes effective constraints on simultaneous atomic excitations. These constraints have enabled the…

Quantum Physics · Physics 2025-12-02 Elie Bermot , Lucia Valor , Wesley Coelho , Louis-Paul Henry , Natalie Pearson

One prominent application of near-term quantum computing devices is to solve combinatorial optimization such as non-deterministic polynomial-time hard (NP-hard) problems. Here we present experiments with Rydberg atoms to solve one of the…

Quantum Physics · Physics 2023-10-11 Minhyuk Kim , Kangheun Kim , Jaeyong Hwang , Eun-Gook Moon , Jaewook Ahn

Analog quantum computing with Rydberg atoms is seen as an avenue to solve hard graph optimization problems, because they naturally encode the Maximum Independent Set (MIS) problem on Unit-Disk (UD) graphs, a problem that admits rather…

Quantum Physics · Physics 2025-12-09 Christian de Correc , Thomas Ayral , Corentin Bertrand

The Maximum Independent Set (MIS) problem is a fundamental combinatorial optimization task that can be naturally mapped onto the Ising Hamiltonian of neutral atom quantum processors. Given its connection to NP-hard problems and real-world…

We describe and analyze an architecture for quantum optimization to solve maximum independent set (MIS) problems using neutral atom arrays trapped in optical tweezers. Optimizing independent sets is one of the paradigmatic, NP-hard problems…

Quantum Physics · Physics 2018-09-03 Hannes Pichler , Sheng-Tao Wang , Leo Zhou , Soonwon Choi , Mikhail D. Lukin

There is a growing interest in harnessing the potential of the Rydberg-atom system to address complex combinatorial optimization challenges. Here we present an experimental demonstration of how the quadratic unconstrained binary…

Quantum Physics · Physics 2024-07-03 Andrew Byun , Junwoo Jung , Kangheun Kim , Minhyuk Kim , Seokho Jeong , Heejeong Jeong , Jaewook Ahn

Finding the maximum independent set (MIS) of a large-size graph is a nondeterministic polynomial-time (NP)-complete problem not efficiently solvable with classical computations. Here, we present a set of quantum adiabatic computing data of…

Quantum Physics · Physics 2024-07-03 Kangheun Kim , Minhyuk Kim , Juyoung Park , Andrew Byun , Jaewook Ahn

We investigate the classical reducibility of random unit-disk graph (UDG) instances of the maximum independent set (MIS) and maximum weighted independent set (MWIS) problems, which can be natively realised in Rydberg atom quantum…

Quantum Physics · Physics 2026-05-11 J. Kombe , J. D. Pritchard

We propose and implement a comprehensive quantum compilation toolkit for solving the maximum independent set (MIS) problem on quantum hardware based on Rydberg atom arrays. Our end-to-end pipeline involves three core components to…

Realizing quantum speedup for practically relevant, computationally hard problems is a central challenge in quantum information science. Using Rydberg atom arrays with up to 289 qubits in two spatial dimensions, we experimentally…

Programmable quantum systems based on Rydberg atom arrays have recently been used for hardware-efficient tests of quantum optimization algorithms [Ebadi et al., Science, 376, 1209 (2022)] with hundreds of qubits. In particular, the maximum…

Neutral atom arrays have emerged as a versatile candidate for the embedding of hard classical optimization problems. Prior work has focused on mapping problems onto finding the maximum independent set of weighted or unweighted unit disk…

Quantum Physics · Physics 2026-03-02 Toonyawat Angkhanawin , Aydin Deger , Jonathan D. Pritchard , C. Stuart Adams

Neutral atom technology has steadily demonstrated significant theoretical and experimental advancements, positioning itself as a front-runner platform for running quantum algorithms. One unique advantage of this technology lies in the…

Maximum Independent Set (MIS for short) is in general graphs the paradigmatic $W[1]$-hard problem. In stark contrast, polynomial-time algorithms are known when the inputs are restricted to structured graph classes such as, for instance,…

Data Structures and Algorithms · Computer Science 2019-09-19 Édouard Bonnet , Nicolas Bousquet , Stéphan Thomassé , Rémi Watrigant

Programmable quantum systems based on Rydberg atom arrays have recently emerged as a promising testbed for combinatorial optimization. Indeed, the Maximum Weighted Independent Set problem on unit-disk graphs can be efficiently mapped to…

Architectures for quantum computing based on neutral atoms have risen to prominence as candidates for both near and long-term applications. These devices are particularly well suited to solve independent set problems, as the combinatorial…

Neutral atom arrays have emerged as a versatile platform towards scalable quantum computation and optimization. In this paper we present demonstrations of solving maximum weighted independent set problems on a Rydberg atom array using…

On neutral atom platforms, preparing specific quantum states is usually achieved by pulse shaping, i.e., by optimizing the time-dependence of the Hamiltonian related to the system. This process can be extremely costly, as it requires…

Quantum Physics · Physics 2022-08-03 Wesley da Silva Coelho , Mauro D'Arcangelo , Louis-Paul Henry

Neutral atom arrays provide a versatile platform to implement coherent quantum annealing as an approach to solving hard combinatorial optimization problems. Here we present and experimentally demonstrate an efficient encoding scheme based…

‹ Prev 1 2 3 10 Next ›