Perturbative Formulation and Non-adiabatic Corrections in Adiabatic Quantum Computing Schemes

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

5 pages, revtex. some references added

Scientific paper

10.1103/PhysRevA.69.024301

Adiabatic limit is the presumption of the adiabatic geometric quantum computation and of the adiabatic quantum algorithm. But in reality, the variation speed of the Hamiltonian is finite. Here we develop a general formulation of adiabatic quantum computing, which accurately describes the evolution of the quantum state in a perturbative way, in which the adiabatic limit is the zeroth-order approximation. As an application of this formulation, non-adiabatic correction or error is estimated for several physical implementations of the adiabatic geometric gates. A quantum computing process consisting of many adiabatic gate operations is considered, for which the total non-adiabatic error is found to be about the sum of those of all the gates. This is a useful constraint on the computational power. The formalism is also briefly applied to the adiabatic quantum algorithm.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Perturbative Formulation and Non-adiabatic Corrections in Adiabatic Quantum Computing Schemes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Perturbative Formulation and Non-adiabatic Corrections in Adiabatic Quantum Computing Schemes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Perturbative Formulation and Non-adiabatic Corrections in Adiabatic Quantum Computing Schemes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-218214

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.