相关论文: Evaluating holonomic quantum computation: beyond a…

The problem Hamiltonian of the adiabatic quantum algorithm for the maximum-weight independent set problem (MIS) that is based on the reduction to the Ising problem (as described in [Choi08]) has flexible parameters. We show that by choosing…

The quantum speed limit specifies a universal bound of the fidelity between the initial state and the time-evolved state. We apply this method to find a bound of the fidelity between the adiabatic state and the time-evolved state. The bound…

Adiabatic quantum computers can solve difficult optimization problems (e.g., the quadratic unconstrained binary optimization problem), and they seem well suited to train machine learning models. In this paper, we describe an adiabatic…

For systems in an externally controllable time-dependent potential, the optimal protocol minimizes the mean work spent in a finite-time transition between given initial and final values of a control parameter. For an initially thermalized…

Non-adiabatic holonomic quantum computation in decoherence-free subspaces protects quantum information from control imprecisions and decoherence. For the non-collective decoherence that each qubit has its own bath, we show the…

In this paper, we present quantum algorithms for a class of highly-oscillatory transport equations, which arise in semiclassical computation of surface hopping problems and other related non-adiabatic quantum dynamics, based on the…

We investigate the quantum mechanics of a single particle constrained to move along an arbitrary smooth reference curve by a confinement that is allowed to vary along the waveguide. The Schr\"odinger equation is evaluated in the adapted…

A quantum system will stay near its instantaneous ground state if the Hamiltonian that governs its evolution varies slowly enough. This quantum adiabatic behavior is the basis of a new class of algorithms for quantum computing. We test one…

By using the Lewis-Riesenfeld theory and the invariant-related unitary transformation formulation, the exact solutions of the {\it time-dependent} Schr\"{o}dinger equations which govern the various Lie-algebraic quantum systems in atomic…

In this paper we describe a quantum algorithm to solve sparse systems of nonlinear differential equations whose nonlinear terms are polynomials. The algorithm is nondeterministic and its expected resource requirements are polylogarithmic in…

Physical implementations of quantum computation must be scrutinized about their reliability under real conditions, in order to be considered as viable candidates. Among the proposed models, those based on adiabatic quantum dynamics have…

Adiabatic quantum gate implementation generally takes longer time, which is disadvantageous in view of decoherence. In this report we implement several essential one-qubit quantum gates nonadiabatically by making use of a dynamical…

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 show how to perform universal adiabatic quantum computation using a Hamiltonian which describes a set of particles with local interactions on a two-dimensional grid. A single parameter in the Hamiltonian is adiabatically changed as a…

Adiabatic quantum algorithms are characterized by their run time and accuracy. The relation between the two is essential for quantifying adiabatic algorithmic performance, yet is often poorly understood. We study the dynamics of a…

Adiabatic quantum computing (AQC) started as an approach to solving optimization problems, and has evolved into an important universal alternative to the standard circuit model of quantum computing, with deep connections to both classical…

A new non-perturbative approach is proposed to solve time-independent Schr\"{o}dinger equations in quantum mechanics and chromodynamics (QCD). It is based on the homotopy analysis method (HAM), which was developed by the author for highly…

For ergodic adiabatic quantum systems, we study the evolution of energy distribution as the system evolves in time. Starting from the von Neumann equation for the density operator, we obtain the quantum analogue of the Smoluchowski equation…

We develop the constrained adiabatic trajectory method (CATM) which allows one to solve the time-dependent Schr\"odinger equation constraining the dynamics to a single Floquet eigenstate, as if it were adiabatic. This constrained Floquet…

Computing using a continuous-time evolution, based on the natural interaction Hamiltonian of the quantum computer hardware, is a promising route to building useful quantum computers in the near-term. Adiabatic quantum computing, quantum…