Related papers: Local Rydberg blockade regimes for disk graph embe…
Most graphs in real life keep changing with time. These changes can be in the form of insertion or deletion of edges or vertices. Such rapidly changing graphs motivate us to study dynamic graph algorithms. However, three important graph…
A complete architecture for cavity-free quantum networking based on collective enhancement in Rydberg atom ensembles is presented. The protocol exploits Rydberg blockade and phase-matched directional emission to eliminate optical cavities…
This paper investigates a fluid reconfigurable intelligent surface (FRIS)-assisted Rydberg Atomic REceiver (RARE) architecture under magnitude-only heterodyne readout. We show that, unlike conventional coherent systems, the optimal…
In this work, we present a fast distributed algorithm for local potential problems: these are graph problems where the task is to find a locally optimal solution where no node can unilaterally improve the utility in its local neighborhood…
Configurable arrays of optically trapped Rydberg atoms are a versatile platform for quantum computation and quantum simulation, also allowing controllable decoherence. We demonstrate theoretically, that they also enable proof-of-principle…
The maximization for the independence systems defined on graphs is a generalization of combinatorial optimization problems such as the maximum $b$-matching, the unweighted MAX-SAT, the matchoid, and the maximum timed matching problems. In…
We present a blueprint for building a fault-tolerant universal quantum computer with Rydberg atoms. Our scheme, which is based on the surface code, uses individually-addressable optically-trapped atoms as qubits and exploits…
The present paper studies local distributed graph problems in highly dynamic networks. Communication and changes of the graph happen in synchronous rounds and our algorithms always, i.e., in every round, satisfy non-trivial guarantees, no…
Nonadiabatic geometric quantum computation provides a means to perform fast and robust quantum gates. It has been implemented in various physical systems, such as trapped ions, nuclear magnetic resonance and superconducting circuits.…
Rydberg atom arrays offer flexible geometries of strongly-interacting neutral atoms, which are useful for many quantum applications such as quantum simulation and quantum computation. Here we consider a gate-based quantum computing scheme…
We investigate the distributed complexity of maximal matching and maximal independent set (MIS) in hypergraphs in the LOCAL model. A maximal matching of a hypergraph $H=(V_H,E_H)$ is a maximal disjoint set $M\subseteq E_H$ of hyperedges and…
Embedding large graphs in low dimensional spaces has recently attracted significant interest due to its wide applications such as graph visualization, link prediction and node classification. Existing methods focus on computing the…
Minor embedding is essential for mapping largescale combinatorial problems onto quantum annealers, particularly in quantum machine learning and optimization. This work presents an optimized, universal minor-embedding framework that…
Controlling strongly interacting many-body systems enables the creation of tailored quantum matter, with properties transcending those based solely on single particle physics. Atomic ensembles which are optically driven to a Rydberg state…
We propose and implement a quantum-informed reduction algorithm for the maximum independent set problem that integrates classical kernelization techniques with information extracted from quantum devices. Our larger framework consists of…
Atom chips are a promising candidate for a scalable architecture for quantum information processing provided a universal set of gates can be implemented with high fidelity. The difficult part in achieving universality is the entangling…
Rydberg atom arrays are powerful platforms for studying quantum many-body systems. We consider the Rydberg-Ising Hamiltonian on periodic chains and numerically study ensembles of states generated by random global pulse sequences subject to…
There is a large ongoing research effort towards obtaining a quantum advantage in the solution of combinatorial optimization problems on near-term quantum devices. A particularly promising platform for testing and developing quantum…
Visual rendering of graphs is a key task in the mapping of complex network data. Although most graph drawing algorithms emphasize aesthetic appeal, certain applications such as travel-time maps place more importance on visualization of…
Line of Sight (LoS) networks were designed to model wireless communication in settings which may contain obstacles restricting node visibility. For fixed positive integer $d$, and positive integer $\omega$, a graph $G=(V,E)$ is a…