Fast quantum algorithms for traversing paths of eigenstates

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

36 pages, 1 figure

Scientific paper

Consider a path of non-degenerate eigenstates of unitary operators or Hamiltonians with minimum eigenvalue gap G. The eigenpath traversal problem is to transform one or more copies of the initial to the final eigenstate. Solutions to this problem have applications ranging from quantum physics simulation to optimization. For Hamiltonians, the conventional way of doing this is by applying the adiabatic theorem. We give ``digital'' methods for performing the transformation that require no assumption on path continuity or differentiability other than the absence of large jumps. Given sufficient information about eigenvalues and overlaps between states on the path, the transformation can be accomplished with complexity O(L/G log(L/e)), where L is the angular length of the path and e is a specified bound on the error of the output state. We show that the required information can be obtained in a first set of transformations, whose complexity per state transformed has an additional factor that depends logarithmically on a maximum angular velocity along the path. This velocity is averaged over constant angular distances and does not require continuity. Our methods have substantially better behavior than conventional adiabatic algorithms, with fewer conditions on the path. They also improve on the previously best digital methods and demonstrate that path length and the gap are the primary parameters that determine the complexity of state transformation along a path.

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

Fast quantum algorithms for traversing paths of eigenstates 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 Fast quantum algorithms for traversing paths of eigenstates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast quantum algorithms for traversing paths of eigenstates will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-56564

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