Related papers: Improved Gap Estimates for Simulating Quantum Circ…
The viability of adiabatic quantum computation depends on the slow evolution of the Hamiltonian. The adiabatic switching theorem provides an asymptotic series for error estimates in $1/T$, based on the lowest non-zero derivative of the…
We show how one can perform arbitrary rotation of any qubit, using delayed laser pulses through nonadiabatic evolution, i.e., via transitions among the adiabatic states. We use a double-Lambda scheme and use a set of control parameters such…
In adiabatic quantum computing finding the dependence of the gap of the Hamiltonian as a function of the parameter varied during the adiabatic sweep is crucial in order to optimize the speed of the computation. Inspired by this challenge,…
We explore the role of entanglement in adiabatic quantum optimization by performing approximate simulations of the real-time evolution of a quantum system while limiting the amount of entanglement. To classically simulate the time evolution…
The use of quantum computing to solve a problem in quantum mechanics is illustrated, step by step, by calculating energies and transition amplitudes in a nonrelativistic quark model. The quantum computations feature the use of variational…
We introduce a simple framework for estimating lower bounds on the runtime of a broad class of adiabatic quantum algorithms. The central formula consists of calculating the variance of the final Hamiltonian with respect to the initial…
The adiabatic theorem is an important concept in quantum mechanics, it tells that a quantum system subjected to gradually changing external conditions remains to the same instantaneous eigenstate of its Hamiltonian as it initially in. In…
Adiabatic evolution is a powerful technique in quantum information and computation. However, its performance is limited by the adiabatic theorem of quantum mechanics. In this scenario, shortcuts to adiabaticity, such as provided by the…
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…
In adiabatic quantum annealing, the speed with which an anneal can be run, while still achieving a high final ground state fidelity, is dictated by the size of the minimum gap that appears between the ground and first excited state in the…
We elucidate the geometry of quantum adiabatic evolution. By minimizing the deviation from adiabaticity we find a Riemannian metric tensor underlying adiabatic evolution. Equipped with this tensor, we identify a unified geometric…
We present a simple formalism describing evolution of a qubit in the process of its measurement in a circuit QED setup. When a phase-sensitive amplifier is used, the evolution depends on only one output quadrature, and the formalism is the…
We apply a hybrid evolutionary algorithm to minimize the depth of circuits in quantum computing. More specifically, we evaluate two different variants of the algorithm. In the first approach, we combine the evolutionary algorithm with an…
Existing quantum algorithms for quantum chemistry work well near the equilibrium geometry of molecules, but the results can become unstable when the chemical bonds are broken at large atomic distances. For any adiabatic approach, this…
One of the difficulties in adiabatic quantum computation is the limit on the computation time. Here we propose two schemes to speed-up the adiabatic evolution. To apply this controlled adiabatic evolution to adiabatic quantum computation,…
A major challenge in quantum computing is to solve general problems with limited physical hardware. Here, we implement digitized adiabatic quantum computing, combining the generality of the adiabatic algorithm with the universality of the…
We present an adaptive variational quantum algorithm to estimate the Berry phase accumulated by a nondegenerate ground state under cyclic, adiabatic evolution of a time-dependent Hamiltonian. Our method leverages cyclic adiabatic evolution…
Adiabaticity occurs when, during its evolution, a physical system remains in the instantaneous eigenstate of the hamiltonian. Unfortunately, existing results, such as the quantum adiabatic theorem based on a slow down evolution (H(epsilon…
Adiabatic time evolution of quantum systems is a widely used tool with applications ranging from state preparation through simplifications of computations and topological transformations to optimization and quantum computing. Adiabatic time…
We propose a new variant of the controlled-NOT quantum logic gate based on adiabatic level-crossing dynamics of the q-bits. The gate has a natural implementation in terms of the Cooper pair transport in arrays of small Josephson tunnel…