Related papers: Approximating maximum independent set on Rydberg a…
Nonadiabatic holonomic quantum computation has received increasing attention due to its robustness against control errors as well as high-speed realization. Several schemes of its implementation have been put forward based on various…
In graph theory, an independent set is a subset of nodes where there are no two adjacent nodes. The independent set is maximal if no node outside the independent set can join it. In network applications, maximal independent sets can be used…
Achieving fast, excitation-free quantum control is a vital challenge in modern quantum technologies. In many cases, shortcuts to adiabaticity enable fast adiabatic-like protocols, yet determining control parameters that satisfy practical…
Platforms of Rydberg atoms have been proposed as promising candidates to solve some combinatorial optimization problems. Here, we compute quantitative requirements on the system sizes and noise levels that these platforms must fulfill to…
Designing proper time-dependent control fields for slowly varying the system to the ground state that encodes the problem solution is crucial for adiabatic quantum computation. However, inevitable perturbations in real applications demand…
Adiabatic elimination is a standard tool in quantum optics, which produces an effective Hamiltonian for a relevant subspace of states, incorporating effects of its coupling to states with much higher unperturbed energy. It shares with…
Rydberg atom arrays have recently emerged as one of the most promising platforms for quantum simulation and quantum information processing. However, as is the case for other experimental platforms, the longer-term success of the Rydberg…
Application of the adiabatic model of quantum computation requires efficient encoding of the solution to computational problems into the lowest eigenstate of a Hamiltonian that supports universal adiabatic quantum computation. Experimental…
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…
In this paper we develop the theory of discrete averaging designed to study discrete time dynamical systems defined by iterates of a map. The discrete averaging uses weighted averages over a segment of trajectory to find an autonomous…
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.…
We propose hybrid digital-analog learning algorithms on Rydberg atom arrays, combining the potentially practical utility and near-term realizability of quantum learning with the rapidly scaling architectures of neutral atoms. Our…
The Maximum Independent Set (MIS) problem is a fundamental combinatorial optimization task that can be naturally mapped onto the Ising Hamiltonian of neutral atom quantum processors. Given its connection to NP-hard problems and real-world…
We present numerical calculations, and simulations performed on a Rydberg atom quantum simulator, of the adiabatic evolution of many-body quantum systems around a quantum phase transition. We demonstrate that the end-to-end transfer error,…
We introduce a method to synthetically engineer the range of dipolar interactions in tweezer atom arrays by effectively modifying the modes of the electromagnetic vacuum with far-detuned relay atoms. We derive equations of motion for the…
We present a perturbative method to estimate the spectral gap for adiabatic quantum optimization, based on the structure of the energy levels in the problem Hamiltonian. We show that for problems that have exponentially large number of…
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…
New computational strategies, such as molecular docking, are emerging to speed up the drug discovery process. This method predicts the activity of molecules at the binding site of proteins, helping to select the ones that exhibit desirable…
We propose a method to speed up the quantum adiabatic algorithm using catalysis by many-body delocalization. This is applied to random-field antiferromagnetic Ising spin models. The algorithm is catalyzed in such a way that the evolution…
We present a new hybrid, local search algorithm for quantum approximate optimization of constrained combinatorial optimization problems. We focus on the Maximum Independent Set problem and demonstrate the ability of quantum local search to…