Quantum Algorithm for Preparing Thermal Gibbs States - Detailed Analysis

Physics – Computational Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

10 pages, fixed typos

Scientific paper

In a recent work [10], Poulin and one of us presented a quantum algorithm for preparing thermal Gibbs states of interacting quantum systems. This algorithm is based on Grovers's technique for quantum state engineering, and its running time is dominated by the factor D/Z(\beta), where D and Z(\beta) denote the dimension of the quantum system and its partition function at inverse temperature \beta, respectively. We present here a modified algorithm and a more detailed analysis of the errors that arise due to imperfect simulation of Hamiltonian time evolutions and limited performance of phase estimation (finite accuracy and nonzero probability of failure). This modfication together with the tighter analysis allows us to prove a better running time by the effect of these sources of error on the overall complexity. We think that the ideas underlying of our new analysis could also be used to prove a better performance of quantum Metropolis sampling by Temme et al. [12].

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

Quantum Algorithm for Preparing Thermal Gibbs States - Detailed Analysis 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 Quantum Algorithm for Preparing Thermal Gibbs States - Detailed Analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Algorithm for Preparing Thermal Gibbs States - Detailed Analysis will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-374104

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