Related papers: Quantum Counting in the Rydberg Blockade
Consider a fixed universe of $N=2^n$ elements and the uniform distribution over elements of some subset of size $K$. Given samples from this distribution, the task of complement sampling is to provide a sample from the complementary subset.…
The solution space of many classical optimization problems breaks up into clusters which are extensively distant from one another in the Hamming metric. Here, we show that an analogous quantum clustering phenomenon takes place in the ground…
We discuss a method for scaling a neutral atom Rydberg gate quantum processor to a large number of qubits. Limits are derived showing that the number of qubits that can be directly connected by entangling gates with errors at the $10^{-3}$…
Numerous conceptually important quantum algorithms rely on a black-box device known as an oracle, which is typically difficult to construct without knowing the answer to the problem that the algorithm is intended to solve. A notable example…
Rydberg blockade gates are the most experimentally mature entangling operations in neutral-atom quantum processors, combining fast gate times with simple control, but their performance degrades at larger interatomic separations and remains…
We introduce a methodology for generating random multi-qubit stabilizer codes based on solving a constraint satisfaction problem (CSP) on random bipartite graphs. This framework allows us to enforce stabilizer commutation, $X/Z$ balancing,…
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…
We present an algorithm to compute the number of solutions of the (constrained) number partitioning problem. A concrete implementation of the algorithm on an Ising-type quantum computer is given.
Constrained sampling and counting are two fundamental problems in artificial intelligence with a diverse range of applications, spanning probabilistic reasoning and planning to constrained-random verification. While the theory of these…
Measurement time represents a critical bottleneck limiting the operational speed of neutral atom quantum computers, as it cannot be accelerated through parallelization like other quantum operations. We present a protocol for fast…
Assembled arrays of individual atoms with Rydberg-mediated interactions provide a powerful platform for the simulation of many-body spin Hamiltonians as well as the implementation of universal gate-based quantum information processing. We…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
We present a multi-step quantum algorithm for solving the $3$-bit exact cover problem, which is one of the NP-complete problems. Unlike the brute force methods have been tried before, in this algorithm, we showed that by applying the…
We present the first demonstration of a CNOT gate using neutral atoms. Our implementation of the CNOT uses Rydberg blockade interactions between neutral atoms held in optical traps separated by >8 \mu\rm m. We measure CNOT fidelities of…
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…
By controlling the temporal and spatial features of light, we propose a novel protocol to prepare two-qubit entangling gates on atoms trapped at close distance, which could potentially speed up the operation of the gate from the sub-micro…
This paper presents a quantum algorithm for the solution of prototypical second-order linear elliptic partial differential equations discretized by $d$-linear finite elements on Cartesian grids of a bounded $d$-dimensional domain. An…
Systems of linear equations are used to model a wide array of problems in all fields of science and engineering. Recently, it has been shown that quantum computers could solve linear systems exponentially faster than classical computers,…
Creation of quantum computer is outstanding fundamental and practical problem. The quantum computer could be used for execution of very complicated tasks which are not solvable with the classical computers. The first prototype of solid…
In this paper, we derive optimized measurement-free protocols for quantum error correction and the implementation of a universal gate set optimized for an error model that is noise biased . The noise bias is adapted for neutral atom…