Related papers: Local Rydberg blockade regimes for disk graph embe…
The construction of Hilbert spaces that are characterized by local constraints as the low-energy sectors of microscopic models is an important step towards the realization of a wide range of quantum phases with long-range entanglement and…
We propose a quantum algorithm for approximately counting the number of solutions to planar 2-satisfiability (2SAT) formulas natively on neutral atom quantum computers. Our algorithm maps Boolean variables to atomic registers arranged in…
Today, hardware constraints are an important limitation on quantum adiabatic optimization algorithms. Firstly, computational problems must be formulated as quadratic unconstrained binary optimization (QUBO) in the presence of noisy coupling…
Classical optimization problems can be solved by adiabatically preparing the ground state of a quantum Hamiltonian that encodes the problem. The performance of this approach is determined by the smallest gap encountered during the…
Characterizing graph properties is fundamental to the analysis and to our understanding of real-world networked systems. The local clustering coefficient, and the more recently introduced, local closure coefficient, capture powerful…
Independent set is a fundamental problem in combinatorial optimization. While in general graphs the problem is essentially inapproximable, for many important graph classes there are approximation algorithms known in the offline setting.…
Nonadiabatic holonomic quantum computation has received increasing attention due to its robustness against control errors as well as high-speed realization. Several schemes of its implementation have been put forward based on various…
Given a graph, the minimum dominating set (MinDS) problem is to identify a smallest set $D$ of vertices such that every vertex not in $D$ is adjacent to at least one vertex in $D$. The MinDS problem is a classic $\mathcal{NP}$-hard problem…
We consider the problem of computing routing schemes in the $\mathsf{HYBRID}$ model of distributed computing where nodes have access to two fundamentally different communication modes. In this problem nodes have to compute small labels and…
We study the design of robust subexponential algorithms for classical connectivity problems on intersection graphs of similarly sized fat objects in $\mathbb{R}^d$. In this setting, each vertex corresponds to a geometric object, and two…
We show that the maximum independent set problem (MIS) on an $n$-vertex graph can be solved in $1.1996^nn^{O(1)}$ time and polynomial space, which even is faster than Robson's $1.2109^{n}n^{O(1)}$-time exponential-space algorithm published…
Optically trapped Rydberg atoms are a suitable platform to explore quantum many-body physics mediated by long-range atom--atom interactions that can be engineered through externally applied light fields. However, this approach is limited to…
We develop an experimental algorithm for the exact solving of the maximum independent set problem. The algorithm consecutively finds the maximal independent sets of vertices in an arbitrary undirected graph such that the next such set…
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,…
Balanced partitioning is often a crucial first step in solving large-scale graph optimization problems, e.g., in some cases, a big graph can be chopped into pieces that fit on one machine to be processed independently before stitching the…
This work deals with the Maximum Independent Set ($\mathcal{MIS}$) formation problem in a finite rectangular grid by autonomous robots. Suppose we are given a set of identical robots, where each robot is placed on a node of a finite…
A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for \textsc{Maximum Clique} on unit disk graphs [Clark, Colbourn, Johnson; Discrete…
The dipole blockade effect at laser excitation of mesoscopic ensembles of Rydberg atoms lies in the fact that the excitation of one atom to a Rydberg state blocks the excitation of other atoms due to the shift in the collective energy…
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…
We propose a feasible scheme to achieve quantum computation based on geometric manipulation of ensembles of atoms, and analyze it for neutral rubidium atoms magnetically trapped in planoconcave microcavities on an atom chip. The geometric…