相关论文: Quasi-adiabatic Grover search via the WKB approxim…

Quantum computation by adiabatic evolution, as described in quant-ph/0001106, will solve satisfiability problems if the running time is long enough. In certain special cases (that are classically easy) we know that the quantum algorithm…

Choosing an appropriate representation of the molecular Hamiltonian is one of the challenges faced by simulations of the nonadiabatic quantum dynamics around a conical intersection. The adiabatic, exact quasidiabatic, and strictly diabatic…

A common trick for designing faster quantum adiabatic algorithms is to apply the adiabaticity condition locally at every instant. However it is often difficult to determine the instantaneous gap between the lowest two eigenvalues, which is…

Constraint satisfiability problems, crucial to several applications, are solved on a quantum computer using Grover's search algorithm, leading to a quadratic improvement over the classical case. The solutions are obtained with high…

Consider an open quantum system governed by a Gorini, Kossakowski, Sudarshan, Lindblad (GKSL) master equation with two times-scales: a fast one, exponentially converging towards a linear subspace of quasi-equilibria; a slow one resulting…

Geometric quantum computation is the idea that geometric phases can be used to implement quantum gates, i.e., the basic elements of the Boolean network that forms a quantum computer. Although originally thought to be limited to adiabatic…

The paper studies the structure of high-order adiabatic approximation of a wave function for slowly changing Hamiltonians. A constructive technique for explicit separation of fast and slow components of the wave function is developed. The…

Grover's quantum search and its generalization, quantum amplitude amplification, provide quadratic advantage over classical algorithms for a diverse set of tasks, but are tricky to use without knowing beforehand what fraction $\lambda$ of…

We present a technique that dramatically improves the accuracy of adiabatic state transfer for a broad class of realistic Hamiltonians. For some systems, the total error scaling can be quadratically reduced at a fixed maximum transfer rate.…

Adiabatic Quantum Computing (AQC) is an attractive paradigm for solving hard integer polynomial optimization problems. Available hardware restricts the Hamiltonians to be of a structure that allows only pairwise interactions. This requires…

The theoretical investigation of non-adiabatic processes is hampered by the complexity of the coupled electron-nuclear dynamics beyond the Born-Oppenheimer approximation. Classically, the simulation of such reactions is limited by the…

This work is devoted to the study of a family of almost periodic one-dimensional Schr\"odinger equations. We define a monodromy matrix for this family. We study the asymptotic behavior of this matrix in the adiabatic case. Therefore, w…

Using the simple (symmetric) Hubbard dimer, we analyze some important features of the $GW$ approximation. We show that the problem of the existence of multiple quasiparticle solutions in the (perturbative) one-shot $GW$ method and its…

We present details and expand on the framework leading to the recently introduced degenerate adiabatic perturbation theory [Phys. Rev. Lett. 104, 170406 (2010)], and on the formulation of the degenerate adiabatic theorem, along with its…

The two main approaches to quantum computing are gate-based computation and analog computation, which are polynomially equivalent in terms of complexity, and they are often seen as alternatives to each other. In this work, we present a…

The parametric deformations of quasienergies and eigenvectors of unitary operators are applied to the design of quantum adiabatic algorithms. The conventional, standard adiabatic quantum computation proceeds along eigenenergies of…

Adiabatic quantum computing~(AQC) is based on the adiabatic principle, where a quantum system remains in an instantaneous eigenstate of the driving Hamiltonian. The final state of the Hamiltonian encodes solution to the problem of interest.…

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…

The diffusion approximation (DA) is widely used in the analysis of stochastic population dynamics, from population genetics to ecology and evolution. DA is an uncontrolled approximation that assumes the smoothness of the calculated quantity…

We adopt a geometric approach to describe the performance of adiabatic quantum machines, operating under slow time-dependent driving and in contact to two or more reservoirs with a temperature bias during all the cycle. We show that the…