Related papers: A Lanczos approach to the Adiabatic Gauge Potentia…
We propose a new set of equations to determine the collective Hamiltonian including the second-order collective-coordinate operator on the basis of the adiabatic self-consistent collective-coordinate (ASCC) theory. We illustrate, with the…
Adiabatic state preparation provides an analytical solution for generating the ground state of a target Hamiltonian, starting from an easily prepared ground state of the initial Hamiltonian. While effective for time-dependent Hamiltonians…
We derive a version of the adiabatic theorem that is especially suited for applications in adiabatic quantum computation, where it is reasonable to assume that the adiabatic interpolation between the initial and final Hamiltonians is…
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…
Measurement-based quantum computation (MBQC) and holonomic quantum computation (HQC) are two very different computational methods. The computation in MBQC is driven by adaptive measurements executed in a particular order on a large…
This paper shows that WKB wave function can be expressed in the form of an adiabatic expansion. To build a bridge between two widely invoked approximation schemes seems pedagogically instructive. Further "cubic-WKB" method that has been…
Granada oscillation code (GraCo) is a software constructed to compute adiabatic and non-adiabatic oscillation eigenfunctions and eigenvalues. The adiabatic version gives the standard numerical resolution, and also the Richardson…
Adiabatic quantum computation with Rydberg atoms provides a natural route for solving combinatorial optimization problems such as the maximum independent set (MIS). However, its performance is fundamentally limited by the reduction of the…
We study the trade-offs between convergence rate and robustness to gradient errors in designing a first-order algorithm. We focus on gradient descent (GD) and accelerated gradient (AG) methods for minimizing strongly convex functions when…
We introduce an algorithm to perform an optimal adiabatic evolution that operates without an apriori knowledge of the system spectrum. By probing the system gap locally, the algorithm maximizes the evolution speed, thus minimizing the total…
Counterdiabatic (CD) protocols enable fast driving of quantum states by invoking an auxiliary adiabatic gauge potential (AGP) that suppresses transitions to excited states throughout the driving process. Usually, the full spectrum of the…
A major challenge facing adiabatic quantum computing is that algorithm design and error correction can be difficult for adiabatic quantum computing. Recent work has considered addressing his challenge by using coherently controlled…
We construct invariant differential operators acting on sections of vector bundles of densities over a smooth manifold without using a Riemannian metric. The spectral invariants of such operators are invariant under both the diffeomorphisms…
The adiabatic approximation in quantum mechanics is considered in the case where the self-adjoint hamiltonian $H_0(t)$, satisfying the usual spectral gap assumption in this context, is perturbed by a term of the form $\epsilon H_1(t)$. Here…
We present a new algorithm that computes eigenvalues and eigenvectors of a Hermitian positive definite matrix while solving a linear system of equations with Conjugate Gradient (CG). Traditionally, all the CG iteration vectors could be…
Adiabatic quantum algorithms must evolve slowly enough to suppress non-adiabatic transitions while remaining fast enough to be practical. In open systems, this trade-off is reshaped by decoherence. For Hamiltonians subject to dephasing…
Surface hopping algorithms, as an important class of quantum dynamics simulation algorithms for non-adiabatic dynamics, are typically performed in the adiabatic representation, which can break down in the presence of ill-defined adiabatic…
Electronic wave-functions in the adiabatic representation acquire nontrivial geometric phases (GPs) when corresponding potential energy surfaces undergo conical intersection (CI). These GPs have profound effects on the nuclear quantum…
We develop new protocols for high-fidelity single qubit gates that exploit and extend theoretical ideas for accelerated adiabatic evolution. Our protocols are compatible with qubit architectures with highly isolated logical states, where…
Grover's unstructured search algorithm is one of the best examples to date for the superiority of quantum algorithms over classical ones. Its applicability, however, has been questioned by many due to its oracular nature. We propose a…