相关论文: Efficient Hamiltonian Engineering for Adiabatic MI…
We present an efficient quantum algorithm for some independent set problems in graph theory, based on non-abelian adiabatic mixing. We illustrate the performance of our algorithm with analysis and numerical calculations for two different…
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…
The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realised in systems which support Hamiltonian evolution, rather…
We introduce a geometric framework for efficient few-parameter pulse optimization in multi-level quantum systems, enabling high-fidelity state transfer beyond the adiabatic limit. Our method interpolates smoothly between adiabatic and…
Analog quantum computing with Rydberg atoms is seen as an avenue to solve hard graph optimization problems, because they naturally encode the Maximum Independent Set (MIS) problem on Unit-Disk (UD) graphs, a problem that admits rather…
Adiabatic optimal control schemes are essential for advancing the practical implementation of quantum technologies. However, the vast array of possible adiabatic protocols, combined with their dependence on the particular quantum system and…
We consider a composite open quantum system consisting of a fast subsystem coupled to a slow one. Using the time-scale separation, we develop an adiabatic elimination technique to derive at any order the reduced model describing the slow…
We study an architecture for implementing adiabatic quantum computation with trapped neutral atoms. Ground state atoms are dressed by laser fields in a manner conditional on the Rydberg blockade mechanism, thereby providing the requisite…
We propose and implement a comprehensive quantum compilation toolkit for solving the maximum independent set (MIS) problem on quantum hardware based on Rydberg atom arrays. Our end-to-end pipeline involves three core components to…
Programmable quantum systems based on Rydberg atom arrays have recently been used for hardware-efficient tests of quantum optimization algorithms [Ebadi et al., Science, 376, 1209 (2022)] with hundreds of qubits. In particular, the maximum…
We show how to perform universal Hamiltonian and adiabatic computing using a time-independent Hamiltonian on a 2D grid describing a system of hopping particles which string together and interact to perform the computation. In this…
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…
Adiabatic quantum computing is a universal model for quantum computing whose implementation using a gate-based quantum computer requires depths that are unreachable in the early fault-tolerant era. To mitigate the limitations of near-term…
Adiabatic quantum computation employs a slow change of a time-dependent control function (or functions) to interpolate between an initial and final Hamiltonian, which helps to keep the system in the instantaneous ground state. When the…
Adiabatic techniques offer some of the most promising tools to achieve high-fidelity control of the centre-of-mass degree of freedom of single atoms. As their main requirement is to follow an eigenstate of the system, constraints on timing…
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.…
An adiabatic quantum algorithm is essentially given by three elements: An initial Hamiltonian with known ground state, a problem Hamiltonian whose ground state corresponds to the solution of the given problem and an evolution schedule such…
We present two applications of emergent local Hamiltonians to speed up quantum adiabatic protocols for isolated noninteracting and weakly interacting fermionic systems in one-dimensional lattices. We demonstrate how to extract maximal work…
Efficient control schemes that enable fast, high-fidelity operations are essential for any practical quantum computation. However, current optimization protocols are intractable due to stringent requirements imposed by the microscopic…
We propose a circuit-model quantum algorithm for eigenpath traversal that is based on a combination of concepts from Grover's search and adiabatic quantum computation. Our algorithm deploys a sequence of reflections determined from…