Related papers: Adiabatic quantum computation with Rydberg-dressed…
We revisit the implementation of a two-qubit entangling gate, the M{\o}lmer-S{\o}rensen gate, using the adiabatic Rydberg dressing paradigm for neutral atoms as studied in [Phys. Rev. A 101, 030301 (R) (2020)]. We study the implementation…
The Rydberg blockade mechanism is now routinely considered for entangling qubits encoded in clock states of neutral atoms. Challenges towards implementing entangling gates with high fidelity include errors due to thermal motion of atoms,…
Adiabatic geometric phase gates offer enhanced robustness against fluctuations compared to con- ventional Rydberg blockade-based phase gates that rely on dynamical phase accumulation. We theoretically demonstrate two- and multi-qubit phase…
There is a growing interest in harnessing the potential of the Rydberg-atom system to address complex combinatorial optimization challenges. Here we present an experimental demonstration of how the quadratic unconstrained binary…
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.…
Quantum adiabatic optimization seeks to solve combinatorial problems using quantum dynamics, requiring the Hamiltonian of the system to align with the problem of interest. However, these Hamiltonians are often incompatible with the native…
We present a review of quantum computation with neutral atom qubits. After an overview of architectural options and approaches to preparing large qubit arrays we examine Rydberg mediated gate protocols and fidelity for two- and multi-qubit…
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…
Neutral atom arrays have recently emerged as a promising platform for quantum information processing. One important remaining roadblock for the large-scale application of these systems is the ability to perform error-corrected quantum…
Adiabatic quantum programming defines the time-dependent mapping of a quantum algorithm into an underlying hardware or logical fabric. An essential step is embedding problem-specific information into the quantum logical fabric. We present…
We report the realization of a nuclear magnetic resonance computer with three quantum bits that simulates an adiabatic quantum optimization algorithm. Adiabatic quantum algorithms offer new insight into how quantum resources can be used to…
A shortcut-to-adiabatic protocol for the realization of a fast and high-fidelity controlled-phase gate in Rydberg atoms is developed. The adiabatic state transfer, driven in the high-blockade limit, is sped up by compensating nonadiabatic…
We study a scheme for implementing a controlled-Z (CZ) gate between two neutral-atom qubits based on the Rydberg blockade mechanism in a manner that is robust to errors caused by atomic motion. By employing adiabatic dressing of the ground…
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…
This tutorial offers a quick, hands-on introduction to solving Quadratic Unconstrained Binary Optimization (QUBO) models on currently available quantum computers and their simulators. We cover both IBM and D-Wave machines: IBM utilizes a…
Single atoms in dipole microtraps or optical tweezers have recently become a promising platform for quantum computing and simulation. Here we report a detailed theoretical analysis of the physics underlying an implementation of a Rydberg…
Entangled many-body states are a key resource for quantum technologies. Yet their preparation through analog control of interacting quantum systems is often hindered by experimental imperfections. Here, we introduce the adiabatic echo…
Graph embedding is a recurrent problem in quantum computing, for instance, quantum annealers need to solve a minor graph embedding in order to map a given Quadratic Unconstrained Binary Optimization (QUBO) problem onto their internal…
Many artificial intelligence (AI) problems naturally map to NP-hard optimization problems. This has the interesting consequence that enabling human-level capability in machines often requires systems that can handle formally intractable…
Background: Solving nuclear many-body problems with an ab initio approach is widely recognized as a computationally challenging problem. Quantum computers offer a promising path to address this challenge. There are urgent needs to develop…