Related papers: Heralded atomic nonadiabatic holonomic quantum com…
At present, several models for quantum computation have been proposed. Adiabatic quantum computation scheme particularly offers this possibility and is based on a slow enough time evolution of the system, where no transitions take place. In…
For the quantum error correction (QEC) and noisy intermediate-scale quantum (NISQ) algorithms to function with high efficiency, the raw fidelity of quantum logic gates on physical qubits needs to satisfy strict requirement. The neutral atom…
The binomial code is renowned for its parity-mediated loss immunity and loss-error recoverability, while geometric phases are widely recognized for their intrinsic resilience against noise. Capitalizing on their complementary merits, we…
We describe a quantum information architecture consisting of a hybrid array of optically-trapped molecules and atoms. This design leverages the large transition dipole moments of Rydberg atoms to mediate fast, high-fidelity gates between…
We propose a scheme for preparing an ensemble of atoms in a maximally entangled W state by exploiting the Rydberg blockade effect. The success of our protocol is indicated by the detection of an ion, which thus serves as a herald for…
We present a general method for studying coupled qubits driven by adiabatically changing external parameters. Extended calculations are provided for a two-bit Hamiltonian whose eigenstates can be used as logical states for a quantum CNOT…
We propose a quantum algorithm for approximately counting the number of solutions to planar 2-satisfiability (2SAT) formulas natively on neutral atom quantum computers. Our algorithm maps Boolean variables to atomic registers arranged in…
Nonadiabatic holonomic quantum computation provides the means to perform fast and robust quantum gates by utilizing the resilience of non-Abelian geometric phases to fluctuations of the path in state space. While the original scheme [New J.…
Geometric phase is an indispensable element for achieving robust and high-fidelity quantum gates due to its built-in noise-resilience feature. However, due to the complexity of manipulation and the intrinsic leakage of the encoded quantum…
Schemes for creation of N particle entangled Greenberger-Horne-Zeilinger (GHZ) states are important for understanding multi-particle non-classical correlations. Here, a theoretical scheme for creation of a multi-particle GHZ state…
In this Letter, we report a parameter-dependent Hilbert space fragmentation in a one-dimensional Rydberg atom array under anti-blockade conditions. We identify distinct non-equilibrium dynamical phases and show that their quasi-periodic…
Ultracold trapped atomic ions excited into highly energetic Rydberg states constitute a promising platform for scalable quantum information processing. Elementary building blocks for such tasks are high-fidelity and sufficiently fast…
A shortcut-to-adiabaticity is compared with a numerically optimized protocol for implementing a high-fidelity quantum gate on Rydberg atoms. The counterdiabatic method offers an analytical framework for accelerating high-fidelity gates by…
Geometric phases are well known to be noise-resilient in quantum evolutions/operations. Holonomic quantum gates provide us with a robust way towards universal quantum computation, as these quantum gates are actually induced by nonabelian…
A quantum system will stay near its instantaneous ground state if the Hamiltonian that governs its evolution varies slowly enough. This quantum adiabatic behavior is the basis of a new class of algorithms for quantum computing. We test one…
Geometric phases have stimulated researchers for its potential applications in many areas of science. One of them is fault-tolerant quantum computation. A preliminary requisite of quantum computation is the implementation of controlled…
Holonomic quantum computing offers a promising paradigm for quantum computation due to its error resistance and the ability to perform universal quantum computations. Here, we propose a scheme for the rapid implementation of a holonomic…
Computing using a continuous-time evolution, based on the natural interaction Hamiltonian of the quantum computer hardware, is a promising route to building useful quantum computers in the near-term. Adiabatic quantum computing, quantum…
We present a quantum algorithm for adiabatic state preparation on a gate-based quantum computer, with complexity polylogarithmic in the inverse error. Our algorithm digitally simulates the adiabatic evolution between two self-adjoint…
Adiabatic quantum computation is based on the adiabatic evolution of quantum systems. We analyse a particular class of qauntum adiabatic evolutions where either the initial or final Hamiltonian is a one-dimensional projector Hamiltonian on…