Related papers: Gates for Adiabatic Quantum Computing
Nonadiabatic holonomic quantum computation (NHQC) provides a method to implement error resilient gates and that has attracted considerable attention recently. Since it was proposed, three-level {\Lambda} systems have become the typical…
Adiabatic quantum computation provides an alternative approach to quantum computation using a time-dependent Hamiltonian. The time evolution of entanglement during the adiabatic quantum search algorithm is studied, and its relevance as a…
Quantum simulation with adiabatic annealing can provide insight into difficult problems that are impossible to study with classical computers. However, it deteriorates when the systems scale up due to the shrinkage of the excitation gap and…
Adiabatic pulses are used extensively to enable robust control of quantum operations. We introduce a new approach to adiabatic control that uses the superadiabatic quality or $Q$-factor as a performance metric to design robust, high…
Adiabatic quantum computation is a paradigmatic model aiming to solve a computational problem by finding the many-body ground state encapsulating the solution. However, its use of an adiabatic evolution depending on the spectral gap of an…
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…
Producing and maintaining entanglement reside at the heart of the optimal construction of quan- tum operations and are fundamental issues in the realization of universal quantum computation. We here introduce a setup of spin qubits that…
Adiabatic quantum control protocols have been of wide interest to quantum computation due to their robustness and insensitivity to their actual duration of execution. As an extension of previous quantum learning algorithms, this work…
Geometric phases and holonomies (their non-commuting generalizations) are a promising resource for the realization of high-fidelity quantum operations in noisy devices, due to their intrinsic fault-tolerance against noise and experimental…
One of the most promising nascent technologies, quantum computation faces a major challenge: The need for stable computational building blocks. We present the quantum-optical realization of non-adiabatic holonomies that can be used as…
Quantum algorithm design plays a crucial role in exploiting the computational advantage of quantum devices. Here we develop a deep-reinforcement-learning based approach for quantum adiabatic algorithm design. Our approach is generically…
Despite its simplicity and strong theoretical guarantees, adiabatic state preparation has received considerably less interest than variational approaches for the preparation of low-energy electronic structure states. Two major reasons for…
In this work, we attempt to solve the integer-weight knapsack problem using the D-Wave 2000Q adiabatic quantum computer. The knapsack problem is a well-known NP-complete problem in computer science, with applications in economics, business,…
The possibility of realization of quantum gates by means of the non-adiabatic geometric phase is considered. It is shown that the non-adiabatic phase can be used for quantum gates realization as well as the adiabatic one.
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…
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…
We present the first direct comparison between gate-based quantum computing (GQC) and adiabatic quantum computing (AQC) paradigms for solving the AC power flow (PF) equations. The PF problem is reformulated as a combinatorial optimization…
Adiabatic quantum computing is a promising route to the computational power afforded by quantum information processing. The recent availability of adiabatic hardware has raised challenging questions about how to evaluate adiabatic quantum…
We implement a non-adiabatic universal set of holonomic quantum gates based on abelian holonomies using dynamical invariants, by Lie-algebraic methods. Unlike previous implementations, presented scheme does not rely on secondary methods…
Adiabatic quantum algorithms solve computational problems by slowly evolving a trivial state to the desired solution. On an ideal quantum computer, the solution quality improves monotonically with increasing circuit depth. By contrast,…