相关论文: Demonstration of weighted graph optimization on a …

Here we consider using quantum annealing to solve Set Cover with Pairs (SCP), an NP-hard combinatorial optimization problem that play an important role in networking, computational biology, and biochemistry. We show an explicit construction…

We introduce a quantum-inspired algorithm for graph coloring problems (GCPs) that utilizes qudits in a product state, with each qudit representing a node in the graph and parameterized by d-dimensional spherical coordinates. We propose and…

Quantum simulation using synthetic systems is a promising route to solve outstanding quantum many-body problems in regimes where other approaches, including numerical ones, fail. Many platforms are being developed towards this goal, in…

Graph kernels are widely used for measuring the similarity between graphs. Many existing graph kernels, which focus on local patterns within graphs rather than their global properties, suffer from significant structure information loss when…

Arrays of single atoms trapped in optical tweezers are increasingly recognized as a promising platform for scalable quantum computing. In both the fault-tolerant and NISQ eras, the ability to individually control qubits is essential for the…

We present quantum simulation experiments of Ising-like spins on Platonic graphs, which are performed with two-dimensional arrays of Rydberg atoms and quantum-wire couplings. The quantum wires are used to couple otherwise uncoupled…

We report on the selective addressing of an individual atom in a pair of single-atom microtraps separated by $3\;\mu$m. Using a tunable light-shift, we render the selected atom off-resonant with a global Rydberg excitation laser which is…

This paper analyzes different online algorithms for the problem of assigning weights to edges in a fully-connected bipartite graph that minimizes the overall cost while satisfying constraints. Edges in this graph may disappear and reappear…

In this paper, we initiate the study of quantum algorithms in the Graph Drawing research area. We focus on two foundational drawing standards: 2-level drawings and book layouts. Concerning $2$-level drawings, we consider the problems of…

Successful execution of a quantum information processing (QIP) task on a quantum processing device depends on the availability of high-quality entangling gates. Two important goals in the design and implementation of any entangling gate are…

Programmable neutral-atom arrays provide a promising route to real-time analog simulation of strongly interacting quantum systems. We introduce a two leg Rydberg atom ladder that realizes string dynamics and controllable particle production…

Neuromorphic computing with crossbar arrays has emerged as a promising alternative to improve computing efficiency for machine learning. Previous work has focused on implementing crossbar arrays to perform basic mathematical operations.…

We report on the creation of an array of spin-squeezed ensembles of cesium atoms via Rydberg dressing, a technique that offers optical control over local interactions between neutral atoms. We optimize the coherence of the interactions by a…

Arrays of neutral atoms present a promising system for quantum computing, quantum sensors, and other applications, several of which would profit from the ability to load, cool, and image the atoms in a finite magnetic field. In this work,…

Finding a maximum-weight matching is a classical and well-studied problem in computer science, solvable in cubic time in general graphs. We consider the specialization called assignment problem where the input is a bipartite graph, and…

In this paper, we propose a general graph optimization based framework for localization, which can accommodate different types of measurements with varying measurement time intervals. Special emphasis will be on range-based localization.…

The even distribution and optimization of tasks across resources and workstations is a critical process in manufacturing aimed at maximizing efficiency, productivity, and profitability, known as Robotic Assembly Line Balancing (RALB). With…

Maximum weight matching is one of the most fundamental combinatorial optimization problems with a wide range of applications in data mining and bioinformatics. Developing distributed weighted matching algorithms is challenging due to the…

The ability to perform entangling quantum operations with low error rates in a scalable fashion is a central element of useful quantum information processing. Neutral atom arrays have recently emerged as a promising quantum computing…

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…