相关论文: Local Rydberg blockade regimes for disk graph embe…
Local algorithms on graphs are algorithms that run in parallel on the nodes of a graph to compute some global structural feature of the graph. Such algorithms use only local information available at nodes to determine local aspects of the…
We propose a protocol to realize arbitrary state synthesis and unitary operations on a qudit encoded in the collective dressed states of a Rydberg blockaded array of three-level atoms. This system is isomorphic to the Jaynes-Cummings model…
Quantum optics based on highly excited atoms, also known as Rydberg atoms, has cemented itself as a powerful platform for the manipulation of light at the few-photon level. The Rydberg blockade, resulting from the strong interaction between…
Measurement-based quantum computing relies on the rapid creation of large-scale entanglement in a register of stable qubits. Atomic arrays are well suited to store quantum information, and entanglement can be created using highly-excited…
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…
We examine topological phases and symmetry-protected electronic edge states in the context of a Rydberg composite: a Rydberg atom interfaced with a structured arrangement of ground-state atoms. The electronic Hamiltonian of such a composite…
We implement and characterize a protocol that enables arbitrary local controls in a dipolar atom array, where the degree of freedom is encoded in a pair of Rydberg states. Our approach relies on a combination of local addressing beams and…
Rydberg atom arrays have emerged as a leading platform for quantum information science. Reaching system sizes of hundreds of long-lived qubits, these arrays are used for highly coherent analog quantum simulation, as well as digital quantum…
Controlling molecular binding at the level of single atoms is one of the holy grails of quantum chemistry. Rydberg macrodimers -- bound states between highly excited Rydberg atoms -- provide a novel perspective in this direction. Resulting…
Experimental control over the strength and angular dependence of interactions between atoms is a key capability for advancing quantum technologies. Here, we use microwave dressing to manipulate and enhance Rydberg-Rydberg interactions in an…
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…
The maximum independent set (MIS) problem of graph theory using the quantum alternating operator ansatz is studied. We perform simulations on the Rigetti Forest simulator for the square ring, $K_{2,3}$, and $K_{3,3}$ graphs and analyze the…
We present the problem of finding a maximal independent set (MIS) (named as \emph{MIS Filling problem}) of an arbitrary connected graph having $n$ vertices with luminous myopic mobile robots. The robots enter the graph one after another…
Quadratic Unconstrained Binary Optimization (QUBO) problems are prevalent in real-world applications, such as portfolio optimization, but pose significant computational challenges for large-scale instances. We propose a hybrid…
The task of factoring integers poses a significant challenge in modern cryptography, and quantum computing holds the potential to efficiently address this problem compared to classical algorithms. Thus, it is crucial to develop quantum…
In the laser excitation of ultracold atoms to Rydberg states, we observe a dramatic suppression caused by van der Waals interactions. This behavior is interpreted as a local excitation blockade: Rydberg atoms strongly inhibit excitation of…
Interval graphs, intersection graphs of segments on a real line (intervals), play a key role in the study of algorithms and special structural properties. Unit interval graphs, their proper subclass, where each interval has a unit length,…
The node-averaged complexity of a distributed algorithm running on a graph $G=(V,E)$ is the average over the times at which the nodes $V$ of $G$ finish their computation and commit to their outputs. We study the node-averaged complexity for…
We present a depletion imaging technique to map out the spatial and temporal dependency of the density distribution of an ultracold gas of Rydberg atoms. Locally resolved absorption depletion, observed through differential ground state…
In computer networks, participants may cooperate in processing tasks, so that loads are balanced among them. We present local distributed algorithms that (repeatedly) use local imbalance criteria to transfer loads concurrently across the…