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

Nonadiabatic holonomic quantum computation has been attracting continuous attention since it was proposed. Until now, various schemes of nonadiabatic holonomic quantum computation have been developed and many of them have been…

Recently, several approaches to solving linear systems on a quantum computer have been formulated in terms of the quantum adiabatic theorem for a continuously varying Hamiltonian. Such approaches enabled near-linear scaling in the condition…

Quantum simulation is known to be capable of simulating certain dynamical systems in continuous time -- Schrodinger's equations being the most direct and well-known -- more efficiently than classical simulation. Any linear dynamical system…

This paper explores several aspects of the adiabatic quantum computation model. We first show a way that directly maps any arbitrary circuit in the standard quantum computing model to an adiabatic algorithm of the same depth. Specifically,…

Adiabatic Quantum Computing relies on the quantum adiabatic theorem, which states that a quantum system evolves along its ground state with time if the governing Hamiltonian varies infinitely slowly. However, practical limitations force…

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,…

Quantum adiabatic algorithm is of vital importance in quantum computation field. It offers us an alternative approach to manipulate the system instead of quantum gate model. Recently, an interesting work arXiv:1805.10549 indicated that we…

Adiabatic elimination is a standard tool in quantum optics, which produces an effective Hamiltonian for a relevant subspace of states, incorporating effects of its coupling to states with much higher unperturbed energy. It shares with…

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…

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…

Quantum computing promises significant improvements of computation capabilities in various fields such as machine learning and complex optimization problems. Recent technological advancements suggest that the adiabatic quantum computing…

The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realised in systems which support Hamiltonian evolution, rather…

Adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its computational power was unknown. We describe an efficient adiabatic simulation of any given quantum algorithm, which…

We present a perturbative method to estimate the spectral gap for adiabatic quantum optimization, based on the structure of the energy levels in the problem Hamiltonian. We show that for problems that have exponentially large number of…

Quantum computation that combines the coherence stabilization virtues of decoherence-free subspaces and the fault tolerance of geometric holonomic control is of great practical importance. Some schemes of adiabatic holonomic quantum…

The main obstacles to the realization of high-fidelity quantum gates are the control errors arising from inaccurate manipulation of a quantum system and the decoherence caused by the interaction between the quantum system and its…

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…

Topological quantum computing promises error-resistant quantum computation without active error correction. However, there is a worry that during the process of executing quantum gates by braiding anyons around each other, extra anyonic…

An adiabatic cyclic evolution of control parameters of a quantum system ends up with a holonomic operation on the system, determined entirely by the geometry in the parameter space. The operation is given either by a simple phase factor (a…

We prove an adiabatic theorem that applies at timescales short of the typical adiabatic limit. Our proof analyzes the stability of solutions to Schrodinger's equation under perturbation. We directly characterize cross-subspace effects of…