相关论文: Local Rydberg blockade regimes for disk graph embe…

Graph partition is a key component to achieve workload balance and reduce job completion time in parallel graph processing systems. Among the various partition strategies, edge partition has demonstrated more promising performance in…

Rydberg atom arrays have emerged as a novel platform exhibiting rich quantum many-body physics and offering promise for universal quantum computation. The Rydberg blockade effect plays an essential role in establishing many-body…

The independent set on a graph $G=(V,E)$ is a subset of $V$ such that no two vertices in the subset have an edge between them. The MIS problem on $G$ seeks to identify an independent set with maximum cardinality, i.e. maximum independent…

We study the long-range interaction of a single ion with a highly excited ultracold Rydberg atom and report on the direct observation of ion-induced Rydberg excitation blockade mediated over tens of micrometer distances. Our hybrid ion-atom…

Local dependence random graph models are a class of block models for network data which allow for dependence among edges under a local dependence assumption defined around the block structure of the network. Since being introduced by…

Rydberg atom arrays constitute a promising quantum information platform, where control over several hundred qubits has been demonstrated. Further scaling could significantly benefit from coupling to integrated optical or electronic devices,…

This paper investigates a combinatorial optimization problem motived from a secure power network design application in [D\'{a}n and Sandberg 2010]. Two equivalent graph optimization formulations are derived. One of the formulations is a…

We present a novel local improvement scheme for the perfectly balanced graph partitioning problem. This scheme encodes local searches that are not restricted to a balance constraint into a model allowing us to find combinations of these…

We present an approximation algorithm for the maximum independent set (MIS) problem over the class of equilateral $B_1$-VPG graphs. These are intersection graphs of $L$-shaped planar objects % (and their rotations by multiples of $90^o$)…

We report on our recent progress on the manipulation of single rubidium atoms trapped in optical tweezers and the generation of entanglement between two atoms, each individually trapped in neighboring tweezers. To create an entangled state…

Ultracold atoms are an ideal platform to study strongly correlated phases of matter in and out of equilibrium. Much of the experimental progress in this field crucially relies on the control of the contact interaction between two atoms.…

Reconfigurable intelligent surfaces (RISs) have become a promising candidate for the development of future mobile systems. In the context of massive machine-type communications (mMTC), a RIS can be used to support the transmission from a…

Interdiction problems ask about the worst-case impact of a limited change to an underlying optimization problem. They are a natural way to measure the robustness of a system, or to identify its weakest spots. Interdiction problems have been…

We propose an experimentally feasible scheme to achieve directional transport of Rydberg excitations and entangled states in atomic arrays with unequal spacings. By leveraging distance-dependent Rydberg-Rydberg interactions and temporally…

The notion of augmenting graphs generalizes Berge's idea of augmenting chains, which was used by Edmonds in his celebrated solution of the maximum matching problem. This problem is a special case of the more general maximum independent set…

Efficient sampling from a classical Gibbs distribution is an important computational problem with applications ranging from statistical physics over Monte Carlo and optimization algorithms to machine learning. We introduce a family of…

This paper focuses on multi-block optimization problems over transport polytopes, which underlie various applications including strongly correlated quantum physics and machine learning. Conventional block coordinate descent-type methods for…

Quantum-classical hybrid algorithms offer a promising strategy for tackling computationally challenging problems, such as the maximum independent set (MIS) problem that plays a crucial role in areas like network design and data analysis.…

In this work, we study two fundamental graph optimization problems, minimum vertex cover (MVC) and maximum-cardinality matching (MCM), for intersection graphs of geometric objects, e.g., disks, rectangles, hypercubes, etc., in…

There are no computationally feasible algorithms that provide solutions to the finite horizon Risk-sensitive Constrained Markov Decision Process (Risk-CMDP) problem, even for problems with moderate horizon. With an aim to design the same,…